Coverage Optimization Algorithm Based On Voronoi Diagram Model For Sensor Network

Sensor network is a kind of distributed network constructed by multiple nodes.Its nodes have the ability of sensing,computing and communication,and can carry out the work of monitoring and networking in a variety of environments.The application prospect of sensor network is very broad.The coverage ability and effect of the nodes will directly affect the accuracy and comprehensiveness of the information sources needed for the data analysis and application based on the sensor network.The social demand of technology and the diversity of network elements and application scenarios determine that the sensor network must provide higher quality coverage sensing ability and more diversified coverage optimization strategies.There are a few bottlenecks in performance indicators of some existing coverage optimization algorithms for sensor networks,and the number of effective algorithms is limited at present.Thus,this paper will combine Voronoi diagram to study and propose two algorithms that can be applied to coverage optimization of sensor networks.Firstly,this paper proposes a coverage optimization algorithm for sensor networks based on the polygon formed by surrounding neighbors after Voronoi division.In this optimization algorithm,space partition of real and virtual nodes by Voronoi diagram is carried out after the virtual nodes is set up around the area according to the agreed rules,and the polygons formed by surrounding neighbors will be defined.For the real nodes in the area,their private coverage area values at the current position and the centroid position of the polygon formed by surrounding neighbors will be measured and compared to determine the target moving position.This algorithm can be carried out several iterations to make the coverage effect more ideal.The simulation result shows that this algorithm is better than the comparison algorithm in coverage rate and node coverage efficiency,has the ability to be applied to optimize the coverage of sensor network.Secondly,this paper proposes another coverage optimization algorithm for sensor network based on a strategy related to the behavioral characteristic of fruit fly and Voronoi diagram.As the basis of this algorithm theory,a new strategy about the behavior characteristic of fruit fly is put forward after improving the previous fruit fly optimization algorithm.And then the new coverage optimization algorithm for sensor networks related to above strategy is proposed.In this algorithm,the relationship between nodes is established after the area has been divided by Voronoi diagram.Each sensor node will search or even move to the target location within a specific range according to the agreed rules,to improve coverage of the area.This algorithm can be carried out several iterations to make the coverage effect more ideal.The simulation result shows that the algorithm performs well in the index including coverage rate,node coverage efficiency and node average displacement.It is feasible to apply this algorithm to optimize the coverage of sensor network.The two coverage optimization algorithms proposed in this paper are both based on Voronoi diagram,but designed from two entry points including the polygon formed by surrounding neighbors and the strategy related to the behavioral characteristic of fruit fly.The simulation results show that the two optimization algorithms have good performance in coverage rate and node coverage efficiency,which can effectively improve the coverage effect of sensor network.