Font Size: a A A

An Improved Algorithm Based On Leach Protocol Of WSN

Posted on:2015-12-26Degree:MasterType:Thesis
Country:ChinaCandidate:Y DingFull Text:PDF
GTID:2298330434956382Subject:Signal and Information Processing
Abstract/Summary:PDF Full Text Request
The rapid development of microprocessor and radio technology have greatly promoted the people’s attention to the wireless sensor network, wireless sensor network is a self-organized network system which is generally formed by tens of thousands of nodes which are mainly responsible for monitoring,storaging and transmissing the interesting events in monitoring area. Wireless sensor network has been widely used in all aspects because of its low power consumption, low cost, strong ability of self organization. Wireless sensor network is different from the traditional sensor net works, sensor nodes are usually powered by batteries, and generally arrangemented in the hash conditions, therefore, energy-saving technology has become a key challenge in wireless sensor networks, the research of energy efficient wireless sensor network routing protocol has become a hot research in wirelesssensor network.LEACH routing protocol is a classical hierarchical routing protocol that was proposed the first,Which has a very big enhancement comparing with flat routing protocol in energy saving, expansibility etc.But the LEACH routing protocol also has some disadvantages in prolonging the network lifetime and balancing the node energy,which remains to be further improved.In this paper, by analyzing the classic hierarchical routing protocol-LEACH routing protocol,a new energy efficient routing protocol of MDG-LEACH is proposed in the paper,which is based on the question of numerous redundancies with data collecting in nodes and imbalance of energy consumption in LEACH protocol.lt selects active nodes based on virtual grids and multiple dimensions grids.,which reduces the number of active nodes under the condition of the guarantee that the network is completely covered.Further,it adopts cluster head choice mechanism in overall consideration of residual energy and spatial distribution of nodes which balances the energy consumption of cluster nodes and establishs the shortest transmission route tree between cluster heads and base station by the dynamic programming method for date transmission, reducing the consumption of energy as data transmission between the cluster head nodes and base station.In addition, the probability of node to become cluster head algorithm of LEACH protocol is improved, The algorithm calculates the whole network energy consumption each round based on multiple hops transport mechanism between cluster heads and calculates the optimal probability of node to become cluster head in the situation that the energy consumption of the network is minimum.Further, the improved algorithm was applied to the MDG-LEACH protocol, put forward the MDG-LEACH agreement whose probability of node to become cluster head is improved.MATLAB simulation results show that the total energy consumption of the network is reduced by80%and the first node’s death time of MDG-LEACH protocol is increased by600%and450%compared with LEACH protocol and Janfeng Dan’s improvement of LEACH algorithm based on optimized percentage of cluster head,which balances the node energy consumption.The last node’s death time of MDG-LEACH protocol is increased by650%and510%compared with LEACH protocol and Janfeng Dan’s improvement of LEACH algorithm based on optimized percentage of cluster head,prolonging the life time of wireless sensor network effectively. Moreover,it reduces the energy consumption of the MDG-LEACH agreement and prolongs the network life of the MDG-LEACH agreement while the algorithm of the probability of node to become cluster head is applied to the MDG-LEACH agreement.
Keywords/Search Tags:WSN, LEACH protocol, grids with multiple dimensions, active nodes, multihop
PDF Full Text Request
Related items