skip to main content
10.1145/345910.345953acmconferencesArticle/Chapter ViewAbstractPublication PagesmobicomConference Proceedingsconference-collections
Article
Free Access

GPSR: greedy perimeter stateless routing for wireless networks

Published:01 August 2000Publication History

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.

References

  1. 1.ABRAMSON, N. The ALOHA system- another alternative for computer communications. AFIPS 37 (1970), 281-285.Google ScholarGoogle Scholar
  2. 2.BHARGHAVAN, A., DEMERS, S., SHENKER, $., AND ZHANG, L. MACAW: A media access protocol for wireless LANs. In Proceedings of the SIGCOMM '94 Conference on Communications, Architectures, Protocols, and Applications (Sept. 1994), pp. 212-225. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3.BOSE, P., MORIN, P., STOJMENOVi(~, I., AND URRUTIA, J. Routing with guaranteed delivery in ad hoc wireless networks. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DialM '99), Aug. 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4.BROCH, J., MALTZ, D., JOHNSON, D., HU, Y.,, AND JETCHEVA, J. A performance comparison of multi-hop wireless ad hoc network routing protocols. In Proceedings of the Fourth Annual A CM/IEEE International Conference on Mobile Computing and Networking (MobiCom '98) (Dallas, Texas, USA, Aug. 1998). Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5.CALl, F., CONTI, M., AND GREGORI, E. IEEE 802.11 wireless LAN: capacity analysis and protocol enhancement. In Proceedings of lEEE INFOCOM 1998 (San Francisco, California, March/April 1998), p. 142.Google ScholarGoogle Scholar
  6. 6.CHANDRAKASAN, A., AMIRTHARAJAH, R., CHO, $., GOODMAN, J., KONDURI, G., KULIK, J., RABINER, W., AND WANG, A. Design considerations for distributed microsensor systems. In Proceedings of the IEEE 1999 Custom Integrated Circuits Conference (CICC '99) (May 1999), pp. 279-286.Google ScholarGoogle ScholarCross RefCross Ref
  7. 7.FINN, G. G. Routing and addressing problems in large metropolitan-scale intemetworks. Tech. Rep. ISI/RR-87-180, Information Sciences Institute, Mar. 1987.Google ScholarGoogle ScholarCross RefCross Ref
  8. 8.FLOYD, S., AND JACOBOSON, V. The synchronization of periodic routing messages. IEEE/ACM Transactions on Networking 2, 2 (April 1994), 122--136. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9.GABRIEL, K., AND SOKAL, R. A new statistical approach to geographic variation analysis. Systematic Zoology 18 (1969), 259-278.Google ScholarGoogle ScholarCross RefCross Ref
  10. 10.HAAS, Z., AND PEARLMAN, M. The performance of query control schemes for the zone routing protocol. In Proceedings of the SIGCOMM '98 Conference on Communications Architectures, Protocols and Applications (Sept. 1998). Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11.IEEE COMPUTER SOCIETY LAN MAN STANDARDS COMMITTEE. Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications. IEEE Std. 802.11-1997, 1997.Google ScholarGoogle Scholar
  12. 12.JOHNSON, D. B., AND MALTZ, D. B. Dynamic source routing in ad hoc wireless networks. In Mobile Computing, T. Imielinski and H. Korth, Eds. Kluwer Academic Publishers, 1996, ch. 5, pp. 153-181.Google ScholarGoogle Scholar
  13. 13.KAHN, J. M., KATZ, R. H., AND PiSTER, K. S. J. Mobile networking for smart dust. In Proceedings of the Fifth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom '99) (Seattle, WA, USA, Aug. 1999). Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. 14.KARN, P. MACA--a new channel access method for packet radio. In Proceedings of the 9th Computer Networking Conference (Sept. 1990), pp. 134-140.Google ScholarGoogle Scholar
  15. 15.KARP, B. Geographic routing for wireless networks. Presentation at AFOSR MURI ACTCOMM Research Review Meeting, Oct. 1998.Google ScholarGoogle Scholar
  16. 16.KARP, B. Greedy perimeter state routing. Invited Seminar at the USCAnformation Sciences Institute, July 1998.Google ScholarGoogle Scholar
  17. 17.Ko, Y., AND VAIDYA, N. Location-aided routing in mobile ad hoc networks. In Proceedings of the Fourth Annual A CM/IEEE International Conference on Mobile Computing and Networking (MobiCom '98) (Dallas, Texas, USA, Aug. 1998). Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. 18.LI, J., JANNOTTI, J., DECOUTO, D., KARGER, D., AND MORRIS, R. A scalable location service for geographic ad-hoc routing. In Proceedings of the Sixth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom 2000) (Boston, MA, USA, Aug. 2000). Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. 19.MALTZ, D., BROCH, J., JETCHEVA, J., AND JOHNSON, O. The effects of on-demand behavior in routing protocols for multihop wireless ad hoc networks. IEEE Journal on Selected Areas in Communications 17, 8 (Aug. 1999), 1439-1453. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. 20.PARK, V., AND CORSON, M. A highly adaptive distributed routing algorithm for mobile wireless networks. In Proceedings of the Conference on Computer Communications (IEEE lnfocom) (Kobe, Japan, Apr. 1997), pp. 1405-1413. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. 21.PERKINS, C. Ad hoc on demand distance vector (AODV) routing. Interact-Draft, draft-ietf-manet-aodv-04.txt, Oct. 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. 22.PERKINS, C., AND BHAGWAT, P. Highly-dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. In Proceedings of the SiGCOMM '94 Conference on Communications, Architectures, Protocols, and Applications (London, UK, Sept. 1994), pp. 234-244. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. 23.SALTZER, J., REED, D. P., AND CLARK, D. End-to-end arguments in system design. ACM Transactions on Computer Systems 2, 4 (Nov. 1984), 277-288. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. 24.SHEPARD, T. A channel access scheme for large dense packet radio networks. In Proceedings of the SIGCOMM '96 Conference on Communications Architectures, Protocols and Applications (Aug. 1996). Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. 25.THE CMU MONARCH GROUP. Wireless and Mobility Extensions to ns-2. http://www, monarch.cs.cmu.edu/cmu-ns.html, Oct. 1999.Google ScholarGoogle Scholar
  26. 26.THE VINT PROJECT. The UCB/LBNIdVINT Network Simulator--ns (version 2). http://mash.cs.berkeley, edu/ns.Google ScholarGoogle Scholar
  27. 27.TOUSSAINT, G. The relative neighborhood graph of a finite planar set,. Pattern Recognition 12, 4 (1980), 261-268.Google ScholarGoogle ScholarCross RefCross Ref
  28. 28.WARD, A., JONES, A., AND HOPPER, A. A new location technique for the active office. IEEE Personal Communications 4, 5 (Oct. 1997), 42-47,Google ScholarGoogle ScholarCross RefCross Ref
  29. 29.ZAUMEN, W., AND GARCIA-LUNA ACEVES, J. Dynamics of distributed shortest-path routing algorithms. In Proceedings of the SIGCOMM '91 Conference on Communications Architectures, Protocols and Applications (Sept. 1991), pp. 31--42. Google ScholarGoogle ScholarDigital LibraryDigital Library
  1. GPSR: greedy perimeter stateless routing for wireless networks

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        MobiCom '00: Proceedings of the 6th annual international conference on Mobile computing and networking
        August 2000
        300 pages
        ISBN:1581131976
        DOI:10.1145/345910

        Copyright © 2000 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 1 August 2000

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • Article

        Acceptance Rates

        MobiCom '00 Paper Acceptance Rate28of226submissions,12%Overall Acceptance Rate440of2,972submissions,15%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader