Virtual dynamic backbone for mobile ad hoc networks

In this paper, we propose the virtual dynamic backbone protocol (VDBP) for ad hoc networks. VDBP constructs a backbone from a subset of the nodes in the network satisfying these two properties: (i) Any node in the network is either a backbone node or is a neighbor of a backbone node (dominating set property), (ii) any pair of backbone nodes is connected via other backbone nodes (connectivity property). VDBP provides explicit mechanisms to handle the mobility of the nodes and depends on local computations to a large extent. Thus it is highly self-organizing even under highly dynamic topologies. Such a backbone can be potentially used by a routing protocol to disseminate broadcast or multicast messages as well as to handle QoS traffic in mobile ad hoc networks. We present the performance of VDBP in terms of backbone size and connectivity using simulations.

[1]  J. Broach,et al.  The dynamic source routing protocol for mobile ad-hoc networks , 1998 .

[2]  Joseph P. Macker,et al.  Mobile Ad hoc Networking (MANET): Routing Protocol Performance Issues and Evaluation Considerations , 1999, RFC.

[3]  Zygmunt J. Haas,et al.  The zone routing protocol (zrp) for ad hoc networks" intemet draft , 2002 .

[4]  Leandros Tassiulas,et al.  Energy conserving routing in wireless ad-hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[5]  Vaduvur Bharghavan,et al.  CEDAR: a core-extraction distributed ad hoc routing algorithm , 1999, IEEE J. Sel. Areas Commun..

[6]  Wendi Heinzelman,et al.  Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[7]  Charles E. Perkins,et al.  Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers , 1994, SIGCOMM.

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

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

[10]  Vincent Park,et al.  Temporally-Ordered Routing Algorithm (TORA) Version 1 Functional Specification , 2001 .