Cellular automata rules solving the wireless sensor network coverage problem

DOI10.1007/s11047-022-09888-0zbMath1530.68166OpenAlexW4283034165MaRDI QIDQ6137191

Franciszek Seredyński, Dominique Désérable, Rolf Hoffmann

Publication date: 1 September 2023

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-022-09888-0

zbMATH Keywords

circulant graphswireless sensor networkcoverage problemprobabilistic cellular automataasynchronous updatingmatching templatesvon Neumann neighborhoods

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Discrete location and assignment (90B80) Cellular automata (computational aspects) (68Q80) Wireless sensor networks as related to computer science (68M18)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Observability of affine cellular automaton through mobile sensors
• Modeling hexagonal constellations with Eisenstein-Jacobi graphs
• A family of Cayley graphs on the hexavalent grid
• Experimental analysis of approximation algorithms for the vertex cover and set covering problems
• Circulants and their connectivities
• Parallel Substitution Algorithm
• Covering Problems
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Towards Self-organizing Sensor Networks: Game-Theoretic $$\epsilon $$ -Learning Automata-Based Approach

This page was built for publication: Cellular automata rules solving the wireless sensor network coverage problem