An Optimal WSN Node Coverage Based on Enhanced Archimedes Optimization Algorithm

Node coverage is one of the crucial metrics for wireless sensor networks' (WSNs') quality of service, directly affecting the target monitoring area's monitoring capacity. Pursuit of the optimal node coverage encounters increasing difficulties because of the limited computational power of individual nodes, the scale of the network, and the operating environment's complexity and constant change. This paper proposes a solution to the optimal node coverage of unbalanced WSN distribution during random deployment based on an enhanced Archimedes optimization algorithm (EAOA). The best findings for network coverage from several sub-areas are combined using the EAOA. In order to address the shortcomings of the original Archimedes optimization algorithm (AOA) in handling complicated scenarios, we suggest an EAOA based on the AOA by adapting its equations with reverse learning and multidirection techniques. The obtained results from testing the benchmark function and the optimal WSN node coverage of the EAOA are compared with the other algorithms in the literature. The results show that the EAOA algorithm performs effectively, increasing the feasible range and convergence speed.