Recyclable Connected Dominating Set for Large Scale Dynamic Wireless Networks

  • Donghyun Kim
  • Xianyue Li
  • Feng Zou
  • Zhao Zhang
  • Weili Wu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5258)

Abstract

Many people studied the Minimum Connected Dominating Set (MCDS) problem to introduce Virtual Backbone (VB) to wireless networks. However, many existing algorithms assume a static wireless network, and when its topology is changed, compute a new CDS all over again. Since wireless networks are highly dynamic due to many reasons, their approaches can be inefficient in practice. Motivated by this observation, we propose Recyclable CDS Algorithm (RCDSA), an efficient VB maintenance algorithm which can handle the activeness of wireless networks. The RCDSA is built on an approximation algorithm CDS-BD-C1 by Kim et. al. [1]. When a node is added to or deleted from current graph, RCDSA recycles current CDS to get a new one. We prove RCDSA’s performance ratio is equal to CDS-BD-C1’s. In simulation, we compare RCDSA with CDS-BD-C1. Our results show that the average size of CDS by RCDSA is similar with that by CDS-BD-C1 but RCDSA is at least three times faster than CDS-BD-C1 due to its simplicity. Furthermore, at any case, a new CDS by RCDSA highly resembles to its old version than the one by CDS-BD-C1, which means that using RCDSA, a wireless network labors less to maintain its VB when its topology is dynamically changing.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Kim, D., Wu, Y., Li, Y., Zou, F., Du, D.-Z.: Constructing minimum connected dominating sets with bounded diameters in wireless networks. IEEE Transactions on Parallel and Distributed Systems (2008)Google Scholar
  2. 2.
    Ephremides, A., Wieselthier, J., Baker, D.: A design concept for reliable mobile radio networks with frequency hopping signaling. Proceeding of IEEE 75(1), 56–73 (1987)CrossRefGoogle Scholar
  3. 3.
    Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica 20, 374–387 (1998)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Cardei, M., Cheng, X., Cheng, X., Du, D.-Z.: Connected domination in multihop ad hoc wireless networks. In: Proc. of International Conference on Computer Science and Informatics (March 2002)Google Scholar
  5. 5.
    Ruan, L., Du, H., Jia, X., Wu, W., Li, Y., Ko, K.-I.: A greedy approximation for minimum connected dominating sets. Journal of Theoretical Computer Science 329, 325–330 (2004)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Wu, W., Du, H., Jia, X., Li, Y., Huang, S.C.-H.: Minimum connected dominating sets and maximal independent sets in unit disk graphs. Theoretical Computer Science 352 (2006)Google Scholar
  7. 7.
    Funke, S., Kesselman, A., Meyer, U., Segal, M.: A simple improved distributed algorithm for minimum CDS in unit disk graphs. ACM Transactions on Sensor Network 2(3), 444–453 (2006)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Donghyun Kim
    • 1
  • Xianyue Li
    • 2
  • Feng Zou
    • 1
  • Zhao Zhang
    • 3
  • Weili Wu
    • 1
  1. 1.Department of Computer ScienceUniversity of Texas at DallasRichardson
  2. 2.School of Mathematics and StatisticsLanzhou UniversityLanzhouP.R. China
  3. 3.College of Mathematics and System SciencesXinjiang University, UrumqiXinjiangP.R. of China

Personalised recommendations