Research On Clustering Routing Algorithm Based On Balanced Energy Consumption For Heterogeneous Wireless Sensor Networks

In wireless sensor networks (WSNs), nodes are limited in energy and nodes batteries are hard to charge or replace, so the primary aims to study WSNs are to balance network energy consumption and prolong network lifetime. Clustering algorithm is regarded as one of efficient way to prolong network lifetime, for the reason that it has high energy utilization rate and simple route structure. The traditional clustering routing algorithms mainly concentrate on homogeneous WSNs, whereas heterogeneous WSNs is the extension and promotion of homogeneous WSNs, it not only is compatible with various technologies of homogeneous WSNs, but also can make full use of heterogeneity characteristics to meet practical scenes. So it has great significance to study clustering algorithms in heterogeneous environments.In thesis, we study clustering routing algorithms based on energy heterogeneous WSNs. Aiming at disadvantages of random election of cluster heads, unbalanced networks energy consumption and poor scalability for the existing clustering algorithm, two improved clustering algorithms are proposed on the basis of DEEC algorithm (Distributed Energy-Efficient Clustering algorithm), which are BEEC algorithm (Balanced and Energy-Efficient Clustering algorithm) and BEEMC algorithm (Balanced and Energy-Efficient Multi-hop Clustering algorithm).BEEC algorithm adopts competition mechanism to select cluster heads. Just in this way, there is only one cluster head distributed in a certain range. Moreover, in order to take fully use of the characteristics of energy heterogeneity, cluster members not only take intra-cluster energy consumption into consideration, but also cluster heads residual energy when choosing their clusters. The network will construct uneven clusters according to cluster heads residual energy, so the high energy cluster heads can bear more burdens to process nodes data to balance the load among nodes. At last, BEEC algorithm is simulated by MATLAB to demonstrate its good performance in balancing network energy consumption and prolonging network lifetime in energy heterogeneous network environments.But BEEC algorithm is not fit for large scale network system for the reason that it adopts single hop communication among cluster heads. BEEMC algorithm is the promotion of BEEC algorithm which can improve network scalability. It adopts multi-hop communication among cluster heads, considering cluster heads residual energy, inter-cluster communication cost and the number of cluster members of cluster heads to choose relay nodes. At the same time, BEEMC algorithm adopts non-uniform competition mechanism to alleviate network "hot spot" problem when choosing cluster heads. The clusters which are close to base station have small competitive radiuses and distributed densely, so they can consume less energy to process intra-cluster data and save more energy for data forwarding among clusters. At last, BEEMC algorithm is simulated by MATLAB and compared with BEEC algorithm so as to prove that BEEMC algorithm can adapt to large scale networks.