Cellular Automaton Based Motion Planning for Mobile Wireless Sensor Networks

Show simple item record

dc.contributor.author Munir, Ahnaf
dc.contributor.author Shihabuzzaman
dc.date.accessioned 2021-01-13T10:09:29Z
dc.date.available 2021-01-13T10:09:29Z
dc.date.issued 2015-11-15
dc.identifier.citation [1] G. Huang, “Casting the wireless sensor net”, Technol. Rev. (Manchester, NH) 106, pp. 50–57., 2003. [2] B. Liu, P. Brass, O. Dousse, P. Nain, and D. Towsley, “Mobility improves coverage of sensor networks, in Proceedings of the 6th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc’ 05”, University of Illinois at Urbana–Champaign, Urbana, IL, ACM, IL, USA, 2005, pp. 300–308. [3] S.A. Munir, B. Ren, W. Jiao, B. Wang, D. Xie, and J. Ma “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 ’07), IEEE, Niagara Falls, Ontario, Canada, Vol. 2, 2007, pp. 113–120. [4] Banerjee, S. Das, H. Rahaman, and B. Sikdar, “CA based sensor node management scheme: An energy efficient approach, in International Conference on Wireless Communications”, Networking and Mobile Computing, 2007 (WiCom 2007), IEEE, hanghai, China, 2007, pp. 2795–2798. [5] Y. Baryshnikov, E. Coffman, and K. Kwak, “High performance sleep–wake sensor systems based on cyclic cellular automata”, in International Conference on Information Processing in Sensor Networks, 2008 (IPSN’08), IEEE, St. Louis, Missouri, USA, 2008, pp. 517–526. [6] S. Choudhury, K. Salomaa, and S.G. Akl, “A cellular automaton model for wireless sensor networks”, J. Cell. Autom 7 (2012), pp. 223–241. [7] R.O. Cunha, A.P. Silva, A.A.F. Loreiro, and L.B. Ruiz, “Simulating large wireless sensor networks using cellular automata”, in Proceedings of the 38th Annual Simulation Symposium, 2005, IEEE,Washington, DC, USA, 2005, pp. 323–330. 29 Bibliography 30 [8] M. Esnaashari and M. Meybodi, “A cellular learning automata based clustering algorithm for wireless sensor networks”, Sens. Lett. 6 (2008), pp. 723–735. [9] M. Garzon, “Analysis of Cellular Automata and Neural Networks”, Texts in Theoretical Computer Science, Springer-Verlag, London, UK, 1995. [10] Sami Torbey, Selim G. Akl, “Reliable Node Placement in Wireless Sensor Networks Using Cellular Automata”, 11th International Conference, WCNC 2012, Orléan, France, September 3-7, 2012. [11] Salimur Choudhury, Kai Salomaa, and Selim G. Akl, “Cellular Automaton Based Motion Planning Algorithms for Mobile Sensor Networks ”, In Proceedings of the First International Conference, TPNC 2012, Tarragona, Spain, October 2-4, 2012. [12] Salimur Choudhury, Kai Salomaa and Selim G. Akl, “Cellular Automaton Based Algorithms for the Dispersion of Mobile Wireless Sensor Networks ”, International Journal of Parallel, Emergent and Distributed Systems 2014, 29:2, 147-177 [13] K.J.J. Kumar, K.C.K. Reddy, and S. Salivahanan, “Novel and efficient cellular automata based symmetric key encryption algorithm for wireless sensor networks ”, Int. J. Comput. Appl. 13(4) (2011), pp. 30–37. [14] K. Kwak, “Minimalist detection and counting protocols in wireless sensor networks ”, Columbia University, 2008, ISBN 9780549860716 [15] W. Li, A. Zomaya, and A. Al-Jumaily, “Cellular automata based models of wireless sensor networks ”, in Proceedings of the 7th ACM International Symposium on Mobility Management and Wireless Access, ACM Digital Library, Tenerife, Canary Islands, Spain, 2009, pp. 1–6. [16] Sang-Ki Ko, Hwee Kim, and Yo-Sub Han “A CA Model for Target Tracking in Distributed Mobile Wireless Sensor Network ”, in Proceedings of the 13th International Conference on Control, Automation and Systems (ICCAS), Gwangju, Korea, 2013, pp. 1356 - 1361 en_US
dc.identifier.uri http://hdl.handle.net/123456789/789
dc.description Supervised by Prof. Dr. Muhammad Mahbub Alam, Department of Computer Science and Engineering, Islamic University of Technology en_US
dc.description.abstract Mobile Wireless Sensor Networks (MWSN) is an ad-hoc network that comprises of a large number of sensors. The sensors usually have limited sensing and communication capabilities. Recent times has seen a rapid development in MWSN technology which has resulted in its increasing application and transformed this sector into an important field of research. Mobility is a key factor in the implementation of MWSN. After being deployed in the environment the sensors need to move around to increase the coverage of the network while maintaining connectivity. This movement is done by the individual sensors based on local information. The use of local information means that Cellular Automaton (CA) is suitable for developing motion planning algorithms for MWSN. CA is a biologically inspired discrete model. Although there are works that have used CA for developing motion planning algorithm for MWSN they mostly used square grids which is not a good representation of the actual MWSN model. In this paper we develop a set of probabilistic and deterministic cellular automaton (CA)-based algorithms for motion planning problems in MWSNs for hexagonal grid. We consider scenarios where sensors are either explicitly or randomly placed in the environment and they need to disperse to maximize the covered area and also maintain connectivity. We conduct simulations for both the deterministic and probabilistic models and find that the probabilistic model yield better results.. . . en_US
dc.language.iso en en_US
dc.publisher Department of Computer Science and Engineering, Islamic University of Technology, Gazipur, Bangladesh en_US
dc.title Cellular Automaton Based Motion Planning for Mobile Wireless Sensor Networks en_US
dc.type Thesis en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search IUT Repository


Advanced Search

Browse

My Account

Statistics