Abstract

We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet's destination to make packet forwarding decisions. GPSR makes greedy forwarding decisions using only information about a router's immediate neighbors in the network topology. When a packet reaches a region where greedy forwarding is impossible, the algorithm recovers by routing around the perimeter of the region. By keeping state only about the local topology, GPSR scales better in per-router state than shortest-path and ad-hoc routing protocols as the number of network destinations increases. Under mobility's frequent topology changes, GPSR can use local topology information to find correct new routes quickly. We describe the GPSR protocol, and use extensive simulation of mobile wireless networks to compare its performance with that of Dynamic Source Routing. Our simulations demonstrate GPSR's scalability on densely deployed wireless networks.

Keywords

Computer networkComputer scienceRouting protocolGeographic routingDistributed computingRouting tableSource routingPacket forwardingWireless Routing ProtocolDynamic Source RoutingStateless protocolLink-state routing protocolNetwork packet

Affiliated Institutions

Related Publications

Publication Info

Year
2000
Type
article
Pages
243-254
Citations
7001
Access
Closed

External Links

View on DOI.org

Social Impact

Altmetric
PlumX Metrics

Social media, news, blog, policy document mentions

Citation Metrics

7001
OpenAlex

Cite This

Brad Karp, H. T. Kung (2000). GPSR. , 243-254. https://doi.org/10.1145/345910.345953

Identifiers

DOI
10.1145/345910.345953