Covering the Space with Sensor Tiles

DOI10.1007/978-3-030-69480-7_16MaRDI QIDQ6487182zbMATH OpenFDO

Authors Rolf Hoffmann, Franciszek Seredynski

Publication date 24 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-69480-7_16

Mathematics Subject Classification ID

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

Recommendations

• Cellular automata rules solving the wireless sensor network coverage problem
• Cellular automaton based motion planning algorithms for mobile sensor networks
• On the number and arrangement of sensors for the multiple covering of bounded plane domains
• Sensor networks and covering of plane by discs
• Covering a planar region by randomly distributed sensors

Cites work

• Covering Problems
• Experimental analysis of approximation algorithms for the vertex cover and set covering problems
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Parallel Substitution Algorithm
• Towards Self-organizing Sensor Networks: Game-Theoretic \epsilon -Learning Automata-Based Approach

Cited in

(1)

• Cellular automata rules solving the wireless sensor network coverage problem

This page was built for publication: Covering the Space with Sensor Tiles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487182)