Firefly algorithm guided by general centre particle and its application in node localisation of wireless sensor networks
by Li Lv; Hongmin Tian; Jia Zhao; Zhifeng Xie; Tanghuai Fan; Longzhe Han
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 13, No. 2, 2017

Abstract: Firefly algorithm (FA) is a kind of swarm intelligence algorithm that was developed by simulating the behaviour of the flashing of fireflies. However, the population uses only the advantage of the better particles' information to complete optimisation without using the comprehensive information of the population effectively. So, this paper proposes an improved FA, namely firefly algorithm guided by general centre particle (GCPFA), in which the General Centre Particle (GCP) was generated by sharing each particle's historically optimal position information, and each particle would learn from GCP after they learned from the other particles with better performances. The simulation results on 12 benchmark test functions also revealed GCPFA's superiority to the other six famous FAs. In order to improve the unreasonable distribution of sensor nodes randomly and improve the network coverage rate, the above algorithm is applied to optimise the coverage of wireless sensor networks and achieve better optimisation effect.

Online publication date: Tue, 21-Nov-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Wireless and Mobile Computing (IJWMC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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