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

Min Te Sun, Xiaoli Ma, Jun Liu, Xiangqian Liu

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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.

Original languageEnglish
Title of host publicationMILCOM 2005
Subtitle of host publicationMilitary Communications Conference 2005
StatePublished - 2005
EventMILCOM 2005: Military Communications Conference 2005 - Atlatnic City, NJ, United States
Duration: 17 Oct 200520 Oct 2005

Publication series

NameProceedings - IEEE Military Communications Conference MILCOM


ConferenceMILCOM 2005: Military Communications Conference 2005
Country/TerritoryUnited States
CityAtlatnic City, NJ


Dive into the research topics of 'A greedy smart path pruning strategy for geographical routing in wireless networks'. Together they form a unique fingerprint.

Cite this