Skip to main content
SpringerLink
Log in
Book cover

International Conference on Contemporary Computing

IC3 2010: Contemporary Computing pp 206–217Cite as

An Algorithm to Determine Minimum Velocity-Based Stable Connected Dominating Sets for Ad Hoc Networks

  • Conference paper

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 94))

Abstract

The high-level contribution of this paper is an algorithm to determine a stable connected dominating set (CDS), based on node velocities, for mobile ad hoc networks (MANETs). The algorithm, referred as MinV-CDS, includes in the CDS, nodes that are slow-moving with lower velocity, rather than the usual approach of preferring nodes with a larger density, i.e., a larger number of uncovered neighbors, referred as MaxD-CDS. If a node has lower velocity and is the next candidate node to be considered for inclusion in the CDS, it is added to the CDS if it has at least one neighbor that is yet to be covered. Simulation results illustrate that MinV-CDS has a significantly longer lifetime than MaxD-CDS; MinV-CDS also has a larger number of nodes and edges compared to MaxD-CDS and this helps to reduce the hop count as well as the end-to-end delay and improves the fairness of node usage.

This is a preview of subscription content, 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   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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Sinha, P., Sivakumar, R., Bhargavan, V.: Enhancing Ad hoc Routing with Dynamic Virtual Infrastructures. In: 20th Annual Joint International Conference of the Computer and Communications Societies, pp. 1763–1772. IEEE, Anchorage (2001)

    Google Scholar 

  2. Wang, F., Min, M., Li, Y., Du, D.: On the Construction of Stable Virtual Backbones in Mobile Ad hoc Networks. In: 24th International Performance Computing and Communications Conference, Enhancing Ad hoc Routing with Dynamic Virtual Infrastructures, pp. 355–362. IEEE, Phoenix (2005)

    Google Scholar 

  3. Sakai, K., Sun, M.-T., Ku, W.-S.: Maintaining CDS in Mobile Ad hoc Networks. In: Li, Y., Huynh, D.T., Das, S.K., Du, D.-Z. (eds.) WASA 2008. LNCS, vol. 5258, pp. 141–153. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  4. Sheu, P.-R., Tsai, H.-Y., Lee, Y.-P., Cheng, J.Y.: On Calculating Stable Connected Dominating Sets Based on Link Stability for Mobile Ad hoc Networks. Tamkang Journal of Science and Engineering 12(4), 417–428 (2009)

    Google Scholar 

  5. Bao, L., Garcia-Luna-Aceves, J.J.: Stable Energy-aware Topology Management in Ad hoc Networks. Ad hoc Networks 8(3), 313–327 (2010)

    Article  Google Scholar 

  6. Kuhn, F., Moscibroda, T., Wattenhofer, R.: Unit Disk Graph Approximation. In: Joint Workshop on the Foundations of Mobile Computing, pp. 17–23. ACM, Philadelphia (2004)

    Google Scholar 

  7. Alzoubi, K.M., Wan, P.-J., Frieder, O.: Distributed Heuristics for Connected Dominating Set in Wireless Ad hoc Networks. IEEE/KICS Journal on Communication Networks 4(1), 22–29 (2002)

    Google Scholar 

  8. Butenko, S., Cheng, X., Du, D.-Z., Paradlos, P.M.: On the Construction of Virtual Backbone for Ad hoc Wireless Networks. In: Cooperative Control: Models, Applications and Algorithms, pp. 43–54 (2002)

    Google Scholar 

  9. Butenko, S., Cheng, X., Oliviera, C., Paradlos, P.M.: A New Heuristic for the Minimum Connected Dominating Set Problem on Ad hoc Wireless Networks. In: Recent Developments in Co-operative Control and Optimization, pp. 61–73 (2004)

    Google Scholar 

  10. Meghanathan, N.: An Algorithm to Determine the Sequence of Stable Connected Dominating Sets in Mobile Ad hoc Networks. In: 2nd Advanced International Conference on Telecommunications, Guadeloupe, French Caribbean (2006)

    Google Scholar 

  11. Meghanathan, N., Farago, A.: On the Stability of Paths, Steiner Trees and Connected Dominating Sets in Mobile Ad hoc Networks. Ad hoc Networks 6(5), 744–769 (2008)

    Article  Google Scholar 

  12. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press/ McGraw Hill, New York (2001)

    MATH  Google Scholar 

  13. Meghanathan, N., Sugumar, M.: A Beaconless Minimum Interference Based Routing Protocol to Minimize End-to-End Delay per Packet for Mobile Ad hoc Networks. International Journal of Interdisciplinary Telecommunications and Networking 2(1), 12–26 (2010)

    Google Scholar 

  14. Meghanathan, N., Odunsi, A.: Investigating the Scalability of the Fish-eye State Routing Protocol for Ad hoc Networks. Journal of Theoretical and Applied Information Technology 12(1), 60–70 (2010)

    Google Scholar 

  15. Meghanathan, N.: Multicast Extensions to the Location-Prediction Based Routing Protocol for Mobile Ad hoc Networks. In: Liu, B., Bestavros, A., Du, D.-Z., Wang, J. (eds.) Wireless Algorithms, Systems, and Applications. LNCS, vol. 5682, pp. 190–199. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  16. Bettstetter, C., Hartenstein, H., Perez-Costa, X.: Stochastic Properties of the Random-Way Point Mobility Model. Wireless Networks 10(5), 555–567 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Jackson State University, Jackson, MS 39217, USA

    Natarajan Meghanathan

Authors
  1. Natarajan Meghanathan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computer Sciences, University of Florida, 32611, Gainesville, FL, USA

    Sanjay Ranka

  2. University of Florida, Gainesville, Fl, USA

    Arunava Banerjee

  3. Department of Computer Science and Engineering, Indian Institute of Technology, 110016, New Delhi, INDIA

    Kanad Kishore Biswas

  4. Computer Science, College of Engineering and Science, Louisiana Tech University, LA 71272, Ruston, USA

    Sumeet Dua

  5. University of Florida, Gainesville, FL, USA

    Prabhat Mishra

  6. Department of Computer Science & Engineering, Indian Institute of Technology, 208016, Kanpur, India

    Rajat Moona

  7. National Tsing Hua University, Hsin-Chu, Taiwan, R.O.C.

    Sheung-Hung Poon

  8. Department of Computer Science, The University of Hong Kong, Pokfulam Road, Hong Kong

    Cho-Li Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meghanathan, N. (2010). An Algorithm to Determine Minimum Velocity-Based Stable Connected Dominating Sets for Ad Hoc Networks. In: Ranka, S., et al. Contemporary Computing. IC3 2010. Communications in Computer and Information Science, vol 94. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14834-7_20

Download citation

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

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14833-0

  • Online ISBN: 978-3-642-14834-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation