Abstract
We develop a set of probabilistic and deterministic cellular automaton based algorithms for an optimization problem of mobile wireless sensor networks (MWSN). We consider a scenario where the sensors are initially randomly distributed and the mobile sensors need to disperse autonomously to both maximize coverage of the network and to maintain connectivity. We perform extensive simulations of both deterministic and randomized variants of the algorithm and argue that randomized algorithms have better overall performance. Cellular automaton algorithms rely only on local information about the network and, hence, they can be used in practice for MWSN problems. On the other hand, locality of the algorithm implies that maintaining connectivity becomes a non-trivial problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Choudhury, S., Akl, S., Salomaa, K.: Energy efficient cellular automaton based algorithms for mobile wireless sensor networks. In: 2012 IEEE Wireless Communications and Networking Conference (WCNC 2012), Paris, France, April 1-4, pp. 2341–2346 (2012)
Choudhury, S., Salomaa, K., Akl, S.: A cellular automaton model for connectivity preserving deployment of mobile wireless sensors. In: 2nd IEEE International Workshop on Smart Communication Protocols and Algorithms (ICC 2012 WS - SCPA), Ottawa, Canada, June 10-15, pp. 6643–6647 (2012)
Cortes, J., Martinez, S., Karatas, T., Bullo, F.: Coverage control for mobile sensing networks. IEEE Transactions on Robotics and Automation 20(2), 243–255 (2004)
Garzon, M.: Models of massive parallelism, Analysis of cellular automata and neural networks. Texts in Theoretical Computer Science. Springer (1995)
Heo, N., Varshney, P.: A distributed self spreading algorithm for mobile wireless sensor networks. In: 2003 IEEE Wireless Communications and Networking, WCNC 2003, vol. 3, pp. 1597–1602 (March 2003)
Huang, G.: Casting the wireless sensor net. Technology Reviw-Manchester NH 106(6), 50–57 (2003)
Kar, K., Banerjee, S.: Node placement for connected coverage in sensor networks. In: Proceedings of WiOpt, vol. 3 (2003)
Liu, B., Brass, P., Dousse, O., Nain, P., Towsley, D.: Mobility improves coverage of sensor networks. In: Proceedings of the 6th ACM International Symposium on Mobile ad Hoc Networking and Computing, MobiHoc 2005, pp. 300–308 (2005)
Munir, S.A., Ren, B., Jiao, W., Wang, B., Xie, D., Ma, J.: Mobile wireless sensor network: Architecture and enabling technologies for ubiquitous computing. In: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops, AINAW 2007, vol. 02, pp. 113–120 (2007)
Poduri, S., Sukhatme, G.: Constrained coverage for mobile sensor networks. In: 2004 IEEE International Conference on Robotics and Automation, April 26-May 1, vol. 1, pp. 165–171 (2004)
Torbey, S.: Towards a framework for intuitive programming of cellular automata. M.Sc thesis, School of Computing, Queen’s University (2007)
Wang, Y., Tseng, Y.: Distributed deployment schemes for mobile wireless sensor networks to ensure multilevel coverage. IEEE Transactions on Parallel and Distributed Systems 19(9), 1280–1294 (2008)
Wiedermann, J., Petrů, L.: On the universal computing power of amorphous computing systems. Theory of Computing Systems 45, 995–1010 (2009)
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
Choudhury, S., Salomaa, K., Akl, S.G. (2012). Cellular Automaton Based Motion Planning Algorithms for Mobile Sensor Networks. In: Dediu, AH., Martín-Vide, C., Truthe, B. (eds) Theory and Practice of Natural Computing. TPNC 2012. Lecture Notes in Computer Science, vol 7505. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33860-1_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-33860-1_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33859-5
Online ISBN: 978-3-642-33860-1
eBook Packages: Computer ScienceComputer Science (R0)