Research On Cluster Head Selection Algorithm In Wireless Sensor Networks Cluster Routing

With the swift development of the technology of wireless communication,sensor computer and network, the wireless sensor network which integrates thesetechnologies become more and more popular. Wireless sensor network works well inmedical check, geographical and meteorological monitoring, military investigationand family monitoring in the digital life. The academic circles and society thinkhighly of it for its promising application prospect. At present, a large number ofresearchers and academic worker at home and abroad are doing related research on it.Wireless sensor network is different from traditional network algorithm. Due to thelimited energy and resources, its routing algorithm is required to be designed in alower energy consuming, high efficient and easy and simple way to extend thenetwork life time effectively.This paper first gives a brief introduction of the wireless sensor network,mainly about its flat and hierarchical routing algorithm, and does some comparisonand analysis of these routing algorithm, pointing out the advantage of thehierarchical routing algorithm.Secondly, based on the analysis of LEACH and PEGASIS algorithm, optimizescluster head selection algorithm to solve the maldistribution of LEACH cluster head,and combing the chaining feature of PEGASIS ,practices minimum-hop routingalgorithm to avoid the uneven energy consumption of the LEACH cluster headsingle-hop algorithm. The paper proposes an effective energy-balanced clusteringrouting algorithm (BEECR), BEECR has the advantage of energy efficient and longnetwork life cycle, and can improving the shortcomings of LEACH.At last, this paper does a lot of simulation experiment of BEECR algorithmusing MATLAB simulation software. Base on the result, makes a conclusion thatform the selection of the cluster head of BEECR and LEACH, the cluster headdistribution of BEECR are more balanced and reasonable. Meanwhile this paperoptimizes the number of cluster head selection to avoid the loss of energy for the too much cluster head. In the compare and analysis of LEACH and PEGASIS, it can berealized that BEECR routing algorithm can better save the energy and increase thelifetime of node and network.