Efficient computation of min and max sensor values in multihop networks

Consider a wireless sensor network (WSN) where a broadcast from a sensor node does not reach all sensor nodes in the network; such networks are often called multihop networks. Sensor nodes take individual sensor readings, however, in many cases, it is relevant to compute aggregated quantities of the...

Full description

Bibliographic Details
Main Author: Pereira, Nuno (author)
Other Authors: Andersson, Björn (author), Tovar, Eduardo (author), Carvalho, Paulo (author)
Format: bookPart
Language:eng
Published: 2014
Subjects:
Consider a wireless sensor network (WSN) where a broadcast from a sensor node does not reach all sensor nodes in the network; such networks are often called multihop networks. Sensor nodes take individual sensor readings, however, in many cases, it is relevant to compute aggregated quantities of these readings. In fact, the minimum and maximum of all sensor readings at an instant are often interesting because they indicate abnormal behavior, for example if the maximum temperature is very high then it may be that a fire has broken out. In this context, we propose an algorithm for computing the min or max of sensor readings in a multihop network. This algorithm has the particularly interesting property of having a time complexity that does not depend on the number of sensor nodes; only the network diameter and the range of the value domain of sensor readings matter
Data processing
Large-scale sensor networks
MAC protocol
Online Access:http://hdl.handle.net/10400.22/3846
Country:Portugal
Oai:oai:recipp.ipp.pt:10400.22/3846

Internet

http://hdl.handle.net/10400.22/3846

Similar Items