A Routing Energy-saving Algorithm Of Wireless Sensor Networks

Wireless sensor network(WSN) is an important application in network technology field. However, due to the number of number of nodes, rely solely on battery power, and the distribution of nodes is usually very difficult to reach in some danger of the human environment, the maintenance workload is huge, and the cost required to replace the battery can buy a number of new nodes, Therefore, how to design effective strategies to extend the network routing the life cycle, the current wireless sensor networks to become the core issue. Since wireless sensor networks are characterized by density, the energy is small, calculation ability, communication radius of the small, traditional wireless routing algorithm is no longer suitable to today's wireless sensor networks. So how to design a power consumption can make even the entire network to extend network life cycle, the routing algorithm, has become around the world of wireless sensor networks is a hot topic. Currently, wireless sensor networks for the routing algorithm are more typical for the LEACH clustering routing algorithm is also a research focus.This paper provides a brief overview of wireless sensor network background and significance, and wireless sensor network structure and characteristics, and then introduces some of the classic wireless sensor network routing protocols, and then focus on the LEACH algorithm theory and ideas analysis and research, summed up the advantages and disadvantages LEACH algorithm, later improved algorithm of LEACH algorithm, LEACH-EA algorithm that LEACH algorithm will take into account on issues of energy, adding the energy parameters, so that the final energy consumption more evenly, but did not take into account the position of the nodes of the factors; two methods in a stable phase, the cluster head to collect the information directly to the base station sends a single hop, which makes the consumption of a large cluster head.This article summarizes and analyzes these two algorithms together, for which the lack of an improved idea: the first selection in the cluster, let the energy position of nodes and large nodes are concentrated a greater probability of being elected as cluster heads, in a stable phase, cluster head nodes collect the data transmitted from sub-section points the way selectively through the multi-hop transmission to the base station, and finally a large number of simulation software MATLAB simulation and experimental results show that: Improved LEACH-NEW algorithm with the original LEACH algorithm in terms of energy consumption and survival time has a very good improvement.