Application of Local Search with Perturbation Inspired by Cellular Automata for Heuristic Optimization of Sensor Network Coverage Problem

被引：4

作者：

Trojanowski, Krzysztof ^{[1
]}

Mikitiuk, Artur ^{[1
]}

Napiorkowski, Krzysztof J. M. ^{[1
]}

机构：

[1] Cardinal Stefan Wyszynski Univ Warsaw, Warsaw, Poland

来源：

PARALLEL PROCESSING AND APPLIED MATHEMATICS (PPAM 2017), PT II | 2018年 / 10778卷

关键词：

Local search; Sensor networks; Maximum Lifetime Coverage Problem; Cellular automata; POINT;

D O I：

10.1007/978-3-319-78054-2_40

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

A cellular automata inspired approach to the problem of effective energy management in a sensor network is presented. The network consisting of a set of sensors is disseminated over an area where a number of points of interest (POI) is localized. The aim is to maximize the time when a sufficient number of POIs is monitored by active sensors. A schedule of sensor activity over time is a solution of this problem. A new heuristic algorithm inspired by a cellular automata engine is proposed. It searches for such schedules maximizing the lifetime of the sensor network. We also present a set of test cases for experimental evaluation of our approach. The proposed algorithm is experimentally tested using these test cases and the obtained results are statistically verified to prove significant contribution of the algorithm components.

引用

页码：425 / 435

页数：11

共 9 条

[1] [Anonymous], 2015, GLOBAL C ARTIFICIAL
[2] Graph automata
Bozapalidis, Symeon
Kalampakas, Antonios
[J]. THEORETICAL COMPUTER SCIENCE, 2008, 393 (1-3) : 147 - 165
[3] Cardei Ionut, 2008, International Journal of Sensor Networks, V3, P201, DOI 10.1504/IJSNET.2008.018484
[4] Multiple point of interest discovery and coverage with mobile wireless sensors
Erdelj, Milan
Loscri, Valeria
Natalizio, Enrico
Razafindralambo, Tahiry
[J]. AD HOC NETWORKS, 2013, 11 (08) : 2288 - 2300
[5] ALGORITHM-247 - RADICAL-INVERSE QUASI-RANDOM POINT SEQUENCE [G5]
HALTON, JH
SMITH, GB
[J]. COMMUNICATIONS OF THE ACM, 1964, 7 (12) : 701 - 702
[6] Tian D., 2002, P 1 ACM INT WORKSH W, P32, DOI DOI 10.1145/570738.570744
[7] Tretyakova Antonina, 2013, 2013 IEEE International Symposium on Parallel and Distributed Processing, Workshops and PhD Forum (IPDPSW), P445, DOI 10.1109/IPDPSW.2013.96
[8] Graph Cellular Automata approach to the Maximum Lifetime Coverage Problem in wireless sensor networks
Tretyakova, Antonina
Seredynski, Franciszek
Bouvry, Pascal
[J]. SIMULATION-TRANSACTIONS OF THE SOCIETY FOR MODELING AND SIMULATION INTERNATIONAL, 2016, 92 (02): : 153 - 164
[9] CELLULAR GRAPH AUTOMATA .1. BASIC CONCEPTS, GRAPH PROPERTY MEASUREMENT, CLOSURE PROPERTIES
WU, A
ROSENFELD, A
[J]. INFORMATION AND CONTROL, 1979, 42 (03): : 305 - 329

← 1 →