An artificial bee colony algorithm for data collection path planning in sparse wireless sensor networks

被引：53

作者：

Chang, Wei-Lun ^{[1
,2
]}

Zeng, Deze ^{[1
]}

Chen, Rung-Ching ^{[2
]}

Guo, Song ^{[1
]}

机构：

[1] Univ Aizu, Sch Comp Sci & Engn, Aizu Wakamatsu, Fukushima, Japan

[2] Choayang Univ Technol, Dept Informat Management, Taichung, Taiwan

来源：

INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS | 2015年 / 6卷 / 03期

关键词：

Sparse wireless sensor network; Artificial bee colony algorithm; Traveling salesman problem with neighborhoods; APPROXIMATION ALGORITHMS; NEIGHBORHOODS; TSP;

D O I：

10.1007/s13042-013-0195-z

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

In sparse wireless sensor networks, a mobile robot is usually exploited to collect the sensing data. Each sensor has a limited transmission range and the mobile robot must get into the coverage of each sensor node to obtain the sensing data. To minimize the energy consumption on the traveling of the mobile robot, it is significant to plan a data collection path with the minimum length to complete the data collection task. In this paper, we observe that this problem can be formulated as traveling salesman problem with neighborhoods, which is known to be NP-hard. To address this problem, we apply the concept of artificial bee colony (ABC) and design an ABC-based path planning algorithm. Simulation results validate the correctness and high efficiency of our proposal.

引用

页码：375 / 383

页数：9

共 19 条

[1] APPROXIMATION ALGORITHMS FOR THE GEOMETRIC COVERING SALESMAN PROBLEM [J].

ARKIN, EM ;

HASSIN, R .

DISCRETE APPLIED MATHEMATICS, 1994, 55 (03) :197-218

[2]

Chiu KM, 2011, 2011 IEEE WORKSHOP ON MERGING FIELDS OF COMPUTATIONAL INTELLIGENCE AND SENSOR TECHNOLOGY (COMPSENS), P42, DOI 10.1109/MFCIST.2011.5949511

[3]

Comarela G., 2011, GECCO COMPANION, P599

[4] TSP with neighborhoods of varying size [J].

de Berg, M ;

Gudmundsson, J ;

Katz, MJ ;

Levcopoulos, C ;

Overmars, MH ;

van der Stappen, AF .

JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2005, 57 (01) :22-36

[5]

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

[6]

Dorigo M., 2004, Ant colony optimization

[7]

Elbassioni K, 2005, LECT NOTES COMPUT SC, V3580, P1115

[8] A modified artificial bee colony algorithm [J].

Gao, Wei-feng ;

Liu, San-yang .

COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (03) :687-697

[9] The travelling salesman problem with neighbourhoods: MINLP solution [J].

Gentilini, Iacopo ;

Margot, Francois ;

Shimada, Kenji .

OPTIMIZATION METHODS & SOFTWARE, 2013, 28 (02) :364-378

[10]

Karaboga D, 2008, APPL SOFT COMPUT, V8, P687, DOI 10.1016/j.asoc.2007.05.007

← 1 2 →