Skip to main content
Springer Nature Link
Log in

VNDS for the min-power symmetric connectivity problem

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

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.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

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

Similar content being viewed by others

References

  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)

    Article  Google Scholar 

  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)

    Chapter  Google Scholar 

  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. 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)

    Article  Google Scholar 

  5. Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Math. 86(1–3), 165–177 (1990)

    Article  MathSciNet  Google Scholar 

  6. Erzin, A., Mladenovic, N., Plotnikov, R.: Variable neighborhood search variants for Min-power symmetric connectivity problem. Comput. Oper. Res. 78, 557–563 (2017)

    Article  MathSciNet  Google Scholar 

  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)

    Article  MathSciNet  Google Scholar 

  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)

    Article  MathSciNet  Google Scholar 

  9. Fuchs, B.: On the hardness of range assignment problems. Technical Report, TR05-113, Electronic Colloquium on Computational Complexity (2005)

  10. Hansen, P., Mladenovic, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130, 449–467 (2001)

    Article  MathSciNet  Google Scholar 

  11. Hansen, P., Mladenovic, N., Perez-Britos, D.: Variable neighborhood decomposition search. J. Heuristics 7(4), 335–350 (2001)

    Google Scholar 

  12. Hansen, P., Mladenovic, N.: Variable Neighborhood Search, pp. 313–337. Springer US, Boston (2014)

    Google Scholar 

  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)

    Article  MathSciNet  Google Scholar 

  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)

    Article  MathSciNet  Google Scholar 

  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)

  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. Rappaport, T.S.: Wireless Communications: Principles and Practices. Prentice Hall, Upper Saddle River (1996)

    Google Scholar 

  18. Santi, P.: Topology Control in Wireless Ad Hoc and Sensor Networks. Wiley, Chichester (2005)

    Book  Google Scholar 

  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)

    Chapter  Google Scholar 

Download references

Acknowledgements

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”.

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, Novosibirsk, Russia

    Roman Plotnikov & Adil Erzin

  2. Novosibirsk State University, Novosibirsk, Russia

    Adil Erzin

  3. Mathematical Institute, Serbian Academy of Sciences and Arts, Belgrade, Serbia

    Nenad Mladenovic

Authors
  1. Roman Plotnikov
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Adil Erzin
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Nenad Mladenovic
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Roman Plotnikov.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Plotnikov, R., Erzin, A. & Mladenovic, N. VNDS for the min-power symmetric connectivity problem. Optim Lett 13, 1897–1911 (2019). https://doi.org/10.1007/s11590-018-1324-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-018-1324-0

Keywords