Scheduling protocols for homogeneous and heterogeneous [formula omitted]-covered wireless sensor networks

Abstract

Sensing coverage is a performance metric that reflects the quality of surveillance of a field by a wireless sensor network. This paper investigates the problem of minimum connected k -coverage in homogeneous and heterogeneous wireless sensor networks, where each point in a field is covered (or sensed) by at least k active nodes while minimizing the necessary total number of active nodes and guaranteeing connectivity between them. First, we study the case of homogeneous nodes to gain some insights on how to address the problem of k -coverage using heterogeneous nodes. Our methodology to solve the minimum connected k -coverage problem consists of two main phases: sensing range slicing and active node scheduling. The goal of the slicing phase is to decompose the sensing range of a sensor node into smaller, congruent regions such that each of them is guaranteed to be k -covered when exactly k nodes are deployed in it. The purpose of the scheduling phase is to specify which nodes turn on (or become active), how, and when. In this paper, we propose two k -coverage protocols using different scheduling approaches. In the first protocol, called self-scheduling driven k-coverage, each sensor node turns itself on based on the local information it has about its sensing neighbors in order to k -cover its sensing range. The second protocol, called triggered-scheduling driven k - coverage, allows a sensor node to trigger a necessary number of its sensing neighbors to become active in order to achieve k -coverage of its sensing range. Then, to promote the use of self-scheduling driven k -coverage and triggered-scheduling driven k -coverage in real-world sensing applications, we show how to relax some commonly used assumption for coverage configuration protocols in wireless sensor networks. More specifically, we discuss a more general framework, where the nodes are heterogeneous in terms of their sensing ranges. Precisely, we propose two protocols for k -coverage using heterogeneous nodes and generalize them by considering convex sensing and communication models. Simulation results show that triggered-scheduling driven k -coverage outperforms self-scheduling driven k -coverage with regard to the number of nodes required for connected k -coverage configuration as well as the network lifetime. We find that self-scheduling driven k -coverage outperforms an existing connected k -coverage protocol for wireless sensor networks. Also, we find that heterogeneity has a positive impact on our k -coverage protocol performance.