Area coverage using distributed randomized methods

In this paper, a method is presented to solve distributed coverage using cooperative sensors. These sensors are aware of their surroundings and can act according to their state. Since the capabilities of these sensors are limited a central communication is not possible. Therefore distributed algorithms are provided which can be executed by the sensors independently. These sensors will enter the area through one point and the algorithm has to provide dispersion which will lead to the coverage. In my work several algorithms are presented in order to minimize the number of steps required by the sensors to reach full coverage. To compare these algorithms a simulator is also created which will be able to visualize and test the performance of these methods.