Distributed Scheduling of a Network of Adjustable Range Sensors for Coverage Problems

  • Akshaye Dhawan
  • Aung Aung
  • Sushil K. Prasad
Conference paper

DOI: 10.1007/978-3-642-12035-0_13

Part of the Communications in Computer and Information Science book series (CCIS, volume 54)
Cite this paper as:
Dhawan A., Aung A., Prasad S.K. (2010) Distributed Scheduling of a Network of Adjustable Range Sensors for Coverage Problems. In: Prasad S.K., Vin H.M., Sahni S., Jaiswal M.P., Thipakorn B. (eds) Information Systems, Technology and Management. ICISTM 2010. Communications in Computer and Information Science, vol 54. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Akshaye Dhawan
    • 1
  • Aung Aung
    • 2
  • Sushil K. Prasad
    • 2
  1. 1.Department of Mathematics and Computer ScienceUrsinus CollegeCollegeville
  2. 2.Department of Computer ScienceGeorgia State UniversityAtlanta

Personalised recommendations