Iterated Local Search for Minimum Power Symmetric Connectivity in Wireless Networks

被引：0
|
作者：
Wolf, Steffen [1 ]
Merz, Peter [1 ]
机构：
[1] Univ Kaiserslautern, Distributed Algorithms Grp, D-67663 Kaiserslautern, Germany
来源：
EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION, PROCEEDINGS | 2009年 / 5482卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The problem of finding a symmetric connectivity topology with minimum power consumption in a wireless ad-hoc network is NP-hard. This work presents a new iterated local search to solve this problem by combining filtering techniques with local search. The algorithm is benchmarked using instances with up to 1000 nodes, and results are compared to optimal or best known results as well as other heuristics. For these instances, the proposed algorithm is able to find optimal and near-optimal solutions and outperforms previous heuristics.
引用
收藏
页码：192 / 203
页数：12
相关论文
共 50 条
  • [1] Minimum power symmetric connectivity problem in wireless networks: A new approach
    Montemanni, R
    Gambardella, LM
    [J]. MOBILE AND WIRELESS COMMUNICATION NETWORKS, 2005, 162 : 497 - 508
  • [2] Exact algorithms for the minimum power symmetric connectivity problem in wireless networks
    Montemanni, R
    Gambardella, LM
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (11) : 2891 - 2904
  • [3] Symmetric connectivity with minimum power consumption in radio networks
    Calinescu, G
    Mandoiu, II
    Zelikovsky, A
    [J]. FOUNDATIONS OF INFORMATION TECHNOLOGY IN THE ERA OF NETWORK AND MOBILE COMPUTING, 2002, 96 : 119 - 130
  • [4] Iterated Local Search Algorithm for Clustering Wireless Sensor Networks
    Oladimeji, Muyiwa Olakanmi
    Turkey, Mikdam
    Dudley, Sandra
    [J]. 2016 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2016, : 3246 - 3253
  • [5] Variable Neighborhood Search-Based Heuristics for Min-Power Symmetric Connectivity Problem in Wireless Networks
    Plotnikov, Roman
    Erzin, Adil
    Mladenovic, Nenad
    [J]. DISCRETE OPTIMIZATION AND OPERATIONS RESEARCH, DOOR 2016, 2016, 9869 : 220 - 232
  • [6] A Branch-and-Cut Algorithm for the Minimum Energy Symmetric Connectivity Problem in Wireless Networks
    Li, Xiangyong
    Aneja, Y. P.
    [J]. COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PROCEEDINGS, 2009, 5573 : 494 - 506
  • [7] Local Optima Networks and the Performance of Iterated Local Search
    Daolio, Fabio
    Verel, Sebastien
    Ochoa, Gabriela
    Tomassini, Marco
    [J]. PROCEEDINGS OF THE FOURTEENTH INTERNATIONAL CONFERENCE ON GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2012, : 369 - 376
  • [8] An iterated local search algorithm for the minimum differential dispersion problem
    Zhou, Yangming
    Hao, Jin-Kao
    [J]. KNOWLEDGE-BASED SYSTEMS, 2017, 125 : 26 - 38
  • [9] Power Efficient Range Assignment for Symmetric Connectivity in Static Ad Hoc Wireless Networks
    E. Althaus
    G. Călinescu
    I. I. Măndoiu
    S. Prasad
    N. Tchervenski
    A. Zelikovsky
    [J]. Wireless Networks, 2006, 12 : 287 - 299
  • [10] Power efficient range assignment for symmetric connectivity in static ad hoc wireless networks
    Althaus, E.
    Calinescu, G.
    Mandoiu, I. I.
    Prasad, S.
    Tchervenski, N.
    Zelikovsky, A.
    [J]. WIRELESS NETWORKS, 2006, 12 (03) : 287 - 299
12345