Research On Balance Of Energy Consumption In Mobile Sink For Wireless Sensor Network

Wireless sensor networks are an end-to-end pipeline technology for information data acquisition,processing,and transmission.Nowadays,people are increasingly demanding digital information.This more convenient information acquisition technology is receiving more and more attention.The characteristics of wireless sensor networks is that the sensor nodes have limited energy and cannot supplement energy.The energy resources of the sensor nodes are very valuable,so the lifetime of the network becomes one of the important indicators to measure the performance of the algorithms related to wireless sensor networks.The faster the energy consumption of the sensor nodes closer to the sink node,the more the other sensor nodes in the network cannot relay the data transmission through these nodes,and eventually cannot contact the sink nodes,resulting in incomplete data collection.Therefore,this thesis no longer only pays attention to the energy consumption of a single node,pays more attention to the energy consumption of the entire network,pays attention to the energy balance of the entire network,and thus prolongs the network lifetime.This thesis analyzes the energy consumption model of wireless sensor networks,and on this basis,improves a non-uniform clustering data collection algorithm.According to the size of the network,by analyzing the energy consumption of the cluster heads and the local network,the optimal number of cluster heads is determined.When the cluster heads are selected,the distance between the cluster heads and the sink node and the energy value of the cluster heads are comprehensively determined.And in the data transmission phase,routing table is established through the cost function.The simulation results show that the improved algorithm plays a positive role in suppressing the energy consumption of the network.Considering the wireless communication characteristics of sensor nodes,this thesis improves a routing planning algorithm about sink node based on neighborhood and local search.The algorithm divides the routing planning into two parts: the first part is to plan the access order of the sink node to the sensor nodes through the local search technology,the second part,the neighborhood correction is performed according to the coverage of the wireless communication signal.The simulation results show that the algorithm with neighborhood correction can effectively reduce the length of the route of the sink node.At the same time,the advantage of the algorithm is more significant if the number of sensor nodes is increased,which can be effectively applied to large-scale wireless sensor networks.Although non-uniform clustering data collection algorithm can achieve the goal of balancing network energy to a certain extent,there is still a "hot spot" phenomenon.Therefore,based on the algorithm,this thesis improves a data collection algorithm based on the movement of the sink node.Multi-hop data transmission is used in the cluster,and the sink node periodically moves to collect data information of all nodes in the cluster saved by the cluster head.The simulation results show that compared with other algorithms,the improved algorithm can greatly reduce the energy consumption of nodes and significantly extend the lifetime of the network,which is of great significance in balancing network energy.