The coverage problem in a wireless sensor network

檔案

日期

2005-08-01

期刊名稱

MOBILE NETWORKS & APPLICATIONS

卷期與頁次

第 10 卷第 4 期,頁 519–528

ISSN

1383-469X

語言

英文

摘要

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.

所屬典藏

會議論文
顯示完整詮釋資料 統計資料

引用此條目

Huang, C., & Tseng, Y. (2005). The coverage problem in a wireless sensor network. MOBILE NETWORKS & APPLICATIONS, 10(4), 519–528. https://doi.org/10.1007/s11036-005-1564-y

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/13458