Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Younis, M., Akkaya, K.: Strategies and techniques for node placement in wireless sensor networks: A survey. Elsevier Ad Hoc Network Journal 6(4), 621–655 (2008)
Mitchell, M.: Computation in cellular automata: A selected review. In: Non-Standard Computation. John Wiley & Sons, Inc., New York (1997)
Chen, J., Koutsoukos, X.: Survey on coverage problems in wireless ad hoc sensor networks. In: IEEE SouthEastCon, Richmond, VA (March 2007)
Torbey, S.: Towards a framework for intuitive programming of cellular automata. Parallel Processing Letters 19(01), 73 (2009)
Wolfram, S.: A New Kind of Science, 1st edn. Wolfram Media (May 2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Torbey, S., Akl, S.G. (2012). Reliable Node Placement in Wireless Sensor Networks Using Cellular Automata. In: Durand-Lose, J., Jonoska, N. (eds) Unconventional Computation and Natural Computation. UCNC 2012. Lecture Notes in Computer Science, vol 7445. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32894-7_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-32894-7_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32893-0
Online ISBN: 978-3-642-32894-7
eBook Packages: Computer ScienceComputer Science (R0)