Deployment Cost Optimal for Composite Event Detection in Heterogeneous Wireless Sensor Networks

Using as few sensor nodes as possible for detecting composite event effectively in large area is a difficult problem, because the composite event contains multiple atomic events which needs many different types of heterogeneous nodes for cooperative monitoring, and the coverage quality would be worse if there are not enough sensor nodes. Most of the traditional methods are focusing on atomic event detection which only needs one type of homogeneous node. Considering the temporal and spatial association, costs and sensing capability of different types of heterogeneous sensor nodes, in this paper, we propose a novel composite event coverage problem with the purpose of minimizing deployment costs subjecting to the constraint of achieving a certain coverage quality, and give a mathematical model for this optimal problem. Then, we propose an exact algorithm and a greedy strategy approximation algorithm to solve this optimization problem. The experimental results and analysis show the performance of the proposed algorithms.