A Biology-Based Algorithm to Minimal Exposure Problem of Wireless Sensor Networks

被引:143
作者
Song, Yuning [1 ]
Liu, Liang [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] Kuwait Univ, Dept Comp Sci, Safat 13060, Kuwait
来源
IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT | 2014年 / 11卷 / 03期
基金
中国国家自然科学基金;
关键词
Bio-inspired computing; physarum optimization; minimal exposure problem; steiner problem; wireless sensor networks; STEINER PROBLEM; COVERAGE;
D O I
10.1109/TNSM.2014.2346080
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The Minimal Exposure Problem (MEP), which corresponds to the quality of coverage, is a fundamental problem in wireless sensor networks. This paper exploits a biological model of physarum to design a novel biology-inspired optimization algorithm for MEP. We first formulate MEP and the related models, and then convert MEP into the Steiner problem by discretizing the monitoring field to a large-scale weighted grid. Inspired by the path-finding capability of physarum, we develop a biological optimization solution to find the minimal exposure road-network among multiple points of interest, and present a Physarum Optimization Algorithm (POA). Furthermore, POA can be used for solving the general Steiner problem. Extensive simulations demonstrate that our proposed models and algorithm are effective for finding the road-network with minimal exposure and feasible for the Steiner problem.
引用
收藏
页码:417 / 430
页数:14
相关论文
共 45 条
[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]  
[Anonymous], 2001, PROC 7 ANN INT C MOB
[5]   THE STEINER PROBLEM WITH EDGE LENGTH-1 AND LENGTH-2 [J].
BERN, M ;
PLASSMANN, P .
INFORMATION PROCESSING LETTERS, 1989, 32 (04) :171-176
[6]  
Bokareva T., 2006, Proc. Land Warfare Conf, P1
[7]  
BYRKA J, 2010, P 42 ACM S THEOR COM, P583
[8]  
Cagalj M., 2002, PROC 8 ANN INT C MOB, P172
[9]  
Dijkstra E. W., 2022, Numerische mathematik, P287, DOI [10.1007/BF01386390, DOI 10.1007/BF01386390]
[10]  
Dorigo M., 1999, NEW IDEAS OPTIMIZATI