In this paper, we present two distributed algorithms to maximize the lifetime of Wireless Sensor Networks for target coverage when the sensors have the ability to adjust their sensing and communication ranges. These algorithms are based on the enhancement of distributed algorithms for fixed range sensors proposed in the literature. We outline the algorithms for the adjustable range model, prove their correctness and analyze the time and message complexities. We also conduct simulations demonstrating 20% improvement in network lifetime when compared with the previous approaches. Thus, in addition to sleep-sense scheduling techniques, further improvements in network lifetime can be derived by designing algorithms that make use of the adjustable range model. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Dhawan, A., Aung, A., & Prasad, S. K. (2010). Distributed scheduling of a network of adjustable range sensors for coverage problems. Communications in Computer and Information Science, 54, 123–132. https://doi.org/10.1007/978-3-642-12035-0_13
Mendeley helps you to discover research relevant for your work.