Static wireless sensor networks deployment using an improved binary PSO

Abstract

Summary A major issue in designing wireless sensor networks is the deployment problem. Indeed, many performances of the sensor network, such as coverage, are determined by the number and locations of deployed sensors. This paper reviews existing deterministic deployment strategies and devises a modified binary particle swarm optimization, which adopts a new position updating procedure for a faster convergence and exploits the abandonment concept to avoid some drawbacks such as premature convergence. The devised approach combines, in a meaningful way, the characteristics of the binary particle swarm optimization with the wireless sensor networks deployment requirements in order to devise a lightweight and efficient sensor placement algorithm. The effectiveness and efficiency of the proposed approach are evaluated through extensive simulations. The obtained results show that the proposed algorithm outperforms the state‐of‐the‐art approaches, especially in the case of preferential coverage. Copyright © 2015 John Wiley & Sons, Ltd.