Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

A Convex-Hull Based Algorithm to Connect the Maximal Independent Set in Unit-Disk Graphs

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

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 4138))

Abstract

In this paper we propose and analyze a localized convex-hull based algorithm to connect a maximal independent set. The cardinality of the resultant connected dominating set is at most 76 opt +19, where opt is the size of a minimum connected dominating set. To our knowledge, this is a dramatic improvement compared to the best published results in the same context [1,6] . Our algorithm plays 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

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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.

Similar content being viewed by others

References

  1. Alzoubi, K.M., Wan, P.-J., Frieder, O.: Message-Optimal Connected Dominating Sets in Mobile Ad Hoc Networks. In: MOBIHOC, EPFL Lausanne, Switzerland (2002)

    Google Scholar 

  2. Alzoubi, K.M., Wan, P.-J., Frieder, O.: New Distributed Algorithm for Connected Dominating Set in Wireleess Ad Hoc Networks. In: Proceedings of the 35th Hawaii International Conference on System Sciences, Big Island, Hawaii (2002)

    Google Scholar 

  3. Alzoubi, K.M., Wan, P.-J., Frieder, O.: Distributed Heuristics for Connected Dominating Sets in Wireless Ad Hoc Networks. Journal of Communications and Networks 4(1) (March 2002)

    Google Scholar 

  4. 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 

  5. Cheng, X., Huang, X., Li, D., Wu, W., Du, D.-Z.: Polynomial-Time Approximation Scheme for Minimum Connected Dominating Set in Ad Hoc Wireless Networks. Networks 42(4), 202–208 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  6. Cheng, X., Ding, M., Du, D.H., Jia, X.: On The Construction of Connected Dominating Set in Ad Hoc Wireless Networks. Wireless Communications and Mobile Computing 6, 183–190 (2006)

    Article  Google Scholar 

  7. Cheng, X.: Routing Issues in Ad Hoc Wireless Networks, PhD Thesis, Department of Computer Science, University of Minnesota (2002)

    Google Scholar 

  8. Cidon, I., Mokryn, O.: Propagation and Leader Election in Multihop Broadcast Environment. In: Proc. 12th Int. Symp. Distr. Computing, Greece, pp. 104–119 (1998)

    Google Scholar 

  9. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. Mc Graw Hill, New York (2001)

    MATH  Google Scholar 

  10. Garey, M.R., Johnson, D.S.: Computers and Intractability: A guide to the theory of NP-completeness. Freeman, San Francisco (1978)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  12. 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. Journal of Global Optimization 35(1), 111–119 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  13. 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 

  14. Wan, P.-J., Alzoubi, K.M., Frieder, O.: Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks. In: IEEE INFOCOM, pp. 1597–1604 (2002)

    Google Scholar 

  15. Wu, J., Dai, F., Gao, M., Stojmenovic, I.: On Calculating Power- Aware Connected Dominating Set for Ecient Routing in Ad Hoc Wireless Networks. Journal of Communications and Networks 5(2), 169–178 (2002)

    Google Scholar 

  16. Xu, Y., Heidemann, J., Estrin, D.: Geography-informed energy conservation for Ad Hoc routing. In: MobiCom 2001, pp. 70–84 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Uniformed Services University of the Health Sciences, 4301 Jones Bridge Road, Bethesda, MD, 20814, USA

    Dechang Chen

  2. School of Computer, National University of Defense Technology, Changsha, Hunan, 410073, P.R. China

    Xilong Mao

  3. Rizhao Geotechical Investigation and Surveying, Institute of Urban and Rural Construction, No.269, Jinan Road, Rizhao, Shandong, 276826, P.R. China

    Xia Fei

  4. Department of Computer Science, The George Washington University, 801 22nd St. NW, Washington, DC, 20052, USA

    Kai Xing & Fang Liu

  5. Department of Electrical and Computer Engineering, Old Dominion University, 231 Kaufman Hall, Norfolk, VA, 23529, USA

    Min Song

Authors
  1. Dechang Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xilong Mao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xia Fei
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Kai Xing
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Fang Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Min Song
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, The George Washington University, 801 22nd Street NW, Suite 704., 20052, Washington DC, USA

    Xiuzhen Cheng

  2. School of Information Science and Technology, Sun Yat-sen University, 510275, Guangzhou, China

    Wei Li

  3. Computer Science Department, University of Pittsburgh, PA 15260, Pittsburgh, USA

    Taieb Znati

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, D., Mao, X., Fei, X., Xing, K., Liu, F., Song, M. (2006). A Convex-Hull Based Algorithm to Connect the Maximal Independent Set in Unit-Disk Graphs. In: Cheng, X., Li, W., Znati, T. (eds) Wireless Algorithms, Systems, and Applications. WASA 2006. Lecture Notes in Computer Science, vol 4138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11814856_35

Download citation

  • DOI: https://doi.org/10.1007/11814856_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-37189-2

  • Online ISBN: 978-3-540-37190-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation