关键词: 无线传感网络, 有向性传感器, 贡献度, 贪心算法

Abstract: Coverage problem is one of the most fundamental problems in wireless sensor networks since it reflects the sensing quality. The present studys mostly concentrates in Omni-directional sensors which is not suitable in many applications such as video surveillance systems consisting of directional video sensors. This paper present a new (k,ω)-angle coverage problem which study directional sensors deployment. The goal is to deploy minimal number of sensors to k-angle cover all the targets. It present a greedy algorithm to solve this problem. For this algorithm, it 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 this algorithm.

Key words: Wireless Sensor Network (WSN), directional sensor, contribution, greedy algorithm