Abstract
Minimizing the energy consumption of battery-powered sensors is an essential consideration in sensor network applications, and sleep/wake scheduling mechanism has been proved to an efficient approach to handling this issue. In this article, a coverage-guaranteed distributed sleep/wake scheduling scheme is presented with the purpose of prolonging network lifetime while guaranteeing network coverage. Our scheme divides sensor nodes into clusters based on sensing coverage metrics and allows more than one node in each cluster to keep active simultaneously via a dynamic node selection mechanism. Further, a dynamic refusal scheme is presented to overcome the deadlock problem during cluster merging process, which has not been specially investigated before. The simulation results illustrate that CDSWS outperforms some other existed algorithms in terms of coverage guarantee, algorithm efficiency and energy conservation.
Highlights
With the advances in digital signal processing, RF techniques and low-power hardware manufacturing and integration, wireless sensor networks (WSNs) have attracted increasing interests in recent years [1]
Coverage is a fundamental quality of service (QoS) of topology control in WSNs, we studied coverage provision based on a prior proof that if the radio range of sensor is equal to or greater than twice the sensing range, complete coverage implies connectivity, as a result, the network connectivity is provided as well
Algorithm efficiency is another essential aspect of our proposed algorithm
Summary
With the advances in digital signal processing, RF techniques and low-power hardware manufacturing and integration, wireless sensor networks (WSNs) have attracted increasing interests in recent years [1]. A centralized sleep scheduling algorithm based on integer linear programming was presented in [6], which calculates the lifetime using the global information of the whole network based on the assumption that the global knowledge of sensor locations and energies is known According to their proposed scheme, sensors allowed to sleep can be intermittently inactive to reduce energy consumption and extend network lifetime. More accurate scheduling results will be achieved by suing the centralized approaches, which lead to a large amount of data transmission and computation Another fundamental issue is the deadlock problem in distributed computing and several deadlock avoiding mechanisms for sensor network applications have been illustrated in the prior literature. Improvement will be achieved in terms of coverage support and algorithm efficiency
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: EURASIP Journal on Wireless Communications and Networking
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
