Wireless sensor network nodes can be deployed in large numbers inside or near the sensed objects by means of aircraft deployment or artificial arrangement, but when the nodes fail due to their own factors or the influence of the external environment, the network monitoring area will have coverage loopholes, and it is not possible to realize comprehensive monitoring. In response to this challenge, this paper conducts an in-depth exploration of coverage vulnerability repair algorithms in wireless sensor networks, and successfully repairs the vulnerabilities of the network by adjusting the positions of locally optimal nodes. For the case of unknown location of the coverage vulnerability, this paper grids the large network, and selects a node as the management node for each grid, and then calculates the degree of overlap between the sensing area of each node and its neighbors, so as to determine the coverage of the node and detect the vulnerability. During the process of vulnerability repair, a distributed method is adopted to seek a locally optimal solution. At the same time, the energy consumption of nodes is fully considered, and the most suitable one is chosen from the neighboring nodes surrounding the vulnerability to serve as the repair node, addressing the vulnerability. In this selection process, the three performance indicators of the vulnerability repair node to be selected, namely, distance traveled, coverage percentage, and residual energy, are taken into account to achieve the optimal selection of candidate vulnerability repair nodes.