Improved Coverage-Enhancing Algorithm in Hybrid Wireless Sensor Network Based on Cellular Structure

Abstract

The coverage-enhancing algorithm of Hybrid Wireless Sensor Network(HWSN) based on cellular structure, HWSNBCS, has the problem of a large average moving distance of mobile nodes.Therefore, an improved HWSN coverage-enhancing algorithm named IHWSNBCS is proposed.To obtain the final target position of the mobile node and further optimize the average moving distance of the mobile node of the HWSNBCS algorithm, it is necessary to find the optimal matching between the initial position of the mobile sensor node and the candidate target position obtained through the HWSNBCS algorithm, transform the problem of minimizing the sum of the mobile node moving distances into the optimal matching problem of a bipartite graph, and use the weighted bipartite graph matching algorithm Kuhn-Munkres(KM) to determine the optimal solution of the matching problem.The experimental results show that the IHWSNBCS algorithm achieves the same network coverage rate as the HWSNBCS algorithm.Moreover, the average moving distance of the mobile node decreases by 38.87%-43.28%, and the maximum moving distance of a single mobile node decreases by 22.65%-66.58%, reducing the energy consumption of the system due to the mobile sensor's redeployment of nodes and the probability of failure of a single sensor node due to energy depletion.Thus, the network life cycle is extended. Simultaneously, the ΔCov-Dist performance index of IHWSNBCS is 1.64-1.76 times that of the HWSNBCS algorithm, indicating that the network coverage rate of the IHWSNBCS algorithm is improved when mobile nodes move the same distance.