Routing Over Multi-Hop Wireless Network of Mobile Computers

  • Charles E. Perkins
  • Pravin Bhagwat
Part of the The Kluwer International Series in Engineering and Computer Science book series (SECS, volume 353)


An ad-hoc network is the cooperative engagement of a collection of Mobile Hosts without the required intervention of any centralized Access Point. In this paper we present an innovative design for the operation of such ad-hoc networks. The basic idea of the design is to operate each Mobile Host as a specialized router, which periodically advertises its view of the interconnection topology with other Mobile Hosts within the network. This amounts to a new sort of routing protocol. We have investigated modifications to the basic Bellman-Ford routing mechanisms, as specified by the Routing Information Protocol, making it suitable for a dynamic and self-starting network mechanism as is required by users wishing to utilize ad-hoc networks. Our modifications address some of the previous objections to the use of Bellman-Ford, related to the poor looping properties of such algorithms in the face of broken links and the resulting time dependent nature of the interconnection topology describing the links between the Mobile Hosts. Finally, we describe the ways in which the basic network-layer routing can be modified to provide MAC-layer support for ad-hoc networks.


Mobile Node Medium Access Control Sequence Number Mobile Host Break Link 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    W. Diepstraten, G. Ennis, and P. Belanger, “Dfwmac — distributed foundation wireless medium access control.” IEEE Document P802.11-93/190, Nov 1993.Google Scholar
  2. [2]
    M. Schwartz and T. Stern, “Routing techniques used in computer communication networks,” IEEE Transactions on Communications, vol. COM-28, pp. 539–552, Apr. 1980.CrossRefGoogle Scholar
  3. [3]
    J. M. McQuillan, I. Richer, and E. C. Rosen, “The new routing algorithm for the ARPANET,” IEEE Transactions on Communications, vol. COM-28, pp. 711–719, May 1980.CrossRefGoogle Scholar
  4. [4]
    C. Hedrick, “Routing Information Protocol.” RFC 1058, June 1988.Google Scholar
  5. [5]
    D. Bertsekas and R. Gallager, Data Networks, pp. 297–333. Prentice-Hall, Inc., 1987.Google Scholar
  6. [6]
    C. Cheng, R. Riley, S. P. R. Kumar, and J. J. Garcia-Luna-Aceves, “A loop-free Bellman-Ford routing protocol without bouncing effect,” in ACM SIGCOMM’ 89, pp. 224–237, Sept. 1989.Google Scholar
  7. [7]
    J. M. Jaffe and F. Moss, “A responsive distributed routing algorithm for computer networks,” IEEE Transactions on Communications, vol. COM-30, pp. 1758–1762, July 1982.CrossRefGoogle Scholar
  8. [8]
    J. J. G. Luna-Aceves, “A unified approach to loop-free routing using distance vectors or link states,” in ACM SIGCOMM, pp. 212–223, 1989.Google Scholar
  9. [9]
    P. M. Merlin and A. Segall, “A failsafe distributed routing protocol,” IEEE Transactions on Communications, vol. COM-27, pp. 1280–1287, Sept. 1979.CrossRefGoogle Scholar

Copyright information

© the Association of Computing Machinery, Inc. 1994

Authors and Affiliations

  • Charles E. Perkins
    • 1
  • Pravin Bhagwat
    • 2
  1. 1.IBM ResearchYorktown Heights
  2. 2.University of MarylandCollege Park

Personalised recommendations