The most fundamental task of the wireless sensor network (WSN) is to monitor a specified region of interest with sufficient sensor coverage. This task is jeopardized when coverage holes appear after the network's deployment. The emergence of coverage holes is unavoidable for many reasons such as sensor node energy depletion, physical damage, or external attacks. Therefore, it is important to have an ongoing mechanism for coverage maintenance because coverage holes can have debilitating effects on network performance if left unattended.

Existing research into coverage hole repair tend to suffer from several shortcomings such as high energy consumption of mobile nodes and inaccurate assumptions about the coverage hole model. Furthermore, many solutions rely on the availability of redundant nodes or deploying new nodes in the network, which is not always feasible. We present a novel distributed self-healing algorithm called Distributed Hole Detection and Repair (DHDR), that simultaneously handles both hole detection and repair using only nodes already deployed in the network. Our algorithm can dynamically detect a coverage hole as it occurs, and accurately estimate its position and size. The algorithm selects suitable nodes from the vicinity which will maximize coverage and minimize energy consumption by sharing information and coordinating their movements. The selected nodes relocate in a way that restores the void area of a hole without disrupting their existing coverage or connectivity.

The performance of the proposed approach is evaluated through simulation experiments. It is compared against two state-of-the-art algorithms and has been shown to outperform both in terms of improved coverage, more stable connectivity, and lower energy consumption.

无线传感器网络（WSN）的最基本任务是使用足够的传感器覆盖范围监视指定的关注区域。当网络部署后出现覆盖漏洞时，此任务将受到威胁。由于许多原因（例如传感器节点能量耗尽，物理损坏或外部攻击），不可避免会出现覆盖孔。因此，重要的是要有一个持续的覆盖维护机制，因为如果不加以注意，覆盖漏洞可能会对网络性能产生不利影响。

现有的对覆盖孔修复的研究往往会受到一些缺点的困扰，例如移动节点的高能耗以及对覆盖孔模型的不正确假设。此外，许多解决方案依赖于冗余节点的可用性或在网络中部署新节点，这并不总是可行的。我们提出了一种新颖的分布式自修复算法，称为分布式漏洞检测和修复（DHDR），该算法仅使用网络中已部署的节点即可同时处理漏洞检测和修复。我们的算法可以动态检测覆盖孔的发生，并准确估算其位置和大小。该算法从附近选择合适的节点，该节点将通过共享信息和协调其运动来最大化覆盖范围并最小化能耗。

通过仿真实验评估了该方法的性能。它与两种最新算法进行了比较，并且在改善覆盖范围，更稳定的连接性和更低的能耗方面均表现出优异的表现。