K-barrier coverage in wireless sensor networks based on immune particle swarm optimisation Online publication date: Fri, 10-Aug-2018
by Yanhua Zhang; Xingming Sun; Zhanke Yu
International Journal of Sensor Networks (IJSNET), Vol. 27, No. 4, 2018
Abstract: Barrier coverage of wireless sensor networks (WSNs) has been an interesting research issue for security applications. In order to increase the robustness of barriers coverage, k-barrier coverage is proposed to address this issue. In this paper, the k-barrier coverage problem is formulated as a global optimisation problem solved by particle swarm optimisation (PSO). However, the performance of PSO greatly depends on its parameters and it often suffers from being trapped in local optima. A novel particle swarm optimisation program named AI-PSO (artificial immune-particle swarm optimisation) is designed and the model of k-barrier coverage problem is proposed to solve this problem. AI-PSO integrates the ability to exploit in PSO with the ability diversity maintenance mechanism of AI (artificial immune) to synthesise both algorithms' strength. Simulation results show that the proposed algorithm is effective for the k-barrier coverage problems.
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