Research On Area Coverage Based On Delaunay And Voronoi For Wireless Sensor Networks

At present,with the rapid development of science and technology,the acquisition of information are highly customized,Wireless Sensor Networks(WSNs)have been highly valued and played a more and more important role in our daily life,especially in natural disasters such as earthquake,forest fire,which brings great convenience to us.As a data-centered network,coverage is one of the important measures of network Qo S,so it is impotrtant to study the coverage problem.In this paper,we take the sensors randomly distributed in the detection area as the study scene and study the coverage of the traditional omnidirectional sensor networks and directional sensor networks(DSNs),this paper takes full use of Delaunay and Voronoi to develop coverage enhance algorithm.In the omidirectiinal sensor networks,we study the coverage of the hybrid network which consists of mobile sensors and static sensors.Sensor deployed randomly leads to coverage holes,by static sensors estimating coverage holes and computing the position of assisted nodes,and then order mobile nodes to heal holes.We have finished the following works:a)By introducing Delaunay to construct Delaunay triangulation(DT)network,then static nodes estimate holes in each triangle and we also develop a set of node deployment strategy.b)We propose Heal Coverage Holes Algorithm(HCHA).The coverage of the directional sensor networks are different from omnidirectional sensor network,which is related to coordinate,,working direc-tion and angle of view(Ao V).By introducing Voronoi,we divide the monitoring area into cells,transform the problem of whole area coverage problem into cell coverage optimization problem.Cleverly we introduce two auxiliary points of sensor,sensor makes a decision to move or rotate by deciding whether the auxiliary points are in the cell.We design three kinds of coverage optimization algorithm: a)Move inside cell based on vertex algorithm(MIC).MIC mainly updates location based on whether the auxiliary points are in its own cell and the moving track is limited to its own cell,network topology evaluation is small relatively;b)Rotate working direction based on vertex algorithm(RWD).RWD by rotating working direction to get full coverage in its own cell,which follows the minimum rotation angle maximum coverage.c)Rotation based on boundary(RB).RB can improve the boundary coverage and utilization ration of boundary sensor.In this paper,we focus on the area coverage problem of the omnidirectional sensor networks and directional sensor networks,by introducing Delaunay and Voronoi to design algorithms,also we conduct related simulations on the Matlab platform and compare our algorithms with others.Finally we make a summary of the outlook and point out some problems that need to be improved.