Spine routing in ad hoc networks

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.

[1]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[2]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.

[3]  Michael C. Loui,et al.  Algorithms for All Single Deletions in a Minimum Spanning Tree, Simultaneously , 1995 .

[4]  Vaduvur Bharghavan,et al.  Routing in ad-hoc networks using minimum connected dominating sets , 1997, Proceedings of ICC'97 - International Conference on Communications.

[5]  M. S. Corson,et al.  Architectural considerations for mobile mesh networking , 1996, Proceedings of MILCOM '96 IEEE Military Communications Conference.

[6]  Samir Khuller,et al.  Approximation Algorithms for Connected Dominating Sets , 1996, ESA.

[7]  Michalis Faloutsos,et al.  Optimal distributed algorithm for minimum spanning trees revisited , 1995, PODC '95.

[8]  Mario Gerla,et al.  Multicluster, mobile, multimedia radio network , 1995, Wirel. Networks.

[9]  Shay Kutten,et al.  A sub-linear time distributed algorithm for minimum-weight spanning trees , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[10]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1993, STOC.

[11]  D. A. Hall.  Tactical Internet system architecture for Task Force XXI , 1996, Proceedings of the 1996 Tactical Communications Conference. Ensuring Joint Force Superiority in the Information Age.

[12]  Shay Kutten,et al.  Fast distributed construction of k-dominating sets and applications , 1995, PODC '95.

[13]  Baruch Awerbuch,et al.  Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems , 1987, STOC.

[14]  J. Jubin,et al.  The DARPA packet radio network protocols , 1987, Proceedings of the IEEE.

[15]  Samir Khuller,et al.  Approximation Algorithms for Connected Dominating Sets , 1996, Algorithmica.

[16]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[17]  J. Broch,et al.  Dynamic source routing in ad hoc wireless networks , 1998 .

[18]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[19]  Vaduvur Bharghavan,et al.  Routing in ad hoc networks using a spine , 1997, Proceedings of Sixth International Conference on Computer Communications and Networks.

[20]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.