An Optimal WSN Coverage Based on Adapted Transit Search Algorithm

Abstract

The wireless sensor network (WSN) coverage is one of the most significant impacts on the quality of service that directly determines the efficiency reality of applications. The distribution of sensor nodes in the WSN determines the size of the network monitoring coverage area, whether there is duplicate coverage, and monitoring blind regions. This study introduces an optimal coverage strategy for the sensor node positions in the sensing region based on an adapted transit search (ATS) algorithm. The transit search (TS) algorithm is a recently developed metaheuristic algorithm with several advantages, e.g. simple concept, robust process, and ease of implementation; still, TS has limitations in the ratios of exploration and exploitation for avoiding the local optimum trap when dealing with complicated node coverage optimization situations. The ATS is implemented by adapting and updating equations with stochastic reverse learning and multi-direction strategies to prevent its original algorithm drawbacks. The experimental analysis is carried out to demonstrate the efficiency of the designed coverage scheme in terms of various metrics, e.g. coverage rate, positioning errors, converge speed, and executed time. Compared experimental-result shows that the ATS scheme offers the WSN applicability coverage model to perform the deployment network application with excellent quality. Significantly, the coverage rate archived of the ATS is 87%, but the other methods are only below or equally 84% in the same comparison conditions.