Aiming at the existing problems in Leach algorithm,which has short network survival time and high energy consumption,a new location-based clustering topology control algorithm is proposed.Based on Leach algorithm,impr...Aiming at the existing problems in Leach algorithm,which has short network survival time and high energy consumption,a new location-based clustering topology control algorithm is proposed.Based on Leach algorithm,improvements have been done.Firstly,when selecting cluster head,node degree,remaining energy,and the number of being cluster head,these three elements are taken into consideration.Secondly,by running the minimum spanning tree algorithm,the tree routing is constructed.Finally,selecting the next hop between clusters is done by MTE algorithm.Simulation results show that the presented control algorithm has not only a better adaptability in the large-scale networks,but also a bigger improvement in terms of some indicators of performance such as network lifetime and network energy consumption.展开更多
GPSR( Greedy Perimeter Stateless Routing) selects the closest neighbor node to the destination as forwarding node using greedy node,and establishes floor plan by using boundary forwarding node to translate packets whe...GPSR( Greedy Perimeter Stateless Routing) selects the closest neighbor node to the destination as forwarding node using greedy node,and establishes floor plan by using boundary forwarding node to translate packets when there is "hole"in network. Aiming at the hot spots and single path issues in GPSR,a new improved algorithm called GPSR-EA is proposed. Distance factor,energy factor and angle factor are introduced to the improved algorithm when nodes choose the nest hop to forward packets. In order to simulate and analyze the performance of GPSR-EA,the NS2 simulation environment was set up. Experimental results show that the GPSR-EA algorithm can effectively balance the network-energy-consumption and improve the network-life-cycle.展开更多
基金Financial by program for Liaoning Outstanding Talents in University(LR2012007)
文摘Aiming at the existing problems in Leach algorithm,which has short network survival time and high energy consumption,a new location-based clustering topology control algorithm is proposed.Based on Leach algorithm,improvements have been done.Firstly,when selecting cluster head,node degree,remaining energy,and the number of being cluster head,these three elements are taken into consideration.Secondly,by running the minimum spanning tree algorithm,the tree routing is constructed.Finally,selecting the next hop between clusters is done by MTE algorithm.Simulation results show that the presented control algorithm has not only a better adaptability in the large-scale networks,but also a bigger improvement in terms of some indicators of performance such as network lifetime and network energy consumption.
基金Financial Support by Program for Liaoning Outstanding Talents in University(LR2012007)
文摘GPSR( Greedy Perimeter Stateless Routing) selects the closest neighbor node to the destination as forwarding node using greedy node,and establishes floor plan by using boundary forwarding node to translate packets when there is "hole"in network. Aiming at the hot spots and single path issues in GPSR,a new improved algorithm called GPSR-EA is proposed. Distance factor,energy factor and angle factor are introduced to the improved algorithm when nodes choose the nest hop to forward packets. In order to simulate and analyze the performance of GPSR-EA,the NS2 simulation environment was set up. Experimental results show that the GPSR-EA algorithm can effectively balance the network-energy-consumption and improve the network-life-cycle.
