Next Article in Journal
Physical Workload Tracking Using Human Activity Recognition with Wearable Devices
Previous Article in Journal
Gait Asymmetry Post-Stroke: Determining Valid and Reliable Methods Using a Single Accelerometer Located on the Trunk
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Review

Routing Schemes in FANETs: A Survey

by
Muhammad Fahad Khan
1,2,
Kok-Lim Alvin Yau
1,*,
Rafidah Md Noor
3 and
Muhammad Ali Imran
4
1
Department of Computing and Information Systems, School of Science and Technology, Sunway University, Bandar Sunway 47500, Malaysia
2
Department of Computer Science, COMSATS University Islamabad (CUI), Attock Campus, Punjab 43600, Pakistan
3
Department of Computer System and Technology, Faculty of Computer Science and Information Technology, University of Malaya, Kuala Lumpur 50603, Malaysia
4
School of Engineering, University of Glasgow, Glasgow G12 8QQ, UK
*
Author to whom correspondence should be addressed.
Submission received: 3 October 2019 / Revised: 23 October 2019 / Accepted: 28 October 2019 / Published: 19 December 2019
(This article belongs to the Section Internet of Things)

Abstract

:
Flying ad hoc network (FANET) is a self-organizing wireless network that enables inexpensive, flexible, and easy-to-deploy flying nodes, such as unmanned aerial vehicles (UAVs), to communicate among themselves in the absence of fixed network infrastructure. FANET is one of the emerging networks that has an extensive range of next-generation applications. Hence, FANET plays a significant role in achieving application-based goals. Routing enables the flying nodes to collaborate and coordinate among themselves and to establish routes to radio access infrastructure, particularly FANET base station (BS). With a longer route lifetime, the effects of link disconnections and network partitions reduce. Routing must cater to two main characteristics of FANETs that reduce the route lifetime. Firstly, the collaboration nature requires the flying nodes to exchange messages and to coordinate among themselves, causing high energy consumption. Secondly, the mobility pattern of the flying nodes is highly dynamic in a three-dimensional space and they may be spaced far apart, causing link disconnection. In this paper, we present a comprehensive survey of the limited research work of routing schemes in FANETs. Different aspects, including objectives, challenges, routing metrics, characteristics, and performance measures, are covered. Furthermore, we present open issues.

1. Introduction

Flying ad hoc network (FANET) is a branch of networking that provides communication among flying nodes, particularly unmanned aerial vehicles (UAVs), with base station (BS) [1]. Flying UAVs are autonomous nodes capable of making decisions (e.g., changing speed and direction) in the air in a distributed manner rather than receiving decisions made from the ground in a centralized manner [2,3]. FANET has distinguishing features compared to existing ad hoc networks such as mobile ad hoc networks (MANETs) [4] and vehicular ad hoc networks (VANETs) [5]. In general, the flying nodes are prone to frequent link disconnections and network partitions due to the following:
  • Movement in the three-dimensional space (against movement that is confined to roads and highways in VANETs [6]).
  • Flying speed ranges from 30 to 460 km/h [7] (against driving speed that ranges from 10 to 120 km/h [8,9]).
  • Low node density (against high node density in urban areas in VANETs). In addition, the flying nodes, which are generally equipped with batteries that provide limited energy, have high energy consumption [10].
This means that frequent disconnections cannot be addressed by increasing the transmission power to provide long-range communication in FANETs. Hence, establishing long-term, reliable, and robust connections and routes is essential to increase route lifetime and to improve quality of service (QoS) (e.g., low latency and route setup time), yet it is challenging in FANETs. Nevertheless, the flying nodes naturally have a) a large coverage and b) minimal effects of obstacles (e.g., buildings and trees) and bad weather due to its elevated look angle [7].
Figure 1 shows two scenarios, namely the single-UAV and multi-UAV scenarios. In the single-UAV scenario, a single UAV establishes a connection to a radio access infrastructure (i.e., FANET base station (BS), cellular BS, and satellite). In the multi-UAV scenario, multiple UAVs cooperate and establish an ad hoc network. Compared to the single-UAV scenario, the multi-UAV scenario provides three main advantages [11]. Firstly, FANETs increase network scalability as multiple UAVs can increase coverage [12,13,14]. Secondly, FANETs increase network survivability (or network robustness and reliability) in a dynamic operating environment (e.g., due to poor weather condition) as multiple UAVs can either connect with each other to form an ad hoc network or to connect to radio access infrastructure directly [15]. The presence of a large swarm of UAVs (or multi-UAV swarm) [16,17] can cater to the failure of a UAV during operations [18,19]. Thirdly, FANETs can distribute payload among UAVs, which helps to reduce the weight of each UAV and, hence, the required energy for the UAV to reach and maintain a targeted altitude, leading to a longer route lifetime [20].
The multi-UAV scenario can be extended to multi-UAV swarm, whereby a large swarm of autonomous, small-sized, and lightweight UAVs are deployed. The multi-UAV swarm can coordinate and prevent collisions among themselves while completing tasks that require a large swarm of UAVs, such as surveillance [16] and search and rescue missions during catastrophe [17] and gathering a swarm of UAVs at a target location [21]. The multi-UAV swarm can be used to upload a huge amount of data collected in a distributed manner (e.g., data collected from cellular users) to the base station. In Reference [22], a multi-UAV swarm with high mobility uses a store-carry-forward approach to capture and transfer images and videos from a post-disaster area to the base station. In Reference [23], a multi-UAV swarm senses and allocates subchannels for UAV-to-X communication in a collaborative manner in order to maximize the sum-rate of uplinks while optimizing the speed of UAVs. In Reference [24], a multi-UAV swarm, which consists of flexible aerial nodes, is deployed to form an emergency network that can recover communication rapidly in a catastrophic area. In Reference [25], UAVs embedded with solar panels, together with solar-powered charging stations, are deployed to overcome energy constraint in order to fulfill the energy, communication, and safety requirements of 5G. In Reference [26], Euclidean distance is measured and it is used to adjust the transmission power for hello messages in order to reduce energy consumption. The number of UAVs required to achieve network performance requirements, such as throughput and packet delivery ratio, are also considered with the objective of minimizing energy consumption. In Reference [27], the secrecy outage probability and the average secrecy capacity of a multi-UAV swarm are derived in order to prevent eavesdropping.

1.1. Our Contribution

In view of the limited research work of routing schemes in FANETs and the lack of focus on the main characteristics of FANETs, such as the three-dimensional movement and mobility, this paper provides a comprehensive survey to stimulate research interest in this topic. Various routing schemes are classified, analyzed, and discussed based on a taxonomy. Open issues are outlined.
Table 1 summarizes papers conducting surveys on FANETs, covering various foci, which are self-explanatory given examples, as follows:
  • Motivation for the need of FANETs and an explanation of their unique characteristics;
  • Comparison with other ad hoc networks, such as MANETs and VANETs;
  • Requirements, such as the bandwidth and energy requirements of the flying nodes;
  • Mobility models of the flying nodes, such as random waypoint and Manhattan;
  • Taxonomy that covers various FANET attributes;
  • Objectives, such as achieving the awareness of energy consumption and cost;
  • Challenges, such as high energy consumption and number of retransmissions;
  • Routing metrics, such as the residual energy level and the distance between flying nodes;
  • Characteristics, such as the transmission range of flying nodes and the number of nodes in a network;
  • Performance measures, such as the number of clusters in a network and cost;
  • Open issues, such as enhancing QoS and addressing the dynamicity of network topology.
To the best of our knowledge, this paper is the first of its kind to provide a comprehensive survey of routing schemes in FANETs, covering a diverse range of aspects. As shown in Table 1, surveys of routing schemes in FANETs have been conducted in the literature with a diverse range of foci [18,32,35,37,39,41], such as hierarchical and data centric approaches [18]; geographical location-based approaches [35]; as well as proactive, reactive, and hybrid routing schemes based on MANETs and VANETs [32]. In addition, although existing papers (see Table 1), including the surveys of routing schemes in FANETs, present taxonomies that categorize routing schemes and mobility models in FANETs, this paper presents a taxonomy that covers various aspects, including objectives, challenges, routing metrics, characteristics, and performance measures.

1.2. Significance of Our Work

Apart from being a comprehensive survey that covers a diverse range of foci as shown in Table 1, this paper provides some distinguishing aspects. Firstly, it provides motivation for the topic, answering questions such as: “How do FANETs differ from other kinds of ad hoc networks?”, “What are the roles of FANETs?”, “What are the requirements of routing in FANETs?”, “What are the mobility models in FANETs?”, and “What are the roles of artificial intelligence in FANETs?”. Secondly, a comprehensive taxonomy for routing in FANETs is provided, and it is used to capture various aspects of the state-of-the-art routing schemes in FANETs. Finally, some significant open issues in this topic are first presented for the first time in the literature. Hence, this paper has laid a strong foundation for future investigations in routing in FANETs.

1.3. Organization of This Paper

The rest of this paper is organized as follows:
  • Section 2 presents background and the motivation for the need to investigate routing schemes in FANETs.
  • Section 3 presents the taxonomy and framework of routing schemes in FANETs.
  • Section 4 presents the framework of routing schemes in FANETs.
  • Section 5 presents a discussion of various routing schemes in FANETs based on the taxonomy.
  • Section 6 presents open issues.
  • Section 7 concludes the paper.

2. Background and Motivating the Need for FANETs

FANET has distinguishing features (e.g., high dynamicity of network topology, large coverage, and limited energy) as compared to other kinds of ad hoc networks (e.g., MANETs and VANETs). Hence, in FANETs, flying nodes can join and leave a highly dynamic ad hoc network, which causes frequent link disconnections and route breakages. This has motivated researchers to investigate FANETs.

2.1. How Do FANETs Differ from Other Kinds of Ad Hoc Networks?

Ad hoc network is composed of geographically distributed connected devices that can communicate with each other over a wireless medium. In general, it is deployed to support short-term applications, such as military usage, video conferencing, infotainment, as well as disaster relief and rescue operation, for a short time period. The ad hoc network is different from a cellular network because the former, which lacks a fixed infrastructure and powered by battery, must perform computation in a distributed manner; hence, energy efficiency is a major concern [42,43]. Table 2 compares and contrasts the three main kinds of ad hoc networks, namely MANETs, VANETs, and FANETs, shown in Figure 2. Due to the differences among the ad hoc networks, novel routing schemes must be designed to cater to the main characteristics of FANETs.

2.1.1. How Do FANETs Differ from MANETs and VANETs in Terms of the Types of Links?

Table 2 compares the types of links in FANETs with those in MANETs and VANETs [44,45,46,47].
There are four main types of links among UAVs and different radio access infrastructure (i.e., FANET BS, cellular BS, and satellite) in ad hoc networks [48,49] as shown in Figure 3:
  • a UAV–UAV link between a UAV and another UAV that supports ad hoc communication. This link is part of a route so that intermediate UAVs can forward packets towards a radio access infrastructure.
  • a UAV–BS link (or a direct link) between a UAV and a FANET BS.
  • a UAV–cellular link between a UAV and a cellular BS.
  • a UAV–satellite link, which is a long-range terrestrial link, between a UAV and a satellite. The UAVs can form a star topology with the satellite. This link is necessary in the absence of other radio access infrastructure (i.e., FANET BS and cellular BS).
The radio access infrastructure is prone to failure during disaster. Hence, the ad hoc network, which is formed using UAV–UAV links, is more robust and easy to deploy, although routing is necessary to establish routes.

2.1.2. How Do FANETs Differ from MANETs and VANETs in Terms of Characteristics?

Table 2 compares the parameters and characteristics of FANETs with those of MANETs and VANETs as follows:
  • Mobility degree (or the dynamicity of network topology) of FANETs is high (i.e., 30–460 km/h [20]) compared to MANETs (i.e., 5–50 km/h [50]) and VANETs (i.e., 10–120 km/h [8,9]). Hence, in FANET, the highly dynamic network topology causes frequent link disconnections and network partitions, resulting in low link quality [51,52].
  • Mobility models of FANETs is different in terms of the capabilities of devices (e.g., UAVs move in the three-dimensional space, while nodes and vehicles in MANETs and VANETs move in a two-dimensional space) and the operating environment (e.g., FANETs operate in the sky, while MANETs operate in the terrain most of the time using random waypoint as it also considered harmful [53] but other model in random trip model [54] and VANETs operate in the highways using prediction based model). Examples of mobility models for FANETs are semi-random circular movement (SRCM) model [55,56], realistic model, and random waypoint model [57]. More details about the mobility models are presented in Section 2.4.
  • Energy constraint in FANETs is moderate [7] compared to MANETs (i.e., has the highest energy constraint) and VANETs (i.e., has the lowest energy constraint). The availability of energy affects route lifetime, and so, small UAVs must conserve energy to support long flight time. In VANETs, vehicles are generally powered by vehicular battery with less energy constraint.
  • Availability of line of sight (LOS) between UAVs is commonplace in FANETs contributing to higher robustness of a link, while there may be non-LOS (NLOS) in MANETs and VANETs as a result of obstacles in a link.
  • Localization method in FANETs, such as inertia measurement unit, provides accurate coordinates of a UAV and neighboring UAVs in a real-time manner [58]. In contrast, MANETs use GPS to find the coordinates of nodes with an accuracy of 10–15 m [59], while VANETs use assisted-GPS or differential-GPS with an accuracy of 10 cm to reduce collisions and find routes [60].
  • Node density (or the number of nodes in a unit area) of FANETs is low compared to MANETs and VANETs. This means that UAVs are spaced far apart in the sky and that the distance between the UAVs is comparatively long. Lower node density can increase the effects of the dynamicity of network topology. Nevertheless, node density can be high for multi-UAV swarm whereby a large swarm of UAVs is deployed.

2.2. What Are the Roles of FANETs?

FANETs provide connectivity among flying nodes (e.g., UAVs) to support various short-term applications and tasks [61]. Multiple UAVs can be deployed to fly over a targeted region and to perform surveillance, detection, and monitoring. The UAVs use sensors and cameras to capture real-time images, audios, and videos at remote and difficult-to-access areas and send the data to a BS immediately [62]. Subsequently, the BS processes the data and generates messages, such as alert messages upon the detection of a disturbance or an event [63]. The multi-UAV scenario has a significant impact to human life and activities [64]. For instance, the use of the multi-UAV scenario to detect and monitor wildfire is foreseen to reduce the current 340,000 cases of casualties and the $ 10 million USD cost annually [62,65].
The multi-UAV scenario has been deployed to detect targets (i.e., to identify the position of a target) in search missions [66], to provide bird’s-eye view for surveillance [67,68,69], to monitor crops (e.g., identifying ripe and unripe crops) in agriculture [70,71], to monitor disaster [72,73,74], and to monitor environment (e.g., wind [75], temperature, humidity, light intensity, and the pollution level [76,77,78]). Multi-UAVs also support other kinds of ad hoc networks, particularly MANETs and VANETs. For instance, the multi-UAV scenario has been deployed to monitor and manage traffic in VANETs [79,80]. The multi-UAV swarm scenario has been deployed to monitor and manage disaster and to perform surveillance in smart cities [81].

2.3. What Are the Requirements of Routing in FANETs?

Routing in FANETs has four requirements as follows:
  • High adaptability since UAVs must adapt to the highly dynamic network topology with low node density and cater to link disconnections and network partitions [7]. Hence, route discovery (i.e., establishing routes for data dissemination) and maintenance (i.e., reestablishing routes) must be sufficiently adaptive to improve route reliability (or robustness) in FANETs. This means that the routing table, which maintains the routes and their route costs, must be constantly updated and that reliable routes must be identified.
  • High scalability since UAVs must cater to large-scale applications that require multiple UAVs [82] with high or low node density. Hence, route discovery and maintenance must be supported by collaboration and coordination among UAVs to improve network scalability.
  • High residual energy since UAVs, which are powered by battery, must establish routes with sufficiently high residual energy to reduce link disconnections and network partitions as a result of node failures [83] in order to prolong route lifetime.
  • Low latency since UAVs must cater to real-time (or delay-sensitive) applications, such as collision prevention in multi-UAV swarm, as well as disaster relief and rescue operation. Hence, route discovery and maintenance must reduce latency as investigated in References [84,85].
  • High bandwidth since UAVs must gather data or sensing outcomes from a single or multiple locations and send them to radio access infrastructure for processing and decision making. Hence, route discovery and maintenance must establish routes with high (or sufficiently high) bandwidth.

2.4. What Are the Mobility Models in FANETs?

Mobility models have been used to characterize the movement of UAVs, including the speed, direction, and acceleration of UAVs, in a fixed space. Such models have been used to develop real-time simulation environment for FANETs. The rest of this section presents various kinds of mobility models used in the investigation of FANETs.

2.4.1. Pure Randomized Mobility Models

The pure randomized mobility model has been widely used in ad hoc networks. There are four common characteristics. Firstly, nodes are independent on each other. Secondly, nodes are memoryless, and so, the new speed and direction of the nodes are independent on their previous speed and direction [86]. Thirdly, nodes can move at any speed within a range (e.g., 30–460 km/h [20]). Fourthly, nodes can move freely in an unpredictable manner in a fixed space at all times. The difference among the pure randomized mobility models lies in the way in which the direction of the nodes’ movement is determined.
A.1
Random walk, which is based on the Brownian movement, allows a node to move in any directions
A.2
Random waypoint [87,88] allows a node to move in different directions (i.e., either straight, left, or right, rather than backward) towards a destination [89,90]. When the node arrives at its destination inside a fixed space, it stops for a short period of time, which helps to prevent a drastic change in order to provide smooth movement, and then, it starts to move towards another randomly chosen destination.
A.3
Random direction (or random mobility) shares the similar way in which the direction of a node’s movement is determined with random waypoint (A.2). The main difference is that a node must stop at the edge of a fixed space [91]. This means that a destination must be located at the edge of a fixed space rather than inside the space.
A.4
Manhattan grid allows a node to move in straight x-axis and y-axis directions in a grid road layout in urban areas. Specifically, the node moves in different directions (i.e., either straight, left, or right, rather than backward) to proceed or to turn to the left or right road at an intersection [92].

2.4.2. Path-Planned Mobility Models

The path-planned mobility model forms predefined routes used by UAVs. There are three common characteristics. Firstly, nodes are independent on each other. Secondly, nodes are memoryless, and so, the new speed and direction of the nodes are independent on their previous speed and direction. Thirdly, nodes can move at any speed within a range.
A.5
Semi-random circular movement (SRCM) allows a node to form a circular (or curve) route [55]. When the node arrives at its destination following the route, it stops for a short period of time, and then, it starts to move towards another randomly chosen destination using a newly predefined route. The circular routes have been shown to reduce collisions between UAVs. This model is suitable for multi-UAV scenario.

2.4.3. Time-Dependent Mobility Models

The time-dependent mobility model minimizes acceleration and the drastic changes of direction in order to provide smooth movement (e.g., a smooth turn), which is more realistic [93]. There are three common characteristics of this model. Firstly, nodes are dependent on each other, whereby the vehicular nodes follow one another (including speed and direction) on the road. Secondly, nodes are memory-based, and so, the new speed and direction of the nodes are dependent on their previous speed and direction. Thirdly, nodes can move at any speed within a range.
A.6
Smooth turn (or realistic model) allows a node to choose a point and to form a circle around it, and then, it moves along the circle [55]. When the node moves towards another randomly chosen destination, it chooses a new point and moves along another circle around the newly chosen point. Nevertheless, there is lack of collision avoidance [94], which explain the need for better collaboration among nodes. This model is suitable for multi-UAV scenario.

2.5. What Are the Roles of Artificial Intelligence in FANETs?

Artificial intelligence (AI) approaches, including artificial neural network [95], fuzzy logic [96], reinforcement learning [97], and particle swarm optimization [98], has been adopted to improve the performance of complex systems in a diverse range of applications, such as FANETs. In FANETs, AI has been applied in routing [99] so that a decision maker observes the state of the operating environment, selects the best possible action (e.g., a stable and reliable route), receives reward, and learns about the appropriateness of the action under the state based on the reward. For instance, a flying node (decision maker) observes the mobility pattern of neighboring nodes (state), selects a stable and reliable route (action), receives throughput performance (reward), and learns the best possible route as time goes by [100]. In Reference [99], AI is used to predict the geographical location of flying nodes in the selection of next-hop node in FANETs. In Reference [101], AI is used to assist the nodes in VANETs and MANETs. In Reference [102], AI is used to form clusters and improve energy efficiency. In Reference [103], a swarm-based approach is applied to routing in a multi-UAV swarm scenario.

3. Taxonomy

This section presents a taxonomy of routing attributes in FANETs as shown in Figure 4. The rest of this subsection explains the taxonomy.

3.1. Objectives

There are three main routing objectives in FANETs:
O.1
Enhancing route stability. In FANETs, route stability and route lifetime are lower because a) the network topology is highly dynamic due to high mobility degree and b) the distance between nodes in FANETs is comparatively long. Hence, frequent route discovery and maintenance are needed to reestablish routes. In addition, route stability increases with node density and residual energy.
O.2
Enhancing network coverage. In FANETs, node density is lower, so a large transmission range and network coverage is needed to reduce the effects of link disconnections and network partitions in order to improve network connectivity. In addition, network coverage increases with node density in multi-UAV scenario.
O.3
Enhancing routing performance and QoS. Since route stability is lower in FANETs, the routing performance reduces due to increased route discovery and maintenance. Hence, suitable routes (e.g., routes that provide high route stability and route lifetime, and routes with lesser number of hops that reduce the latency of data dissemination in an ad hoc manner) are identified and selected. In addition, QoS increases with node density and transmission range, which increases network connectivity.
In general, route stability is higher, network coverage is higher, and routing performance improves:
  • higher QoS (e.g., higher throughput, as well as lower latency and packet loss);
  • lower routing cost;
  • longer route lifetime;
  • lower latency of data dissemination in an ad hoc manner.

3.2. Challenges

There are three main challenges that must be addressed in routing for FANETs in order to improve routing performance, such as higher QoS performance and route setup success rate, as well as lower energy consumption and number of clusters (see Section 3.5):
X.1
High dynamicity. In FANETs, the highly dynamic network topology, as a result of high mobility, causes low link quality. Consequently, there are frequent link disconnections and network partitions, which increase route discovery and maintenance, resulting in lower routing performance. Various mobility models (see Section 2.4) of UAVs has been designed to investigate routing [104].
X.2
High cost. In FANETs, frequent route updates, route discovery (or to reestablish routes), route maintenance (as well as packet retransmission) due to route failure, can incur three main types of costs: (a) routing overhead (or inefficient resource utilization); (b) energy consumption; and (c) computational cost due to the time incurred for route discovery and maintenance. Multi-UAVs can be deployed to increase connectivity among UAV [7].
X.3
Low residual energy. In FANETs, UAVs, which are powered by battery, have limited energy (a) to perform routing (i.e., route updates, discovery, and maintenance); (b) to retransmit packets due to route failure; and (c) to support long transmission range due to the comparatively long distance between UAVs. Meanwhile, UAVs with higher payloads increase energy consumption [7].

3.3. Routing Metrics

There are five main routing metrics used for selecting routes in FANETs:
M.1
Mobility metrics, such as speed, distance, and angle of arrival. This metric helps to achieve two main objectives in FANETs, namely enhancing route stability (O.1) and enhancing routing performance and QoS (O.3) because nodes with similar speed or angle of arrival are selected as part of a route to prolong the route lifetime.
M.2
Link expiration time, which depends on the distance between two UAVs. Longer link expiration time increases the link lifetime and, hence, the route lifetime. This metric helps to achieve two main objectives in FANETs, namely enhancing route stability (O.1) and enhancing routing performance and QoS (O.3) because (a) nodes with a higher number of neighbor nodes, which tend to have higher link expiration time, are selected as part of a route to increase route stability and (b) a new route can be reestablished before a link expires based on the link expiration time to ensure smooth network operation.
M.3
Geographical location can be obtained from GPS. In general, nodes are spaced far apart, and so, physically closer neighbor nodes are selected as part of a route; however, this may increase the number of hops of a route. This metric helps to achieve two main objectives in FANETs, namely enhancing route stability (O.1) and enhancing routing performance and QoS (O.3) because physically closer neighbor nodes can increase route lifetime and reduce route updates, discovery, and maintenance.
M.4
Residual energy can be used to reduce routing overhead incurred in route discovery and maintenance caused by link disconnections and network partitions, contributing to lower energy consumption. This metric helps to achieve three main objectives, namely enhancing route stability (O.1), enhancing network coverage (O.2), and enhancing routing performance and QoS (O.3) (e.g., higher throughput with reduced route discovery and maintenance) because neighbor nodes with higher residual energy are selected as part of a route to improve network connectivity among UAVs.
M.5
Node identity, such as node ID, can be used to select intermediate nodes, which receives packets and forwards them towards the destination, as part of a route in a random manner. This metric can be used along with the aforementioned routing metrics to achieve routing objectives.

3.4. Characteristics

Routes in FANETs can be characterized by the following:
C.1
Routing decision can be made at either the source node or the intermediate node. There are two options as follows:
C.1.1
Hop-by-hop routing includes the next-hop node and destination node information (i.e., node addresses) in the route request (RREQ) message. Hence, routing tables must be maintained at intermediate nodes to store the information [105].
C.1.2
Source routing includes the complete route information (i.e., the node addresses of all nodes of a route) in the RREQ message. Hence, routing table is not embedded in intermediate nodes, and these nodes can forward packets to destination nodes using the complete route information in RREQ.

3.5. Performance Measures

There are four main performance measures for routing in FANETs.
P.1
Higher QoS performance increases throughput and packet delivery rate (or reduces packet loss rate) as well as reduces end-to-end delay of delay-sensitive packets.
P.2
Lower energy consumption increases route lifetime.
P.3
Lower number of clusters increases the cluster size and, hence, the coverage of each cluster, which is a logical group of nodes comprised of the leader of a cluster (or cluster head, CH) and cluster members (CMs). Larger cluster size reduces intra-cluster communication (i.e., between CH and CMs from the same cluster) and inter-cluster communication (i.e., between CH and CMs from different clusters) [106,107].
P.4
Higher route setup success rate increases with the capability of setting up a route between a source node and a destination node.

4. Routing Framework

Routing framework consists of steps for nodes to find routes from source to destination nodes. In general, there are three main steps. Firstly, neighbor and route discoveries enable nodes (a) to broadcast control messages (e.g., hello messages) periodically to identify neighboring nodes in order to form an up-to-date neighbor set as the network topology changes as time goes by and (b) to exchange routing messages, whereby the source node sends messages, such as route request (RREQ), to the destination node to gather node information (e.g., node addresses and geographical location) along potential routes and the destination node sends messages, such as route reply (RREP), to the source node using the same route that the RREQ message traverses. Secondly, route selection enables nodes to use routing metrics to select routes. For instance, link expiration time (M.2) can be used to prolong route lifetime. Thirdly, route maintenance enables nodes to reestablish routes in order to cater for the dynamicity of network topology. There are four main categories of routing frameworks based on how route selection is made in FANETs as shown in Table 3. The rest of this section presents the frameworks of the routing schemes.
F.1
Adaptive: The adaptive routing scheme learns, selects, and changes routes dynamically based on the current network condition (e.g., network congestion level and network connectivity) and the updates of the routes. This enables nodes to select the optimal routes based on knowledge as time goes by.
The advantage is that packets can be sent along optimal routes, contributing to reduced link disconnections and network congestion and, hence, improved network performance. Nevertheless, there is a shortcoming whereby computational complexity increases due to learning.
Some adaptive routing schemes used in MANETs, VANETs, and FANETs are adaptive routing in dynamic ad hoc networks (AROD) [108], static-node assisted adaptive routing (SADV) [109], and self-learning routing protocol based on reinforcement learning (RLSRP) [100].
F.2
Proactive: The proactive (or active) routing scheme determines routes prior to packet arrivals to provide immediate data transmission; in other words, routes leading to all destination nodes in the network are established, stored, and maintained in routing tables in advance at UAVs. Since a route leading to a destination node is either readily available or unavailable at a source node, packets can be either sent or dropped immediately.
The advantage is that packets can be sent immediately without any initial delay incurred to establish routes. Nevertheless, there are two shortcomings. Firstly, nodes must exchange a large number of messages (or routing overheads) among themselves periodically to establish, update, and maintain routes in the routing table due to the high dynamicity of network topology in which link disconnections and network partitions are commonplace. Consequently, routing overhead is high and bandwidth utilization is inefficient. Secondly, routes in the routing table may not be responsive to the dynamicity of network topology, and so, packets are sent along nonoptimal routes.
Some proactive routing schemes used in MANETs, VANETs, and FANETs are optimized link state routing (OLSR) [110], destination-sequenced distance vector [111], and directional optimized link state routing protocol (DOLSR) [112].
F.3
Reactive: The reactive routing scheme determines routes upon packet arrivals in an on-demand manner; in other words, routes are established whenever data transmission is needed.
The advantage is that it addresses the high routing overhead issue found in proactive routing. Specifically, it reduces the periodic exchange of routing messages among nodes and the computational cost incurred to maintain and reestablish routes periodically, contributing to higher efficiency of bandwidth utilization. Nevertheless, there is a shortcoming that the initial delay incurred to establish routes increases.
Some reactive routing schemes used in MANETs, VANETs, and FANETs are ad hoc on-demand distance vector (AODV) [113], time-slotted AODV [114], modified-AODV [115], dynamic source routing (DSR) [116], and UAV-assisted vehicular network routing (UVAR) [101].
F.4
Hybrid: The hybrid routing scheme integrates both proactive and reactive routing schemes. In Reference [117], nodes in the networks are segregated into clusters. The intra-cluster communication (i.e., between CH and CMs from the same cluster) is supported by reactive routing, and the inter-cluster communication (i.e., between CH and CMs from different clusters) is supported by proactive routing. Hybrid routing scheme has been proposed to cluster multi-UAV swarm and select optimal routes over a clustered network [118].
The advantage is that it reduces routing overheads from source to destination nodes as intra-cluster communication can be excluded in route discovery.
Some hybrid routing schemes used in MANETs, VANETs, and FANETs are ant colony optimization [119], grey wolf optimization [120,121], moth flame optimization [122,123], and energy aware link based clustering [102].

5. Routing Schemes in FANETs

This section presents a survey on routing schemes in FANETs, and a summary of the routing schemes is shown in Table 4. Based on the frameworks presented in Section 4, the routing schemes are segregated into four categories, namely adaptive, proactive, reactive, and hybrid routing schemes.

5.1. Adaptive

This section presents two adaptive routing schemes for FANETs.

5.1.1. Enhancing Routing Performance Using Reinforcement Learning

Zheng et al. [100] propose an adaptive routing scheme that enables each node to use reinforcement learning (RL), which is an artificial intelligence approach, to learn from its operating environment and to select the most suitable next-hop node as part of a route in FANETs. The main objectives are to enhance route stability (O.1) as well as to enhance routing performance and QoS (O.3) in FANETs. The routing scheme addresses two challenges, namely high dynamicity (X.1) of network topology as flying nodes have high mobility and cost (X.2), particularly energy consumption and computational cost. The routing scheme is designed for hop-by-hop routing (C.1.1), specifically a next-hop node is selected as part of a route. The underlying medium access control (MAC) has three main characteristics to support routing. Firstly, nodes exchange handshaking messages, such as ready-to-send, wait-to-send, and clear-to-send, to clear a channel in order to increase link reliability. Secondly, there are two transceivers used for concurrent transmission and reception of control messages and data packets, respectively. Examples of information in control messages are geographical locations and handshaking messages. Thirdly, directional antennas are used, whereby the antennas are directed properly (i.e., the antennas are directed towards the transmitter at the receiver and towards the receiver at the transmitter) after a successful handshake, which helps to improve the link stability and, hence, the route stability.
During the neighbor and route discoveries stage, each node sends control messages that contain mobility metrics (M.1) (i.e., nodes’ velocity), node identity (M.5) (i.e., node addresses), and the geographical locations (M.3) (i.e., GPS coordinates) of one-hop neighboring nodes to form a neighbor set comprised of two-hop neighboring nodes as well as to predict the next geographical location of the neighboring nodes based on their velocity. During the route selection stage, each node selects a next-hop node, which is in the idle state after a successful handshake, that provides the shortest route with highest possible packet deliver rate towards the destination node. RL is embedded in each node, and it has three main representations, including the following:
  • state represents the status of the node (i.e., whether ready-to-send, wait-to-send, or clear-to-send in a handshake);
  • action represents whether to transmit data packets;
  • reward represents positive reward (i.e., when packets arrive at the destination node) or negative reward (i.e., when packets fail to arrive at the destination node).
RL enables each node to observe its state, to learn, and to take the right action at the right time in order to maximize its reward as time goes by. During the route maintenance stage, which is required when the accumulated reward of the node becomes lower than a predefined threshold as a result of packet loss, the node initiates the route discovery mechanism (or the first stage).
The routing scheme is compared with a state-of-the-art scheme that utilizes directional antennas and location estimation within the MAC layer, which uses unicasting and geo-casting routing approaches based on location and trajectory information so as to keep track of high-speed flying UAVs of which the topology changes. Random waypoint mobility model (A.2) is used in simulation. The routing scheme has been shown to increase QoS (P.1) (i.e., lower delay), route setup success rate (P.4) (i.e., packet deliver rate), and route lifetime.

5.1.2. Enhancing Routing Performance Using Clustering

Khelifi et al. [99] propose an adaptive routing scheme that enables each node to use fuzzy logic to predict the next geographical location of the neighboring nodes based on their received signal strength in scenarios with unknown geographical locations (e.g., the GPS does not function) and select the most suitable next-hop node as part of a route in FANETs. The main objective is to enhance routing performance and QoS (O.3) in FANETs. The routing scheme addresses three challenges, namely high dynamicity (X.1) of network topology, cost (X.2), as well as low residual energy (X.3) as a result of high energy consumption and computational cost since flying nodes are spaced far apart in the sky. The routing scheme is designed for both hop-by-hop (C.1.1) and source (C.1.2) routing approaches.
During the neighbor and route discoveries stage, each node sends control messages that contain node identity (M.5) (i.e., node addresses) to form a neighbor set comprised of two-hop neighboring nodes as well as to predict the geographical locations of one-hop neighboring nodes based on received signal strength, which indicates the distance between nodes, using fuzzy logic [127]. During the route selection stage, in order to reduce energy consumption, the underlying network is clustered based on a) residual energy (M.4), whereby nodes with higher residual energy are selected as CHs, and b) geographical location (M.3), whereby nodes near a CH joins its cluster. The CH collects data from CMs and then aggregates and forwards the data. Selecting CHs with high residual energy and node density reduces energy consumption and, hence, prolongs route lifetime. During the route maintenance stage, which is required when neighboring nodes move out of a node’s transmission range, the node initiates the route discovery mechanism (or the first stage).
The routing scheme is compared with a state-of-the-art scheme which is an energy-efficient multi-hop hierarchical routing protocol that optimizes clustering process based on an energy-efficient strategy. Random direction mobility model (A.3) is used in simulation. The routing scheme has been shown to increase QoS (P.1) (i.e., higher throughput) and to reduce energy consumption (P.2).

5.1.3. Enhancing Routing Performance Using Swarm-Based Clustering

Ali et al. [128] propose an adaptive routing scheme that minimizes the issue of unstable routes caused by limited battery and high mobility of UAVs. The proposed scheme uses the glowworm swarm optimization algorithm in an energy-aware cluster formation, which includes CH election. The main objective is to enhance route stability (O.1) as well as to enhance routing performance and QoS (O.3) in FANETs. The routing scheme addresses three challenges, namely high dynamicity (X.1) of network topology and cost (X.2) as well as low residual energy (X.3) as a result of high energy consumption and computational cost since flying nodes are spaced far apart in the sky. The routing scheme is designed for both hop-by-hop (C.1.1) and source (C.1.2) routing approaches.
During the neighbor and route discoveries stage, each node sends control messages that contain residual energy (M.4). Each node forms a neighbor set, and the neighbors are sorted according to a fitness value, which is calculated based on their respective residual energy levels. During the route selection stage, in order to reduce energy consumption, the underlying network is clustered based on mobility metrics (M.1), whereby nodes join a cluster in which its speed is near the speed of the CH of the cluster. The CH collects data from CMs and then aggregates and forwards the data. Therefore, selecting CHs with higher residual energy level and node density reduces energy consumption, and hence, it prolongs route lifetime. For route selection, a route is selected based on geographical location (M.3) and residual energy (M.4) of nodes. During the route maintenance stage, which is required when the residual energy level of CHs or CMs reaches the minimum threshold, the CHs and CMs initiate the route discovery mechanism, which is the first stage.
The routing scheme is compared with a state-of-the-art, which is a swarm-based routing scheme that provides an optimized number of clusters for routing. Random direction mobility model (A.3) is used in simulation. The routing scheme has been shown to increase QoS (P.1) (i.e., lower cluster formation time) and route setup success rate (P.4) as well as to reduce energy consumption (P.2).

5.2. Proactive

This section presents three proactive routing schemes for FANETs.

5.2.1. Enhancing Routing Performance Using Shortest Route

Alshabtat et al. [112] propose a proactive routing scheme for nodes equipped with directional antennas to find the shortest route, which has the least possible number of nodes in a route while reducing routing overhead. The main objectives are to enhance network coverage (O.2) as well as to enhance routing performance and QoS (O.3), in FANETs. The routing scheme addresses two challenges, namely high dynamicity (X.1) of network topology and cost (X.2), particularly routing overhead. The routing scheme is designed for hop-by-hop routing (C.1.1) approach.
During the neighbor and route discoveries stage, each node broadcasts hello messages to one-hop neighboring nodes to form a neighbor set comprised of two-hop neighboring nodes. The hello messages are not forwarded to reduce cost, particularly routing overhead and energy consumption. During the route selection stage, each node selects a next-hop node by using mobility metrics (M.1) (i.e., the relative speed of nodes), whereby neighbor nodes with similar mobility metrics are selected. The farthest node is selected in case of more than a single potential next-hop node in order to reduce the number of hops of a route, which helps to reduce the end-to-end delay of packet transmission. During the route maintenance stage, link disconnections are detected by the absence of the periodic hello messages. The intermediate node sends a link failure notification message to the source node in order to initiate a route discovery mechanism [110].
The routing scheme is compared with a state-of-the-art scheme that aims to provide lower end-to-end delay. Random waypoint (A.2) and semi-random circular movement (A.5) mobility models are used in simulation. The routing scheme has been shown to increase QoS (P.1) (i.e., higher throughput, as well as lower end-to-end delay and routing overhead).

5.2.2. Enhancing Route Stability Based on Link Connectivity

Rosati et al. [124] propose a proactive routing scheme that enables each node to select a next-hop node with the maximum link connectivity time in order to extend coverage in FANETs. The main objectives are to enhance route stability (O.1) as well as to enhance routing performance and QoS (O.3) in FANETs. The routing scheme addresses the challenge of high dynamicity (X.1) of network topology, which causes frequent updates of routing table. This routing protocol is designed for source routing (C.1.2).
During the neighbor and route discoveries stage, each node broadcasts hello messages, which contains the mobility metrics (M.1) (i.e., nodes’ velocity), node identity (M.5) (i.e., node addresses), and the geographical locations (M.3) (i.e., altitude, latitude, and longitude) of one-hop neighboring nodes to one-hop neighboring nodes to form a neighbor set comprised of two-hop neighboring nodes. During the route selection stage, the source node uses mobility metrics (M.1) (i.e., distance and velocity), the geographical location (M.3) of the destination node, and the link expiration time (M.2) between the source node and the destination node to select a route comprised of links with higher expected link expiration time to increase the route lifetime between nodes (i.e., source and destination). During the route maintenance stage, the link expires (or disconnects) and so the source node recalculates the link expiration time of another link in order to reestablish routes.
The routing scheme is compared with a state-of-the-art scheme that uses hello messages and topology control messages to discover and disseminate link state information. Random waypoint mobility model (A.2) is used in simulation. The routing scheme has been shown to increase QoS (P.1) (i.e., lower outage time, which contributes to lower packet loss rate) and to reduce energy consumption (P.2).

5.2.3. Enhancing Routing Performance Using Probability of Link Disconnection

Ganbayar et al. [125] propose a proactive routing scheme to select routes based on the probability of link disconnection between nodes in a route as a result of high mobility in order to prolong route lifetime. The main objectives are to enhance route stability (O.1) as well as to enhance routing performance and QoS (O.3) in FANETs. The routing scheme addresses two challenges, namely high dynamicity (X.1) of network topology as well as low residual energy (X.3) due to retransmission. The routing scheme is designed for source routing (C.1.2).
During the neighbor and route discoveries stage, the source node periodically broadcasts RREQ messages that contain mobility metrics (i.e., nodes’ velocity) (M.1) and geographical location (M.3) of one-hop neighboring nodes to form a neighbor set comprised of two-hop neighboring nodes and to gather node information along potential routes. Intermediate nodes that receive RREQ calculates the link expiration time (M.2) and the probability of route breakage based on mobility of nodes. During the route selection stage, the destination nodes, which receive RREQ messages via different routes, select a route that provides higher link expiration time (i.e., higher connectivity time between source and destination) and lower probability of route breakage in order to prolong route lifetime and to reduce delay. The destination node sends a RREP message to the source node using the same route that the RREQ message traverses. During the route maintenance stage, link disconnection occurs due to the dynamicity of network topology and so the source node determines an alternative route before the expiration of the link expiration time.
The routing scheme is compared with a state-of-the-art scheme, which is a conventional routing scheme that establishes routes to destinations in an on-demand manner and supports both unicast and multicast routing. Random waypoint mobility model (A.2) is used in simulation. The routing scheme has been shown to increase route setup success rate (P.4) and to reduce energy consumption (P.2).

5.3. Reactive

This section presents two reactive routing schemes for FANETs.

5.3.1. Enhancing Routing Performance in Vehicular Networks Using UAV-Assisted Approach

Omar et al. [101] propose a reactive routing scheme that enables UAVs to establish routes among themselves and with vehicular nodes on land when network partitions occur among the vehicular nodes. This means that, during normal operation, vehicular nodes communicate among themselves; however, when network partitions occur, some vehicular nodes are unable to communicate with each other. Therefore, the vehicular nodes establish routes with UAVs; specifically, a route consists of several parts, including links between vehicles, between vehicles and UAVs, and between UAVs. The main objectives are to enhance the route stability (O.1) as well as to enhance routing performance and QoS (O.3) in FANETs. The routing scheme addresses two challenges, namely high dynamicity (X.1) of network topology and cost (X.2), particularly routing overhead. The routing scheme is designed for source routing (C.1.2).
During the neighbor and route discoveries stage, each node broadcasts hello messages to form a neighbor set comprised of two-hop neighboring nodes. The hello message contains the geographical location (M.3), node identity (M.5), and one-hop neighboring nodes. Subsequently, the source node broadcasts RREQ messages that accumulate the link expiration time (M.2) along potential routes. Shorter distance between a pair of UAVs tends to increase the link expiration time and, hence, provides a longer link connectivity. During the route selection stage, the destination nodes receive RREQ messages via different routes and select a route with the highest link expiration time among the routes based on the minimum link expiration time of each route in order to prolong route lifetime. The destination node sends a RREP message to the source node using the same route that the RREQ message traverses.
The routing scheme is compared with a state-of-the-art scheme, which is a conventional routing scheme that establishes routes to destinations in an on-demand manner and supports both unicast and multicast routing. Random walk mobility model (A.1) is used in simulation. The routing scheme has been shown to increase QoS (P.1) (i.e., higher packet delivery rate and lower end-to-end delay) and route setup success rate (P.4).

5.3.2. Enhancing Route Stability Using Link Delay

Biomo et al. [126] propose a reactive routing scheme, which is based on AODV [129], that enables UAVs to establish routes by accumulating a route stability factor, which is based on link delay and mobility. The main objectives are to enhance route stability (O.1) as well as to enhance routing performance and QoS (O.3) in FANETs. The routing scheme addresses two challenges, namely high dynamicity (X.1) of network topology and cost (X.2), particularly routing overhead which increase energy consumption and computational complexity. The routing scheme is designed for hop-by-hop (C.1.1) and source routing (C.1.2) approaches.
During the neighbor and route discoveries stage, each node periodically broadcasts hello messages to form a neighbor set comprised of two-hop neighboring nodes. The hello message contains the sending time, geographical location (M.3) (i.e., GPS coordinates), mobility metric (M.1) (i.e., the distance with and average speed of neighboring nodes), and one-hop neighboring nodes. Using the sending time information and the reception time at a neighboring node, the link delay can be estimated. Subsequently, the source node broadcasts RREQ messages to accumulate the route stability factor, which is based on the link delay and mobility metric along potential routes [130,131]. During the route selection stage, the destination nodes, which receive RREQ messages via different routes, select a route that provides the least accumulated route stability factor in order to increase route stability and to reduce delay. The destination node sends a RREP message to the source node using the same route that the RREQ message traverses. During the route maintenance stage when a link disconnection occurs, an intermediate node performs a local link repair so that the rest of the route can still be used and identifying a new route is not necessary. Specifically, the intermediate node does the following:
  • stores the affected packets;
  • broadcasts RREQ to identify a next-hop node located closer to the destination node, which is based on the greedy geographic forwarding (GGF) [132];
  • selects the next-hop node to form a new link in order to repair the broken route;
  • forwards packets along the new link. Nevertheless, if steps broadcasting RREQ and selecting the next-hop node are unsuccessful, then the node drops the packets in its storage.
The routing scheme is compared with a state-of-the-art scheme that prefers the route with the least number of hops during route discovery. Random waypoint mobility model (A.2) is used in simulation. The routing scheme has been shown to increase QoS (P.1) (i.e., higher packet delivery rate and lower routing overhead).

5.4. Hybrid

This section presents two hybrid routing schemes for FANETs.

5.4.1. Enhancing Route Stability Using Energy-Efficient Technique

Ali et al. [102] propose a hybrid routing scheme that enables nodes to form clusters and routing by adjusting the transmission range of nodes in order to reduce energy consumption and computational complexity. The main objectives are to enhance route stability (O.1) and network coverage (O.2) in FANETs. The routing scheme addresses two challenges, namely high dynamicity (X.1) of network topology and low residual energy (X.3) as a result of long transmission range and packet retransmission. This routing scheme is designed for source routing (C.1.2).
During the neighbor and route discoveries stage, each node periodically broadcast messages (e.g., hello messages) to form a neighbor set comprised of two-hop neighboring nodes—the hello message contains its geographical location (M.3) and node identity (M.5)—as well as to predict the geographical locations of two-hop neighboring nodes based on coordinates, which indicates the distance between nodes. During the route selection stage, in order to increase network stability and hence the route lifetime, the underlying network is clustered using the K-mean algorithm based on a) residual energy (M.4) and mobility metrics (M.1), whereby nodes with higher residual energy and moving close to the average speed of the average speed are selected as CHs, and b) on geographical location (M.3) and node identity (M.5), whereby nodes moving close to the average speed of a CH joins its cluster. The CH collects data from CMs and then aggregates and forwards the data. The transmission power of CHs and CMs are adjusted to further reduce energy consumption. CHs are responsible for sending the data between the clusters. The route between CHs are established by considering the residual energy (M.4) of the CH. Hence, a CH with higher residual energy is selected as intermediate node. During the route maintenance stage, link disconnection occurs due to the dynamicity of network topology, and so, the route discovery mechanism is initiated to select a new CH or to join another CH as well as to reestablish routes.
The routing scheme is compared with a state-of-the-art scheme that uses the swarm-based algorithm to provide an optimized resource utilization. Random walk mobility model (A.1) is used in simulation. The routing scheme has been shown to reduce energy consumption (P.2) and the number of clusters in the network (P.3).

5.4.2. Enhancing Routing Performance Using the Node Density of UAVs

Yu et al. [103] propose a hybrid routing scheme that enables nodes in a swarm of UAVs (or multi-UAV swarm) to form clusters and to establish a route in which nodes are geographically nearer to each other in order to increase link expiration time. The main objective is to enhance route stability (O.1) in FANETs. The routing scheme addresses the challenge of high dynamicity (X.1) of network topology. The routing scheme is designed for source routing (C.1.2).
During the neighbor and route discoveries stage, each node periodically broadcasts hello message to form a neighbor set comprised of two-hop neighboring nodes. The hello message contains the three-dimensional geographical location of nodes. During the route selection stage, in order to increase network stability and hence the route lifetime, the underlying network is clustered based on (a) residual energy (M.4) and mobility metrics (M.1), whereby nodes with higher residual energy and moving close to the average speed of the nodes in the neighbor set are selected as CHs, and (b) link expiration time (M.2) and geographical location (M.3), whereby nodes geographically close to the CH joins its cluster to reduce the latency of data dissemination and to improve network connectivity in order to increase route stability in both inter- or intra-cluster communication. During the route maintenance stage, link disconnection occurs due to the dynamicity of network topology, and so, the route discovery mechanism is initiated to select a new CH or to join another CH as well as to reestablish routes. The CH collects data from CMs and then aggregates and forwards the data. CHs are responsible for sending the data between the clusters as well. The route between CHs are established by considering the mobility metrics (M.1) (i.e., average distance), whereby nearest located CH is selected as an intermediate node to route the data. During the route maintenance stage, which is required when there are lower number of CMs in a cluster than a predefined threshold, the node initiates the route discovery mechanism (or the first stage) to re-cluster the network and to reestablish routes.
The routing scheme is compared with a state-of-the-art scheme, which is a cluster-based routing scheme. Realistic mobility model (A.6) is used in simulation. The routing scheme has been shown to increase QoS (P.1) as well as to reduce energy consumption (P.2) and the number of clusters in the network (P.3).

6. Open Issues

FANETs possess unique characteristics (e.g., high mobility degree, high dynamicity of network topology, low energy constraint, as well as different node densities in different network scenarios) that require novel routing schemes, although there are limited routing schemes for FANETs in the literature, but this survey paper can motivate researchers by identifying more research gaps in the respective domains. For instance, the high mobility degree characteristic has brought about three challenges to routing:
  • high dynamicity (X.1), whereby nodes with high mobility can cause significant changes to network topology;
  • high cost (X.2), whereby nodes with high mobility can cause link disconnections, resulting in high packet retransmission due to route failure, route discovery, and route maintenance;
  • low residual energy (X.3), whereby higher number of message exchanges can cause high energy consumption and shorter route lifetime.
Novel routing schemes can cater to the unique characteristics in order to achieve better network performance, such as higher QoS performance (P.1) (e.g., higher throughput, as well as lower packet loss rate and delay) and lower energy consumption (P.2). In addition, novel routing schemes must be designed to cater for next-generation applications, which have stringent QoS requirements, such as high throughput as well as low latency and packet loss rate in real-time surveillance with video, voice, and images. Table 5 depicts the summary of open issues. The rest of this section presents open issues that can be pursued in this research topic.

6.1. Minimizing the Effects of Frequent Link Disconnections to Improve Routing

Frequent link disconnections and network partitions can increase route discovery and maintenance to reestablish routes as well as increase packet retransmission [133]. Consequently, network performance degrades, which can be unacceptable in critical circumstances, such as disaster relief and rescue operations [104,134]. There are two main challenges in improving network connectivity: a) high dynamicity (X.1) of network topology and b) high cost (X.2) due to increased routing overhead, energy consumption, and computational cost. Addressing this open issue helps to achieve higher QoS performance (P.1), lower energy consumption (P.2), and higher route setup success rate (P.4). Further investigation could be pursued to reduce link disconnections and network partitions; for instance, the next geographical location of a UAV can be predicted and used to maintain a route or to select intermediate nodes of a route.

6.2. Performing Routing in the Multi-UAV Swarm Scenarios

In the multi-UAV swarm scenarios, a massive amount of data is generated by a large collection of autonomous, small-sized, and lightweight (or non-weight-carrying) UAVs, which is a scenario called ultra-densification. Multi-UAV swarm also possess unique characteristics of FANETs, such as high mobility degree and high dynamicity of network topology. In addition to high dynamicity (X.1) of network topology, high cost (X.2), and low residual energy (X.3), there are two new challenges: (a) high channel demand requires high channel capacity [135,136], and (b) high collision rate among UAVs in a large swarm of UAVs requires reliable communication [137]. Further investigation could be pursued to investigate routing for reliable communication under different mobility models with different social behaviors of swarms (e.g., a school of fish, a swarm of bees, a swarm of ants, and a pack of wolves), levels of ultra-densification, and collision rates. Further investigation could also be pursued to design context-aware routing schemes that select next-hop and backhaul nodes (or BS) based on internal and external ambient factors, such as geographical location, the amount of fuel, and hardware capabilities, in order to establish long-term routes [93].

6.3. Performing Clustering for Supporting Routing in Multi-UAVs

Due to ultra-densification in the multi-UAVs and multi-UAV swarm scenarios, essential collaborative tasks, such as data aggregation, load distribution, resource allocation, and local synchronization, are performed to cater to the massive amount of data generated by UAVs. Clustering (i.e., hierarchical routing) segregates nodes with similar characteristics and behaviors into logical groups in order to improve network stability and scalability; hence, it is suitable to support the collaborative tasks [138]. Since clustering can increase network lifetime, it can increase route stability and lifetime [139]. While clustering schemes have been proposed for FANETs [103], there is a lack of focus on scenarios under ultra-densification. Since the network densification changes with geographical locations and time, further investigation could be pursued to perform clustering using context-aware approaches, such as artificial intelligence approaches and bio-inspired algorithms [140].

6.4. Enhancing Mobility Models for the Investigation of Routing in FANETs

The mobility pattern of the UAVs are highly dynamic in the three-dimensional space, and they may be spaced far apart, causing link disconnection that reduces route lifetime. In addition to high dynamicity (X.1) of network topology, high cost (X.2), and low residual energy (X.3), there are two new challenges: (a) high mobility degree that causes the next geographical locations of nodes to become unpredictable and (b) movement in the three-dimensional space, which differs from the two-dimensional space in MANETs and VANETs [137]. Nevertheless, some routing schemes have been investigated under two-dimensional space in FANETs, including those in References [102,103,112]. To the best of our knowledge, an extensive mobility model that covers the two new challenges are yet to be investigated to support the investigation of routing in FANETs [141]; nevertheless, movement with high mobility degree in a three-dimensional space is the core characteristic of FANETs. Further investigation could be pursued to enhance the mobility models so that the mobility characteristics and flight routes of UAVs emulate real-life scenarios in FANETs [142].

6.5. Improving Network Performance and Survivability through Multi-Pathing

Frequent link disconnections and network partitions occur due to high dynamicity (X.1) of network topology, and so, route discovery and maintenance must be performed frequently to reestablish routes, resulting in higher cost (X.2). Multi-pathing establishes more than a single route so that (a) multiple routes can be used at the same time to maximize resource utilization [143,144] and to reduce network congestion [145,146], which is important under ultra-densification, and (b) a backup route is available when the current route is broken to improve network survivability and fault tolerance [147], contributing to reduced routing overhead [148]. Further investigation could be pursued to investigate multi-pathing to improve network performance and survivability. Context-aware approaches, such as artificial intelligence approaches and bio-inspired algorithms [140], can be adopted to cater to the dynamic network condition that affects multi-pathing.

6.6. Improving Network Performance by Using Artificial Intelligence

Artificial intelligence (AI), such as deep learning and reinforcement learning, allows a system to autonomously learn from its operating environment and past experience in order to improve its performance as time goes by. AI plays a vital role in optimizing communication among flying nodes [139,149]. For instance, reinforcement learning enables UAVs to learn from their respective operating environment and to adjust their position and movement (i.e., speed and direction) accordingly. Learning enables UAVs to self-organize and to select optimal routes among themselves. Furthermore, AI can be embedded in ground stations to enhance FANETs, such as to detect the presence of UAVs, to monitor their movement and behavior as time goes by, to create channel model and utilization map, and to distribute traffic load among routes in the multi-UAV swarm scenario. Further investigation could be pursued to explore and exploit the AI domain to improve routing performance in FANETs.

6.7. Improving Network Coverage by Using High and Low Altitude UAVs

Frequent link disconnections and network partitions occur due to high dynamicity (X.1) of network topology, particularly when nodes move out of the coverage (or transmission range) of neighboring nodes or BS. This increases route discovery and maintenance to reestablish routes, as well as packet retransmission, resulting in higher cost (X.2) [133]. Consequently, network performance degrades, which can be unacceptable in critical circumstances, such as during disaster relief and rescue operations [104,134]. Both high and low altitude platforms can be used. The high altitude platforms (e.g., balloons) provide a large coverage that can improve connectivity among nodes [150,151], hence improving the routing performance. The low altitude platforms (e.g., helikites [152]) provide a small coverage that can improve local connectivity among nodes [153]. Further investigation could be pursued to investigate how UAVs can collaborate with high and low altitude platforms to improve routing performance.

6.8. Reducing Energy Consumption Using Green Energy

UAVs are highly dynamic (X.1) in the three-dimensional space, and they may be spaced far apart, causing frequent link disconnection and network partitions that reduce route lifetime. Hence, high energy consumption is incurred to establish and select routes from time to time. Green energy-based mechanisms have been introduced to reduce energy consumption [26]. It helps to keep the energy by reducing the number of exchange messages between UAVs. Further investigation could be pursued to investigate how UAVs can collaborate for energy harvesting. It provides the longer life of network and route by keeping UAVs alive. Solar panels can be used to harvest energy in order to minimize the drainage of power in UAVs. Addressing this open issue helps to achieve lower energy consumption (P.2) and high route setup rate (P.4).

7. Conclusions

This paper presents a review of the limited work on routing in flying ad hoc networks (FANETs), which possess unique characteristics (e.g., movement with high mobility degree in the three-dimensional space) that distinguish itself from the traditional mobile ad hoc networks and vehicular ad hoc networks. Routing in FANETs aims to achieve the objectives of enhancing route stability, network coverage, as well as routing performance and quality of service while addressing the challenges of high dynamicity, high cost, and low residual energy. Various routing metrics, such as mobility metrics, link expiration time, geographical location, and residual energy, are used to select routes; for instance, routes with higher link expiration time are selected. Due to the limited research done on routing in FANETs as well as the limited focus on the unique characteristics of FANETs, there remains a large amount of future work, and this paper has laid a solid foundation to motivate investigations of the open issues raised in this topic.

Author Contributions

All the authors contributed to the work and wrote the article. M.F.K. proposed the idea, designs, and writing. K.-L.A.Y., R.M.N. and M.A.I. suggested directions for the detailed designs as well as coordinated the work. All authors have read and agreed to the published version of the manuscript.

Funding

This work was part of the project entitled “A Novel Clustering Algorithm based on Reinforcement Learning for the Optimization of Global and Local Network Performances in Mobile Networks” funded by the Malaysian Ministry of Education under Fundamental Research Grant Scheme FRGS/1/2019/ICT03/SYUC/01/1.

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

The following abbreviations are used in this manuscript:
ARODAdaptive routing in dynamic ad hoc networks
BSBase station
CHCluster head
CMCluster member
DOLSRDirectional optimized link state routing
FANETFlying ad hoc network
GGFGreedy geographic forwarding
GPSGlobal positioning system
LOSlinear dichroism
MACMedium access control
MANETMobile ad hoc network
NLOSNon line of sight
OLSROptimized link state routing
QoSQuality of service
RLSRPReinforcement learning based self-learning routing protocol
RREPRoute reply
RREQRoute request
SRCMSemi-random circular movement
UAVUnmanned aerial vehicle
UVARUAV-assisted VANET routing protocol
V2RVehicle to road side unit
V2VVehicle to vehicle
VANETVehicular ad hoc network

References

  1. Zhang, C.; Zhang, W.; Wang, W.; Yang, L.; Zhang, W. Research challenges and opportunities of UAV millimeter-wave communications. IEEE Wirel. Commun. 2019, 26, 58–62. [Google Scholar] [CrossRef]
  2. Bürkle, A.; Segor, F.; Kollmann, M. Towards autonomous micro UAV swarms. J. Intell. Robot. Syst. 2011, 61, 339–353. [Google Scholar] [CrossRef]
  3. Ben-Asher, Y.; Feldman, S.; Gurfil, P.; Feldman, M. Distributed decision and control for cooperative UAVs using ad hoc communication. IEEE Trans. Control Syst. Technol. 2008, 16, 511–516. [Google Scholar] [CrossRef]
  4. Mauve, M.; Widmer, J.; Hartenstein, H. A survey on position-based routing in mobile ad hoc networks. IEEE Netw. 2001, 15, 30–39. [Google Scholar] [CrossRef] [Green Version]
  5. Zeadally, S.; Hunt, R.; Chen, Y.-S.; Irwin, A.; Hassan, A. Vehicular ad hoc networks (VANETs): Status, results, and challenges. Telecommun. Syst. 2012, 50, 217–241. [Google Scholar] [CrossRef]
  6. Li, F.; Wang, Y. Routing in vehicular ad hoc networks: A survey. IEEE Veh. Technol. Mag. 2007, 2, 12–22. [Google Scholar] [CrossRef]
  7. Bekmezci, I.; Sahingoz, O.K.; Temel, A. Flying ad hoc networks (FANETs): A survey. Ad Hoc Netw. 2013, 11, 1254–1270. [Google Scholar] [CrossRef]
  8. Souza, E.; Nikolaidis, I.; Gburzynski, P. A new aggregate local mobility clustering algorithm for VANETs. In Proceedings of the IEEE International Conference on Communications, Cape Town, South Africa, 23–27 May 2010; pp. 1–5. [Google Scholar]
  9. Lee, E.-K.; Oh, S.Y.; Gerla, M. Rfid assisted vehicle positioning in VANETs. Pervasive Mob. Comput. 2012, 8, 167–179. [Google Scholar] [CrossRef]
  10. Song, Q.; Jin, S.; Zheng, F.-C. Completion time and energy consumption minimization for UAV-enabled multicasting. IEEE Wirel. Commun. Lett. 2019, 8, 821–824. [Google Scholar] [CrossRef]
  11. Wu, Q.; Zeng, Y.; Zhang, R. Joint trajectory and communication design for multi-UAV enabled wireless networks. IEEE Trans. Wirel. Commun. 2018, 17, 2109–2121. [Google Scholar] [CrossRef] [Green Version]
  12. Morse, B.S.; Engh, C.H.; Goodrich, M.A. UAV video coverage quality maps and prioritized indexing for wilderness search and rescue. In Proceedings of the 5th ACM/IEEE International Conference on Human-Robot Interaction, Osaka, Japan, 2–5 March 2010; pp. 227–234. [Google Scholar]
  13. Olsson, P.-M.; Kvarnström, J.; Doherty, P.; Burdakov, O.; Holmberg, K. Generating UAV communication networks for monitoring and surveillance. In Proceedings of the 11th IEEE International Conference on Control Automation Robotics & Vision (ICARCV), Singapore, 7–10 December 2010; pp. 1070–1077. [Google Scholar]
  14. Samad, T.; Bay, J.S.; Godbole, D. Network-centric systems for military operations in urban terrain: The role of UAVs. Proc. IEEE 2007, 95, 92–107. [Google Scholar] [CrossRef]
  15. Chao, H.; Cao, Y.; Chen, Y. Autopilots for small fixed-wing unmanned air vehicles: A survey. In Proceedings of the IEEE International Conference on Mechatronics and Automation (ICMA), Harbin, China, 5–8 August 2007; pp. 3144–3149. [Google Scholar]
  16. Chaumette, S.; Laplace, R.; Mazel, C.; Mirault, R.; Dunand, A.; Lecoutre, Y.; Perbet, J.N. Carus, an operational retasking application for a swarm of autonomous UAVs: First return on experience. In Proceedings of the IEEE Military Communications Conference—Milcom, Baltimore, MD, USA, 7–10 November 2011; pp. 2003–2010. [Google Scholar]
  17. Quaritsch, M.; Kruggl, K.; Wischounig-Strucl, D.; Bhattacharya, S.; Shah, M.; Rinner, B. Networked UAVs as aerial sensor network for disaster management applications. e i Elektrotechnik und Informationstechnik 2010, 127, 56–63. [Google Scholar] [CrossRef]
  18. Sahingoz, O.K. Networking models in flying ad hoc networks (FANETs): Concepts and challenges. J. Intell. Robot. Syst. 2014, 74, 513–527. [Google Scholar] [CrossRef]
  19. Alsamhi, S.H.; Ma, O.; Ansari, M.S.; Gupta, S.K. Collaboration of drone and internet of public safety things in smart cities: An overview of qos and network performance optimization. Drones 2019, 3, 13. [Google Scholar] [CrossRef] [Green Version]
  20. Sahingoz, O.K. Mobile networking with UAVs: Opportunities and challenges. In Proceedings of the IEEE International Conference on Unmanned Aircraft Systems (ICUAS), Atlanta, GA, USA, 9–12 June 2013; pp. 933–941. [Google Scholar]
  21. Alshbatat, A.I.; Alsafasfeh, Q. Cooperative decision making using a collection of autonomous quad rotor unmanned aerial vehicle interconnected by a wireless communication network. Glob. J. Technol. 2012, 1, 212–218. [Google Scholar]
  22. Arafat, M.Y.; Moh, S. Location-aided delay tolerant routing protocol in UAV networks for post-disaster operation. IEEE Access 2018, 6, 59891–59906. [Google Scholar] [CrossRef]
  23. Zhang, S.; Zhang, H.; Di, B.; Song, L. Cellular UAV-to-X communications: Design and optimization for multi-UAV networks. IEEE Trans. Wirel. Commun. 2019, 18, 1346–1359. [Google Scholar] [CrossRef] [Green Version]
  24. Mekikis, P.V.; Antonopoulos, A.; Kartsakli, E.; Alonso, L.; Verikoukis, C. Communication recovery with emergency aerial networks. IEEE Trans. Consum. Electron. 2017, 63, 291–299. [Google Scholar] [CrossRef]
  25. Prodromos-Vasileios, M.; Antonopoulos, A. Breaking the Boundaries of Aerial Networks with Charging Stations. In Proceedings of the IEEE International Conference on Communications (ICC), Atlanta, GA, USA, 20–24 May 2019. [Google Scholar]
  26. Mahmud, I.; Cho, Y.Z. Adaptive Hello Interval in FANET Routing Protocols for Green UAVs. IEEE Access 2019, 7, 63004–63015. [Google Scholar] [CrossRef]
  27. Ye, J.; Zhang, C.; Lei, H.; Pan, G.; Ding, Z. Secure UAV-to-UAV systems with spatially random UAVs. IEEE Wirel. Commun. Lett. 2018, 8, 564–567. [Google Scholar] [CrossRef]
  28. Bauer, C.; Zitterbart, M. A survey of protocols to support ip mobility in aeronautical communications. IEEE Commun. Surv. Tutor. 2011, 13, 642–657. [Google Scholar] [CrossRef]
  29. Neji, N.; Lacerda, R.D.; Azoulay, A.; Letertre, T.; Outtier, O. Survey on the future aeronautical communication system and its development for continental communications. IEEE Trans. Veh. Technol. 2013, 62, 182–191. [Google Scholar] [CrossRef] [Green Version]
  30. Xie, J.; Wan, Y.; Kim, J.H.; Fu, S.; Namuduri, K. A survey and analysis of mobility models for airborne networks. IEEE Commun. Surv. Tutor. 2014, 16, 1221–1238. [Google Scholar] [CrossRef]
  31. Motlagh, N.H.; Taleb, T.; Arouk, O. Low-altitude unmanned aerial vehicles-based internet of things services: Comprehensive survey and future perspectives. IEEE Internet Things J. 2016, 3, 899–922. [Google Scholar] [CrossRef]
  32. Gupta, L.; Jain, R.; Vaszkun, G. Survey of important issues in UAV communication networks. IEEE Commun. Surv. Tutor. 2016, 18, 1123–1152. [Google Scholar] [CrossRef] [Green Version]
  33. Hayat, S.; Yanmaz, E.; Muzaffar, R. Survey on unmanned aerial vehicle networks for civil applications: A communications viewpoint. IEEE Commun. Surv. Tutor. 2016, 18, 2624–2661. [Google Scholar] [CrossRef]
  34. Bujari, A.; Calafate, C.T.; Cano, J.-C.; Manzoni, P.; Palazzi, C.E.; Ronzani, D. Flying ad hoc network application scenarios and mobility models. Int. J. Distrib. Sens. Netw. 2017, 13, 1550147717738192. [Google Scholar] [CrossRef] [Green Version]
  35. Oubbati, O.S.; Lakas, A.; Zhou, F.; Güneş, M.; Yagoubi, M.B. A survey on position-based routing protocols for flying ad hoc networks (FANETs). Veh. Commun. 2017, 10, 29–56. [Google Scholar] [CrossRef]
  36. Kaleem, Z.; Rehmani, M.H. Amateur drone monitoring: State-of-the-art architectures, key enabling technologies, and future research directions. IEEE Wirel. Commun. 2018, 25, 150–159. [Google Scholar] [CrossRef] [Green Version]
  37. Khan, M.; Khan, I.; Safi, A.; Quershi, I. Dynamic routing in flying ad hoc networks using topology-based routing protocols. Drones 2018, 2, 27. [Google Scholar] [CrossRef] [Green Version]
  38. Guillen-Perez, A.; Cano, M.-D. Flying ad hoc networks: A new domain for network communications. Sensors 2018, 18, 3571. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  39. Kaur, P.; Singh, A. Nature-inspired optimization techniques in VANETs and FANETs: A survey. In Advanced Computational and Communication Paradigms; Springer: Berlin, Germany, 2018; pp. 651–663. [Google Scholar]
  40. Otto, A.; Agatz, N.; Campbell, J.; Golden, B.; Pesch, E. Optimization approaches for civil applications of unmanned aerial vehicles (UAVs) or aerial drones: A survey. Networks 2018, 72, 411–458. [Google Scholar] [CrossRef]
  41. Jiang, J.; Han, G. Routing protocols for unmanned aerial vehicles. IEEE Commun. Mag. 2018, 56, 58–63. [Google Scholar] [CrossRef]
  42. Prakash, S.; Saroj, V. A review of wireless charging nodes in wireless sensor networks. In Data Science and Big Data Analytics; Springer: Berlin, Germany, 2019; pp. 177–188. [Google Scholar]
  43. Rajaraman, R. Topology control and routing in ad hoc networks: A survey. ACM SIGACT News 2002, 33, 60–73. [Google Scholar] [CrossRef]
  44. Liu, G.; Yan, Z.; Pedrycz, W. Data collection for attack detection and security measurement in mobile ad hoc networks: A survey. J. Netw. Comput. Appl. 2018, 105, 105–122. [Google Scholar] [CrossRef] [Green Version]
  45. Shah, S.A.A.; Ahmed, E.; Xia, F.; Karim, A.; Shiraz, M.; Noor, R.M. Adaptive beaconing approaches for vehicular ad hoc networks: A survey. IEEE Syst. J. 2018, 12, 1263–1277. [Google Scholar] [CrossRef] [Green Version]
  46. Hartenstein, H.; Laberteaux, P.L. A tutorial survey on vehicular ad hoc networks. IEEE Commun. Mag. 2008, 46, 164–171. [Google Scholar] [CrossRef]
  47. Al-Sultan, S.; Al-Doori, M.M.; Al-Bayatti, A.H.; Zedan, H. A comprehensive survey on vehicular ad hoc network. J. Netw. Comput. Appl. 2014, 37, 380–392. [Google Scholar] [CrossRef]
  48. Frew, E.W.; Brown, T.X. Networking issues for small unmanned aircraft systems. J. Intell. Robot. Syst. 2009, 54, 21–37. [Google Scholar] [CrossRef]
  49. Frew, E.W. Airborne communication networks for small unmanned aircraft systems. Proc. IEEE 2008, 96, 2008–2027. [Google Scholar] [CrossRef]
  50. Liu, S.; Ölveczky, P.C.; Meseguer, J. A framework for mobile ad hoc networks in real-time maude. In International Workshop on Rewriting Logic and Its Applications; Springer: Berlin, Germany, 2014; pp. 162–177. [Google Scholar]
  51. Han, Z.; Swindlehurst, A.L.; Liu, K.J.R. Optimization of MANET connectivity via smart deployment/movement of unmanned air vehicles. IEEE Trans. Veh. Technol. 2009, 58, 3533. [Google Scholar] [CrossRef]
  52. Yanmaz, E.; Kuschnig, R.; Bettstetter, C. Channel measurements over 802.11 a-based UAV-to-ground links. In Proceedings of the IEEE GLOBECOM Workshops (GC Wkshps), Houston, TX, USA, 5–9 December 2011; pp. 1280–1284. [Google Scholar]
  53. Yoon, J.; Liu, M.; Noble, B. Random waypoint considered harmful. In Proceedings of the IEEE INFOCOM Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No. 03CH37428), San Francisco, CA, USA, 30 March–3 April 2003; pp. 1312–1321. [Google Scholar]
  54. Le Boudec, J.Y.; Vojnovic, M. The random trip model: Stability, stationary regime, and perfect simulation. IEEE/ACM Trans. Netw. 2006, 14, 1153–1166. [Google Scholar] [CrossRef] [Green Version]
  55. Wang, W.; Guan, X.; Wang, B.; Wang, Y. A novel mobility model based on semi-random circular movement in mobile ad hoc networks. Inf. Sci. 2010, 180, 399–413. [Google Scholar] [CrossRef]
  56. Kuiper, E.; Nadjm-Tehrani, S. Mobility models for UAV group reconnaissance applications. In Proceedings of the IEEE International Conference on Wireless and Mobile Communications(ICWMC’06), Bucharest, Romania, 29–31 July 2006; p. 33. [Google Scholar]
  57. Brown, T.; Argrow, B.; Dixon, C.; Doshi, S.; Thekkekunnel, R.-G.; Henkel, D. Ad hoc UAV ground Network (Augnet). In Proceedings of the AIAA 3rd Unmanned Unlimited Technical Conference, Workshop and Exhibit, Chicago, IL, USA, 20–23 September 2004; p. 6321. [Google Scholar]
  58. Wang, J.; Ghosh, R.K.; Das, S.K. A survey on sensor localization. J. Control Theory Appl. 2010, 8, 2–11. [Google Scholar] [CrossRef]
  59. Ahn, H.-S.; Won, C.-H. Dgps/imu integration-based geolocation system: Airborne experimental test results. Aerosp. Sci. Technol. 2009, 13, 316–324. [Google Scholar] [CrossRef]
  60. Wong, A.K.; Woo, T.K.; Lee, A.T.; Xiao, X.; Luk, V.W.; Cheng, K.W. An agps-based elderly tracking system. In Proceedings of the IEEE First International Conference on Ubiquitous and Future Networks (ICUFN), Hong Kong, China, 7–9 June 2009; pp. 100–105. [Google Scholar]
  61. Singh, K.; Verma, A.K. Flying adhoc networks concept and challenges. In Advanced Methodologies and Technologies in Network Architecture, Mobile Computing, and Data Analytics; IGI Global: Philadelphia, PA, USA, 2019; pp. 903–911. [Google Scholar]
  62. Padró, J.-C.; Muñoz, F.-J.; Planas, J.; Pons, X. Comparison of four UAV georeferencing methods for environmental monitoring purposes focusing on the combined use with airborne and satellite remote sensing platforms. Int. J. Appl. Earth Obs. Geoinf. 2019, 75, 130–140. [Google Scholar] [CrossRef]
  63. Vijayanandh, R.; Kumar, J.D.; Kumar, M.S.; Bharathy, L.A.; Kumar, G.R. Design and fabrication of solar powered unmanned aerial vehicle for border surveillance. In Proceedings of the International Conference on Remote Sensing for Disaster Management; Springer: Berlin, Germany, 2019; pp. 61–71. [Google Scholar]
  64. Odonkor, P.; Ball, Z.; Chowdhury, S. Distributed operation of collaborating unmanned aerial vehicles for time-sensitive oil spill mapping. Swarm Evol. Comput. 2019, 46, 52–68. [Google Scholar] [CrossRef]
  65. Kang, J.-G.; Lim, D.-W.; Jung, J.-W. Energy-efficient forest fire prediction model based on two-stage adaptive duty-cycled hybrid x-mac protocol. Sensors 2018, 18, 2960. [Google Scholar] [CrossRef] [Green Version]
  66. Choudhary, G.; Sharma, V.; You, I. Sustainable and secure trajectories for the military internet of drones (IoD) through an efficient medium access control (mac) protocol. Comput. Electr. Eng. 2019, 74, 59–73. [Google Scholar] [CrossRef]
  67. George, J.; Sujit, P.B.; Sousa, J.B. Search strategies for multiple UAV search and destroy missions. J. Intell. Robot. 2011, 61, 355–367. [Google Scholar] [CrossRef]
  68. Sun, Z.; Wang, P.; Vuran, M.C.; Al-Rodhaan, M.A.; Al-Dhelaan, A.M.; Akyildiz, I.F. Bordersense: Border patrol through advanced wireless sensor networks. Ad Hoc Netw. 2011, 9, 468–477. [Google Scholar] [CrossRef] [Green Version]
  69. Barrado, C.; Messeguer, R.; López, J.; Pastor, E.; Santamaria, E.; Royo, P. Wildfire monitoring using a mixed air-ground mobile network. IEEE Pervasive Comput. 2010, 9, 24–32. [Google Scholar] [CrossRef]
  70. Krishna, K.R. Unmanned Aerial Vehicle Systems in Crop Production: A Compendium; CRC Press: Boca Raton, FL, USA, 2019. [Google Scholar]
  71. Zhelonkin, A. Automated field monitoring by a group of light aircraft-type UAVs. In Proceedings of the Third International Scientific Conference “Intelligent Information Technologies for Industry”(IITI’18); Springer: Berlin, Germany, 2019. [Google Scholar]
  72. Maza, I.; Caballero, F.; Capitán, J.; Dios, J.R.M.; Ollero, A. Experimental results in multi-UAV coordination for disaster management and civil security applications. J. Intell. Robot. Syst. 2011, 61, 563–585. [Google Scholar] [CrossRef]
  73. Freitas, E.P.D.; Heimfarth, T.; Netto, I.F.; Lino, C.E.; Pereira, C.E.; Ferreira, A.M.; Wagner, F.R.; Larsson, T. UAV relay network to support wsn connectivity. In Proceedings of the IEEE International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT), Moscow, Russia, 17–21 September 2010; pp. 309–314. [Google Scholar]
  74. Jiang, F.; Swindlehurst, A.L. Dynamic UAV relay positioning for the ground-to-air uplink. In Proceedings of the IEEE GLOBECOM Workshops (GC Wkshps), Miami, FL, USA, 6–10 December 2010; pp. 1766–1770. [Google Scholar]
  75. Cho, A.; Kim, J.; Lee, S.; Kee, C. Wind estimation and airspeed calibration using a UAV with a single-antenna gps receiver and pitot tube. IEEE Trans. Aerosp. Electron. Syst. 2011, 47, 109–117. [Google Scholar] [CrossRef]
  76. Xiang, H.; Tian, L. Development of a low-cost agricultural remote sensing system based on an autonomous unmanned aerial vehicle (UAV). Biosyst. Eng. 2011, 108, 174–190. [Google Scholar] [CrossRef]
  77. Wei, P.; Gu, Q.; Sun, D. Wireless sensor network data collection by connected cooperative UAVs. In Proceedings of the IEEE American Control Conference (ACC), Washington, DC, USA, 17–19 June 2013; pp. 5911–5916. [Google Scholar]
  78. Alvear, O.; Calafate, C.T.; Hernández, E.; Cano, J.-C.; Manzoni, P. Mobile pollution data sensing using UAVs. In Proceedings of the ACM 13th International Conference on Advances in Mobile Computing and Multimedia, Brussels, Belgium, 11–13 December 2015; pp. 393–397. [Google Scholar]
  79. Semsch, E.; Jakob, M.; Pavlicek, D.; Pechoucek, M. Autonomous UAV surveillance in complex urban environments. In Proceedings of the IEEE Computer Society, IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology-Volume 02, Washington, DC, USA, 15–18 September 2009; pp. 82–85. [Google Scholar]
  80. Karaduman, M.; Çınar, A.; Eren, H. UAV traffic patrolling via road detection and tracking in anonymous aerial video frames. J. Intell. Robot. Syst. 2019, 995, 675–690. [Google Scholar] [CrossRef]
  81. Sánchez-García, J.; García-Campos, J.M.; Arzamendia, M.; Reina, D.G.; Toral, S.L.; Gregor, D. A survey on unmanned aerial and aquatic vehicle multi-hop networks: Wireless communications, evaluation tools and applications. Comput. Commun. 2018, 119, 43–65. [Google Scholar] [CrossRef]
  82. Yanmaz, E.; Costanzo, C.; Bettstetter, C.; Elmenreich, W. A discrete stochastic process for coverage analysis of autonomous UAV networks. In Proceedings of the IEEE GLOBECOM Workshops (GC Wkshps), Miami, FL, USA, 6–10 December 2010; pp. 1777–1782. [Google Scholar]
  83. Shen, J.; Moh, S.; Chung, I. Routing protocols in delay tolerant networks: A comparative survey. In Proceedings of the 23rd International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC), Shimonoseki City, Japan, 6–9 July 2008; pp. 6–9. [Google Scholar]
  84. Baillieul, J.; Antsaklis, P.J. Control and communication challenges in networked real-time systems. Proc. IEEE 2007, 95, 9–28. [Google Scholar] [CrossRef]
  85. Zhai, H.; Kwon, Y.; Fang, Y. Performance analysis of ieee 802.11 mac protocols in wireless lans. Wirel. Commun. Mob. Comput. 2004, 4, 917–931. [Google Scholar] [CrossRef]
  86. Dewangan, K.P.; Bonde, P. Application of rpgm model in wireless ad hoc network. In Proceedings of the 3rd International Conference on Internet of Things and Connected Technologies (ICIoTCT), Jaipur, India, 26–27 March 2018. [Google Scholar]
  87. Camp, T.; Boleng, J.; Davies, V. A survey of mobility models for ad hoc network research. Wirel. Commun. Mob. Comput. 2002, 2, 483–502. [Google Scholar] [CrossRef]
  88. Broch, J.; Maltz, D.A.; Johnson, D.B.; Hu, Y.-C.; Jetcheva, J. A performance comparison of multi-hop wireless ad hoc network routing protocols. In Proceedings of the 4th Annual ACM/IEEE International Conference on Mobile Computing and Networking, Dallas, TX, USA, 25–30 October 1998; pp. 85–97. [Google Scholar]
  89. Khan, S.; Kim, K.-I. Simulation-based performance comparison of two routing protocols for aircraft ad hoc networks. Int. J. Ad Hoc Ubiquitous Comput. 2016, 22, 128–137. [Google Scholar] [CrossRef]
  90. Bekmezci, I.; Ermis, M.; Kaplan, S. Connected multi UAV task planning for flying ad hoc networks. In Proceedings of the IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom), Odessa, Ukraine, 27–30 May 2014; pp. 28–32. [Google Scholar]
  91. Xie, J.; Wan, Y.; Wang, B.; Fu, S.; Lu, K.; Kim, J.H. A comprehensive 3-dimensional random mobility modeling framework for airborne networks. IEEE Access 2018, 6, 22849–22862. [Google Scholar] [CrossRef]
  92. Singh, K.; Verma, A.K. Adaptability of various mobility models for flying adhoc networks—A review. In Networking Communication and Data Knowledge Engineering; Springer: Berlin, Germany, 2018; pp. 51–63. [Google Scholar]
  93. Mozaffari, M.; Saad, W.; Bennis, M.; Nam, Y.-H.; Debbah, M. A tutorial on UAVs for wireless networks: Applications, challenges, and open problems. IEEE Commun. Surv. Tutor. 2019, 21, 2334–2360. [Google Scholar] [CrossRef] [Green Version]
  94. Cabreira, T.M.; Franco, C.D.; Ferreira, P.R.; Buttazzo, G.C. Energy-aware spiral coverage path planning for UAV photogrammetric applications. IEEE Robot. Autom. Lett. 2018, 3, 3662–3668. [Google Scholar] [CrossRef]
  95. Vanitha, N.; Ganapathi, P. Traffic Analysis of UAV Networks Using Enhanced Deep Feed Forward Neural Networks (EDFFNN). In Handbook of Research on Machine and Deep Learning Applications for Cyber Security; IGI Global: Philadelphia, PA, USA, 2020; pp. 219–244. [Google Scholar]
  96. Khan, A.; Aftab, F.; Zhang, Z. Self-organization based clustering scheme for FANETs using Glowworm Swarm Optimization. Phys. Commun. 2019, 36, 100769. [Google Scholar] [CrossRef]
  97. De Rango, F.; Potrino, G.; Tropea, M.; Santamaria, A.F.; Fazio, P. Scalable and ligthway bio-inspired coordination protocol for FANET in precision agriculture applications. Comput. Electr. Eng. 2019, 74, 305–318. [Google Scholar] [CrossRef]
  98. Na, H.J.; Yoo, S.J. PSO-Based Dynamic UAV Positioning Algorithm for Sensing Information Acquisition in Wireless Sensor Networks. IEEE Access 2019, 7, 77499–77513. [Google Scholar] [CrossRef]
  99. Khelifi, F.; Bradai, A.; Singh, K.; Atri, M. Localization and energy-efficient data routing for unmanned aerial vehicles: Fuzzy-logic-based approach. IEEE Commun. Mag. 2018, 56, 129–133. [Google Scholar] [CrossRef]
  100. Zheng, Z.; Sangaiah, A.K.; Wang, T. Adaptive communication protocols in flying ad hoc network. IEEE Commun. Mag. 2018, 56, 136–142. [Google Scholar] [CrossRef]
  101. Oubbati, O.S.; Lakas, A.; Zhou, F.; Güneş, M.; Lagraa, N.; Yagoubi, M.B. Intelligent UAV-assisted routing protocol for urban VANETs. Comput. Commun. 2017, 107, 93–111. [Google Scholar] [CrossRef]
  102. Aadil, F.; Raza, A.; Khan, M.F.; Maqsood, M.; Mehmood, I.; Rho, S. Energy aware cluster-based routing in flying ad hoc networks. Sensors 2018, 18, 1413. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  103. Yu, Y.; Ru, L.; Fang, K. Bio-inspired mobility prediction clustering algorithm for ad hoc UAV networks. Eng. Lett. 2016, 24, 83–92. [Google Scholar]
  104. Oubbati, O.S.; Chaib, N.; Lakas, A.; Lorenz, P.; Rachedi, A. UAV-assisted supporting services connectivity in urban VANETs. IEEE Trans. Veh. Technol. 2019, 68, 3944–3951. [Google Scholar] [CrossRef] [Green Version]
  105. Ruiz, P.M.; Stojmenovic, I. Cost-efficient multicast routing in ad hoc and sensor networks. In Handbook on Approximation Algorithms and Metaheuristics; Gonzalez, T., Ed.; Chapman & Hall: Boca Raton, FL, USA, 2018. [Google Scholar]
  106. Khan, Z.; Fan, P. A multi-hop moving zone (mmz) clustering scheme based on cellular-V2X. China Commun. 2018, 15, 55–66. [Google Scholar] [CrossRef]
  107. Bassoy, S.; Jaber, M.; Imran, M.A.; Xiao, P. Load aware self-organising user-centric dynamic comp clustering for 5G networks. IEEE Access 2016, 4, 2895–2906. [Google Scholar] [CrossRef] [Green Version]
  108. Liu, C.; Wu, J. Adaptive routing in dynamic ad hoc networks. In Proceedings of the IEEE Wireless Communications and Networking Conference, Las Vegas, NV, USA, 31 March–3 April 2008; pp. 2603–2608. [Google Scholar]
  109. Ding, Y.; Xiao, L. Sadv: Static-node-assisted adaptive data dissemination in vehicular networks. IEEE Trans. Veh. Technol. 2010, 59, 2445–2455. [Google Scholar] [CrossRef]
  110. Clausen, T.; Jacquet, P.; Adjih, C.; Laouiti, A.; Minet, P.; Muhlethaler, P.; Qayyum, A.; Viennot, L. Optimized Link State Routing Protocol (OLSR). Available online: https://hal.inria.fr/inria-00471712/document (accessed on 1 October 2019).
  111. Perkins, C.E.; Bhagwat, P. Highly dynamic destination-sequenced distance-vector routing (dsdv) for mobile computers. In ACM SIGCOMM Computer Communication Review; ACM: New York, NY, USA, 1994; pp. 234–244. [Google Scholar]
  112. Alshabtat, A.I.; Dong, L.; Li, J.; Yang, F. Low latency routing algorithm for unmanned aerial vehicles ad hoc networks. Int. J. Electr. Comput. Eng. 2010, 6, 48–54. [Google Scholar]
  113. Nayyar, A. Flying adhoc network (FANETs): Simulation based performance comparison of routing protocols: Aodv, dsdv, dsr, olsr, aomdv and hwmp. In Proceedings of the IEEE International Conference on Advances in Big Data, Computing and Data Communication Systems (icABCD), Durban, South Africa, 6–7 August 2018; pp. 1–9. [Google Scholar]
  114. Kharb, S.; Singhrova, A. A survey on network formation and scheduling algorithms for time slotted channel hopping in industrial networks. J. Netw. Comput. Appl. 2018, 126, 59–87. [Google Scholar] [CrossRef]
  115. Anand, M.; Sasikala, T. Efficient energy optimization in mobile ad hoc network (MANET) using better-quality aodv protocol. In Cluster Computing; Springer: Berlin, Germany, 2018; pp. 1–7. [Google Scholar]
  116. Sufian, A.; Sultana, F.; Dutta, P. Data load balancing in mobile ad hoc network using fuzzy logic (DBMF). arXiv 2019, arXiv:1905.11627. [Google Scholar]
  117. Liu, K.; Zhang, J.; Zhang, T. The clustering algorithm of UAV networking in near-space. In Proceedings of the IEEE 8th International Symposium on Antennas, Propagation and EM Theory (ISAPE), Kunming, China, 2–5 November 2008; pp. 1550–1553. [Google Scholar]
  118. Sharma, V.; Srinivasan, K.; Kumar, R.; Chao, H.-C.; Hua, K.-L. Efficient cooperative relaying in flying ad hoc networks using fuzzy-bee colony optimization. J. Supercomput. 2017, 73, 3229–3259. [Google Scholar] [CrossRef]
  119. Aadil, F.; Bajwa, K.B.; Khan, S.; Chaudary, N.M.; Akram, A. CACONET: Ant colony optimization (ACO) based clustering algorithm for VANET. PLoS ONE 2016, 11, e0154080. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  120. Khan, M.F.; Aadil, F.; Maqsood, M.; Khan, S.; Bukhari, B.H. An efficient optimization technique for node clustering in VANETs using gray wolf optimization. KSII Trans. Internet Inf. Syst. (TIIS) 2018, 12, 4228–4247. [Google Scholar]
  121. Fahad, M.; Aadil, F.; Khan, S.; Shah, P.A.; Muhammad, K.; Lloret, J.; Wang, H.; Lee, J.W.; Mehmood, I. Grey wolf optimization based clustering algorithm for vehicular ad hoc networks. Comput. Electr. Eng. 2018, 70, 853–870. [Google Scholar] [CrossRef]
  122. Shah, Y.A.; Habib, H.A.; Aadil, F.; Khan, M.F.; Maqsood, M.; Nawaz, T. CAMONET: Moth-flame optimization (MFO) based clustering algorithm for VANETs. IEEE Access 2018, 6, 48611–48624. [Google Scholar] [CrossRef]
  123. Cooper, C.; Franklin, D.; Ros, M.; Safaei, F.; Abolhasan, M. A comparative survey of VANET clustering techniques. IEEE Commun. Surv. Tutor. 2017, 19, 657–681. [Google Scholar] [CrossRef]
  124. Rosati, S.; Krużelecki, K.; Heitz, G.; Floreano, D.; Rimoldi, B. Dynamic routing for flying ad hoc networks. IEEE Trans. Veh. Technol. 2016, 65, 1690–1700. [Google Scholar] [CrossRef] [Green Version]
  125. Gankhuyag, G.; Shrestha, A.P.; Yoo, S.-J. Robust and reliable predictive routing strategy for flying ad hoc networks. IEEE Access 2017, 5, 643–654. [Google Scholar] [CrossRef]
  126. Biomo, J.D.; Kunz, T.; St-Hilaire, M. Routing in unmanned aerial ad hoc networks: Introducing a route reliability criterion. In Proceedings of the IEEE 7th IFIP Wireless and Mobile Networking Conference (WMNC), Vilamoura, Portugal, 20–22 May 2014; pp. 1–7. [Google Scholar]
  127. Kaleem, Z.; Rehmani, M.H.; Ahmed, E.; Jamalipour, A.; Rodrigues, J.J.P.C.; Moustafa, H.; Guibene, W. Amateur drone surveillance: Applications, architectures, enabling technologies, and public safety issues: Part 2. IEEE Commun. Mag. 2018, 56, 66–67. [Google Scholar] [CrossRef]
  128. Khan, A.; Aftab, F.; Zhang, Z. BICSF: Bio-inspired clustering scheme for FANETs. IEEE Access 2019, 7, 31446–31456. [Google Scholar] [CrossRef]
  129. Zonghua, M.; Xiaojing, M. A modified aodv routing protocol based on route stability in MANET. In Proceedings of the 4th IET International Conference on Wireless, Mobile & Multimedia Networks (ICWMMN), Beijing, China, 27–30 November 2011; pp. 63–67. [Google Scholar]
  130. Li, Y.; St-Hilaire, M.; Kunz, T. Enhancing the RGR Routing Protocol for Unmanned Aeronautical ad Hoc Networks; Technical Report SCE-12-01; Carleton University, Systems and Computer Engineering: Ottawa, ON, Canada, 2012. [Google Scholar]
  131. Li, Y. Enhancements to reduce the overhead of the reactive-greedy-reactive routing protocol for unmanned aeronautical ad hoc networks. In Proceedings of the IEEE 8th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM), Shanghai, China, 21–23 September 2012; pp. 1–4. [Google Scholar]
  132. Shirani, R.; St-Hilaire, M.; Kunz, T.; Zhou, Y.; Li, J.; Lamont, L. The performance of greedy geographic forwarding in unmanned aeronautical ad hoc networks. In Proceedings of the IEEE Ninth Annual Communication Networks and Services Research Conference (CNSR), Ottawa, ON, Canada, 2–5 May 2011; pp. 161–166. [Google Scholar]
  133. Guo, Q.; Yan, J.; Xu, W. Localized fault tolerant algorithm based on node movement freedom degree in flying ad hoc networks. Symmetry 2019, 11, 106. [Google Scholar] [CrossRef] [Green Version]
  134. Klaine, P.V.; Nadas, J.P.B.; Souza, R.D.; Imran, M.A. Distributed drone base station positioning for emergency cellular networks using reinforcement learning. Cogn. Comput. 2018, 10, 790–804. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  135. Zhang, H.; Ren, Y.; Chen, K.-C.; Hanzo, L. Thirty years of machine learning: The road to pareto-optimal next-generation wireless networks. arXiv 2019, arXiv:1902.01946. [Google Scholar]
  136. Huang, X.-L.; Wang, G.; Hu, F.; Kumar, S. Stability-capacity-adaptive routing for high-mobility multihop cognitive radio networks. IEEE Trans. Veh. Technol. 2011, 60, 2714–2729. [Google Scholar] [CrossRef]
  137. Arul, S.H.; Sathyamoorthy, A.J.; Patel, S.; Otte, M.; Xu, H.; Lin, M.C.; Manocha, D. Lswarm: Efficient collision avoidance for large swarms with coverage constraints in complex urban scenes. arXiv 2019, arXiv:1902.08379. [Google Scholar] [CrossRef] [Green Version]
  138. Kurdi, H.A.; How, J.P. Dynamic Task Allocation in an Autonomous Multi-UAV Mission. U.S. Patent 15/344,014, 11 May 2017. [Google Scholar]
  139. Challita, U.; Ferdowsi, A.; Chen, M.; Saad, W. Machine learning for wireless connectivity and security of cellular-connected UAVs. IEEE Wirel. Commun. 2019, 26, 28–35. [Google Scholar] [CrossRef] [Green Version]
  140. Yang, J.; You, X.; Wu, G.; Hassan, M.M.; Almogren, A.; Guna, J. Application of reinforcement learning in UAV cluster task scheduling. Future Gener. Comput. Syst. 2019, 95, 140–148. [Google Scholar] [CrossRef]
  141. Wang, W.; Wang, J.; Wang, M.; Wang, B.; Zhang, W. A realistic mobility model with irregular obstacle constraints for mobile ad hoc networks. Wirel. Netw. 2019, 25, 487–506. [Google Scholar] [CrossRef]
  142. Sharma, V. Advances in drone communications, state-of-the-art and architectures. Drones 2019, 3, 21. [Google Scholar] [CrossRef] [Green Version]
  143. Palomar, D.P.; Chiang, M. Alternative distributed algorithms for network utility maximization: Framework and applications. IEEE Trans. Autom. Control 2007, 52, 2254–2269. [Google Scholar] [CrossRef]
  144. Xin, G.; Jun, Z.; Tao, Z. A distributed multipath routing algorithm to minimize congestion. In Proceedings of the IEEE/AIAA 28th Digital Avionics Systems Conference, Orlando, FL, USA, 23–29 October 2009. [Google Scholar]
  145. Tanaka, A. Effects of length and number of paths on simultaneous multi-path communication. In Proceedings of the IEEE/IPSJ International Symposium on Applications and the Internet, Munich, Germany, 18–21 July 2011; pp. 214–217. [Google Scholar]
  146. Liao, J.; Wang, J.; Li, T.; Zhu, X. Introducing multipath selection for concurrent multipath transfer in the future internet. Comput. Netw. 2011, 55, 1024–1035. [Google Scholar] [CrossRef]
  147. He, J.; Rexford, J. Toward internet-wide multipath routing. IEEE Netw. 2008, 22, 16–21. [Google Scholar]
  148. Li, J.; Wang, X.; Li, F.; Jia, J. Efficient traffic aware multipath routing algorithm in cognitive networks. In Proceedings of the IEEE Fifth International Conference on Genetic and Evolutionary Computing, Xiamen, China, 29 August–1 September 2011; pp. 303–306. [Google Scholar]
  149. Chen, M.; Challita, U.; Saad, W.; Yin, C.; Debbah, M. Machine learning for wireless networks with artificial intelligence: A tutorial on neural networks. arXiv 2017, arXiv:1710.02913. [Google Scholar]
  150. Chandrasekharan, S.; Gomez, K.; Al-Hourani, A.; Kandeepan, S.; Rasheed, T.; Goratti, L.; Reynaud, L.; Grace, D.; Bucaille, I.; Wirth, T.; et al. Designing and implementing future aerial communication networks. IEEE Commun. Mag. 2016, 54, 26–34. [Google Scholar] [CrossRef]
  151. Huo, Y.; Dong, X.; Lu, T.; Xu, W.; Yuen, M. Distributed and multi-layer UAV network for the next-generation wireless communication. arXiv 2018, arXiv:1805.01534. [Google Scholar]
  152. Hellaoui, H.; Bekkouche, O.; Bagaa, M.; Taleb, T. Aerial Control System for Spectrum Efficiency in UAV-to-Cellular Communications. IEEE Commun. Mag. 2018, 56, 108–113. [Google Scholar] [CrossRef]
  153. Zhu, X.; Guo, Z.; Hou, Z. Solar-powered airplanes: A historical perspective and future challenges. Prog. Aerosp. Sci. 2014, 71, 36–53. [Google Scholar] [CrossRef]
Figure 1. Two main scenarios in flying ad hoc networks (FANETs).
Figure 1. Two main scenarios in flying ad hoc networks (FANETs).
Sensors 20 00038 g001
Figure 2. Two categories of ad hoc networks, namely mobile ad hoc networks (MANETs) and vehicular ad hoc networks (VANETs): The solid line represents the connectivity between two nodes.
Figure 2. Two categories of ad hoc networks, namely mobile ad hoc networks (MANETs) and vehicular ad hoc networks (VANETs): The solid line represents the connectivity between two nodes.
Sensors 20 00038 g002
Figure 3. Four types of links in FANETs.
Figure 3. Four types of links in FANETs.
Sensors 20 00038 g003
Figure 4. A taxonomy of routing attributes in FANETs.
Figure 4. A taxonomy of routing attributes in FANETs.
Sensors 20 00038 g004
Table 1. Comparison of existing survey papers in FANETs with our paper.
Table 1. Comparison of existing survey papers in FANETs with our paper.
ReferenceYearTopicFocus
RoutingMobility ModelsApplicationsMotivationComparison with other ad hoc NetworksRequirementsMobility ModelsTaxonomyObjectivesChallengesRouting MetricsCharacteristicsPerformance MeasuresFrame workOpen issues
Axel et al. [2]2010 × × ×
Bauer et al. [28]2011 × × × ×
Neji et al. [29]2013 × × × ××
Bekmezci et al. [7]2013 ××××× × ×× ×
Ozgur et al. [18]2013× × × ×× ×
Xie et al. [30]2014 × × × × × ×
Naser et al. [31]2016 × × ×× ×× ×
Gupta et al. [32]2016× ×× ×××× ×
Samira et al. [33]2016 × × ××× ×
Armir et al. [34]2017 × × ×× × ×
Omar et al. [35]2017× ××× × ×× ×
Zeeshan et al. [36]2018 ×× × × × ×
Khan et al. [37]2018× × ×× × ××
Antonio et al. [38]2018 × × × ×× ×
Kaur et al. [39]2018× ×× ××××
Otto et al. [40]2018 × × ××××× ×
Jinfang et al. [41]2018× × × ×× ×
Our paper2019× ××××××××××××
A cross × indicates that the option, which is represented by the column, applies to the reference, which is represented by the row.
Table 2. Comparison of FANETs with MANETs and VANETs.
Table 2. Comparison of FANETs with MANETs and VANETs.
Category MANETsVANETsFANETs
Types of linkAd hocYesYesYes
Direct linkYesYesYes
SatelliteNoNoYes
CellularNoYesYes
CharacteristicsMobility degreeLowMediumHigh
Mobility ModelsRandom way pointPrediction basedSRCM, Realistic
Energy constraintHighLowMedium
Radio propagation modelNLOSNLOSLOS
Localization methodGPSAssisted-GPS, differential-GPSInertia measurement unit
Node densityHighMediumLow
Table 3. Stages of routing frameworks in FANETs.
Table 3. Stages of routing frameworks in FANETs.
CategoryStageDetailsOutcomes
AdaptiveFirstNodes exchange messages among themselves and prediction to localize the nodes in the spaceNeighbor sets, network typologies, and location
SecondUse routing metrics and select routeEstablishment of routing path
ProactiveFirstNodes exchange messages among themselvesNeighbor sets and network typologies are formed
SecondUse routing metrics and select routeEstablishment of routing path
ThirdReestablishment of route to cater dynamicityNew routes are established
ReactiveFirstNodes exchange messages among themselves and send route requests (RREQs) from source nodes towards the destination nodeNeighbor sets, network typologies, and route identification
SecondResponse of RREQ from destination node towards the source nodeRoute chosen by RREP
HybridFirstNodes exchange messages among themselvesNeighbor sets and network typologies are formed
SecondNon-clustered nodes elect CHsCHs are elected
ThirdNon-clustered nodes join clustersClusters are formed
Table 4. Summary of objectives, metrics, and performance of routing schemes proposed in the literature for FANETs.
Table 4. Summary of objectives, metrics, and performance of routing schemes proposed in the literature for FANETs.
ReferenceYearApproachObjectivesChallengesRouting MetricsCharac-TeristicPerformance Measures
F.1 AdaptiveF.2 ProactiveF.3 ReactiveF.4 HybridO.1 Enhancing routing stabilityO.2 Enhancing network coverageO.3 Enhancing routing performance and QoSX.1 High dynamicityX.2 High costX.3 Low residual energyM.1 Mobility metricsM.2 Link expiration timeM.3 Geographical locationM.4 Residual energyM.5 Node identityC.1.1 Hop-by-hop routingC.1.2 Source routingP.1 Higher QoS performanceP.2 Lower energy consumptionP.3 Lower number of clustersP.4 Higher route setup success rate
Zheng et al. [100]2018× × ××× × ×× × ×
Khelifi et al. [99]2018× ××××× × ××××
Alshabtat et al. [112]2010 × ×××× × × ×
Rosati et al. [124]2016 × × ×× ××× ×××
Ganbayar et al. [125]2017 × ×× ×× × × × ×
Omar et al. [101]2017 × × ××× ×× × ×
Biomo et al. [126]2014 × ×× ×× × × ×××
Ali et al. [102]2018 ××× ×× ××× × ××
Yu et al. [103]2016 ×× × ×××× ××××
Table 5. A Summary of open issues and their purposes, challenges, and proposed solutions.
Table 5. A Summary of open issues and their purposes, challenges, and proposed solutions.
Open IssuePurposeChallengesProposed Solutions
Minimizing the effects of frequent link disconnections to improve routingReducing packet retransmission and reestablishing routes
  • High dynamicity
  • High cost
Predicting the next geographical location of a UAV in route selection and maintenance.
Performing routing in the multi-UAV swarm scenariosManaging massive amount of data due to ultra-densification
  • High dynamicity
  • High cost
  • Low residual energy
Predicting the next geographical location of a UAV.
Performing clustering for supporting routing in multi-UAVsDeploying collaborative tasks, including data aggregation, load distribution, and resource distribution
  • High cost
  • Low residual energy
Using context-aware approaches, such as artificial intelligence approaches and bio-inspired algorithms
Enhancing mobility models for the investigation of routing in FANETsMobility management
  • High dynamicity
  • High cost
  • Low residual energy
Forming mobility models based on real-life scenarios
Improving network performance and survivability through multi-pathingMaximizing resource utilization and reducing network congestion
  • High routing overhead
Artificial intelligence (AI)-based approaches
Improving network performance by using artificial intelligenceOptimize performance
  • High cost
  • High routing overhead
Using AI approaches to improve network performance
Improving network coverage by using high and low altitude unmanned aerial vehicles (UAVs)Reducing packet retransmission and reestablishing routes
  • High cost
Enabling collaboration between high and low altitude platforms
Reducing power consumption by using green energyReducing network partitioning
  • High cost
  • Low residual energy
Use solar panels for extra energy backup

Share and Cite

MDPI and ACS Style

Khan, M.F.; Yau, K.-L.A.; Noor, R.M.; Imran, M.A. Routing Schemes in FANETs: A Survey. Sensors 2020, 20, 38. https://0-doi-org.brum.beds.ac.uk/10.3390/s20010038

AMA Style

Khan MF, Yau K-LA, Noor RM, Imran MA. Routing Schemes in FANETs: A Survey. Sensors. 2020; 20(1):38. https://0-doi-org.brum.beds.ac.uk/10.3390/s20010038

Chicago/Turabian Style

Khan, Muhammad Fahad, Kok-Lim Alvin Yau, Rafidah Md Noor, and Muhammad Ali Imran. 2020. "Routing Schemes in FANETs: A Survey" Sensors 20, no. 1: 38. https://0-doi-org.brum.beds.ac.uk/10.3390/s20010038

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop