Abstract
Coverage problem is one of the most fundamental problems in wireless sensor networks since it reflects the sensing quality of a sensor network. Several coverage problems have been studied for different applications such as [1], [2] studies the coverage problem, and [12] discussed the barrier coverage problems. However, these works assume the sensor has Omni-directional sensing model which is not suitable in many applications such as video surveillance systems consisting of directional video sensors. In this thesis, we study a new coverage problem in wireless sensor networks. The k-angle coverage problem considers the problem using directional sensors which can only cover a limited angle and range. Given a set of targets to be monitored, the goal is to deploy minimal number of sensors to k-angle cover all the targets. We present a greedy algorithm to solve this problem. For this algorithm, we define three contribution functions to determine the location to deploy sensor. The proposed method greedily selects a maximal contribution location to deploy a sensor until the entire targets are k-angle covered. Simulation results exhibit the characteristic and performance of our algorithm. Based on the proposed algorithm, we develop a toolkit for emulating sensor deployment.