Authors: Zaixin Lu; Weili Wu; Wei Wayne Li
Addresses: Department of Mathematics and Computer Science, Marywood University, Scranton, PA 18505, USA ' Department of Computer Science, University of Texas at Dallas, Richardson, TX 75083, USA ' Department of Computer Science, Texas Southern University, Houston, TX 77004, USA
Abstract: Wireless sensor networks (WSNs) have applications in many areas, such as biomedical observation, environmental monitoring, and battlefield surveillance. In order to reduce costs and improve reliability, target coverage has been an important problem for WSNs in recent years. In this paper, we investigate target coverage for a special kind of WSNs, called directional sensor networks, in which the sensors have limited monitoring distance and coverage angle. Given a set of targets and a set of sensors, we investigate how to assign proper directions for the sensors such that the number of covered targets is maximised. We show that it is NP-hard to find an optimal solution and we investigate both centralised and distributed approximation algorithms with provable performance guarantee. In addition, we analyse the problem itself from the combinatorics' point of view. Finally we also conduct a simulation experiment to evaluate the practical performance of proposed algorithms.
Keywords: WSN; wireless sensor network; directional cover; target coverage maximisation; distributed algorithm; approximation algorithm.
International Journal of Sensor Networks, 2017 Vol.24 No.4, pp.253 - 263
Received: 08 Nov 2015
Accepted: 27 Nov 2015
Published online: 21 Aug 2017 *