An improved firefly algorithm for routing in flying ad hoc networks Online publication date: Tue, 12-Oct-2021
by Amrita Yadav; Seema Verma
International Journal of Communication Networks and Distributed Systems (IJCNDS), Vol. 27, No. 3, 2021
Abstract: This paper presents a new and improved firefly algorithm which can be used to solve routing issues in flying ad hoc networks. A flying ad hoc network is basically a new form of mobile ad hoc network (MANET) in which multiple unmanned aerial vehicles (UAV) are connected together in the form of nodes. Routing has been a foremost issue in FANETs. Firefly algorithm (FA) is one such nature-inspired swarm intelligence algorithm which gives efficient results when compared with other conventional algorithms. The proposed approach uses clustering as the methodology. The parameters taken in this algorithm to analyse the results are packet delivery ratio, end-to-end delay, routing overhead and throughput. The results of the proposed algorithm are compared with ant colony optimisation (ACO) and existing FA. The results indicate that this algorithm is considerably better than existing firefly algorithm and ACO and can be used for finding optimal routing solutions.
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 Communication Networks and Distributed Systems (IJCNDS):
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