k-Angle Object Coverage Problem in a Wireless Sensor Network
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
3416 | en_US |
dc.citation.issue |
12 | en_US |
dc.citation.spage |
3408 | en_US |
dc.citation.volume |
12 | en_US |
dc.citation.woscount |
1 | |
dc.contributor.author |
Tseng, Yu-Chee | en_US |
dc.contributor.author |
Chen, Po-Yu | en_US |
dc.contributor.author |
Chen, Wen-Tsuen | en_US |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
Department of Computer Science | en_US |
dc.date.accessioned |
2014-12-08T15:28:29Z | |
dc.date.available |
2014-12-08T15:28:29Z | |
dc.date.issued |
2012-12-01 | en_US |
dc.description.abstract |
One of the fundamental issues in sensor networks is the coverage problem, which reflects how well a field is monitored or tracked by sensors. Various versions of this problem have been studied, such as object, area, barrier, and hole coverage problems. In this paper, we define a new k-angle object coverage problem in a wireless sensor network. Each sensor can only cover a limited angle and range, but can freely rotate to any direction to cover a particular angle. Given a set of sensors and a set of objects at known locations, the goal is to use the least number of sensors to k-angle-cover the largest number of objects such that each object is monitored by at least k sensors satisfying some angle constraint. We propose centralized and distributed polynomial-time algorithms to solve this problem. Simulation results show that our algorithms can be effective in maximizing coverage of objects. A prototype system is developed to demonstrate the usefulness of angle coverage. | en_US |
dc.identifier.doi |
10.1109/JSEN.2012.2198054 | en_US |
dc.identifier.issn |
1530-437X | en_US |
dc.identifier.journal |
IEEE SENSORS JOURNAL | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1109/JSEN.2012.2198054 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/20597 | |
dc.identifier.wosnumber |
WOS:000311358000004 | |
dc.language.iso |
en_US | en_US |
dc.subject |
Coverage problem | en_US |
dc.subject |
pervasive computing | en_US |
dc.subject |
sensor network | en_US |
dc.subject |
video surveillance | en_US |
dc.subject |
wireless network | en_US |
dc.title |
k-Angle Object Coverage Problem in a Wireless Sensor Network | en_US |
dc.type |
Article | en_US |
檔案
- 000311358000004.pdf (966.3 KB, Adobe PDF)
所屬典藏: 期刊論文