Cellular Automaton Based Algorithms for Wireless Sensor Networks
MetadataShow full item record
Wireless sensor networks have been used in different applications due to the advancement of sensor technology. These uses also have raised different optimization issues. Most of the algorithms proposed as solutions to the various optimization problems are either centralized or distributed which are not ideal for these real life applications. Very few strictly local algorithms for wireless sensor networks exist in the literature. In this thesis, we consider some of these optimization problems of sensor networks, for example, sleep-wake scheduling, mobile dispersion, mobile object monitoring, and gathering problems. We also consider the depth adjustment problem of underwater sensor networks. We design cellular automaton based local algorithms for these problems. The cellular automaton is a bioinspired model used to model different physical systems including wireless sensor networks. One of the main advantages of using cellular automaton based algorithms is that they need very little local information to compute a solution. We perform different simulations and analysis and find that our algorithms are efficient in practice.