Skip to main content

A Coloring Based Backbone Construction Algorithm in Wireless Ad Hoc Network

  • Conference paper
Advances in Grid and Pervasive Computing (GPC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3947))

Included in the following conference series:

Abstract

A wireless ad hoc network consists of many mobile hosts communicating with each other without any infrastructure. Virtual backbone plays a key role in a wireless ad hoc network for routing optimization, energy conservation and resource allocation. To construct virtual backbones efficiently, a new distributed method based on coloring algorithm is proposed in this paper. Because the proposed algorithm uses only 1-hop neighbors information, it is proven that this coloring based method can cluster into groups with O(Δ) time complexity and O(nΔ2) message complexity, which are better than referenced work in this paper.

Partially supported by National Natural Science Foundation of China (No. 60502047), Natural Science Foundation of Fujian Province of China (No.A0440001).

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit Disk Graphs. Discrete Mathematics 86, 165–177 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  2. Das, B., Bharghavan, V.: Routing in Ad-Hoc Networks Using Minimum Connected Dominating Sets. In: International Conference on Communications, Montreal, Canada (June 1997)

    Google Scholar 

  3. Min, M., Wang, F., Du, D.–Z., Pardalos, P.M.: A Reliable Virtual Backbone Scheme in Mobile Ad-Hoc Networks. In: Proceedings of the 1st IEEE International conference on Mobile Ad Hoc and Sensor Systems, FL, USA (October 2004)

    Google Scholar 

  4. Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica 20(4), 374–387 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  5. Lin, C.R., Gerla, M.: Adaptive Clustering for Mobile Wireless Networks. IEEE Journal on Selected Areas in Communications 15(7), 1265–1275 (1997)

    Article  Google Scholar 

  6. Marathe, M.V., et al.: Simple heuristics for unit disk graphs. Networks 25, 59–68 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  7. Stojmenovic, I., Seddigh, M.: Dominating Sets and Neighbor Elimination Based Broadcasting Algorithms in Wireless Networks. IEEE Transactions on Parallel and Distributed Systems 13(1), 14–25 (2002)

    Article  Google Scholar 

  8. Wan, P.-j., Alzoubi, K.M., Frieder, O.: Distributed Construction of Connected Dominating Sets in Wireless Ad Hoc Networks. IEEE INFOCOM (2002)

    Google Scholar 

  9. Wu, J., Li, H.: On calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks. In: Proc. of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, August 1999, pp. 7–14 (1999)

    Google Scholar 

  10. Wu, J., Li, H.: Domination and its Applications in Ad Hoc Wireless Networks with Unidirectional Links. In: Proc. of International Conference on Parallel Processing, August 2000, pp. 189–200 (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lin, Z., Xu, L., Wang, D., Gao, J. (2006). A Coloring Based Backbone Construction Algorithm in Wireless Ad Hoc Network. In: Chung, YC., Moreira, J.E. (eds) Advances in Grid and Pervasive Computing. GPC 2006. Lecture Notes in Computer Science, vol 3947. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11745693_50

Download citation

  • DOI: https://doi.org/10.1007/11745693_50

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-33809-3

  • Online ISBN: 978-3-540-33810-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics