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.
KeywordsSpan Tree Mobile Host Route Discovery Link Failure Message Complexity
Unable to display preview. Download preview PDF.
- 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
- S. Corson, J. Macker and S. Batsell, Architectural considerations for mobile mesh networking, at Internet DRAFT RFC Version 2, May 1996, http://tonnant.itd.nrl.navy.mil/mmnet/mmnetRFC.txt.Google Scholar
- 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
- 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
- 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
- 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
- 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
- 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
- D.A. Hall, Tactical Internet system architecture for task force XXI, in: Proceedings of the Tactical Communications Conference, Ft. Wayne (May 1996).Google Scholar
- 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
- 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