Cluster Computing

, Volume 1, Issue 2, pp 237–248 | Cite as

Spine routing in ad hoc networks

  • Raghupathy Sivakumar
  • Bevan Das
  • Vaduvur Bharghavan


An ad hoc network is a multihop wireless network in which mobile hosts communicate without the support of a wired backbone for routing messages. We introduce a self organizing network structure called a spine and propose a spine-based routing infrastructure for routing in ad hoc networks. We propose two spine routing algorithms: (a) Optimal Spine Routing (OSR), which uses full and up-to-date knowledge of the network topology, and (b) Partial-knowledge Spine Routing (PSR), which uses partial knowledge of the network topology. We analyze the two algorithms and identify the optimality-overhead trade-offs involved in these algorithms.


Span Tree Mobile Host Route Discovery Link Failure Message Complexity 
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]
    B. Awerbuch, Optimal distributed algorithms for minimum weight spanning tree, counting, leader election and related problems, in: Proceedings of the 19th Annual ACM Symposium on Theory of Computing(1987) pp. 230-240.Google Scholar
  2. [2]
    S. Corson, J. Macker and S. Batsell, Architectural considerations for mobile mesh networking, at Internet DRAFT RFC Version 2, May 1996, Scholar
  3. [3]
    B. Das and V. Bharghavan, Routing in ad-hoc networks using minimum connected dominating sets, in: IEEE International Conference on Communications(ICC' 97) (June 1997).Google Scholar
  4. [4]
    B. Das and M.C. Loui, Algorithms for all single deletions in a minimum spanning tree, simultaneously, Technical Report UILU-ENG-95-2241, ACT-136, Coord. Sci. Lab., University of Illinois, Urbana-Champaign (1995).Google Scholar
  5. [5]
    B. Das, R. Sivakumar and V. Bharghavan, Routing in ad-hoc networks using a virtual backbone, in: 6th International Conference on248 R. Sivakumar et al. / Spine routing in ad hoc networks Computer Communications and Networks(IC3N' 97) (September 1997) pp. 1-20.Google Scholar
  6. [6]
    M. Faloutsos and M. Molle, Optimal distributed algorithm for minimum spanning trees revisited, in: Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing(1995) pp. 231-237.Google Scholar
  7. [7]
    R.G. Gallager, P.A. Humblet and P.M. Spira, A distributed algorithm for minimum-weight spanning trees, ACM Transactions Programming Languages Systems 5(1) (1983) 66-77.zbMATHCrossRefGoogle Scholar
  8. [8]
    J.A. Garay, S. Kutten and D. Peleg, A sub-linear time distributed algorithm for minimum-weight spanning trees, in: Proceedings of the 34th Annual Symposium on Foundations of Computer Science(1993) pp. 659-668.Google Scholar
  9. [9]
    M.L. Garey and D.S. Johnson, Computers and Intractablility: A Guide to the Theory of NP-Completeness(W.H. Freeman, San Francisco, 1979).zbMATHGoogle Scholar
  10. [10]
    M. Gerla and J.T.-C. Tsai, Multicluster, mobile, multimedia radio network, ACM J. Wireless Networks 1(3) (1995) 255-265.CrossRefGoogle Scholar
  11. [11]
    S. Guha and S. Khuller, Approximation algorithms for connected dominating sets, Technical Report 3660, University of Maryland Institute for Advanced Computer Studies-Department of Computer Science, University of Maryland, College Park (June 1996).Google Scholar
  12. [12]
    D.A. Hall, Tactical Internet system architecture for task force XXI, in: Proceedings of the Tactical Communications Conference, Ft. Wayne (May 1996).Google Scholar
  13. [13]
    D.B. Johnson and D.A. Maltz, Dynamic source routing in ad hoc wireless networks, in: Mobile Computing, eds. T. Imielinski and H. Korth (Kluwer Academic Publishers, Dordrecht, 1996).Google Scholar
  14. [14]
    J. Jubin and J.D. Tornow, The DARPA packet radio network protocols, Proceedings of the IEEE 75(1) (1987) 21-32.CrossRefGoogle Scholar
  15. [15]
    S. Kutten and D. Peleg, Fast distributed construction of k-dominating sets and applications, in: Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing(1995) pp. 238-249.Google Scholar
  16. [16]
    C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, J. ACM 41(5) (1994) 960-981.zbMATHCrossRefMathSciNetGoogle Scholar
  17. [17]
    C.E. Perkins and P. Bhagwat, Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers, Computer Communications Review 24(1) (1994) 234-244.CrossRefGoogle Scholar

Copyright information

© Kluwer Academic Publishers 1998

Authors and Affiliations

  • Raghupathy Sivakumar
    • 1
  • Bevan Das
    • 1
  • Vaduvur Bharghavan
    • 1
  1. 1.Coordinated Sciences LaboratoryUniversity of Illinois at Urbana–ChampaignUrbanaUSA

Personalised recommendations