Acknowledgement
This work was supported by the Catholic University of Korea Research Fund (2021).
References
- K. Zhou and J. Chen, "Simulation DNA algorithm of set covering problem," Applied Mathematics & Information Sciences, vol. 8, no. 1, pp. 139-144, Jan. 2014. DOI: 10.12785/amis/080117.
- P. K. Tripathy, R. K. Dash, and C. R. Tripathy, "A genetic algorithm based approach for topological optimization of interconnection networks," in Procedia Technology, Rourkela, India, vol. 6, pp. 196-205, 2012. DOI: 10.1016/j.protcy.2012.10.024.
- J. Kim, J. Oh, M. Kim, Y. Kim, J. Lee, S. Han, and B. Hwang, "Maximum node interconnection by a given sum of euclidean edge lengths," Journal of Information and Communication Convergence Engineering, vol. 17, no. 4, pp. 246-254, 2019. DOI: 10.6109/jicce.2019.17.4.246
- D. Hu, P. Dai, K. Zhou, and S. Ge, "Improved particle swarm optimization for minimum spanning tree of length constraint problem," in 8th International Conference on Intelligent Computation Technology and Automation, Nanchang, China, pp. 474-477, 2015. DOI: 10.1109/icicta.2015.124.
- G. Hong-mei, X. Chao, and Y. Ben-cheng, "Design and analysis of minimum spanning tree in euclidean plane," in International Conference on Computational and Information Sciences, Shiyang, China, pp. 976-979, 2013. DOI: 10.1109/iccis.2013.262.
- V. Geetha, S. Aithal, and K. C. Sekaran, "Effect of mobility over performance of the ad hoc networks," in International Symposium on Ad Hoc and Ubiquitous Computing, Mangalore, India, pp. 138-141, 2006. DOI: 10.1109/isahuc.2006.4290661.
- P. Flocchini, T. M. Enriquez, L. Pagli, G. Prencipe, and N. Santoro, "Distributed minimum spanning tree maintenance for transient node failures," IEEE Transactions on Computers, vol. 61, no. 3, pp. 408-414, Nov. 2012. DOI: https://doi.org/10.1109/tc.2010.228.
- R. Ghoshal and S. Sundar, "Two approaches for the min-degree constrained minimum spanning tree problem," Applied Soft Computing, vol. 111, 107715, Nov. 2021. DOI: 10.1016/j.asoc.2021.107715.
- Perkins, "Ad hoc networking in the IETF," in IEEE International Workshop on Broadband Convergence Networks, Vancouver: BC, Canada, pp. 1-35, 2006. DOI: 10.1109/bcn.2006.1662294.
- S. Ren, P. Yi, D. Hong, Y. Wu, and T. Zhu. "Distributed construction of connected dominating sets optimized by minimum-weight spanning tree in wireless ad-hoc sensor networks," in IEEE 17th International Conference on Computational Science and Engineering, Chengdu, China, pp. 901-908, 2014. DOI: 10.1109/cse.2014.183.
- J. J. Kponyo, Y. Kuang, E. Zhang, and K. Domenic, "VANET cluster-on-demand minimum spanning tree (MST) prim clustering algorithm," in International Conference on Computational Problem-Solving, Jiuzhai, China, pp. 101-104, 2013. DOI: 10.1109/iccps.2013.6893585.
- X. Zhang and X. Zhang, "A binary artificial bee colony algorithm for constructing spanning trees in vehicular ad hoc networks," Ad Hoc Networks, vol. 58, pp. 198-204, Apr. 2017. DOI: 10.1016/j.adhoc.2016.07.001.