Research On Hierarchical Clustering Routing Algorithm For Wireless Sensor Networks

Wireless sensor network is a multi-hop and self-organized network system formed with a large number of sensor nodes that in the monitoring region through wireless communication. In the wireless sensor network architecture, network layer is responsible for route discovery and maintenance, the routing protocol has an important influence on wireless sensor network quality.Wireless sensor network routing protocol according to the final form of the topological structure, can be divided into plane routing protocol and routing protocol. In plane routing protocol, all nodes are equal. In principle, there is no bottleneck problem. Its disadvantages are poor expansibility and the maintenance of dynamic routing requiring a large amount of control information.In the cluster-based routing protocols, cluster member function is more simple, no need to maintain a complex routing information. This has good scalability and greatly reduces the number of the information controlled by network routing. Its disadvantage is that the heading-cluster nodes may become the bottleneck of network. So in the cluster-based routing protocols to achieve full net energy balance is very important.Based on the cluster-based routing protocols, in order to achieve equilibrium of energy, the main content of this article is to find a suitable hierarchical clustering routing algorithm for large-scale network. The main contributions are as follows:(1) There are disadvantages of random、uneven distribution of heading-cluster in LEACH clustering protocol causing network life cycle short, so it gives out hierarchical clustering routing algorithm called MEBC based on wireless sensor. In the stage of heading-cluster selection, this paper puts forward "competition mechanism" used to solve the problem of uneven distribution in LEACH protocol. On the basis of this, the sensor node is divided into different levels, balance energy consumption and hop counts to be standards for establishing a transmission path selected through the autonomy of base station and multi-hop transmission routing. And the introduction of "relay nodes", the focus of forwarding data between cluster will be shared from the heading-cluster to relay node, rather than directly transmission between multiple heading-cluster nodes and base station nodes or simple path transmission between heading-clusters, it can not only reduce the burden of heading-cluster, but also have a better effect for long distance transmission, greatly prolongs the network lifetime.(2) The balance of energy consumption is very important in a wireless sensor network. The wireless sensor network generates the data through collection or supervision. Most of the data flow into the base station finally. For the source nodes often much more than the target nodes, the data stream will be unbalance. As a result, nodes which near base station cost more energy, and this is the so-called "hot spot" effect. Thus the energy hole problem is unavoidable. Aiming at these problems, this article introduces non uniform distribution strategy on the basis of the MEBC algorithm, so that the inner layer node has more number of nodes. Through theoretical and experimental simulation, the non-uniform node distribution strategy can effectively deal with the hot effect, realize the entire network of suboptimal balanced energy consumption in wireless sensor networks, and is effective to alleviate the energy hole problem. In addition, the simulation shows that with the expansion of network scale, it does not shorten network life cycle for non-uniform distribution strategy. So the non-uniform distribution strategy is a good solution to the problem of large scale network deployment.