Wireless sensor networks for habitat monitoring
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Protocols and Architectures for Wireless Sensor Networks
Protocols and Architectures for Wireless Sensor Networks
REED: robust, efficient filtering and event detection in sensor networks
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Wireless sensor networks for structural health monitoring
Proceedings of the 4th international conference on Embedded networked sensor systems
A wireless sensor network for structural health monitoring: performance and experience
EmNets '05 Proceedings of the 2nd IEEE workshop on Embedded Networked Sensors
Distributed algorithms for connected domination in wireless networks
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Co-operative computations in a network of sensor nodes rely on an established, interference free and repetitive communication between adjacent sensors. This paper analyzes a simple randomized and distributed protocol to establish a periodic communication schedule S where each sensor broadcasts once to communicate to all of its neighbors during each period of S. The result obtained holds for any bounded degree network. The existence of such randomized protocols is not new. Our protocol reduces the number of random bits and the number of transmissions by individual sensors from Θ(log2 n) to O(log n) where n is the number of sensor nodes. These reductions conserve power which is a critical resource. Both protocols assume upper bound on the number of nodes n and the maximum number of neighbors B. For a small multiplicative (i.e., a factor ω(1)) increase in the resources, our algorithm can operate without an upper bound on B.