標題: k-Angle Object Coverage Problem in a Wireless Sensor Network
作者: Tseng, Yu-Chee
Chen, Po-Yu
Chen, Wen-Tsuen
資訊工程學系
Department of Computer Science
關鍵字: Coverage problem;pervasive computing;sensor network;video surveillance;wireless network
公開日期: 1-十二月-2012
摘要: 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.
URI: http://dx.doi.org/10.1109/JSEN.2012.2198054
http://hdl.handle.net/11536/20597
ISSN: 1530-437X
DOI: 10.1109/JSEN.2012.2198054
期刊: IEEE SENSORS JOURNAL
Volume: 12
Issue: 12
起始頁: 3408
結束頁: 3416
顯示於類別:期刊論文


文件中的檔案:

  1. 000311358000004.pdf