Randomized algorithms
Asynchronous wakeup for ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
An adaptive energy-efficient MAC protocol for wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Energy-efficient collision-free medium access control for wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Medium access control with coordinated adaptive sleeping for wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Versatile low power media access for wireless sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Ultra-low duty cycle MAC with scheduled channel polling
Proceedings of the 4th international conference on Embedded networked sensor systems
A stream-oriented power management protocol for low duty cycle sensor network applications
EmNets '05 Proceedings of the 2nd IEEE workshop on Embedded Networked Sensors
O-MAC: A Receiver Centric Power Management Protocol
ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
Practical asynchronous neighbor discovery and rendezvous for mobile sensing applications
Proceedings of the 6th ACM conference on Embedded network sensor systems
Deterministic and energy-optimal wireless synchronization
DISC'11 Proceedings of the 25th international conference on Distributed computing
| Hi-index | 0.00 |
Sensor networks are composed of nodes embedded in physical environments where applications may be tasked to run for years without human maintenance and without continuous external power supply. Strategies for power conservation are thus important in sensor network protocols and system architecture. One such strategy is to arrange node sleeping schedules so that radios are powered off until communication is necessary. Nodes cannot receive messages during periods when the radio is turned off. In this setting, there can arise situations where groups of network nodes have somehow become temporally partitioned: due to having different sleeping schedules, groups of nodes could be unaware of each other. The paper presents several self-stabilizing protocols to solve the problem of temporal partition; starting from an arbitrary temporally partitioned state, these protocols lead the network to a state in which all nodes have a perfectly aligned sleep schedule. Our techniques include using randomly chosen relatively prime sleep periods and occasional, and possibly random, probing of extra time slots. Our protocols aim for fast convergence while imposing only a small energy consumption overhead.