| Name: | Description: | Size: | Format: | |
|---|---|---|---|---|
| 1.34 MB | Adobe PDF |
Advisor(s)
Abstract(s)
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 sensor readings but individual
sensor readings are not very important. It is important however to compute aggregated
quantities of these sensor readings. 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. We propose an algorithm for computing the min or max of sensor reading
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.
Description
Keywords
Pedagogical Context
Citation
Publisher
IEEE
