A Distributed Homological based Sensor Selection and Scheduling in Wireless Sensor Networks
Marzieh Varposhti · Research Square · 2023
Abstract One of the fundamental problems in randomly deployed sensor networks is to enhance the network lifetime along with providing full area coverage. The problem is more challenging when location information is not available. Scheduling the activities of sensor nodes in a way that each point of the area of interest is covered by at least one sensor node is a promising way when a smaller set of sensor nodes is scheduled autonomously. This autonomous sleep scheduling of sensor nodes can be efficiently done based on the topological properties of the sensor network in a distributed fashion. In this paper, we address the problem of autonomous scheduling of sensor nodes for providing full area coverage in wireless sensor networks in a distributed manner when there is no location information available. The goal is to prolong the network lifetime. The proposed method is based on homology. The idea is autonomous selection of the minimum number of active sensors with the highest level of energy based on the properties of the simplicial complex of the network. We formulate this problem as an integer programming problem. Then, we propose a distributed algorithm, which does not require the knowledge of the location of nodes or distance between them. Finally, we provide simulation results demonstrating the performance of the proposed algorithm.