A Bio-Inspired Algorithm for Route Selection in Wireless Sensor Networks

被引：10

作者：

Gao, Cai ^{[1
]}

Yan, Chao ^{[2
,3
]}

Adamatzky, Andrew ^{[4
]}

Deng, Yong ^{[1
]}

机构：

[1] Southwest Univ, Sch Comp & Informat Sci, Chongqing 400715, Peoples R China

[2] Chinese Acad Sci, Comp Network Informat Ctr, Beijing 100190, Peoples R China

[3] Univ Chinese Acad Sci, Beijing 100190, Peoples R China

[4] Univ W England, Unconvent Comp Ctr, Bristol BS16 1QY, Avon, England

来源：

IEEE COMMUNICATIONS LETTERS | 2014年 / 18卷 / 11期

基金：

中国国家自然科学基金; 国家高技术研究发展计划(863计划);

关键词：

Physarum solver; slime mold; wireless sensor network; shortest path tree; optimization;

D O I：

10.1109/LCOMM.2014.2360523

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

How to determine the optimal communication path in wireless sensor networks (WSNs) is a fundamental problem. In this letter, we formulate the optimal communication path problem and convert it into the shortest path tree (SPT) problem by considering an external base station and sensors as the root node and leaf nodes, respectively. Inspired by a path-finding mathematical model Physarum solver, a novel bio-inspired algorithm is proposed to solve the SPT problem in WSNs. Experimental results demonstrate that the proposed algorithm also has an advantage of adaptivity and performs better than Physarum solver in dynamic small WSNs.

引用

页码：2019 / 2022

页数：4

共 13 条

[1] Slime Mold Solves Maze in One Pass, Assisted by Gradient of Chemo-Attractants [J].

Adamatzky, Andrew .

IEEE TRANSACTIONS ON NANOBIOSCIENCE, 2012, 11 (02) :131-134

[2] Modeling and Simulation Analysis of an Efficient MASNET Routeless Routing Protocol [J].

Alotaibi, Mohammad ;

Soliman, Hamdy .

IEEE COMMUNICATIONS LETTERS, 2013, 17 (12) :2324-2327

[3] Shortest Path Tree Computation in Dynamic Graphs [J].

Chan, Edward P. F. ;

Yang, Yaya .

IEEE TRANSACTIONS ON COMPUTERS, 2009, 58 (04) :541-557

[4]

Dorigo M., 1997, IEEE Transactions on Evolutionary Computation, V1, P53, DOI 10.1109/4235.585892

[5] An amoeboid algorithm for solving linear transportation problem [J].

Gao, Cai ;

Yan, Chao ;

Zhang, Zili ;

Hu, Yong ;

Mahadevan, Sankaran ;

Deng, Yong .

PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2014, 398 :179-186

[6]

Horvath P., 2013, P 22 ICCCN, P1

[7] Optimal rate allocation in wireless networks with delay constraints [J].

Qiu, Fan ;

Bai, Jia ;

Xue, Yuan .

AD HOC NETWORKS, 2014, 13 :282-295

[8] A mathematical model for adaptive transport network in path finding by true slime mold [J].

Tero, Atsushi ;

Kobayashi, Ryo ;

Nakagaki, Toshiyuki .

JOURNAL OF THEORETICAL BIOLOGY, 2007, 244 (04) :553-564

[9] Rules for Biologically Inspired Adaptive Network Design [J].

Tero, Atsushi ;

Takagi, Seiji ;

Saigusa, Tetsu ;

Ito, Kentaro ;

Bebber, Dan P. ;

Fricker, Mark D. ;

Yumiki, Kenji ;

Kobayashi, Ryo ;

Nakagaki, Toshiyuki .

SCIENCE, 2010, 327 (5964) :439-442

[10]

Yang X.S., 2019, Mathematical Foundations of Nature-Inspired Methods

← 1 2 →