一种面向能耗均衡的wsn分簇路由算法的分析-analysis of a clustering routing algorithm for wsn oriented to energy consumption balance.docxVIP

ABSTRACTWireless Sensor Networks (WSN) is considered as one of the 21st centurys 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 than others, and tend to break earlier. This incurs uneven distribution of network energy consumption, and then causes “energy-hole” phenomenon in network. Due to “energy-hole”, the network ultimately cannot work anymore and wastes a large number of unused energy. To improve 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-spot of WSN routing protocol technology.Thisthesispresentsaclusteringroutingalgorithmforenergy-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: cluster algorithm can be used to deduce the optimal number of clusters and optimize the proportion p that cluster-heads accounts for number of nodes; To reduce the probability of low energy or distance of the node elected cluster head, the proportion P, distance and energy parameters are introduced into the threshold T (n) of cluster head selection. The basic station calculates the optimal cluster-radius of each cluster, and cluster head control themselves cluster-scale by themselves optimal cluster-radius. Mark nodes that do not join the cluster as redundant nodes to 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 WSN meanwhile to reduce energy consumption of node. Routing tree from the bottom up by the basic station is constructed. The process of routingIIalgorithm of adjacent cl