Local maximum lifetime algorithms for strong k-barrier coverage with cooridnated sensors

Barrier coverage is known to be an appropriate model of coverage for movement detection and boundary guard, which is achieved by barriers of sensors. This paper focuses on local algorithms for strong k-barrier coverage based on detection coverage model. We first formalize a coordinated detection coverage model, where the data fusion rule is described by a general function. Then, we analyze the influencing factors of barrier coverage lifetime, and transfer it to a multiobjective optimization problem. Moreover, we propose a new Divide-and-Conquer scheme. Based on it, we design a new local maximal lifetime algorithm and following protocol for strong k-barrier with coordinated sensors. Simulations that the new algorithm provides effective enhancement in network lifetime, it outperforms RIS by up to 4.34 times and surpasses LBCP by 5 time units.