Coverage time characteristics in sensor networks

Ravi Balasubramanian, Srinivasan Ramasubramanian, Alon Efrat

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Scopus citations

Abstract

We study the problem of coverage of a given area for a maximum duration using a set of battery-operated sensors. Each sensor has a fixed sensing range and a limited lifetime due to the finite battery capacity. Sensors can be activated and deactivated at any time. The goal of this paper is to a find a schedule, determining when to activate and deactivate each sensor, to maximize the time for which every point in the area is covered by at least one sensor. We present several algorithms for this problem and show experimental and theoretical evidences to their efficiency. We also present an algorithm for a new model of coverage, called weak coverage, that does not require each point of the region to be covered all times, as long as the regions that are not covered are small.

Original languageEnglish (US)
Title of host publication2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems, MASS
Pages566-569
Number of pages4
DOIs
Publication statusPublished - 2007
Event2006 IEEE International Conference on Mobile Ad Hoc and Sensor Sysetems, MASS - Vancouver, BC, Canada
Duration: Oct 9 2006Oct 12 2006

Other

Other2006 IEEE International Conference on Mobile Ad Hoc and Sensor Sysetems, MASS
CountryCanada
CityVancouver, BC
Period10/9/0610/12/06

    Fingerprint

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Software

Cite this

Balasubramanian, R., Ramasubramanian, S., & Efrat, A. (2007). Coverage time characteristics in sensor networks. In 2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems, MASS (pp. 566-569). [4053957] https://doi.org/10.1109/MOBHOC.2006.278611