Abstract
The objective is to find Cellular Automata (CA) which are able to cover the 2D space by a minimum number of so-called “Sensor Tiles”. A sensor tile consists of a central sensor pixel and 12 surrounding sensing pixels. Two probabilistic CA rules were designed that can perform this task. The first rule evolves very fast stable sub–optimal coverings, starting from a random configuration. The second rule finds several optimal or near-optimal coverings but needs much more time for their evolution.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Snyder, L.V.: Covering problems. In: Foundations of Location Analysis, pp. 109–135. Springer, Boston (2011)
Hakimi, S.L.: Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Oper. Res. 13, 462–475 (1965)
Gomesa, F.C., Menesesb, C.N., Pardalosb, P.M., Vianaa, G.V.R.: Experimental analysis of approximation algorithms for the vertex cover and set covering problems. Comput. Oper. Res. 33, 3520–3534 (2006)
Richter, S., Helmert, M., Gretton, C.: A stochastic local search approach to vertex cover. In: Hertzberg, J., Beetz, M., Englert, R. (eds.) KI 2007. LNCS (LNAI), vol. 4667, pp. 412–426. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-74565-5_31
Church, R.L., ReVelle, C.S.: Theoretical and computational links between the p-median, location set-covering, and the maximal covering location problem. Geograph. Anal. 8(4), 406–415 (1976)
Mehrez, A.: Facility location problems, review, description, and analysis. Geogr. Res. Forum 8, 113–129 (2016)
Thai, M.T., Wang, F., Du, D.H., Jia, X.: Coverage problems in wireless sensor networks: designs and analysis, Int. J. Sens. Netw. 3(3), 191–200 (2008)
Aziz, N.A.A., Aziz, K.A., Ismail, W.Z.W.: Coverage strategies for wireless sensor networks. World Acad. Sci. Eng. Technol. 50, 145–150 (2009)
Moh’d Alia, O., Al-Ajouri, A.: Maximizing wireless sensor network coverage with minimum cost using harmony search algorithm. IEEE Sens. J. 17(3), 882–896 (2017)
Gąsior, J., Seredyński, F., Hoffmann, R.: Towards self-organizing sensor networks: game-theoretic \(\epsilon \)-learning automata-based approach. In: Mauri, G., El Yacoubi, S., Dennunzio, A., Nishinari, K., Manzoni, L. (eds.) ACRI 2018. LNCS, vol. 11115, pp. 125–136. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-99813-8_11
Achasova, S., Bandman, O., Markova, V., Piskunov, S.: Parallel Substitution Algorithm, Theory and Application. World Scientific, Singapore (1994)
Hoffmann, R., Désérable, D., Seredyński, F.: A probabilistic cellular automata rule forming domino patterns. In: Malyshkin, V. (ed.) PaCT 2019. LNCS, vol. 11657, pp. 334–344. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-25636-4_26
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Hoffmann, R., Seredyński, F. (2021). Covering the Space with Sensor Tiles. In: Gwizdałła, T.M., Manzoni, L., Sirakoulis, G.C., Bandini, S., Podlaski, K. (eds) Cellular Automata. ACRI 2020. Lecture Notes in Computer Science(), vol 12599. Springer, Cham. https://doi.org/10.1007/978-3-030-69480-7_16
Download citation
DOI: https://doi.org/10.1007/978-3-030-69480-7_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-69479-1
Online ISBN: 978-3-030-69480-7
eBook Packages: Computer ScienceComputer Science (R0)