A Coverage Hole Patching Algorithm for Heterogeneous Wireless Sensor Networks

Abstract

The improvement of coverage is a critical issue in the coverage hole patching of sensors. Traditionally, VOPR and VORCP algorithms improve the coverage of the detection area by improving the original VOR algorithm, but coverage hole patching algorithms only target homogeneous networks. In the real world, however, the nodes in the wireless sensor network (WSN) are often heterogeneous, i.e., the sensors have different sensing radii. The VORPH algorithm uses the VOR in a hybrid heterogeneous network and improves the original algorithm. The patched nodes are better utilized, and the detection range is enlarged. However, the utilization rate of the patched nodes is not optimized, making it impossible to patch the coverage holes to the maximum degree. In the environment of hybrid heterogeneous WSN, we propose a coverage hole patching algorithm with a priority mechanism. The algorithm determines the patching priority based on the size of the coverage holes, thereby improving network coverage, reducing node redundancy, and balancing resource allocation. The proposed algorithm was compared under the same environment by simulation and analysis. The results show that our algorithm is superior to the traditional coverage hole patching algorithms in coverage rate, and can reduce node redundancy.

DHD-MEPO: A Novel Distributed Coverage Hole Detection and Repair Method for Three-Dimensional Hybrid Wireless Sensor Networks

“…Some scholars have also effectively combined mathematical thinking with the coverage hole problem. Lu et al [24] proposed the development of a prioritization strategy in hybrid heterogeneous networks based on mathematical geometric approaches to determine the size of hole regions and use a limited quantity of mobile nodes to repair the holes, which reduces the redundancy of mobile nodes in the area, with a lack of analysis of the mobile nodes' energy consumption aspects. The authors of [25] addressed the problem of the high complexity of traditional detection algorithms and proposed a hole detection method on the basis of a simplified Rips complex, in which nodes are classified by combining the degree and clustering coefficients of the complex networks and Turan's theorem.…”