Research On Clustering Routing And Coverage Control Algorithms For Wireless Sensor Networks

As the nerve terminal of the Internet of things,the wireless sensor network is responsible for information monitoring of the real physical world.With the development of IoT,its role is increasingly prominent.It is considered as one of the most important communication technologies in the 21 st century.A number of cutting-edge technologies such as cluster routing,coverage control,data fusion and time synchronization have played a role in the development of wireless sensor networks.Due to the limited energy of sensor nodes,limited to the working environment of power supply is difficult to replace,so the routing protocol design to improve energy,efficiency and prolong the network lifetime is an important research area in wireless sensor networks.Coverage control is a direct factor that affects the quality of service,information perception ability,network energy consumption and life span of the entire network.Therefore,the research on coverage problem of wireless sensor networks is of great significance.In this paper,the classic clustering routing protocol and coverage control algorithm are improved.The paper mainly studied the following two contents.A BCEPOCH routing protocol based on cluster head election and node location optimization is proposed,aiming at the improvement of traditional clustering routing protocol,such as too short stable period and half survival node period,and the instability of cluster heads election and the appearance of zero cluster heads.First,we improve the cluster head election process and modify the update strategy of the candidate cluster head node set G,instead of randomly selecting the best cluster head probability,we update the candidate set G when the number of candidate nodes is less than the optimal number of cluster heads,guaranteed to choose the best number of cluster heads.Increase the distance between the node and the base station and the distance between the node and the cluster head as the threshold adjustment factor and adjust the probability of the elected cluster head by the dynamic threshold to balance the network energy consumption.Simulation results show that the BCEPOCH algorithm can guarantee the best number of cluster heads elected each round and avoid the emergence of cluster heads,and effectively prolong the stable period and the half-node death period of WSN in terms of network lifetime.CMACP algorithm based on memetic algorithm is proposed,aiming at the lifetime and coverage optimization of wireless sensor networks,a composite memetic algorithm clustering protocol based on memetic algorithm and node wake-up scheduling strategy is proposed.The algorithm first runs the memetic algorithm to initialize the nodes that need to be activated and plan the neighboring redundant sensors,in which the genetic algorithm and the local search algorithm can guarantee the optimal initial sensor node distribution.With the operation of the network,when a node losts coverage target due to energy exhaustion,the wake-up scheduling strategy makes up for the cover loopholes by activating the optimal adjacent redundant nodes through calculation and contrast..Simulation results show that,compared with genetic algorithm,CMACP has higher fitness,longer 100% coverage period and network lifetime.Compared with other clustering protocols,CMACP algorithm has more obvious advantages,can better extend the 100% coverage period,stable period and network lifetime,and improve the coverage control ability of WSN to the perceptual area.