Skip to main content
SpringerLink
Log in

The first constant factor approximation for minimum partial connected dominating set problem in growth-bounded graphs

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

The idea of virtual backbone has emerged to improve the efficiency of flooding based routing algorithms for wireless networks. The effectiveness of virtual backbone can be improved as its size decreases. The minimum connected dominating set (CDS) problem was used to compute minimum size virtual backbone. However, as this formulation requires the virtual backbone nodes to connect all other nodes, even the size of minimum virtual backbone can be large. This observation leads to consider the minimum partial CDS problem, whose goal is to compute a CDS serving only more than a certain portion of the nodes in a given network. So far, the performance ratio of the best approximation algorithm for the problem is \(O(\ln \varDelta ),\) where \(\varDelta\) is the maximum degree of the input general graph. In this paper, we first assume the input graph is a growth-bounded graph and introduce the first constant factor approximation for the problem. Later, we show that our algorithm is an approximation for the problem in unit disk graph with a much smaller performance ratio, which is of practical interest since unit disk graph is popular to abstract homogeneous wireless networks. Finally, we conduct simulations to evaluate the average performance of our algorithm.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  1. Akyildiz, I. F., Su, W., Sankarasubramaniam, Y., & Cayirci, E. (2002). A survey on sensor networks. IEEE Communications Magazine, 40, 102–114.

    Article  Google Scholar 

  2. Dow, C. R., Lin, P. J., Chen, S. C., Lin, J. H., & Hwang, S. F. (2005). A study of recent research trends and experimental guidelines in mobile ad hoc networks. In The 19th international conference on advanced information networking and applications (AINA’05), Taiwan (pp. 72–77).

  3. Ni, S., Tseng, Y., Chen, Y., & Sheu, J. (1999). The broadcast storm problem in a mobile ad hoc network. In The 5th annual ACM/IEEE international conference on mobile computing and networking (MOBICOM’99), Washington, USA (pp. 152–162).

  4. Ephremides, A., Wieselthier, J., & Baker, D. (1987). A design concept for reliable mobile radio networks with frequency hopping signaling. Proceedings of the IEEE, 75(1), 56–73.

    Article  Google Scholar 

  5. Sinha, P., Sivakumar, R., & Bharghavan, V. (2001). Enhancing ad hoc routing with dynamic virtual infrastructures. In The 20th annual joint conference of the IEEE computer and communications societies (vol. 3, pp. 1763–1772).

  6. Guha, S., & Khuller, S. (1998). Approximation algorithms for connected dominating sets. Algorithmica, 20, 374–387.

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  8. Guha, S., & Khuller, S. (1999). Improved methods for approximating node weighted Steiner trees and connected dominating sets. Information and Computation, 150(1), 57–74.

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  10. Wan, P.-J., Alzoubi, K. M., & Frieder, O. (2002). Distributed construction of connected dominating set in wireless ad hoc networks. In The 21st annual joint conference of the IEEE computer and communications societies (INFOCOM’02), New York, USA.

  11. Ruan, L., Du, H., Jia, X., Wu, W., Li, Y., & Ko, K.-I. (2004). A greedy approximation for minimum connected dominating sets. Theoretical Computer Science, 329(1–3), 325–330.

    Article  MathSciNet  MATH  Google Scholar 

  12. Wan, P.-J., Alzoubi, K. M., & Frieder, O. (2004). Distributed construction of connected dominating set in wireless ad hoc networks. ACM Journal on Mobile Networks and Applications (MONET), 9(2), 141–149.

    Article  Google Scholar 

  13. Wu, W., Du, H., Jia, X., Li, Y., & Huang, S. C.-H. (2006). Minimum connected dominating sets and maximal independent sets in unit disk graphs. Theoretical Computer Science, 352, 1–7.

    Article  MathSciNet  MATH  Google Scholar 

  14. Funke, S., Kesselman, A., Meyer, U., & Segal, M. (2006). A simple improved distributed algorithm for minimum CDS in unit disk graphs. ACM Transactions on Sensor Networks (TOSN), 2(3), 444–453.

    Article  Google Scholar 

  15. Wan, P.-J., Wang, L., & Yao, F. (2008). Two-phased approximation algorithms for minimum CDS in wireless ad hoc networks. In Proceedings of the 2008 the 28th international conference on distributed computing systems (ICDCS) (pp. 337–344).

  16. Li, M., Wan, P.-J., & Yao, F. (2009). Tighter approximation bounds for minimum CDS in wireless ad hoc networks. In The 20th international symposium on algorithms and computation (ISAAC 2009), Hawaii, USA, December, 16–18.

  17. Liu, Y., & Liang, W. (2005). Approximate coverage in wireless sensor networks. In Proceedings of 30th IEEE conference on local computer networks (LCN).

  18. Khuller, S., Purohit, M., & Sarpatwar, K. K. (2014). Analyzing the optimal neighborhood: Algorithms for budgeted and partial connected dominating set problems. In Proceedings of 2014 ACM-SIAM symposium on discrete algorithms (SODA14), Portland, OR, USA, January, 5–7.

  19. Li, Y., Zhu, S., Thai, M. T., & Du, D.-Z. (2004). 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 (TAWN04), Chicago.

  20. Li, D., Du, H., Wan, P.-J., Gao, X., Zhang, Z., & Wu, W. (2008). Minimum power strongly connected dominating sets in wireless networks. In Proceedings of the 2009 international conference on wireless networks (ICWN’09) (pp. 447–451).

  21. Thai, M. T., Wangm, F., Liu, D., Zhu, S., & Du, D.-Z. (2007). Connected dominating sets in wireless networks with different transmission ranges. IEEE Transactions on Mobile Computing, 6(7), 721–730.

    Article  Google Scholar 

  22. Thai, M. T., Tiwari, R., & Du, D.-Z. (2008). On construction of virtual backbone in wireless ad hoc networks with unidirectional links. IEEE Transactions on Mobile Computing (TMC), 7(9), 1098–1109.

    Article  Google Scholar 

  23. Kim, D., Li, X., Zou, F., Zhang, Z., & Wu, W. (2008). Recyclable connected dominating set for large scale dynamic wireless networks. In Proceedings of the 3rd international conference on wireless algorithms, systems and applications (WASA 2008), Dallas, TX, USA, October, 26–28.

  24. Kim, D., Wu, Y., Li, Y., Zou, F., & Du, D.-Z. (2009). Constructing minimum connected dominating sets with bounded diameters in wireless networks. IEEE Transactions on Parallel and Distributed Systems (TPDS), 20(2), 147–157.

    Article  Google Scholar 

  25. Kim, D., Zhang, Z., Li, X., Wang, W., Wu, W., & Du, D.-Z. A better approximation algorithm for computing connected dominating sets in unit ball graphs. In IEEE Transactions on Mobile Computing (TMC), 2010, vol. 9, (pp. 1108–1118).

  26. Ding, L., Gao, X., Wu, W., Lee, W., Zhu, X., & Du, D.-Z. (2010). Distributed construction of connected dominating sets with minimum routing cost in wireless networks. In 2010 IEEE 30th international conference on distributed computing systems (ICDCS) (pp. 448–457).

  27. Ding, L., Wu, W., Willson, J., Du, H., Lee, W., & Du, D.-Z. (2011). Efficient algorithms for topology control problem with routing cost constraints in wireless networks. IEEE Transactions on Parallel and Distributed Systems (TPDS), 22(10), 1601–1609.

    Article  Google Scholar 

  28. Du, H., Wu, W., Ye, Q., Li, D., Lee, W., & Xu, X. (2013). CDS-based virtual backbone construction with guaranteed routing cost in wireless sensor networks. IEEE Transactions on Parallel and Distributed Systems (TPDS), 24(4), 652–661.

    Article  Google Scholar 

  29. Du, H., Wu, W., Shan, S., Kim, D., & Lee, W. (2012). Constructing weakly connected dominating set for secure clustering in distrubuted sensor network. Journal of Combinatorial Optimization (JOCO), 23, 301–307.

    Article  MathSciNet  MATH  Google Scholar 

  30. Wang, W., Kim, D., An, M. K., Gao, W., Li, X., Zhang, Z., et al. (2013). On construction of quality fault-tolerant virtual backbone in wireless networks. IEEE/ACM Transactions on Networking (TON), 21(5), 1499–1510.

    Article  Google Scholar 

  31. Wu, J., & Li, H. (1999). On calculating connected dominating set for efficient routing in ad hoc wireless networks. In Proceedings of the 3rd international workshop on discrete algorithms and methods for mobile computing and communications (DIAL-M’99) (pp. 7–14).

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

    Article  MathSciNet  MATH  Google Scholar 

  33. Johnson, D. S., Minkoff, M., & Phillips, S. (2000). The prize collecting Steiner tree problem: Theory and practice. In Proceedings of the eleventh annual ACM-SIAM symposium on Discrete Algorithms (SODA '00) (pp. 760–769).

    MathSciNet  Google Scholar 

  34. Garg, N. (2005). Saving an epsilon: A 2-approximation for the k-MST problem in graphs. In Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (STOC '05), 2005 (pp. 396–402). Baltimore, Maryland, USA.

  35. Graham, R. L., Lubachevsky, B. D., Nurmela, K. J., & Ostergard, P. R. J. (1998). Dense packings of congruent circles in a circle. Discrete Mathematics, 181, 139–154.

    Article  MathSciNet  MATH  Google Scholar 

  36. Funke, S., Kesselman, A., & Meyer, U. (2006). A simple improved distributed algorithm for minimum CDS in unit disk graphs. ACM Transactions on Sensor Networks, 2, 444–453.

    Article  Google Scholar 

Download references

Acknowledgments

This research was jointly supported by National Natural Science Foundation of China under Grants 11471005. This work was also supported in part by US National Science Foundation (NSF) CREST No. HRD-1345219.

Author information

Authors and Affiliations

  1. School of Mathematics and Statistics, Xi’an Jiaotong University, Xi’an, China

    Xianliang Liu, Wei Wang, Zishen Yang & Yaolin Jiang

  2. Department of Mathematics and Physics, North Carolina Central University, Durham, NC, 27707, USA

    Donghyun Kim & Alade O. Tokuta

Authors
  1. Xianliang Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wei Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Donghyun Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Zishen Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Alade O. Tokuta
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Yaolin Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wei Wang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liu, X., Wang, W., Kim, D. et al. The first constant factor approximation for minimum partial connected dominating set problem in growth-bounded graphs. Wireless Netw 22, 553–562 (2016). https://doi.org/10.1007/s11276-015-0981-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-015-0981-5

Keywords

Search

Navigation