Advertisement

Two Meta-Heuristics Designed to Solve the Minimum Connected Dominating Set Problem for Wireless Networks Design and Management

  • 188 Accesses

Abstract

Wireless ad hoc and sensor networks play an important role in providing flexible deployment and mobile connectivity for next generation network. Since there is no fixed physical backbone infrastructure, some of the nodes are selected to form a virtual backbone. Efficient algorithms for identifying the Minimum Connected Dominating Set (MCDS) have many practical applications in wireless sensor networks deployment and management. We propose two algorithms in this paper for solving the MCDS problem. The first algorithm called Memetic Algorithm for the MCDS problem, or MA-MCDS shortly. This is a new hybrid algorithm based on genetic algorithm in addition to local search strategies for the MCDS problem. In order to achieve fast performance, MA-MCDS algorithm uses local search and intensification procedures in addition to genetic operations. In the second algorithm, simulated annealing is used to enhance a stochastic local search with the ability to of run away from local solutions. In addition, we present a new objective function that effectively measure the quality of the solutions of our proposed algorithms. Both algorithms are tested using different benchmark test graph sets available in the literature, and shows good results in terms of solution quality.

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

Access options

Buy single article

Instant unlimited access to the full article PDF.

US$ 39.95

Price includes VAT for USA

Subscribe to journal

Immediate online access to all issues from 2019. Subscription will auto renew annually.

US$ 99

This is the net price. Taxes to be calculated in checkout.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

References

  1. 1.

    Gao, X., Zhu, X., Li, J., Fan, W., Chen, G., Ding-Zhu, D., Tang, S.: A novel approximation for multi-hop connected clustering problem in wireless networks. IEEE/ACM Trans. Netw. 25(4), 2223–2234 (2017)

  2. 2.

    Mohanty, J.P., Mandal, C., Reade, C.: Distributed construction of minimum connected dominating set in wireless sensor network using two-hop information. Comput. Netw. 123, 137–152 (2017)

  3. 3.

    Mohanty, J.P., Mandal, C., Reade, C., Das, A.: Construction of minimum connected dominating set in wireless sensor networks using pseudo dominating set. Ad Hoc Netw. 42, 61–73 (2016)

  4. 4.

    Narasimha Raghavan, V., Arvind Ranganath, R., Bharath, N., Khan, M.F.: Simple and efficient backbone algorithm for calculating connected dominating set in wireless adhoc networks. Int. J. Electron. Circuits Syst. 1(3), 3–18 (2007)

  5. 5.

    Thai, M.T., Tiwari, R., Du, D.-Z.: On construction of virtual backbone in wireless ad hoc networks with unidirectional links. IEEE Trans. Mobile Comput. 7(9), 1098–1109 (2008)

  6. 6.

    Torkestani, J.A., Meybodi, M.R.: An intelligent backbone formation algorithm for wireless ad hoc networks based on distributed learning automata. Comput. Netw. 54(5), 826–843 (2010)

  7. 7.

    Wan, P.-J., Alzoubi, K.M., Frieder, O.: Distributed construction of connected dominating set in wireless ad hoc networks. In: Proceedings INFOCOM 2002. Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 3, pp. 1597–1604. IEEE (2002)

  8. 8.

    Yu, F., Xia, X., Li, W., Tao, J., Ma, L., Cai, Z.-Q.: Critical node identification for complex network based on a novel minimum connected dominating set. Soft Comput. 21, 1–9 (2016)

  9. 9.

    Fahong, Y., Xia, X., Li, W., Tao, J., Ma, L., Cai, Z.: Critical node identification for complex network based on a novel minimum connected dominating set. Soft Comput. 21(19), 5621–5629 (2017)

  10. 10.

    Paradis, L., Han, Q.: A survey of fault management in wireless sensor networks. J. Netw. Syst. Manag. 15(2), 171–190 (2007)

  11. 11.

    Ferreira, C., Guardalben, L., Gomes, T., Sargento, S., Salvador, P., Robalo, D., Velez, F.J.: Supporting unified distributed management and autonomic decisions: design, implementation and deployment. J. Netw. Syst. Manag. 25(2), 416–456 (2017)

  12. 12.

    Haynes, T.W., Hedetniemi, S., Slater, P.: Fundamentals of Domination in Graphs. CRC Press, Boca Raton (1998)

  13. 13.

    Michael, R.G., David, S.J.: Computers and Intractability: A Guide to the Theory of np-Completeness. WH Freeman & Co., San Francisco (1979)

  14. 14.

    Glover, F., Kochenberger, G.A.: Handbook of Metaheuristics. Springer, Berlin (2003)

  15. 15.

    Merz, P.: Advanced fitness landscape analysis and the performance of memetic algorithms. Evolut. Comput. 12(3), 303–325 (2004)

  16. 16.

    Aarts, E., Korst, J.: Selected topics in simulated annealing. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics, pp. 1–37. Springer, Berlin (2002)

  17. 17.

    Hedar, A.-R., Fukushima, M.: Heuristic pattern search and its hybridization with simulated annealing for nonlinear global optimization. Optim. Methods Softw. 19(3–4), 291–308 (2004)

  18. 18.

    Hedar, A.-R., Fukushima, M.: Derivative-free filter simulated annealing method for constrained continuous global optimization. J. Glob. Optim. 35(4), 521–549 (2006)

  19. 19.

    Kirkpatrick, S., Vecchi, M.P., et al.: Optimization by simmulated annealing. Science 220(4598), 671–680 (1983)

  20. 20.

    Aarts, E., Korst, J., Michiels, W.: Simulated annealing. In: Burke, E.K. (ed.) Search Methodologies, pp. 187–210. Springer, Berlin (2005)

  21. 21.

    Hedar, A.-R., Fukushima, M.: Hybrid simulated annealing and direct search method for nonlinear unconstrained global optimization. Optim. Methods Softw. 17(5), 891–912 (2002)

  22. 22.

    Moscato, P., et al.: On genetic crossover operators for relative order preservation. C3P Report, pp. 778 (1989)

  23. 23.

    Pastorino, M., Caorsi, S., Massa, A., Randazzo, A.: Reconstruction algorithms for electromagnetic imaging. IEEE Trans. Instrum. Meas. 53(3), 692–699 (2004)

  24. 24.

    Hedar, A.-R., Ismail, R.: Hybrid genetic algorithm for minimum dominating set problem. In: Computational Science and Its Applications–ICCSA 2010, pp. 457–467. Springer, Berlin (2010)

  25. 25.

    Li, R., Hu, S., Gao, J., Zhou, Y., Wang, Y., Yin, M.: Grasp for connected dominating set problems. Neural Comput. Appl. 28, 1–9 (2016)

  26. 26.

    Misra, R., Mandal, C.: Minimum connected dominating set using a collaborative cover heuristic for ad hoc sensor networks. IEEE Trans. Parallel Distrib. Syst. 21(3), 292–302 (2010)

  27. 27.

    Yadav, A.K., Yadav, R.S., Singh, R., Singh, A.K.: Connected dominating set for wireless ad hoc networks: a survey. Int. J. Eng. Syst. Modell. Simul. 7(1), 22–34 (2014)

  28. 28.

    Coelho, R.S., Moura, P.F.S., Wakabayashi, Y.: The k-hop connected dominating set problem: hardness and polyhedra. Electron. Notes Discrete Math. 50, 59–64 (2015)

  29. 29.

    Hongjie, D., Ding, L., Weili, W., Kim, D., Pardalos, P.M., Willson, J.: Connected dominating set in wireless networks. In: Pardalos, P.M., Du, D.-Z., Graham, R.L. (eds.) Handbook of Combinatorial Optimization, pp. 783–833. Springer, Berlin (2013)

  30. 30.

    Gupta, A., Kumar, A., Roughgarden, T.: Simpler and better approximation algorithms for network design. In: Proceedings of the Thirty-fifth Annual ACM Symposium on Theory of Computing, pp. 365–372 (2003)

  31. 31.

    Swamy, C., Kumar, A.: Primal-dual algorithms for connected facility location problems. Algorithmica 40(4), 245–269 (2004)

  32. 32.

    Cheng, X., Ding, M., Chen, D.: An approximation algorithm for connected dominating set in ad hoc networks. In: Proceedings of International Workshop on Theoretical Aspects of Wireless Ad Hoc, Sensor, and Peer-to-Peer Networks (TAWN) (2004)

  33. 33.

    Jie, W., Dai, F.: A generic distributed broadcast scheme in ad hoc wireless networks. IEEE Trans. Comput. 53(10), 1343–1354 (2004)

  34. 34.

    Rawat, P., Singh, K.D., Chaouchi, H., Bonnin, J.M.: Wireless sensor networks: a survey on recent developments and potential synergies. J. Supercomput. 68(1), 1–48 (2014)

  35. 35.

    Hongwei, D., Ye, Q., Weili, W., Lee, W., Li, D., Dingzhu, D., Howard, S.: Constant approximation for virtual backbone construction with guaranteed routing cost in wireless sensor networks. In: 2011 Proceedings IEEE INFOCOM, pp. 1737–1744. IEEE (2011)

  36. 36.

    Ren, S., Yi, P., Lin, Z., Guo, C., Wu, Y.: Constructing minimum connected dominating sets with constant update time in wireless ad-hoc sensor networks. In: 2014 IEEE 17th International Conference on Computational Science and Engineering (CSE), pp. 1570–1576. IEEE (2014)

  37. 37.

    Ren, S., Yi, P., Hong, D., Wu, Y., Zhu, T.: Distributed construction of connected dominating sets optimized by minimum-weight spanning tree in wireless ad-hoc sensor networks. In: 2014 IEEE 17th International Conference on Computational Science and Engineering (CSE), pp. 901–908. IEEE (2014)

  38. 38.

    Kim, D., Yiwei, W., Li, Y., Zou, F., Ding-Zhu, D.: Constructing minimum connected dominating sets with bounded diameters in wireless networks. IEEE Trans. Parallel Distrib. Syst. 20(2), 147–157 (2009)

  39. 39.

    Wang, L., Wan, P.-J., Yao, F.: Minimum cds in multihop wireless networks with disparate communication ranges. IEEE Trans. Mobile Comput. 1(3), 162–168 (2013)

  40. 40.

    Mohanty, J.P., Mandal, C.: A distributed greedy algorithm for construction of minimum connected dominating set in wireless sensor network. In: Applications and Innovations in Mobile Computing (AIMoC), 2014, pp. 104–110. IEEE (2014)

  41. 41.

    Kui, X., Wang, J., Zhang, S.: A data gathering algorithm based on energy-balanced connected dominating sets in wireless sensor networks. In: 2013 IEEE Wireless Communications and Networking Conference (WCNC), pp. 1139–1144. IEEE (2013)

  42. 42.

    Malatras, A., Hadjiantonis, A.M., Pavlou, G.: Exploiting context-awareness for the autonomic management of mobile ad hoc networks. J. Netw. Syst. Manag. 15(1), 29–55 (2007)

  43. 43.

    Aoun, B., Boutaba, R.: Clustering in wsn with latency and energy consumption constraints. J. Netw. Syst. Manag. 14(3), 415–439 (2006)

  44. 44.

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

  45. 45.

    Ruan, L., Hongwei, D., Jia, X., Weili, W., Li, Y., Ko, K.-I.: A greedy approximation for minimum connected dominating sets. Theor. Comput. Sci. 329(1–3), 325–330 (2004)

  46. 46.

    Weili, W., Hongwei, D., Jia, X., Li, Y., Huang, S.C.-H.: Minimum connected dominating sets and maximal independent sets in unit disk graphs. Theor. Comput. Sci. 352(1–3), 1–7 (2006)

  47. 47.

    Kamei, S., Kakugawa, H.: A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs. Theor. Comput. Sci. 428, 80–90 (2012)

  48. 48.

    Dai, F., Jie, W.: On constructing k-connected k-dominating set in wireless ad hoc and sensor networks. J. Parallel Distrib. Comput. 66(7), 947–958 (2006)

  49. 49.

    Das, B., Sivakumar, R., Bharghavan, V.: Routing in ad hoc networks using a spine. In: Proceedings Sixth International Conference on Computer Communications and Networks, 1997, pp. 34–39. IEEE (1997)

  50. 50.

    Wu, J., Li, H.: On calculating connected dominating set forefficient routing in ad hoc wireless networks. In Proceedings of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 7–14. ACM (1999)

  51. 51.

    Das, B., Sivakumar, R., Bharghavan, V.: Routing in ad-hoc network using a virtual backbone. Proc. ACM SIGCOMM 97, 1–20 (1997)

  52. 52.

    Jovanovic, R., Tuba, M.: Ant colony optimization algorithm with pheromone correction strategy for the minimum connected dominating set problem. Comput. Sci. Inf. Syst. 10(1), 133–149 (2013)

  53. 53.

    Dagdeviren, Z.A., Aydin, D., Cinsdikici, M.: Two population-based optimization algorithms for minimum weight connected dominating set problem. Appl. Soft Comput. 59, 644–658 (2017)

  54. 54.

    Kumar, G., Rai, M.K.: An energy efficient and optimized load balanced localization method using cds with one-hop neighbourhood and genetic algorithm in wsns. J. Netw. Comput. Appl. 78, 73–82 (2017)

  55. 55.

    Deb, K.: Multi-objective Optimization Using Evolutionary Algorithms, vol. 16. Wiley, Hoboken (2001)

  56. 56.

    Baker, J.E.: Adaptive selection methods for genetic algorithms. In Proceedings of an International Conference on Genetic Algorithms and Their Applications, pp. 101–111. ACM, Hillsdale (1985)

  57. 57.

    Herrera, F., Lozano, M., Verdegay, J.L.: Tackling real-coded genetic algorithms: operators and tools for behavioural analysis. Artif. Intell. Rev. 12(4), 265–319 (1998)

  58. 58.

    Hedar, A.-R., Ismail, R., El Sayed, G.A., Khayyat, : K.M.J.: Two meta-heuristics for the minimum connected dominating set problem with an application in wireless networks. In 2015 3rd International Conference on Applied Computing and Information Technology/2nd International Conference on Computational Science and Intelligence (ACIT-CSI), pp. 355–362. IEEE (2015)

  59. 59.

    Hedar, A.-R., Ismail, R.: Simulated annealing with stochastic local search for minimum dominating set problem. Int. J. Mach. Learn. Cybern. 3(2), 97–109 (2012)

  60. 60.

    Sanchis, L.A.: Experimental analysis of heuristic algorithms for the dominating set problem. Algorithmica 33(1), 3–18 (2002)

  61. 61.

    García, S., Fernández, A., Luengo, J., Herrera, F.: A study of statistical techniques and performance measures for genetics-based machine learning: accuracy and interpretability. Soft Comput. 13(10), 959–977 (2009)

  62. 62.

    Sheskin, David J.: Handbook of Parametric and Nonparametric Statistical Procedures. CRC Press, Boca Raton (2003)

Download references

Acknowledgements

This work was funded by the Scientific Research Deanship at Umm Al-Qura University, the Kingdom of Saudi Arabia, Award Project Number (43508016). The authors would like to express their sincere gratitude to the anonymous referees and the editors for their useful and valuable comments and suggestions to improve the quality of the paper.

Author information

Correspondence to Abdel-Rahman Hedar.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Hedar, A., Ismail, R., El-Sayed, G.A. et al. Two Meta-Heuristics Designed to Solve the Minimum Connected Dominating Set Problem for Wireless Networks Design and Management. J Netw Syst Manage 27, 647–687 (2019) doi:10.1007/s10922-018-9480-1

Download citation

Keywords

  • Minimum connected dominating set
  • Memetic algorithm
  • Simulated annealing
  • Stochastic local search
  • Wireless network design