Optimization Letters

, Volume 13, Issue 8, pp 1897–1911 | Cite as

VNDS for the min-power symmetric connectivity problem

  • Roman PlotnikovEmail author
  • Adil Erzin
  • Nenad Mladenovic
Original Paper


We consider the NP-hard problem of synthesis of optimal spanning communication subgraph in a given arbitrary simple edge-weighted graph. This problem occurs in the wireless networks while minimizing total transmission power consumptions. We propose a new method based on the variable neighborhood decomposition search metaheuristic for the approximate solution to the problem. We have performed a numerical experiment where the proposed algorithm was executed on the randomly generated test instances. For these instances, on average, our algorithm significantly outperforms the previously known heuristics, comparing solutions obtained after the same run time. The advantage of the proposed algorithm becomes more noticeable with increasing dimensions of the problem.


Energy efficiency Communication network Symmetric connectivity Variable neighborhood decomposition search 



This research is partially supported by the Russian Foundation for Basic Research (Grants No. 16-37-60006, 16-07-00552 and 17-51-45125) and by the framework of the Grant No. BR05236839 “Development of information technologies and systems for stimulation of personality’s sustainable development as one of the bases of development of digital Kazakhstan”.


  1. 1.
    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. Wirel Netw 12(3), 287–299 (2006)CrossRefGoogle Scholar
  2. 2.
    Calinescu, G., Mandoiu, I.I., Zelikovsky, A.: Symmetric connectivity with minimum power consumption in radio networks. In: Baeza-Yates, R.A., Montanari, U., Santoro, N. (eds.) Proceedings of 2nd IFIP International Conference on Theoretical Computer Science. IFIP Conference Proceedings, vol. 223, pp. 119–130. Kluwer, Dordrecht (2002)CrossRefGoogle Scholar
  3. 3.
    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.) RANDOM 1999 and APPROX 1999. LNCS, vol. 1671, pp. 197–208. Springer, Heidelberg (1999)Google Scholar
  4. 4.
    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)CrossRefGoogle Scholar
  5. 5.
    Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Math. 86(1–3), 165–177 (1990)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Erzin, A., Mladenovic, N., Plotnikov, R.: Variable neighborhood search variants for Min-power symmetric connectivity problem. Comput. Oper. Res. 78, 557–563 (2017)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Erzin, A., Plotnikov, R.: Using VNS for the optimal synthesis of the communication tree in wireless sensor networks. Electron. Notes Discrete Math. 47, 21–28 (2015)MathSciNetCrossRefGoogle Scholar
  8. 8.
    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)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Fuchs, B.: On the hardness of range assignment problems. Technical Report, TR05-113, Electronic Colloquium on Computational Complexity (2005)Google Scholar
  10. 10.
    Hansen, P., Mladenovic, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130, 449–467 (2001)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Hansen, P., Mladenovic, N., Perez-Britos, D.: Variable neighborhood decomposition search. J. Heuristics 7(4), 335–350 (2001)Google Scholar
  12. 12.
    Hansen, P., Mladenovic, N.: Variable Neighborhood Search, pp. 313–337. Springer US, Boston (2014)Google Scholar
  13. 13.
    Kirousis, L.M., Kranakis, E., Krizanc, D., Pelc, A.: Power consumption in packet radio networks. Theor. Comput. Sci. 243(1–2), 289–305 (2000)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Montemanni, R., Gambardella, L.M.: Exact algorithms for the minimum power symmetric connectivity problem in wireless networks. Comput. Oper. Res. 32(11), 2891–2904 (2005)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Park, J., Sahni, S.: Power assignment for symmetric communication in wireless networks. In: Proceedings of the 11th IEEE Symposium on Computers and Communications (ISCC), pp. 591–596. Washington (2006)Google Scholar
  16. 16.
    Plotnikov, R., Erzin, A., Mladenovic, N.: Variable neighborhood search-based heuristics for min-power symmetric connectivity problem in wireless networks. In: Kochetov, Y., et al. (eds.) DOOR-2016. LNCS, vol. 9869, pp. 220–232. Springer, Heidelberg (2016)Google Scholar
  17. 17.
    Rappaport, T.S.: Wireless Communications: Principles and Practices. Prentice Hall, Upper Saddle River (1996)Google Scholar
  18. 18.
    Santi, P.: Topology Control in Wireless Ad Hoc and Sensor Networks. Wiley, Chichester (2005)CrossRefGoogle Scholar
  19. 19.
    Wolf, S., Merz, P.: Iterated Local Search for Minimum Power Symmetric Connectivity in Wireless Networks. Lecture Notes in Computer Science, vol. 5482, pp. 192–203. Springer, Berlin (2009)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Sobolev Institute of MathematicsNovosibirskRussia
  2. 2.Novosibirsk State UniversityNovosibirskRussia
  3. 3.Mathematical InstituteSerbian Academy of Sciences and ArtsBelgradeSerbia

Personalised recommendations