A global-to-local searching-based binary particle swarm optimisation algorithm and its applications in WSN coverage optimisation Online publication date: Wed, 15-Apr-2020
by Kangshun Li; Ying Feng; Dunmin Chen; Shanni Li
International Journal of Sensor Networks (IJSNET), Vol. 32, No. 4, 2020
Abstract: 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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Sensor Networks (IJSNET):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook