无线传感网络中有向性传感节点的覆盖问题

Coverage problem of directional sensors in wireless sensor networks

覆盖问题是无线传感网中最根本的问题之一,它在很大程度上影响到传感的质量。目前有关覆盖问题的研究大多集中于探讨全向性传感节点的覆盖问题,这些方法并不适用于如视频传感这类方向性的传感节点。提出了一个新的(k,ω)-夹角覆盖问题,探讨有向性的传感节点的覆盖问题,为了用最少的传感节点(k,ω)-夹角覆盖所有的目标,提出了一个贪心算法来解决这个问题。另外还提出了三个贡献度函数用于计算每个位置的贡献度,算法根据每个位置所提供的贡献度来决定传感节点的部署位置。仿真结果显示了算法的特性和性能的提升。

Coverage problem is one of the most fundamental problems in Wireless Sensor Networks（WSN） since it reflects the sensing quality.The present studies mostly concentrate on omni-directional sensors which is not suitable in many applications such as video surveillance systems consisting of directional video sensors.This paper proposed a new（k,ω）-angle coverage problem which study directional sensors deployment.The goal was to deploy minimal number of sensors to k-angle cover all the targets.It presented a greedy algorithm to solve this problem.For this algorithm,it defined three contribution functions to determine the location to deploy sensor.The proposed method greedily selected a maximal contribution location to deploy a sensor until the entire targets were k-angle covered.The simulation results exhibit the characteristic and performance of this algorithm.