Research On Hierarchical Clustering Algorithm For The Energy-balanced In Wireless Sensor Networks

Wireless Sensor Networks (WSN) is considered as one of the21stcentury’s most influential technologies. Due to its broad application,WSN has been used in many areas. WSN is attracting great attention.Some nodes within the network are burdened with heavier traffic thanothers, and tend to break earlier. This incurs uneven distribution ofnetwork energy consumption, and then causes “energy-hole”phenomenon in network. Due to “energy-hole”, the network ultimatelycannot work anymore and wastes a large number of unused energy. Toimprove energy efficiency, it is necessary to prolong the network lifetime.The key of issue aims to balance the network energy consumption load.So how to balance the network energy consumption becomes a hot-spotof WSN routing protocol technology.This thesis presents a clustering routing algorithm forenergy-balanced in WSN, named global energy-balanced algorithm(GEBR) algorithm. The GEBR algorithm is composed of clusters-buildalgorithms and the routing algorithm of adjacent clusters：Firstly, the main work based on load balancing includes: clusteralgorithm can be used to deduce the optimal number of clusters andoptimize the proportion p that cluster-heads accounts for number ofnodes; To reduce the probability of low energy or distance of the nodeelected cluster head, the proportion P, distance and energy parameters areintroduced into the threshold T (n) of cluster head selection. The basicstation calculates the optimal cluster-radius of each cluster, and clusterhead control themselves cluster-scale by themselves optimalcluster-radius. Mark nodes that do not join the cluster as redundant nodesto reduce the sensor nodes in working condition.Secondly, the main target of routing algorithm of adjacent clustersproposed in this thesis is to balance energy consumption of WSNmeanwhile to reduce energy consumption of node. Routing tree from thebottom up by the basic station is constructed. The process of routing algorithm of adjacent clusters is as follows: basic station selects a “supercluster-head” according to the number of cluster member and the distanceof cluster-heads to the base station; the non-super cluster-heads choosethe next hop based on the distance between the clusters and the adjacentnumber of cluster members.Finally, the GEBR algorithm is simulated with OMNeT++4.1platform. In this thesis, to analyze the performance of the algorithm usingthree standards: network energy consumption, network load balancingand network lifetime number of nodes. The result shows that comparedwith LEACH, LEACH-C and EEUC, the GEBR algorithm performsbetter at load balancing, and reduces the energy consumption of nodesmeanwhile effectively improves the lifetime of network.