Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Bozapalidis, S., Kalampakas, A.: Graph automata. Theor. Comput. Sci 393(1–3), 147–165 (2008). https://doi.org/10.1016/j.tcs.2007.11.022
Cardei, I., Cardei, M.: Energy-efficient connected-coverage in wireless sensor networks. IJSNet 3(3), 201–210 (2008). https://doi.org/10.1504/IJSNET.2008.018487
Erdelj, M., Loscrì, V., Natalizio, E., Razafindralambo, T.: Multiple point of interest discovery and coverage with mobile wireless sensors. Ad Hoc Netw. 11(8), 2288–2300 (2013). https://doi.org/10.1016/j.adhoc.2013.04.017
Halton, J.H.: Algorithm 247: radical-inverse quasi-random point sequence. Commun. ACM 7(12), 701–702 (1964). https://doi.org/10.1145/355588.365104
Tian, D., Georganas, N.D.: A coverage-preserving node scheduling scheme for large wireless sensor networks. In: Proceedings of the First ACM International Workshop on Wireless Sensor Networks and Applications (WSNA 2002), pp. 32–41. ACM Press (2002). https://doi.org/10.1145/570738.570744
Tretyakova, A., Seredynski, F.: Application of evolutionary algorithms to maximum lifetime coverage problem in wireless sensor networks. In: IPDPS Workshops, pp. 445–453. IEEE (2013). https://doi.org/10.1109/IPDPSW.2013.96
Tretyakova, A., Seredynski, F.: Simulated annealing application to maximum lifetime coverage problem in wireless sensor networks. In: Global Conference on Artificial Intelligence, GCAI, vol. 36, pp. 296–311. EasyChair (2015)
Tretyakova, A., Seredynski, F., Bouvry, P.: Graph cellular automata approach to the maximum lifetime coverage problem in wireless sensor networks. Simulation 92(2), 153–164 (2016). https://doi.org/10.1177/0037549715612579
Wu, A.Y., Rosenfeld, A.: Cellular graph automata I and II. Inf. Control 42, 305–353 (1979). https://doi.org/10.1016/S0019-9958(79)90288-2
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Trojanowski, K., Mikitiuk, A., Napiorkowski, K.J.M. (2018). Application of Local Search with Perturbation Inspired by Cellular Automata for Heuristic Optimization of Sensor Network Coverage Problem. In: Wyrzykowski, R., Dongarra, J., Deelman, E., Karczewski, K. (eds) Parallel Processing and Applied Mathematics. PPAM 2017. Lecture Notes in Computer Science(), vol 10778. Springer, Cham. https://doi.org/10.1007/978-3-319-78054-2_40
Download citation
DOI: https://doi.org/10.1007/978-3-319-78054-2_40
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-78053-5
Online ISBN: 978-3-319-78054-2
eBook Packages: Computer ScienceComputer Science (R0)