<p>Wireless sensor network technology is a crucial enabling technology for the Internet of Things and has gained extensive attention from scholars. In water surface wireless sensor networks, nodes are highly vulnerable to environmental factors, leading to coverage holes that require timely and computationally-efficient repair strategies to ensure network quality. Therefore, this paper focuses on the coverage hole repair problem of the water surface environment and proposes two different algorithms for repairing coverage holes by minimizing the total time required and the total energy consumption of the network. To minimize the total waiting time for repairing coverage holes, we factor in the movement of mobile nodes during the repair process on the water surface and determine their maximum drift speed and position under gravity, buoyancy, and water pressure differences. Additionally, we minimize the total energy consumption of the network by solving Karush-Kuhn-Tucker conditions using the Lagrange multiplier method under transmission time and power constraints to obtain the optimal transmission power. Finally, we adopt the Hungarian algorithm, a classic combinatorial optimization solver known for its polynomial-time efficiency, to obtain the global optimal assignment plan. This approach delivers the computational performance required for large-scale network deployments. Simulations confirm that the proposed algorithm effectively minimizes the total waiting time for repairing coverage holes and reduces the total energy consumption of the network while extending its lifetime.</p>