In mobile wireless sensor networks (MWSNs), because the movement of sensors consumes much more power than that in sensing and communication, the problem of scheduling mobile sensors to cover all targets and maintain network connectivity such that the total movement distance of mobile sensors is minimized has received a great deal of attention. However, network design in fact indicates that there are situations (limited budget, sensor failure, or obstacle in a sensing field) in which the number of active mobile sensors is insufficient to cover all targets or form a connected network. Therefore, targets must be weighted by their importance. The more important a target, the higher the weight of the target. A more general problem for target coverage and network connectivity, termed the Maximum Weighted Target Coverage and Sensor Connectivity with Limited Mobile Sensors (TAR-CC) problem, is studied. In this paper, an approximation algorithm, termed the weighted-maximum-coverage-based algorithm (WMCBA), is proposed for the subproblem of the TAR-CC problem. Based on the WMCBA, the Steiner-tree-based algorithm (STBA) is proposed for the TAR-CC problem. Simulation results demonstrate that the STBA provides better performance than the other methods.

中文翻译：

---

关于最大加权目标覆盖和传感器连接的新方法：硬度和近似

在移动无线传感器网络(MWSNs)中，由于传感器的移动比传感和通信消耗的功率大得多，调度移动传感器覆盖所有目标并保持网络连通性使得移动传感器的总移动距离最小化的问题受到了极大的关注。然而，网络设计实际上表明存在以下情况（预算有限、传感器故障或传感领域中的障碍），其中活动移动传感器的数量不足以覆盖所有目标或形成一个连接的网络。因此，目标必须根据其重要性进行加权。目标越重要，目标的权重就越高。目标覆盖和网络连接的一个更普遍的问题，被称为最大加权目标覆盖范围和传感器连接受限移动传感器 (TAR-CC) 问题，进行了研究。在本文中，针对 TAR-CC 问题的子问题提出了一种近似算法，称为基于加权最大覆盖的算法 (WMCBA)。在WMCBA的基础上，针对TAR-CC问题提出了基于Steiner-tree的算法（STBA）。仿真结果表明 STBA 提供了比其他方法更好的性能。