Physarum Optimization: A Biology-Inspired Algorithm for the Steiner Tree Problem in Networks

被引:207
作者
Liu, Liang [1 ]
Song, Yuning [1 ]
Zhang, Haiyang [1 ]
Ma, Huadong [1 ]
Vasilakos, Athanasios V. [2 ]
机构
[1] Beijing Univ Posts & Telecommun, Beijing Key Lab Intelligent Telecommun Software &, Beijing 100876, Peoples R China
[2] Univ Western Macedonia, Dept Comp & Telecommun Engn, Kozani 14671, Greece
基金
中国国家自然科学基金;
关键词
Biology-inspired computing; Steiner tree problem; physarum optimization; minimal exposure problem; network design; WIRELESS SENSOR NETWORKS; APPROXIMATION ALGORITHMS; ADAPTATION; SYSTEMS; COLONY;
D O I
10.1109/TC.2013.229
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Using insights from biological processes could help to design new optimization techniques for long-standing computational problems. This paper exploits a cellular computing model in the slime mold physarum polycephalum to solve the Steiner tree problem which is an important NP-hard problem in various applications, especially in network design. Inspired by the path-finding and network formation capability of physarum, we develop a new optimization algorithm, named as the physarum optimization, with low complexity and high parallelism. To validate and evaluate our proposed models and algorithm, we further apply the physarum optimization to the minimal exposure problem which is a fundamental problem corresponding to the worst-case coverage in wireless sensor networks. Complexity analysis and simulation results show that our proposed algorithm could achieve good performance with low complexity. Moreover, the core mechanism of our physarum optimization also may provide a useful starting point to develop some practical distributed algorithms for network design.
引用
收藏
页码:819 / U14
页数:14
相关论文
共 53 条
[1]  
Adamatzky A., 2010, Physarum Machines: Computers From Slime Mould vol 74
[2]   A Biological Solution to a Fundamental Distributed Computing Problem [J].
Afek, Yehuda ;
Alon, Noga ;
Barad, Omer ;
Hornstein, Eran ;
Barkai, Naama ;
Bar-Joseph, Ziv .
SCIENCE, 2011, 331 (6014) :183-185
[3]   Wireless sensor networks: a survey [J].
Akyildiz, IF ;
Su, W ;
Sankarasubramaniam, Y ;
Cayirci, E .
COMPUTER NETWORKS, 2002, 38 (04) :393-422
[4]   Placement and routing for performance-oriented FPGA layout [J].
Alexander, MJ ;
Cohoon, JP ;
Ganley, JL ;
Robins, G .
VLSI DESIGN, 1998, 7 (01) :97-110
[5]  
[Anonymous], 1996, CS9606 U VIRG
[6]  
[Anonymous], 2008, INT J UNCONVENTIONAL
[7]   IMPROVED APPROXIMATIONS FOR THE STEINER TREE PROBLEM [J].
BERMAN, P ;
RAMAIYER, V .
JOURNAL OF ALGORITHMS, 1994, 17 (03) :381-408
[8]   Physarum can compute shortest paths [J].
Bonifaci, Vincenzo ;
Mehlhorn, Kurt ;
Varma, Girish .
JOURNAL OF THEORETICAL BIOLOGY, 2012, 309 :121-133
[9]  
Cheng X., 2001, Steiner trees in Industry
[10]   Minimizing ISP Network Energy Cost: Formulation and Solutions [J].
Chiaraviglio, Luca ;
Mellia, Marco ;
Neri, Fabio .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2012, 20 (02) :463-476