Solving k-Barrier Coverage Problem Using Modified Gravitational Search Algorithm

الملخص EN

Coverage problem is a critical issue in wireless sensor networks for security applications.

The k-barrier coverage is an effective measure to ensure robustness.

In this paper, we formulate the k-barrier coverage problem as a constrained optimization problem and introduce the energy constraint of sensor node to prolong the lifetime of the k-barrier coverage.

A novel hybrid particle swarm optimization and gravitational search algorithm (PGSA) is proposed to solve this problem.

The proposed PGSA adopts a k-barrier coverage generation strategy based on probability and integrates the exploitation ability in particle swarm optimization to update the velocity and enhance the global search capability and introduce the boundary mutation strategy of an agent to increase the population diversity and search accuracy.

Extensive simulations are conducted to demonstrate the effectiveness of our proposed algorithm.