Research On Wireless Sensor Network Coverage And Hole Repair Algorithm

Wireless Sensor Networks(WSN)have attracted more and more researchers to study them in recent years since they can meet the needs of fast mobility,self-organization and convenience.Area coverage is one of the research hotspots of wireless sensor networks,and its main evaluation index is the rate of area coverage.In order to optimize sensor node locations and improve network coverage,this paper investigates network coverage and hole repair algorithms from two perspectives:initial deployment of nodes and post-maintenance of sensor networks,respectively.For sensor networks with different application attributes and environments,we explore how to find the optimal node deployment to enhance the coverage of the monitoring area without increasing the network overhead and node deployment.As well as how to achieve the most effective repair of coverage holes by using limited sensor nodes to improve network coverage,network connectivity and energy efficiency after coverage holes are created in wireless sensor networks.To address the problem of high node redundancy and low network coverage in mobile heterogeneous wireless sensor networks during random initial deployment,the computational geometry principle is combined with the traditional virtual force algorithm.The virtual force coverage algorithm based on the common external tangent circular gravity is proposed by introducing the common external tangent circular gravity to constrain the movement of nodes.It overcomes the phenomenon that the traditional geometric algorithm is not applicable in the optimization process of heterogeneous networks,and achieves a more uniform coverage effect and higher coverage rate by using a limited number of mobile sensor nodes.Wireless sensor nodes are powered by a miniature battery.Therefore,the nodes have a limited lifetime and when the energy is exhausted,the nodes fail and a coverage hole in a region will be created.Coverage voids are also created when a sensor node unexpectedly dies due to various reasons.The occurrence of coverage voids can reduce the coverage of the monitored area and affect the quality of service of the whole network.Therefore,repairing the coverage holes generated by the network has become an important focus in the field of wireless sensor network research.Most of the traditional coverage hole repair algorithms are only applicable to homogeneous networks.In contrast,the nodes of wireless sensor networks in real environments are often heterogeneous.A coverage hole repair algorithm with a prioritization mechanism is proposed in a hybrid heterogeneous wireless sensor network environment using a common tangent circle coverage hole localization algorithm.The algorithm can determine the repair priority by the size of the coverage hole range,so as to use limited mobile sensor nodes for repairing,and then improve the network coverage,reduce node redundancy,and balance the resource allocation.