Wireless Networks

, Volume 21, Issue 3, pp 783–792 | Cite as

An optimization algorithm for the minimum k-connected m-dominating set problem in wireless sensor networks

  • Namsu Ahn
  • Sungsoo Park


In wireless sensor networks (WSNs), virtual backbone has been proposed as the routing infra-structure and connected dominating set has been widely adopted as virtual backbone. However, since the sensors in WSNs are prone to failures, recent studies suggest that it is also important to maintain a certain degree of redundancy in the backbone. To construct a robust backbone, so called k-connected m-dominating set has been proposed. In this research, we propose an integer programming formulation and an optimal algorithm for the minimum k-connected m-dominating set problem. To the best of our knowledge, this is the first integer programming formulation for the problem, and extensive computational results show that our optimal algorithm is capable of finding a solution within a reasonable amount of time.


Wireless sensor network Robust connected dominating set Integer programming Optimal algorithm 


  1. 1.
    Alzoubi, K. M., Wan, P. J., & Frieder, O. (2002). Message-optimal connected dominating sets in mobile ad hoc networks. In Proceedings of the 3rd ACM international symposium on mobile ad hoc networking and computing (pp. 157–164). ACM, Lausanne, Switzerland.Google Scholar
  2. 2.
    Basu, P., & Redi, J. (2004). Movement control algorithms for realization of fault tolerant ad hoc robot networks. IEEE Networks, 18, 36–44.CrossRefGoogle Scholar
  3. 3.
    Bertsimas, D., & Tsitsiklis, J. N. (1997). Introduction to linear optimization. Belmont: Athena Scientific.Google Scholar
  4. 4.
    Blum, J., Ding, M., Thaeler, A., & Cheng, X. (2004). Connected dominating set in sensor networks and MANETs, handbook of combinatorial optimization. Massachusetts: Kluwer Acacemic Publishers.Google Scholar
  5. 5.
    Bondy, J. A., & Murty, U. S. R. (2008). Graph theory. Berlin: Springer.zbMATHGoogle Scholar
  6. 6.
    Bredin, J. L., Demaine, E. D., Hajiaghayi, M., & Rus, D. (2005). Deploying sensor networks with guaranteed capacity and fault tolerance. In Proceedings of the 6th ACM international symposium on mobile ad hoc networking and computing (pp. 309–319). ACM SIGMOBILE, Urbana-Champaign, Illinois.Google Scholar
  7. 7.
    Dai, F., & Wu, J. (2006). On constructing k-connected k-dominating set in wireless network. Journal of Parallel and Distributed Computing, 66, 947–958.CrossRefzbMATHGoogle Scholar
  8. 8.
    Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. San Francisco: W. H. Freeman and Company.zbMATHGoogle Scholar
  9. 9.
    Guha, S., & Khuller, S. (1998). Approximation algorithms for connected dominating sets. Algorithmica, 20, 374–387.CrossRefzbMATHMathSciNetGoogle Scholar
  10. 10.
    Grotschel, M., Lovasz, L., & Schrijver, A. (1981). The ellipsoid method and its consequences in combinatorial optimization. Combinatorica, 1, 169–197.CrossRefMathSciNetGoogle Scholar
  11. 11.
    Kim, D., Wang, W., Li, X., Zhang, Z., & Wu, W. (2010). A new constant factor approximation for computing 3-connected m-dominating sets in homogeneous wireless networks. In INFOCOM, IEEE (pp. 1–9). San Diego, CA.Google Scholar
  12. 12.
    Koskinen, H., & Karvo, J. (2005). On improving connectivity of static ad-hoc networks by adding nodes, 4th annual Mediterranean workshop on ad hoc network. IEEE Communications Society (pp. 169–178). Porquerolles, France.Google Scholar
  13. 13.
    Kuhn, F., Moscibroda, T., & Wattenhofer, R. (2006). Fault-tolerant clustering in ad hoc and sensor networks. In 26th international conference on distributed computing systems. IEEE Computer Society, Lisboa, Portugal.Google Scholar
  14. 14.
    Li, Y., Wu, Y., Ai, C., & Neyah, R. (2012). On the construction of k-connected m-dominating sets in wireless networks. Journal of Combinatorial Optimization, 23, 118–139.CrossRefzbMATHMathSciNetGoogle Scholar
  15. 15.
    Ni, S. Y., Tseng, Y. C., Chen, Y. S., & Sheu, J. P. (2002). The broadcast storm problem in a mobile ad hoc network. Wireless Networks, 8, 153–167.CrossRefzbMATHGoogle Scholar
  16. 16.
    Papadimitriou, C. H., & Steiglitz, K. (1998). Combinatorial pptimization. Mineola, NY: Dover Publications.zbMATHGoogle Scholar
  17. 17.
    Ryl, D. S., Stojmenović, I., & Wu, J. (2005). Energy-efficient backbone construction, broadcasting, and area coverage in sensor networks. In I. Stojmenović (Ed.), Handbook of sensor networks (pp. 343–380). Hoboken: Wiley.Google Scholar
  18. 18.
    Shang, W., Yao, F., Wan, P., & Hu, X. (2007). Algorithms for minimum m-connected k-dominating set problem. Lecture Notes in Computer Science, 4616, 182–190.CrossRefMathSciNetGoogle Scholar
  19. 19.
    Shang, W., Yao, F., Wan, P., & Hu, X. (2008). On minimum m-connected k-dominating set problem in unit disc graphs. Journal of Combinatorial Optimization, 16, 99–106.CrossRefzbMATHMathSciNetGoogle Scholar
  20. 20.
    Sinha, P., Sivakumar, R., & Bharghavan, V. (2001). Enhancing ad hoc routing with dynamic virtual infrastructures. IN 20th annual joint conference of the IEEE computer and communications societies. Technical Committees on Computer Communications (TCCC) of the Societies (Vol. 3, pp. 1763–1772). Anchorage, Alaska.Google Scholar
  21. 21.
    Stojmenović, I., & Wu, J. (2005). Mobile ad hoc networking. Hoboken: WileyGoogle Scholar
  22. 22.
    Tarjan, R. E. (1972). Depth first search and linear graph algorithms. SIAM Journal on Computing, 1(2), 146–160.Google Scholar
  23. 23.
    Thai, M. T., Zhang, N., Tiwari, R., & Xu, X. (2007). On approximation algorithms of k-connected m-dominating sets in disk graphs. Theory of Computation Sc, 385, 49–59.CrossRefzbMATHMathSciNetGoogle Scholar
  24. 24.
    Thulasiraman, K., & Swamy, M. N. S. (1992). Graphs: Theory and algorithms. New York: Wiley.zbMATHGoogle Scholar
  25. 25.
    Tiwari, R., & Thai, M. T. (2012). On enhancing fault tolerance of virtual backbone in a wireless sensor network with unidirectional links. Sensors: Theory, Algorithms, and Applications, 61, 3–18.Google Scholar
  26. 26.
    Wang, F., Thai, M. T., & Du, D. Z. (2009). On the construction of 2-connected virtual backbone in wireless network. IEEE Transactions on Wireless Communications, 8, 1230–1237.CrossRefGoogle Scholar
  27. 27.
    Wang, W., Kim, D., An, M. K., Gao, W., Li, X., Zhang, Z., & Wu, W. (2012). On construction of quality fault-tolerant virtual backbone in wireless networks. Networking, IEEE/ACM Transactions, 21(5), 1499–1510.Google Scholar
  28. 28.
    West, D. B. (2001). Introduction to graph theory. Upper Saddle River: Prentice-Hall.Google Scholar
  29. 29.
    Wu, Y., Wang, F., Thai, M. T., & Li, Y. (2007). Constructing k-connected m-dominating sets in wireless sensor networks. In Military communications conference. Orlando, FL.Google Scholar
  30. 30.
    Wu, Y., & Li, Y. (2008) Construction algorithms for k-connected m-dominating sets in wireless sensor networks. In 9th ACM international symposium on mobile ad hoc networking and computing (pp. 83–90). ACM SIGMOBILE, May, Hong Kong.Google Scholar
  31. 31.
    Yu, J., Wang, N., Wang, G., & Yu, D. (2013). Connected dominating sets in wireless ad hoc and sensor networks—A comprehensive survey. Computer Communications, 36, 121–134.CrossRefGoogle Scholar
  32. 32.
    Zhang, J., Gao, X., & Wu, W. (2009). Algorithms for connected set cover problem and fault-tolerant connected set cover problem. Theoretical Computer Science, 410, 812–817.CrossRefzbMATHMathSciNetGoogle Scholar
  33. 33.
    Zhou, J., Zhang, Z., Wu, W., & Xing, K. (2014). A greedy algorithm for the fault-tolerant connected dominating set in a general graph. Journal of Combinatorial Optimization, 28(1), 310–319.Google Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  1. 1.Defense Agency for Technology and QualityJinju-si Republic of Korea
  2. 2.Department of Industrial and Systems EngineeringKAIST Daejeon-si Republic of Korea

Personalised recommendations