It is important to maximize network lifetime while meeting coverage requirements in Wireless Sensor Networks (WSN). This paper focuses on maximizing the network lifetime of barrier coverage in WSN with mobile sensors. For mobile sensors, movement energy consumption can be much higher than during sensing and communication. Since the battery capacity of the sensor is fixed, more energy can be used for sensing and communication if the movement distance required to build the barrier can be reduced. Therefore, we focus on reducing the movement distance required by the mobile sensors to build the barriers. Also, we can build as many barriers as possible if we use as few mobile sensors as possible to build a barrier. By rotating multiple barriers, we can further extend the lifetime of the network. Based on the above concept, an energy-efficient algorithm is proposed for building barriers in WSNs with mobile sensors. The contribution of this paper are: (1) We find the minimum number of sensors required to construct a barrier for a rectangular region. (2) We explain how to cluster the sensors in the region, and then calculate the linear equations of the barriers based on the results of the clustering. (3) We explain how to set the sojourn points for these linear equations of the barriers, and then assign the mobile sensors to every one of these sojourn points. In short, the proposed algorithm can construct multiple barriers depending on the location of the sensor, with a minimum number of sensors connecting the left and right boundaries of the target field. Finally, the simulation results show that the proposed algorithm has better performance in terms of network lifetime than the previous result.

在满足无线传感器网络 (WSN) 的覆盖要求的同时最大限度地延长网络寿命非常重要。本文的重点是利用移动传感器最大化 WSN 中障碍物覆盖的网络寿命。对于移动传感器，运动能量消耗可能比传感和通信期间高得多。由于传感器的电池容量是固定的，如果可以减少搭建屏障所需的移动距离，则可以将更多的能量用于传感和通信。因此，我们专注于减少移动传感器构建障碍所需的移动距离。此外，如果我们使用尽可能少的移动传感器来构建屏障，我们就可以构建尽可能多的屏障。通过旋转多个障碍，我们可以进一步延长网络的生命周期。基于以上概念，提出了一种节能算法，用于在具有移动传感器的 WSN 中建立障碍。本文的贡献是：（1）我们找到了为矩形区域构建屏障所需的最小传感器数量。(2) 我们解释了如何对区域内的传感器进行聚类，然后根据聚类结果计算障碍物的线性方程。(3) 我们解释了如何为这些障碍的线性方程设置逗留点，然后将移动传感器分配给这些逗留点中的每一个。简而言之，所提出的算法可以根据传感器的位置构建多个屏障，连接目标场的左右边界的传感器数量最少。最后，