The Coverage Problem in a Wireless Sensor Network

Chi Fu Huang*, Yu-Chee Tseng

*Corresponding author for this work

研究成果: Conference contribution同行評審

637 引文 斯高帕斯(Scopus)

摘要

One fundamental issue 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 predefined value. 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: (i) positioning applications, (ii) situations which require stronger environmental monitoring capability, and (iii) scenarios which impose more stringent fault-tolerant capability.

原文English
主出版物標題Proceedings of the Second ACM International Workshop on Wireless Sensor Networks and Applications, WSNA 2003
頁面115-121
頁數7
DOIs
出版狀態Published - 1 十二月 2003
事件Proceedings of the Second ACM International Workshop on Wireless Sensor Networks and Applications, WSNA 2003 - San Diego, CA, United States
持續時間: 19 九月 200319 九月 2003

出版系列

名字Proceedings of the Second ACM International Workshop on Wireless Sensor networks and Applications, WSNA 2003

Conference

ConferenceProceedings of the Second ACM International Workshop on Wireless Sensor Networks and Applications, WSNA 2003
國家United States
城市San Diego, CA
期間19/09/0319/09/03

指紋 深入研究「The Coverage Problem in a Wireless Sensor Network」主題。共同形成了獨特的指紋。

引用此