Mobile Networks and Applications

, Volume 10, Issue 4, pp 519–528

The Coverage Problem in a Wireless Sensor Network

Article

DOI: 10.1007/s11036-005-1564-y

Cite this article as:
Huang, CF. & Tseng, YC. Mobile Netw Appl (2005) 10: 519. doi:10.1007/s11036-005-1564-y

Abstract

One of the fundamental issues in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this problem as a decision problem, whose goal is to determine whether every point in the service area of the sensor network is covered by at least k sensors, where k is a given parameter. The sensing ranges of sensors can be unit disks or non-unit disks. We present polynomial-time algorithms, in terms of the number of sensors, that can be easily translated to distributed protocols. The result is a generalization of some earlier results where only k = 1 is assumed. Applications of the result include determining insufficiently covered areas in a sensor network, enhancing fault-tolerant capability in hostile regions, and conserving energies of redundant sensors in a randomly deployed network. Our solutions can be easily translated to distributed protocols to solve the coverage problem.

Keywords

ad hoc network computer geometry coverage problem ubiquitous computing wireless network sensor network 

Copyright information

© Springer Science + Business Media, Inc. 2005

Authors and Affiliations

  1. 1.Department of Computer Science and Information EngineeringNational Chiao-Tung UniversityHsin-ChuTaiwan

Personalised recommendations