A Sensor Network Coverage Planning Based on Adjusted Single Candidate Optimizer

Abstract

Wireless sensor networks (WSNs) are widely used for various practical applications due to their simplicity and versatility. The quality of service in WSNs is greatly influenced by the coverage, which directly affects the monitoring capacity of the target region. However, low WSN coverage and uneven distribution of nodes in random deployments pose significant challenges. This study proposes an optimal node planning strategy for network coverage based on an adjusted single candidate optimizer (ASCO) to address these issues. The single candidate optimizer (SCO) is a metaheuristic algorithm with stable implementation procedures. However, it has limitations in avoiding local optimum traps in complex node coverage optimization scenarios. The ASCO overcomes these limitations by incorporating reverse learning and multi-direction strategies, resulting in updated equations. The performance of the ASCO algorithm is compared with other algorithms in the literature for optimal WSN node coverage. The results demonstrate that the ASCO algorithm offers efficient performance, rapid convergence, and expanded coverage capabilities. Notably, the ASCO achieves an archival coverage rate of 88%, while other approaches achieve coverage rates below or equal to 85% under the same conditions.