Experimental estimate of using the ant colony optimization algorithm to solve the routing problem in FANET

FANETs are ad hoc networks based on unmanned aerial vehicles. Such nets are characterized by high mobility of nodes, dynamically changing topology and 3-D movement. Routing in FANET is a complex task. Different methods of routing in FANET are given in this paper. The review of intelligent routing me...

Full description

Saved in:
Bibliographic Details
Published in2016 International Siberian Conference on Control and Communications (SIBCON) pp. 1 - 10
Main Authors Maistrenko, Vasily A., Alexey, Leonov V., Danil, Volkov A.
Format Conference Proceeding Journal Article
LanguageEnglish
Published IEEE 01.05.2016
Subjects
ACO
Ad hoc networks
Algorithms
Ant Colony Optimization
Computer networks
FANET
Finite element analysis
MANET
Mobile communication systems
Mobile computing
Network simulation
Peer-to-peer computing
Routing
Routing (telecommunications)
Routing protocols
Swarm Intelligence
Tasks
UAVs
VANET
Wireless networks
Online AccessGet full text

Cover

More Information
Summary:FANETs are ad hoc networks based on unmanned aerial vehicles. Such nets are characterized by high mobility of nodes, dynamically changing topology and 3-D movement. Routing in FANET is a complex task. Different methods of routing in FANET are given in this paper. The review of intelligent routing methods in MANETs based on ant algorithm is presented. To confirm possibility of effective usage of protocols based on ant colony algorithm to solve routing tasks in MANETs, the experimental analysis has been performed.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Conference-1
ObjectType-Feature-3
content type line 23
SourceType-Conference Papers & Proceedings-2
ISSN:2380-6516
DOI:10.1109/SIBCON.2016.7491805