Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/1089803.1089991acmconferencesArticle/Chapter ViewAbstractPublication PagesmswimConference Proceedingsconference-collections
Article

Virtual backbone based on MCDS for topology control in wireless ad hoc networks

Published: 10 October 2005 Publication History

Abstract

This paper proposes to utilize virtual backbone to handle control messages in ad hoc networks. The virtual backbone is built by using the Minimum Connected Dominating Set (MCDS) on a graph. The first part of this paper presents a new algorithm to construct the MCDS. The construction of the MCDS is formulated using the linear programming approach. We compared the performance of this procedure with those other previous approaches, and we find that our approach is less complex and gives the nearest solution to the optimal one. The second part of this paper presents different techniques of diffusion in ad hoc networks such as flooding, clustering, MP relay, and backbone based on MCDS, etc. The flooding technique is simple and efficient, but it is expensive in term of bandwidth, and causes excessive flows of message etc. Simulation results show that the approach of virtual backbone based MCDS outperforms flooding and MP relay.

References

[1]
NIST, "Mobile Ad Hoc Networks (MANETs)" http://www.antd.nist.gov/wahn_mahn.shtml.
[2]
S. Guha and S. Khuller, "Approximation Algorithms for Connected Dominating Sets," Algorithmica, vol. 20, pp. 374--387, 1998.
[3]
A. Qayyum, L. Viennot, and A. Laouiti, "Multipoint relaying for flooding broadcast messages in mobile wireless networks," in Proc. of the 35th Annual Hawaii International, pp. 3866--3875, 2002.
[4]
J. Wu and H. Li, "On Calculating Connected Dominating Set for Efficient Routing in Ad hoc Wireless Networks," in Proc. of the 3rd Inter. WDAM for MOBILE Comp. and Comm. Seattle, WA, USA, 1999, pp. 7--14.
[5]
K. Mnif, B. Rong and M. Kadoch "A Distributed Approach for Computing the Minimum Connected Dominating Set", CCEC'05, Saskatoon, SK, Canada. pp. 2011--2014. 1-4 May 2005.
[6]
N. Megiddo, "On the complexity of linear programming," in Advances in economic theory: Fifth world congress. T. Bewley. ed. Cambridge University Press, 1987, pp. 225--268.
[7]
R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications. New Jersey: Prentice-Hall, Inc., 1993.
[8]
J. P. Jarvis and D. E. White, "Computational experience with minimum spanning tree algorithms," Operations Research Letters, vol. 2, pp. 36--41, 1983.
[9]
Basagni, S. "Distributed Clustering for Ad Hoc Networks." Proc. of the 1999 Inter. Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '99) pp. 310--315, 1999.
[10]
Vamsi S. Paruchuri, Arjan Durresi, Durga S. Dash, and Raj Jain. Optimal flooding protocol for routing in ad-hoc networks. Technical report, Ohio State University, CS Department, 2002.
[11]
Stojemenovic, I., M. Seddigh and J. Zunic (2001). "Internal nodes based broadcasting algorithms in wireless networks." Proceedings of the 34th Annual Hawaii International conference on system sciences HICSS 2001.

Cited By

View all
  • (2020)Wireless Sensor Networks Fault-Tolerance Based on Graph Domination with Parallel Scatter SearchSensors10.3390/s2012350920:12(3509)Online publication date: 21-Jun-2020
  • (2020)Linear programming approach for various domination parametersDiscrete Mathematics, Algorithms and Applications10.1142/S1793830920500962(2050096)Online publication date: 15-Sep-2020
  • (2019)A blockchain‐based framework to secure vehicular social networksTransactions on Emerging Telecommunications Technologies10.1002/ett.365030:8Online publication date: 14-Aug-2019
  • Show More Cited By

Index Terms

  1. Virtual backbone based on MCDS for topology control in wireless ad hoc networks

      Recommendations

      Comments

      Please enable JavaScript to view thecomments powered by Disqus.

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      PE-WASUN '05: Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
      October 2005
      292 pages
      ISBN:1595931821
      DOI:10.1145/1089803
      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Sponsors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 10 October 2005

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. integer programming
      2. minimum connected dominating set
      3. virtual backbone

      Qualifiers

      • Article

      Conference

      MSWiM05
      Sponsor:

      Acceptance Rates

      Overall Acceptance Rate 70 of 240 submissions, 29%

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)0
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 21 Nov 2024

      Other Metrics

      Citations

      Cited By

      View all
      • (2020)Wireless Sensor Networks Fault-Tolerance Based on Graph Domination with Parallel Scatter SearchSensors10.3390/s2012350920:12(3509)Online publication date: 21-Jun-2020
      • (2020)Linear programming approach for various domination parametersDiscrete Mathematics, Algorithms and Applications10.1142/S1793830920500962(2050096)Online publication date: 15-Sep-2020
      • (2019)A blockchain‐based framework to secure vehicular social networksTransactions on Emerging Telecommunications Technologies10.1002/ett.365030:8Online publication date: 14-Aug-2019
      • (2018)Parallel genetic algorithm with elite and diverse cores for solving the minimum connected dominating set problem in wireless networks topology controlProceedings of the 2nd International Conference on Future Networks and Distributed Systems10.1145/3231053.3231080(1-9)Online publication date: 26-Jun-2018
      • (2018)Towards a Blockchain and Software-Defined Vehicular Networks Approaches to Secure Vehicular Social Network2018 IEEE Conference on Standards for Communications and Networking (CSCN)10.1109/CSCN.2018.8581756(1-7)Online publication date: Oct-2018
      • (2015)A layer-based algorithm for the construction of connected dominating set in WSNsInternational Journal of Autonomous and Adaptive Communications Systems10.1504/IJAACS.2015.0695688:2/3(320-331)Online publication date: 1-May-2015
      • (2012)Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer ProgrammingCombinatorial Optimization and Applications10.1007/978-3-642-31770-5_33(371-383)Online publication date: 2012
      • (2011)An efficient algorithm for constructing a connected dominating set in mobile ad hoc networksJournal of Parallel and Distributed Computing10.1016/j.jpdc.2010.05.00871:1(27-39)Online publication date: 1-Jan-2011
      • (2010)An optimal solution to the MCDS problem for topology construction in wireless sensor networks2010 IEEE Latin-American Conference on Communications10.1109/LATINCOM.2010.5641018(1-6)Online publication date: Sep-2010
      • (2008)Theoretical Bound and Practical Analysis of Connected Dominating Set in Ad Hoc and Sensor NetworksDistributed Computing10.1007/978-3-540-87779-0_33(481-495)Online publication date: 2008
      • Show More Cited By

      View Options

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media