Constructing belt-barrier providing β-quality of monitoring with minimum camera sensors

A wireless sensor network is said to form a belt-barrier for a region if it is able to detect any object moving from outside the region to inside. Recently, Cheng and Tsai found if camera sensors are used to form a belt-barrier, the breadth of the barrier becomes an important quality factor to ensure high quality of monitoring (QoM). Then, they proposed the minimum β-breadth belt-barrier construction problem ((β, 1)-B³CP) whose goal is to select a minimum number of camera sensors to form a β-breadth belt-barrier, which ensures the width of the picture of any object which moves through the barrier is at least β. In this paper, we perform more thorough investigation of the problem and introduce a new polynomial time exact algorithm for the problem under the assumption that the angle of each camera is fixed. Our simulation result shows our algorithm outperforms Cheng and Tsai´s algorithm. We also introduce a variation of (β, 1)-B³CP, namely (β, k)-B³CP, which aims to construct k node-disjoint β-breadth belt-barrier for fault-tolerance purpose, propose a new heuristic algorithm for it, and conduct simulations to evaluate its performance.