Reliable node placement in wireless sensor networks using cellular automata. (English) Zbl 1374.68313
Durand-Lose, Jérôme (ed.) et al., Unconventional computation and natural computation. 11th international conference, UCNC 2012, Orléan, France, September 3–7, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32893-0/pbk). Lecture Notes in Computer Science 7445, 210-221 (2012).
Summary: Wireless sensor networks are often used to provide critical measurements in unattended harsh environments. They should be designed to adequately monitor their surroundings while being resilient to environmental changes. Appropriate sensor node placement greatly influences their capability to perform this task. Cellular automata have properties very similar to those of wireless sensor networks. In this paper, we present a sensor node placement algorithm that runs on a cellular automaton and achieves adequate coverage, connectivity and sparsity while being resilient to changing environmental conditions.
For the entire collection see [Zbl 1250.68024].
For the entire collection see [Zbl 1250.68024].
MSC:
68Q80 | Cellular automata (computational aspects) |
68R10 | Graph theory (including graph drawing) in computer science |