Abstract
We consider a Min-Power Bounded-Hops Symmetric Connectivity problem that consists in the construction of communication spanning tree on a given graph, where the total energy consumption spent for the data transmission is minimized and the maximum number of edges in a path in the tree between any pair nodes is bounded by some predefined constant. We focus on the planar Euclidian case of this problem where the power cost necessary for the communication between two network elements is proportional to the squared distance between them. Since this is an NP-hard problem, we propose different heuristics based on the following metaheuristics: genetic local search, variable neighborhood search, and ant colony optimization. We perform a posteriori comparative analysis of the proposed algorithms and present the obtained results in this paper.
The research is supported by the Russian Science Foundation (project 18-71-00084).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Rappaport, T.S.: Wireless Communications: Principles and Practices. Prentice Hall, Upper Saddle River (1996)
Clementi, A.E.F., Penna, P., Silvestri, R.: Hardness results for the power range assignment problem in packet radio networks. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds.) APPROX/RANDOM -1999. LNCS, vol. 1671, pp. 197–208. Springer, Heidelberg (1999). https://doi.org/10.1007/978-3-540-48413-4_21
Kirousis, L.M., Kranakis, E., Krizanc, D., Pelc, A.: Power consumption in packet radio networks. Theoret. Comput. Sci. 243(1–2), 289–305 (2000)
Călinescu, G., Măndoiu, I.I., Zelikovsky, A.: Symmetric connectivity with minimum power consumption in radio networks. In: Baeza-Yates, R., Montanari, U., Santoro, N. (eds.) Foundations of Information Technology in the Era of Network and Mobile Computing. ITIFIP, vol. 96, pp. 119–130. Springer, Boston, MA (2002). https://doi.org/10.1007/978-0-387-35608-2_11
Cheng, X., Narahari, B., Simha, R., Cheng, M.X., Liu, D.: Strong minimum energy topology in wireless sensor networks: NP-completeness and heuristics. IEEE Trans. Mob. Comput. 2(3), 248–256 (2003)
Chu, T., Nikolaidis, I.: Energy efficient broadcast in mobile ad hoc networks. In: Proceedings of AD-HOC Networks and Wireless (2002)
Park, J., Sahni, S.: Power assignment for symmetric communication in wireless networks. In: Proceedings of the 11th IEEE Symposium on Computers and Communications (ISCC), Washington, pp. 591–596. IEEE Computer Society, Los Alamitos (2006)
Althaus, E., Calinescu, G., Mandoiu, I.I., Prasad, S.K., Tchervenski, N., Zelikovsky, A.: Power efficient range assignment for symmetric connectivity in static ad hoc wireless networks. Wireless Netw. 12(3), 287–299 (2006)
Erzin, A., Plotnikov, R., Shamardin, Y.: On some polynomially solvable cases and approximate algorithms in the optimal communication tree construction problem. J. Appl. Ind. Math. 7, 142–152 (2013)
Wolf, S., Merz, P.: Iterated local search for minimum power symmetric connectivity in wireless networks. In: Cotta, C., Cowling, P. (eds.) EvoCOP 2009. LNCS, vol. 5482, pp. 192–203. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-01009-5_17
Erzin, A., Plotnikov, R.: Using VNS for the optimal synthesis of the communication tree in wireless sensor networks. Electron. Notes Discret. Math. 47, 21–28 (2015)
Erzin, A., Mladenovic, N., Plotnikov, R.: Variable neighborhood search variants for Min-power symmetric connectivity problem. Comput. Oper. Res. 78, 557–563 (2017)
Erzin, A., Plotnikov, R., Mladenovic, N.: VNDS for Min-power symmetric connectivity problem. Optim. Lett. 13(8), 1897–1911 (2019). https://doi.org/10.1007/s11590-018-1324-0
Clementi, A.E.F., Ferreira, A., Penna, P., Perennes, S., Silvestri, R.: The minimum range assignment problem on linear radio networks. In: Paterson, M.S. (ed.) ESA 2000. LNCS, vol. 1879, pp. 143–154. Springer, Heidelberg (2000). https://doi.org/10.1007/3-540-45253-2_14
Calinescu, G., Kapoor, S., Sarwat, M.: Bounded-hops power assignment in ad hoc wireless networks. Discret. Appl. Math. 154(9), 1358–1371 (2006)
Carmi, P., Chaitman-Yerushalmi, L., Trabelsi, O.: On the bounded-hop range assignment problem. In: Dehne, F., Sack, J.-R., Stege, U. (eds.) WADS 2015. LNCS, vol. 9214, pp. 140–151. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21840-3_12
Clementi, A.E.F., Penna, P., Silvestri, R.: On the power assignment problem in radio networks. Electronic Colloquium on Computational Complexity (ECCC) (054) (2000)
Plotnikov, R., Erzin, A.: Constructive heuristics for min-power bounded-hops symmetric connectivity problem. In: CCIS, vol. 1090, pp. 390–407 (2019). https://doi.org/10.1007/978-3-030-33394-2_31
Gruber, M., van Hemert, J., Raidl, G.R.: Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO. In: Proceedings of 8th Annual Conference on Genetic and Evolutionary Computation (GECCO 2006), Seattle, Washington, USA, 08–12 July, pp. 1187–1194 (2006). https://doi.org/10.1145/1143997.1144185
Hansen, P., Mladenovic, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130, 449–467 (2001)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Plotnikov, R., Erzin, A. (2020). Metaheuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem. In: Matsatsinis, N., Marinakis, Y., Pardalos, P. (eds) Learning and Intelligent Optimization. LION 2019. Lecture Notes in Computer Science(), vol 11968. Springer, Cham. https://doi.org/10.1007/978-3-030-38629-0_29
Download citation
DOI: https://doi.org/10.1007/978-3-030-38629-0_29
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-38628-3
Online ISBN: 978-3-030-38629-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)