reportJan 1, 2005Closed access

GPSR: Greedy Perimeter Stateless Routing for Wireless Networks

Harvard University · Harvard University Press

Indexed incrossref

Abstract

We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that used 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…

Citation impact

667
total citations
FWCI
Percentile
References
18
Citations per year

Authors

2

Topics & keywords

Keywords
  • Stateless protocol
  • Computer network
  • Computer science
  • Routing (electronic design automation)
  • Perimeter
  • Geographic routing
  • Greedy algorithm
  • Distributed computing
UN Sustainable Development Goals
  • Affordable and clean energy
No related works found for this paper.