A Distributed Homological Approach to Location-Independent Area Coverage in Wireless Sensor Networks
Area coverage is one of the fundamental problems in wireless sensor networks. The main objective is to minimize the number of active sensors to conserve energy consumption, while complete area coverage is achieved. Some of the existing solutions are based on the location information of sensors which are not applicable to scenarios where GPS modules are not available and there is no reliable location information of sensors. In this paper, we present a distributed homological sensor selection algorithm, namely DHSS, to select the least number of sensors to cover the entire area in the case that no location information is available. We consider the Rips complex of the network and formulate the selection problem as an optimization problem. DHSS tries to find the least number of 2-simplices of the Rips complex of the network to cover the entire area in a distributed manner. Finally, we evaluate the performance of the proposed algorithm by conducting simulation experiments.
homology area coverage wireless sensor networks sensor selection