节点相邻关系的传感网覆盖优化方法

Coverage optimization algorithm based on adjacent neighbors for sensor networks

在无线传感器网络中,节点往往以随机方式密集部署,从而易于产生大量冗余。检测这些冗余节点可以有效地解决信道冲突,重复信息采集等问题。本文提出了一种覆盖冗余判别算法,节点根据自身与邻居节点的距离、邻居节点的数量以及邻居节点对自身感知区域的覆盖程度三方面判断其是否冗余,若为冗余节点,则进入休眠状态,以降低全网能耗。仿真结果表明,所提出的冗余判断算法可有效关闭网络中的冗余节点,并降低全网能耗,和同类算法相比较,检测冗余节点的能力明显优于同类算法。

In wireless sensor networks（ WSNs）,in order to solve the problem of redundant coverage and reduce redundant nodes,a type of discriminate algorithm on coverage redundancy based on the information of its neighbors is introduced in this paper. Each node calculates the coverage rate of its sensing area,depending on the locations of its neighbors nodes. If the coverage rate is beyond the threshold,the redundant node will go into sleeping mode to save energy. Experimental results show that the algorithm can effectively reduce the number of redundant nodes as well as the energy consumption of the whole network.