Research On Cluster-Based Routing Algorithms For Wireless Sensor Network

With the rapid development of the Internet era of big data information, wireless sensor networks as an emerging field of data collection technology, the physical world and those who have been closely associated with a wide range of scientific fields attracted to human exploration of hard to explain or unimaginable phenomenon. However, the sensor is limited energy storage and convenient battery replacement or charging characteristics, making a key issue surrounding the long-term sensor networks is how to extend the life of the network, to achieve high energy efficiency, many related solutions have been proposed for this problem.In the design of wireless sensor network, this paper will expand research priorities are:to improve the energy efficiency of the utilization of the main cluster head election and optimize the routing algorithm to construct the routing tree to maximize the network life cycle. Based on these studies focused on this paper, a distributed clustering routing algorithm. Essential to its network layer routing technology from the functions can be divided into two categories:flat routing and hierarchical routing. Wherein the clustering hierarchical routing structures in energy efficiency especially reflected in the auxiliary channel for access, enhanced network scalability, routing, easy management, and network security through data fusion technology to deal with redundant data, etc., enhancing the whole network to improve the performance of far-reaching significance.First, the relevant knowledge sensor network concepts and routing protocols briefly described, and in accordance with the specific function in different environments routing protocols and application requirements, from the function of routing protocols comprehensive classification, and analyzes the different application routing protocol the design and characteristics of routing technology brings performance issues, and clustering routing advantage. Then this paper LEACH algorithm as the basic theory study, detailed analysis of LEACH clustering approach, working principle and operation mechanism, the agreement generated around the cluster head, cluster formation systematically describe and analyze the LEACH protocol advantages and disadvantages, shortcomings on the basis of the agreement was based on the corresponding improvement, and thus leads to improved algorithm of this paper is necessary.Finally, based on the principle of LEACH protocol, improve and propose an energy efficient clustering routing algorithm. The improved algorithm is mainly reflected in the cluster head election and build routing trees, in the first elections and the formation of clusters, the algorithm does not have the sensor nodes are targeting, so the location information of the node can not be predicted, based only on the local network topology the residual energy of nodes to the base station (BS) distance values, and classified according to the minimum cost function, etc., on the lower cluster head along the route tree effectively control the number of clusters and evenly distributed in space. In the data transfer phase, take advantage of the sensor network routing protocols, through the use of single-hop and multi-hop hybrid communications mode, effectively solve the problem of balance between the cluster and the cluster node on the communication of energy consumption.