The coverage problem in a wireless sensor network

Chi Fu Huang, Yu-Chee Tseng*

*Corresponding author for this work

研究成果: Article同行評審

475 引文 斯高帕斯(Scopus)

摘要

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.

原文English
頁(從 - 到)519-528
頁數10
期刊Mobile Networks and Applications
10
發行號4
DOIs
出版狀態Published - 4 七月 2005

指紋 深入研究「The coverage problem in a wireless sensor network」主題。共同形成了獨特的指紋。

引用此