Coverage maximization of sensor networks with connectivity constraints in obstacle-filled environment based on nature-inspired algorithms

Abstract

The application of meta-heuristic algorithms has significant potential in various fields, including wireless sensor networks. In this paper, we utilize two algorithms, the Fruitfly optimization algorithm (FOA) and the Nutcracker optimization algorithm (NOA), to address two critical issues: optimizing coverage and ensuring connectivity in sensor networks. The main contribution of this paper is the application of these algorithms to arbitrary communication radius, independent of predefined connectivity assumptions. Simulation results demonstrate the effectiveness of the proposed methods by comparing with each other and with the two traditional algorithms Genetic Algorithm (GA) and Particle Swarm Optimization (PSO). Additionally, this paper simulates the coverage area in an environment with different types of obstacles to showcase the practical flexibility of the algorithms.