Authors: Plotnikov, Roman
Erzin, Adil
Mladenović, Nenad 
Title: Variable neighborhood search-based heuristics for min-power symmetric connectivity problem in wireless networks
Journal: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume: 9869 LNCS
First page: 220
Last page: 232
Conference: 9th International Conference on Discrete Optimization and Operations Research, DOOR 2016; Vladivostok; Russian Federation; 19 September 2016 through 23 September 2016
Issue Date: 1-Jan-2016
Rank: M33
ISBN: 978-3-319-44913-5
ISSN: 0302-9743
DOI: 10.1007/978-3-319-44914-2_18
We investigate the well-known NP-hard problem of finding an optimal communication subgraph in a given edge-weighted graph. This problem appears in different distributed wireless communication networks, e.g., in wireless sensor networks, when it is necessary to minimize transmission energy consumption. We propose new heuristic algorithms based on variable neighborhood search metaheuristic. Our results have been compared with the best known results, and the numerical experiment showed that, on a large number of instances, our algorithms outperform the previous ones, especially in a case of large dimensions.
Keywords: Energy efficiency | NP-hard problem | Variable neighborhood search | Wireless sensor networks
Publisher: Springer Link
Project: Russian Foundation for Basic Research, Grant nos. 16-07-00552 and 16-37-60006
Ministry of Education and Science, Republic of Kazakhstan, Project no. 0115PK00546

Show full item record


checked on Jun 21, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.