Font Size: a A A

Research Of LEACH Protocol Based On The Cluster Heads Election And Multi-hop Routing

Posted on:2014-01-28Degree:MasterType:Thesis
Country:ChinaCandidate:S LiuFull Text:PDF
GTID:2248330398982412Subject:Computer application technology
Abstract/Summary:PDF Full Text Request
Accompanied by swept wave of the Internet of Things, the wireless sensor network technology has been rapid development and increasingly be mature. The wireless technology was used into the various fields of life, people’s lifestyles are undergoing changes in turn the world upside down, and the human has been in a highly developed informationera. The wireless sensor network is an emerging sensor network which was born with the development of embedded computing technology, sensor technology and wireless communication technology, a distributed self-organizing network. It consists of many low-cost, low-power sensor nodes by wireless communication, self-organizing. For the cost considerations, sensor nodes must be subject to cost constraints, thus its energy, CPU calculation speed, memory and communication bandwidth resource will be greatly constrained. Especially for sensor networks deployed in complex environment areas where battery cannot be replaced frequently, which requirements for battery can be used for several years, therefore, energy has become a very important resources. In order to prolong the network’s lifetime, researching the energy efficiency of WSN protocol or how to save energy become the focus of attention.This paper studied and simulated the WSN routing protocol-LEACH, through the analysis the core idea and the principle of work and fonnd its shortcomings:Randomly chosen cluster head distribution effect is poor; cluster head may not even; number of cluster head and members is random; network load is imbalance; single-hop routing etc.. According to the design requirement of the performance of routing protocol of wireless sensor networks, based on the cluster head election and routing algorithm of LEACH protocol, presents an algorithm of WSN routing protocol whch based on cluster head election and multi-hop routing, here called CHEMHR (Cluster Heads Clection and Multi-hop Routing).The CHEMHR algorithm is mainly in line with the following three ideas to optimize LEACH protocol.(1) For the LEACH protocol, its cluster heads distribution is uneven, the random number of cluster heads and members, which can cause the network load unequal problem. This paper proposes a new cluster head election mechanism which set the cluster head election threshold by considering the remain engery of the node and the distance to the Sink node, and used to calculate the number of cluster heads and members which makes the number of members of cluster head and the cluster head relatively stable.(2) As for the LEACH protocol, the cluster heads to the Sink node (base station) single-hop direct communication, while the CHEMHR protocol’s routing module is used multi-hop communication by again hierarchical of cluster heads and combined with genetic algorithm and simulated annealing algorithm to optimize multi-hop routing path of cluster heads.(3) Learning from the framework of LEACH protocol, this paper designed the complete CHEMHR protocol by the organic combination of (1) and (2).Finally, this paper used the configured network environment of the simulation software Matlab to simulate. The simulation results show that the improved algorithm CHEMHR has much better performance than the LEACH protocol. The life cycle of the wireless sensor network is extended about20.1%, the data packet throughput is increased by about33.3%, the energy loss in the network is reduced by about31.3%and the scalability of the network has been greatly improved. In addition, the multi-hop routing optimization path of CHEMHR algorithm makes a more economical energy consumption of the network and also makes WSN have a stronger robustness.
Keywords/Search Tags:WSN, LEACH, Routing Protocol, CIustering Routing, Matlab
PDF Full Text Request
Related items