WSN的极坐标最小能耗覆盖空洞修复算法

A coverage hole recovery algorithm with minimum energy consumption based on polar coordinates in WSNs

针对混合无线传感器网络中的覆盖空洞问题,提出了一种基于极坐标的空洞修复算法。首先,通过计算静态节点感知圆交叉点的位置确定空洞边界点,连接空洞边界点构造空洞多边形;其次,按照极坐标方法计算每个空洞多边形中的虚拟修复节点位置;最后,建立虚拟修复节点与移动节点之间的距离数据表,将表中移动节点移动到与之匹配的虚拟节点位置上,完成空洞修复。仿真结果表明,该算法能够有效判定并修复网络中的覆盖空洞,相比同类算法,所需移动修复节点数量较少,移动节点平均移动距离较短,在提高网络覆盖质量的同时延长了网络的生存周期。

Aiming at the coverage hole problem in hybrid wireless sensor networks(WSNs),we propose a coverage hole recovery algorithm based on polar coordinates.Firstly,we determine the boundary points of coverage holes by calculating the intersections of statistic nodes'sensing circle,and connect the boundary points to construct coverage hole polygons.Secondly,the location of virtual recovering nodes in every polygon is calculated according to the polar coordinate method.Finally,we build the distance data table between virtual recovering nodes and moving nodes to complete the hole recovery work,that is moving the moving nodes in the table to the locations of virtual nodes that match them.Simulation results show that compared with other similar algorithms,the proposed algorithm can determine and recover the coverage holes in WSNs effectively,and meanwhile it needs less moving nodes and has a shorter average moving distance.In addition,it prolongs the network's life cycle while improving the quality of coverage.