A global-to-local searching-based binary particle swarm optimisation algorithm and its applications in WSN coverage optimisation

Heuristic search algorithms have been applied to the coverage optimisation problem of WSNs in recent years because of their strong search ability and fast convergence speed. This paper proposes an optimisation algorithm for a WSN based on improved binary particle swarm optimisation (PSO). The position updating formula based on the sigmoid transformation function is adjusted, and a global-to-local search strategy is used in the global-to-local searching-based binary particle swarm optimisation algorithm (GSBPSO). Furthermore, to apply GSBPSO to the optimisation of WSNs, a small probability mutation replacement strategy is proposed to replace individuals who do not meet the coverage requirements in the search process. In addition, the fitness function is improved so that the network density can be adjusted by modifying the parameters in the improved fitness function. Experiments show that the proposed algorithm in this paper is effective.