Mobility improves coverage of sensor networks

  • Authors:

  • Benyuan Liu;Peter Brass;Olivier Dousse;Philippe Nain;Don Towsley

  • Affiliations:

  • University of Massachusetts-Lowell, Lowell, MA;City College of New York, New York, NY;EPFL, Lausanne, Switzerland;INRIA, France;University of Massachusetts, Amherst, MA

  • Venue:
  • Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Previous work on the coverage of mobile sensor networks focuses on algorithms to reposition sensors in order to achieve a static configuration with an enlarged covered area. In this paper, we study the dynamic aspects of the coverage of a mobile sensor network that depend on the process of sensor movement. As time goes by, a position is more likely to be covered; targets that might never be detected in a stationary sensor network can now be detected by moving sensors. We characterize the area coverage at specific time instants and during time intervals, as well as the time it takes to detect a randomly located stationary target. Our results show that sensor mobility can be exploited to compensate for the lack of sensors and improve network coverage. For mobile targets, we take a game theoretic approach and derive optimal mobility strategies for sensors and targets from their own perspectives.