On The Low Energy Clusteirng Algorithms For Wireless Sensor Networks

Wireless sensor networks is composed of a large number of tiny, cheap, limited resourcesof sensor nodes, they randomly deployed in the monitored area, formed wirelesscommunication network by self-organizing, closely linked with human life, and has broadapplication prospects and major research significance. Wireless sensor networks have beenused in military, medical, networking, environmental monitoring and other fields. Comparedwith traditional network, wireless sensor networks have the limited of energy resources,communication capabilities, storage capacity and computing, so energy-efficient is thewireless sensor networks routing protocol’s primary design goal.Clustering routing protocol as the important component of wireless sensor networkrouting protocol has great research and practical significance. It divided the network intoseveral clusters, and cluster head node collected information from the member nodes of thecluster, then fused the data, and end it to the sink node. Clustering routing protocol improvesthe energy efficiency of the network greatly, owns strong scalability, prolong the networklifetime. Based on the shortcomings of the clustering routing protocol, and with the purpose ofenergy-efficient and balanced energy consumption. In this paper we have been proposed severalimprovement routing algorithms, the corresponding theoretical analysis and simulation onthese protocols are implemented as well.The classic LEACH algorithm possesses disadvantages in terms of irregular spatialdistribution of cluster heads and the unbalanced energy consumption among the sensor nodes.To address those drawbacks, we propose an improved LEACH protocol. It first divides theWSN into several node clusters through exploring the Fuzzy C-Mean algorithm and the nodeposition information. The proposed algorithm then applies a modified LEACH algorithm thattakes into account the residual energy in sensor nodes to select a single cluster head for eachnode cluster and accomplish the two-hop data transmission. The simulation results show thatthe new algorithm makes the cluster head nodes distribution more uniform, and prolongs thenetwork life time in a certain extent.With clustering-based routing protocols, the cluster heads close to the sink node have torelay the data from other clusters, which could quickly deplete their battery power and lead tothe well-known ‘hotspot’ problem. This paper presents a novel RSSI-based double clusterhead uneven cluster in grouting protocol for wireless sensor networks. The key idea is that onthe basis of the received RSSI from the sink node, sensor nodes are partitioned into clusters ofdifferent sizes. The clusters closer to the sink node have fewer nodes than those farther awayfrom the sink node. According to the distance from the base station and cluster, the cluster isdivided into inside and outside areas, selection of main cluster head and assistant clusterhead in the corresponding region. Then use cluster head residual energy, distance, intra-clusterresidual energy mean other factors select a relay node, the finite state machine built datarouting tree for data forwarding. The computer simulation proved that the rationality of thetheoretical analysis, and show that the algorithm has excellent characteristics in solvingnetwork "hotspot" phenomenon, as well as aspects of a balanced network consumption.Finally, the improvement of a non-uniform multi-path routing algorithm based on fuzzy logic and ant colony algorithm. The algorithm uses fuzzy logic node put residual energy,density of nodes, data traffic nodes into account, according to the fuzzy rule to calculate theprobability of cluster head for election; When the cluster head elected, use ant colonyalgorithm select multiple paths, the simulation results prove the theory of rational analysisalso shows that the algorithm can effectively balance the network energy consumption andprolong the network lifetime.