Research On Coverage Control Algorithm For Wireless Sensor Network

With the continuous development of micro-electronics technology,wireless sensor networks emerge as the times require.The rise of wireless sensor networks has played an important role in the development of Internet of things.Wireless sensor networks are mainly used in Monitoring target,which shows that the coverage of wireless sensor networks is a core issue.Efficient collaboration between nodes to ensure coverage quality has always been the focus of research.In wireless sensor networks,the static nodes are limited in energy,cheap and cannot move,while the dynamic nodes are relatively high in price,but the energy can be supplemented and mobile.In the area coverage restoration,mobile nodes have more advantages than static nodes.The key point of this thesis is how to optimize the area coverage with mixed dynamic and static nodes.The main work of this paper is as follows:(1)This paper mainly studies the coverage control algorithm of wireless sensor networks.Firstly,the wireless sensor networks are briefly described.Then,the basic theory of coverage is introduced.Finally,the existing coverage control algorithms are classified.(2)In order to solve the problem that the static nodes can not repair the large-scale coverage hole caused by the sparse deployment of nodes,a dual repair algorithm is designed:First,some static nodes are used as sentries,which are responsible for monitoring the area,and other static nodes stay asleep,then adding mobile nodes one by one to repair it.The algorithm can be applied to the intensive and sparse deployment:the node uses the wake-up sleep mechanism to repair hole in the case of intensive deployment;in the case of sparse deployment,the node uses the wake-up sleep mechanism to repair hole at first,and then utilize the dynamic nodes to repair it.Finally,the experimental results show that the double repair algorithm significantly improves the coverage and connectivity compared with the EEHR algorithm in the case of sparse deployment.(3)Based on the circle coverage algorithm and set theory,this paper proposes a series of new concepts including the longest continuous arc and the longest continuous arc set,and the problem of the coverage hole of a node is mapped to the continuous longest arc problem,and this paper further designs a new strategy for coverage hole recovery based on circle coverage.According to the difference between the adjacent continuous longest arcs,the node selects the repair strategy.Finally,the experimental results show that the repair strategy can effectively repair the holes in dense and sparse deployment,and optimizes the coverage quality.