Font Size: a A A

Research On Clustering Routing Algorithm For Wireless Sensor Networks With Energy Consumption Equilibrium

Posted on:2015-10-04Degree:MasterType:Thesis
Country:ChinaCandidate:S Y ZhangFull Text:PDF
GTID:2208330431474588Subject:Communication and Information System
Abstract/Summary:PDF Full Text Request
With the popularization of the Internet of things, a wireless micro sensor technology for low power high efficiency has become an important part of wireless communication, the wireless sensor network is a collection of wireless communication, micro sensor, embedded technology and computer network etc. Researching on routing protocol is one of the emphases and difficulty in the research of wireless sensor networks, the existing routing protocols is not suitable for its use, wireless sensor network’s routing protocol is in urgent need aiming to the characteristics of energy limited. The existing routing protocols for wireless sensor network exist ubiquitously some problem, such as energy imbalance, unequal cluster size, leading to premature death of some nodes, thus affecting the network’s lifetime. So the core work of this paper is:Based on energy and distance factors, uneven clustering routing protocol is designed to balance the energy consumption and optimize the relay path, in order to achieve the purpose of balancing the network load.This paper is based on the systematic study of routing protocols existed for wireless sensor networks, summarizes previous achievements and research on energy constrained wireless sensor networks and unequal cluster head distribution problem, this paper designs a kind of energy-balanced clustering routing algorithm based on energy and distance-ECRED. The specific works arelisted as follows:1) This paper first analyzed the characteristics of wireless sensor network topology control and routing protocol, provided a brief analysis of the situation, and summarized the existing problems for the routing protocols, thus established a theoretical foundation for energy consumption balanced routing protocol. At the same time, this paper analyzed several typical routing protocols’ existing problems.2) By setting the network model and summing up the design goals of cluster head selection in routing algorithm, this paper analyzed cluster head selection strategy of LEACH and LEACH-NEW algorithm and its existing problems, according to the deficiency of these algorithms in the presence of strategy, the CHSS-ED algorithm for cluster head selection was designed. Threshold formula for CHSS-ED algorithm was derived by adding the energy and distance factors, so as to make the selected cluster heads’the surplus energy larger and distance to the base station closer, thus prolonged the survival period of cluster head; increased the waiting time to check whether in the one hop range existed the cluster could be added in before broadcasting the election news, in order to reduce the number of clusters and avoid cluster head distribution with dense; alternative strategies were used to reduce the cluster reconstruction time.3) The design of the ECRED algorithm was based on the CHSS-ED cluster head selection strategy and furthermore increased the design idea of the routing strategy, in addition to the use of single hop and multi hop routing strategy combination, through the calculation of relay weight to select the maximum weight relaying node as the next hop relay nodes, so as to design an optimal relay route to forward the message.4) The algorithm performance was simulated compared with the EECS algorithm, ECRED algorithm’s index in energy consumption and life cycle was better than EECS algorithm, which could prolong the network life of8%or so, providing that ECRED algorithm had certain research significance.This paper designs an energy-balanced uneven clustering routing algorithm ECRED and analyzes topology control and routing protocol. In the end of this paper, the whole work was summarized and gave the follow-up work and experimental application prospects.
Keywords/Search Tags:Energy balance, uneven clustering, optimal routing, routing, wirelesssensor networks
PDF Full Text Request
Related items