The coverage problem in a wireless sensor network
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
528 | en_US |
dc.citation.issue |
4 | en_US |
dc.citation.spage |
519 | en_US |
dc.citation.volume |
10 | en_US |
dc.contributor.author |
Huang, CF | en_US |
dc.contributor.author |
Tseng, YC | en_US |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
Department of Computer Science | en_US |
dc.date.accessioned |
2014-12-08T15:18:43Z | |
dc.date.available |
2014-12-08T15:18:43Z | |
dc.date.issued |
2005-08-01 | en_US |
dc.description.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. | en_US |
dc.identifier.doi |
10.1007/s11036-005-1564-y | en_US |
dc.identifier.issn |
1383-469X | en_US |
dc.identifier.journal |
MOBILE NETWORKS & APPLICATIONS | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1007/s11036-005-1564-y | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/13458 | |
dc.identifier.wosnumber |
WOS:000230590100013 | |
dc.language.iso |
en_US | en_US |
dc.subject |
ad hoc network | en_US |
dc.subject |
computer geometry | en_US |
dc.subject |
coverage problem | en_US |
dc.subject |
ubiquitous computing | en_US |
dc.subject |
wireless network | en_US |
dc.subject |
sensor network | en_US |
dc.title |
The coverage problem in a wireless sensor network | en_US |
dc.type |
Article; Proceedings Paper | en_US |
檔案
- 000230590100013.pdf (579.6 KB, Adobe PDF)
所屬典藏: 會議論文