Witnessing broad energy-critical applications of barrier coverage in mobile and wireless sensor networks, emerging practical applications have recently brought a new barrier coverage model which uses sink-based mobile sensors for covering a given barrier with the aim of prolonging the lifespan of the coverage. In the model, a set of sink stations were distributed on the plane in which each sink can emit mobile sensors with an identical radius. The task is to cover a given line barrier with the emitted mobile sensors, aiming to minimize the maximum movement of the sensors so as to prolong the shortest lifespan among the sensors in coverage. In this paper, we first devise an algorithm for optimally solving the problem based on the properties of the structures called movement parity and tangent equilibrium points between the sinks. Then based on a more sophisticated geometric property of optimum solutions, we improve the runtime to a linear runtime O(k) which attains the possibly optimum runtime of the problem for k being the number of sinks. At last, numerical experiments are carried out to demonstrate the practical performance gain of our algorithms against baselines in literature.

中文翻译：

---

线性时间算法，用于计算基于汇的移动传感器的最小-最大移动，用于线障碍覆盖

见证了屏障覆盖在移动和无线传感器网络中的广泛能源关键应用，新兴的实际应用最近带来了一种新的屏障覆盖模型，该模型使用基于接收器的移动传感器覆盖给定的屏障，目的是延长覆盖的寿命。在模型中，一组汇站分布在平面上，其中每个汇可以发射具有相同半径的移动传感器。任务是用发射的移动传感器覆盖给定的线屏障，旨在最大限度地减少传感器的最大移动，从而延长覆盖范围内传感器的最短寿命。在本文中，我们首先设计了一种算法，用于根据称为运动奇偶性和汇之间切线平衡点的结构的属性来优化解决问题。O ( k ) 获得问题的可能最佳运行时间，k是汇的数量。最后，进行了数值实验，以证明我们的算法相对于文献中的基线的实际性能提升。