摘要
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.
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.
出处
《沈阳理工大学学报》
CAS
2014年第3期82-87,共6页
Journal of Shenyang Ligong University
基金
Financial Support by Program for Liaoning Outstanding Talents in University(LR2012007)
