Skip to main content
Log in

A Distributed Virtual Backbone Development Scheme for Ad-Hoc Wireless Networks

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

The virtual backbone is an approach for solving routing problems in ad-hoc wireless networks. The virtual backbone approach features low latency, moderate routing overhead and is a hybrid scheme that uses the table-driven and on-demand routing protocols. This work presents a distributed virtual backbone development scheme for ad-hoc wireless networks. Using clustering, distributed labeling and heuristic Steiner tree techniques, our scheme outperforms other schemes in terms of the size and stability of the virtual backbone and the virtual backbone change rate. Experimental results demonstrate that our scheme has lower overhead than traditional table-driven and on-demand routing schemes.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. R. Bagrodia and X. Zeng, “Glomosim, A Library for the Parallel Simulation of Large Wireless Networks”, in Proceedings of the 12th Workshop on Parallel and Distributed Simulation (PADS'98), 1998.

  2. S. Basagni, “Distributed Clustering for Ad-Hoc Networks”, in Proceedings of Parallel Architectures, Algorithms, and Networks (I-SPAN '99), 1999.

  3. C.C. Chiang, “Routing in Clustered Multihop, Mobile Wireless Networks with Fading Channel”, in Proceedings of IEEE SICON '97, 1997.

  4. B. Das and V. Bharghavan, “Routing in Ad-Hoc Networks Using Minimum Connected Dominating Sets”, in Proceedings of ICC '97, 1997.

  5. B. Das, R. Sivakumar and V. Bharghavan, “Routing in Ad-Hoc Networks Using a Spine”, in Proceedings on Sixth International Conference, 1997.

  6. S.R. Das, R. Castañeda and J. Yan, “Simulation-Based Performance Evaluation of Routing Protocols for Mobile Ad-Hoc Networks”, Mobile Networks and Applications 5, pp. 179–189, 2000.

  7. C.R. Dow, J.H. Lin, S.F. Hwang and Y.W. Wang, “An Efficient Distributed Clustering Scheme for Ad-Hoc Wireless Networks”, IEICE Transactions on Communications, Vol. E85-B, No. 8, pp. 1561–1571, 2002.

    Google Scholar 

  8. M. Gerla, G. Pei and S.J. Lee, “Wireless, Mobile Ad-Hoc Network Routing”, in Proceedings of IEEE/ACM FOCUS'99, 1999.

  9. M. Gerla and J.T.C. Tsai, “Multicluster, Mobile, Multimedia Radio Network”, ACM-Baltzer Journal of Wireless Network, Vol. 1, No. 3, pp. 255–265, 1995.

    Article  Google Scholar 

  10. Z.J. Haas and M.R. Pearlman, “The Zone Routing Protocol (ZRP) for Ad-Hoc Networks”, IEEE Network Communication, 1997.

  11. T.C. Hou, T.J. Tsai and T.C. Hsu, “A Limited-Size Clustering Protocol in Ad-Hoc Networks”, in Proceedings of the 14th International Conference on Information Networking, 2000.

  12. A. Iwata, C.C. Chiang, G. Pei, M. Gerla and T.W. Chen, “Scalable Routing Strategies for Ad-Hoc Wireless Networks”, IEEE Journal on Selected Areas in Communications, Vol. 17, No. 8, 1999.

  13. B. Liang and Z.J. Hass, “Virtual Backbone Generation and Maintenance in Ad-Hoc Network Mobility Management”, IEEE INFOCOM 2000, Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies, 2000.

  14. C.R. Lin and M. Gerla, “Adaptive Clustering for Mobile Wireless Networks”, IEEE Journal on Selected Areas in Communications, Vol. 15, No. 7, pp. 1265–1275, 1997.

    Article  Google Scholar 

  15. H.C. Lin and Y.H. Chu, “A Clustering Technique for Large Multihop Mobile Wireless Networks”, in Proceedings of Vehicular Technology Conference, 2000.

  16. K. Mehlhorn, “A Faster Approximation Algorithm for the Steiner Problem in Graphs”, Inf. Process. Lett., Vol. 27, pp. 125–128, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  17. J. Raju and J.J. Garcia-Luna-Aceves, “A Comparison of On-Demand and Table Driven Routing for Ad-Hoc Wireless Networks”, IEEE International Conference on Communications, 2000.

  18. E.M. Royer, “A Review of Current Routing Protocols for Ad-Hoc Mobile Wireless Network”, IEEE Personal Communications, pp. 46–55, 1999.

  19. R. Sivakumar, B. Das and V. Bharghavan, “The Clade Vertebrata: Spines and Routing in Ad-Hoc Networks”, Third IEEE Symposium on Computers and Communications, 1998.

  20. R. Sivakumar, P. Sinha and V. Bharghavan, “CEDAR: A Core-Extraction Distributed Ad-Hoc Routing Algorithm”, IEEE Journal on Selected Areas in Communications, Vol. 17, No. 8, 1999.

  21. N.H. Vaidya, P. Krishna, M. Chatterjee and K.K. Pradhan, “A Cluster-Based Approach for Routing in Dynamic Networks”, ACM Comput. Commun. Rev., Vol. 27, No. 2, 1997.

  22. T.H.P. Vuong and D.T. Huynh, “Adapting D-Hop Dominating Sets to Topology Changes in Ad-Hoc Networks”, in Proceedings of Ninth International Conference on Computer Communications and Networks, 2000.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chyi-Ren Dow.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lin, JH., Dow, CR. & Hwang, SF. A Distributed Virtual Backbone Development Scheme for Ad-Hoc Wireless Networks. Wireless Personal Communications 27, 215–233 (2003). https://doi.org/10.1023/B:WIRE.0000010135.75404.23

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:WIRE.0000010135.75404.23

Navigation