A greedy smart path pruning strategy for geographical routing in wireless networks

Geographical routing is powerful in its ability to discover sub-optimal route to the destination without the help of global state. Among all geographical routing protocols, the greedy perimeter stateless routing (GPSR) protocol is famous due to its ability to find the route without the need of flooding and storing state information at each node. However, the detour found by perimeter mode face routing commonly contains a large number of hops. When multiple packets are generated for the same destination, such large number of hops tends to consume more energy. In this paper, a simple yet effective strategy is proposed to reduce the excessive number of hops caused by the perimeter mode face routing in GPSR. Based on this strategy, a new geographical routing protocol, namely the greedy smart geographical routing protocol (GSGR), is proposed. With the help of little state information passively maintained by a subset of nodes on the route, our protocol is capable of pruning the path to reduce a large portion of hops introduced by perimeter mode of GPSR

[1]  Nitin H. Vaidya,et al.  Location-aided routing (LAR) in mobile ad hoc networks , 1998, MobiCom '98.

[2]  Zygmunt J. Haas,et al.  A new routing protocol for the reconfigurable wireless networks , 1997, Proceedings of ICUPC 97 - 6th International Conference on Universal Personal Communications.

[3]  Brad Karp,et al.  Greedy Perimeter Stateless Routing for Wireless Networks , 2000 .

[4]  Guoliang Xing,et al.  On greedy geographic routing algorithms in sensing-covered networks , 2004, MobiHoc '04.

[5]  R. Sokal,et al.  A New Statistical Approach to Geographic Variation Analysis , 1969 .

[6]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[7]  Ahmed Helmy,et al.  Energy-efficient forwarding strategies for geographic routing in lossy wireless sensor networks , 2004, SenSys '04.

[8]  M. S. Corson,et al.  A highly adaptive distributed routing algorithm for mobile wireless networks , 1997, Proceedings of INFOCOM '97.

[9]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[10]  Godfried T. Toussaint,et al.  The relative neighbourhood graph of a finite planar set , 1980, Pattern Recognit..

[11]  Charles E. Perkins,et al.  Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers , 1994, SIGCOMM.

[12]  Ivan Stojmenovic,et al.  Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 1999, DIALM '99.

[13]  David E. Culler,et al.  Taming the underlying challenges of reliable multihop routing in sensor networks , 2003, SenSys '03.