Skip to main content
SpringerLink
Log in

A Maximal Independent Set Based Giant Component Formation in Random Unit-Disk Graphs

  • Conference paper
Wireless Algorithms, Systems, and Applications (WASA 2011)

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

Abstract

In this paper we propose a maximal independent set (MIS) based giant component formation strategy in random unit-disk graph. This research is motivated by the problem of virtual backbone construction in wireless ad hoc and sensor networks, where the coverage area of nodes are disks with identical radii. The evaluation results show that the MIS-based giant component has the ability to connect most nodes in the MIS and serve as a backbone in the network. Besides, our algorithm is localized and may play an important rule in efficiently constructing a virtual backbone for ad hoc and sensor networks.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Wu, J., Li, H.: On calculating connected dominating set for efficient routing in ad hoc wireless networks. In: DIALM 1999: Proceedings of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 7–14 (1999)

    Google Scholar 

  2. Wu, J., Dai, F., Gao, M., Stojmenovic, I.: On calculating power-aware connected dominating set for efficient routing in ad hoc wire- less networks. Journal of Communications and Networks 5(2), 169–178 (2002)

    Google Scholar 

  3. Xu, Y., Heidemann, J., Estrin, D.: Geography-informed energy conservation for ad hoc routing. In: MobiCom 2001: Proceedings of the 7th Annual International Conference on Mobile Computing and Networking, pp. 70–84. ACM, New York (2001)

    Google Scholar 

  4. Sivakumar, R., Sinha, P., Bharghavan, V.: Cedar: a core-extraction distributed ad hoc routing algorithm. IEEE Journal on Selected Areas in Communications 17(8), 1454–1465 (1999)

    Article  Google Scholar 

  5. Carle, J., Simplot-Ryl, D.: Energy-efficient area monitoring for sensor networks. Computer 37(2), 40–46 (2004)

    Article  Google Scholar 

  6. Chen, B., Jamieson, K., Balakrishnan, H., Morris, R.: Span: an energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks. Wirel. Netw. 8(5), 481–494 (2002)

    Article  MATH  Google Scholar 

  7. Blum, M.D.J., Cheng, X.: Applications of Connected Dominating Sets in Wireless Networks. In: Handbook of Combinatorial Optimization, pp. 329–369. Kluwer Academic Publisher, Boston (2004)

    Google Scholar 

  8. Cheng, X., Ding, M., Du, D.H., Jia, X.: Virtual backbone construction in multihop ad hoc wireless networks. Wireless Communications and Mobile Computing 6, 183–190 (2006)

    Article  Google Scholar 

  9. Balister, P., Bollobas, B., Sarkar, A.: Percolation, connectivity, coverage and colouring of random geometric graphs. Tech. Report (2009)

    Google Scholar 

  10. Huang, S.C.-H., Sun, M.-T., Liang, Q., Wan, P.-J., Jia, a.X.: Interference-aware, fully-distributed virtual backbone construction and its applications in multi-hop wireless networks. To Appear in IEEE Transactions on Communications

    Google Scholar 

  11. Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Mathematics 86, 165–177 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  12. Alzoubi, K.M., Wan, P.-J., Frieder, O.: Message-optimal connected dominating sets in mobile ad hoc networks. In: MobiHoc 2002: Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc Networking & Computing, pp. 157–164. ACM, New York (2002)

    Google Scholar 

  13. Li, Y., Zhu, S., Thai, M.T., Du, D.-Z.: Localized construction of connected dominating set in wireless networks. In: NSF International Workshop on Theoretical Aspects of Wireless Ad Hoc, Sensor and Peer-to-Peer Networks, TAWN 2004 (2004)

    Google Scholar 

  14. Cheng, X., Ding, M., Du, D.H., Jia, X.: On the construction of connected dominating set in ad hoc wireless networks. In: Wireless Communications and Mobile Computing, vol. 6, pp. 183–190 (2006)

    Google Scholar 

  15. Blum, J., Ding, M., Thaeler, A., Cheng, X.: Connected dominating sets in sensor networks and manets. In: Du, D.-Z., Pardalos, P. (eds.) Handbook of Combinatorial Optimization, pp. 329–369 (2004)

    Google Scholar 

  16. Alzoubi, K., Wan, P.-J., Frieder, O.: New distributed algorithm for connected dominating set in wireless ad hoc networks. In: HICSS 2002: Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS 2002), vol. 9, p. 297. IEEE Computer Society, Washington, DC (2002)

    Google Scholar 

  17. Alzoubi, K., Wan, P., Frieder, O.: Distributed heuristics for connected dominating set in wireless ad hoc networks. Journal of Communications and Networks 4(1) (2002)

    Google Scholar 

  18. Wan, P.-J., Alzoubi, K.M., Frieder, O.: Distributed construction of connected dominating set in wireless ad hoc networks. In: Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2002), pp. 1597–1604 (2002)

    Google Scholar 

  19. Cheng, X.: Routing issues in ad hoc wireless networks. PhD Thesis, Department of Computer Science, University of Minnesota (2002)

    Google Scholar 

  20. Cidon, I., Mokryn, O.: Propagation and leader election in a multihop broadcast environment. In: Kutten, S. (ed.) DISC 1998. LNCS, vol. 1499, pp. 104–118. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  22. Min, M., Du, H., Jia, X., Huang, C.X., Huang, S.C.-H., Wu, W.: Improving construction for connected dominating set with steiner tree in wireless sensor networks. J. of Global Optimization 35(1), 111–119 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  23. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)

    MATH  Google Scholar 

  24. Cheng, X., Huang, X., Li, D., Wu, W., Du, D.-Z.: A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks. Networks 42(4), 202–208 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  25. Ding, L., Guan, Z.: Modeling wireless sensor networks using random graph theory. Physica A (12), 3008–3016 (2008)

    Google Scholar 

  26. Dowell, L.J., Bruno, M.L.: Connectivity of random graphs and mobile networks: validation of monte carlo simulation results. In: Proceedings of the 2001 ACM Symposium on Applied Computing, ser. SAC 2001, pp. 77–81 (2001)

    Google Scholar 

  27. Venkatesh, S.S.: Connectivity of metric random graphs. Tech. Report (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Technology, Univ. of Sci. and Tech. of China, P.O. Box 4, Hefei, Anhui, 230027, China

    Pengfei Hu, Kai Xing, Liusheng Huang & Yang Wang

  2. Suzhou Institute for Advanced Study, Univ. of Sci. and Tech. of China, 166 RenAi Road, Suzhou, Jiangsu, 215123, China

    Pengfei Hu, Kai Xing, Liusheng Huang & Yang Wang

  3. Alcatel-Lucent Shanghai Bell, No.388, Ningqiao Road, Shanghai, 201206, China

    Dapeng Wang

  4. College of Information Systems and Management, National Univ. of Defense Tech., Changsha, Hunan, 410073, China

    Pei Li

Authors
  1. Pengfei Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kai Xing
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Liusheng Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yang Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Dapeng Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Pei Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical and Computer Engineering, Illinois Institute of Technology, 3301 South Dearborn Street, Siegel Hall 320, 60616-3793, Chicago, IL, USA

    Yu Cheng

  2. Department of Electrical and Computer Engineering, EBII3054, North Carolina State University, Box 7911, 27695-7911, Raleigh, NC, USA

    Do Young Eun

  3. Department of Computer Science and Technology, University of Electronic Science and Technology, 2006 Xi Yuan Road, West Hi-Tech District, 611731, Chengdu, Sichuan, China

    Zhiguang Qin

  4. National Science Foundation, Department of Electrical and Computer Engineering, Old Dominion University, 231 Kaufmann Hall, 23529, Norfolk, VA, USA

    Min Song

  5. School of Computer Science and Technology, University of Science and Technology, USTC West Campus, P.O. Box 4, 230027, Hefei, Anhui, China

    Kai Xing

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hu, P., Xing, K., Huang, L., Wang, Y., Wang, D., Li, P. (2011). A Maximal Independent Set Based Giant Component Formation in Random Unit-Disk Graphs. In: Cheng, Y., Eun, D.Y., Qin, Z., Song, M., Xing, K. (eds) Wireless Algorithms, Systems, and Applications. WASA 2011. Lecture Notes in Computer Science, vol 6843. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23490-3_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23490-3_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23489-7

  • Online ISBN: 978-3-642-23490-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation