Mission-Oriented k-Coverage in Mobile Wireless Sensor Networks

Abstract

AbstractThe problem of sensor deployment to achieve k-coverage of a field, where every point is covered by at least k sensors, is very critical in the design of energy-efficient wireless sensor networks (WSNs). It becomes more challenging in mission-oriented WSNs, where sensors have to move in order to k-cover a region of interest in the field. In this paper, we consider the problem of k-coverage in mission-oriented mobile WSNs which we divide into two sub-problems, namely sensor placement and sensor selection. The sensor placement problem is to identify a subset of sensors and their locations in a region of interest so it is k-covered with a minimum number of sensors. The sensor selection problem is to determine which sensors should move to the above-computed locations in the region while minimizing the total energy consumption due to sensor mobility and communication. Simulation results show that our solution to the k-coverage problem in mission-oriented mobile WSNs outperforms an existing one in terms of the number of sensors needed to achieve k-coverage of a region of interest in the field as well as their total energy consumption.KeywordsMission-oriented k-coverageplacementselectionmobility