.png){kind=icon}
返回
k-Angle Object Coverage Problem in a Wireless Sensor Network
.png){kind=icon}
PRE
AI
DOI：10.1109/JSEN.2012.2198054.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Coverage problem
pervasive computing
sensor network
video surveillance
wireless network
期刊
IF:
4.5
论文数:
2.1W
被引数:
7.3W
机构
引用论文
分享收藏Tracking Hydroplasticization by DSC: Movement of Water Domains Bound to Poly(Meth)Acrylates during Latex Film Formation.png)
Polymers
OAAI
PolymersIF0
OAAI分享收藏
分享收藏
查看更多内容