Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
Proceedings of the 7th annual international conference on Mobile computing and networking
Maximum lifetime routing in 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
Wakeup scheduling in wireless sensor networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
TC-DSA: topology control for delay sensitive applications in wireless sensor networks
The Fourth International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness & Workshops
An energy-efficient topology construction algorithm for wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
Wakeup scheduling in wireless sensor networks is known as the most effective way to conserve the limited amount of available energy for each sensor node. Such schedules are applicable to protocols of different network layers and often result in higher latency. Tolerance to latency varies greatly depending on the application so that it is low for a large class of delay sensitive applications. In this paper, we present a unified approach in the design of wakeup schedules in different network layers. A new distributed wakeup schedule is introduced in the context of topology control which aims to conserve more energy while not compromising on the delay performance of the system. The proposed protocol addresses the problem of increasing the network longevity for a given upper bound on the average end-to-end delay. In this scheme neither localization nor synchronization is required and only local information about the network topology is used. In addition to its simplicity of implementation, its energy overhead is negligible and it implicitly determines the routing paths. Our simulation results show that the performance of this protocol is close to the optimal schedule and significantly higher than SPAN, an existing topology control mechanism.