Research On WSN Node Decomposition Low Energy Routing Algorithm Based On Geographic Location

Wireless Sensor Network(WSN)is a self-organizing wireless sensing network composed of a large number of inexpensive low-energy miniature sensors,and the sensor nodes cooperate to complete the monitoring of designated areas.Nodes of wireless sensor network are generally powered by energy-limited batteries,and it is difficult for networks to supply energy in this process.Therefore,the efficient use of limited energy to extend the network lifetime becomes the primary goal of wireless sensor networks.The energy consumption of nodes in wireless sensor network systems is mainly concentrated on the communication module.An excellent routing protocol can not only find the shortest path of data transmission,reduce communication consumption,but also balance the transmission consumption between nodes,avoiding the behaviors of energy exhaustion of nodes,generating energy holes and other actions which shorten the lifetime of the network.Designing a low-energy routing algorithm is a key means of energy conservation in wireless sensor networks.According to the related research,a low-energy routing algorithm based on location characteristics for node decomposition is designed,which is aiming at the shortcomings of frequent replacement of cluster heads and strong randomness of selecting cluster heads in the traditional clustering algorithm,and combining with the advantages of clustering algorithms and geolocation-based algorithms.The first step of algorithm is clustering,the next calculating the centroid of each cluster,then selecting the node close to the centroid in a cluster as the cluster head node.The cluster head node is in charge of collecting the data received by others nodes in the cluster and performing data fusion while the member nodes are in charge of transmitting the processed data.At the same time,on the problem of replacing the cluster head,we perform replacement operations of cluster head when the energy of it is lower than a certain ratio,which can reduce the waste of energy in the clustering stage.The algorithm can optimize the distance of data transmission between the nodes,thereby reducing the node energy consumption in data transmission,and extending the network lifetime.Finally,the algorithm is simulated by Matlab and compared with the classic algorithm and improved algorithm.The results show that the algorithm can balance the energy consumption between nodes and effectively extend the lifetime of the network.