三维无线传感器网络K重覆盖机制研究

Research on K-coverage mechanism for 3-D wireless sensor networks

针对传感器节点在三维监测区域中随机分布覆盖效率低下,并且不能达到关键区域重覆盖的问题,本文使用空间填充多面体,分别从确定性覆盖和随机覆盖两个方面,提出理想状态下覆盖冗余率最低和空间密度值最低的节点分布策略。首先将监测区域分为多个以传感器节点的传感半径为外接球直径的多面体,然后将传感器节点放置在多面体的顶点或是外接球重叠区域中,最后理论分析出同构节点分布的最佳位置。实验仿真表明,在相同覆盖重数的情况下,截角八面体的覆盖冗余率和空间密度值最低。

For the problem that the coverage efficiency of the sensor nodes which are randomly distributed in the three-dimensional monitoring area is low, and the critical area can not reach K-coverage. This article uses polyhedrons to fill an area, Respectively, use the deterministic coverage and random coverage to propose the best node distribution strategy, which can reach the lowest value of coverage redundancy rate and spatial density under ideal conditions. First, the monitoring area is divided into a plurality of poly- hedrons, the ball diameter of a polyhedron is the sensing radius of the working sensor nodes. Then, put the sensor nodes on the vertices of a polyhedron or in the overlapping area of the polyhedrons＇ circumscribed sphere. Finally, according to theory, analyze the optimum deployment of the nodes in three-dimensional sensor networks. The simulation showed that, in the case of the same coverage degree K, the coverage redundancy rate and spatial density of truncated oetahedron is the lowest.