scispace - formally typeset
Search or ask a question
Journal ArticleDOI

A survey on position-based routing protocols for Flying Ad hoc Networks (FANETs)

TL;DR: A comprehensive survey of position-based routing protocols for FANETs with their various categories is proposed, including a classification and a taxonomy of these protocols, and a detailed description of the routing schemes used in each category.
About: This article is published in Vehicular Communications.The article was published on 2017-10-01. It has received 223 citations till now. The article focuses on the topics: Optimized Link State Routing Protocol & Link-state routing protocol.
Citations
More filters
Journal ArticleDOI
TL;DR: A survey regarding the potential use of UAVs in PA is provided, focusing on 20 relevant applications, which investigate in detail 20 UAV applications that are devoted to either aerial crop monitoring processes or spraying tasks.

386 citations

Journal ArticleDOI
TL;DR: A taxonomy to classify the existing research issues is presented, and a brief overview of 5G mmWave communications for UAV-assisted wireless networks from two aspects, i.e., key technical advantages and challenges as well as potential applications.
Abstract: In recent years, unmanned aerial vehicles (UAVs) have received considerable attention from regulators, industry and research community, due to rapid growth in a broad range of applications. Particularly, UAVs are being used to provide a promising solution to reliable and cost-effective wireless communications from the sky. The deployment of UAVs has been regarded as an alternative complement of existing cellular systems, to achieve higher transmission efficiency with enhanced coverage and capacity. However, heavily utilized microwave spectrum bands below 6 GHz utilized by legacy wireless systems are insufficient to attain remarkable data rate enhancement for numerous emerging applications. To resolve the spectrum crunch crisis and satisfy the requirements of 5G and beyond mobile communications, one potential solution is to use the abundance of unoccupied bandwidth available at millimeter wave (mmWave) frequencies. Inspired by the technique potentials, mmWave communications have also paved the way into the widespread use of UAVs to assist wireless networks for future 5G and beyond wireless applications. In this paper, we provide a comprehensive survey on current achievements in the integration of 5G mmWave communications into UAV-assisted wireless networks. More precisely, a taxonomy to classify the existing research issues is presented, by considering seven cutting-edge solutions. Subsequently, we provide a brief overview of 5G mmWave communications for UAV-assisted wireless networks from two aspects, i.e., key technical advantages and challenges as well as potential applications. Based on the proposed taxonomy, we further discuss in detail the state-of-the-art issues, solutions, and open challenges for this newly emerging area. Lastly, we complete this survey by pointing out open issues and shedding new light on future directions for further research on this area.

220 citations


Additional excerpts

  • ...[75] and Arafat and Moh [76], respectively....

    [...]

Journal ArticleDOI
TL;DR: This comprehensive survey both studies and summarizes the existing UAV-assisted research, such as routing, data gathering, cellular communications, Internet of Things (IoT) networks, and disaster management that supports existing enabling technologies.

204 citations

Journal ArticleDOI
TL;DR: A comprehensive survey is presented covering the architecture, the constraints, the mobility models, the routing techniques, and the simulation tools dedicated to FANETs, better presenting the state of the art of this specific area of research.
Abstract: Owing to the explosive expansion of wireless communication and networking technologies, cost-effective unmanned aerial vehicles (UAVs) have recently emerged and soon they will occupy the major part of our sky. UAVs can be exploited to efficiently accomplish complex missions when cooperatively organized as an ad hoc network, thus creating the well-known flying ad hoc networks (FANETs). The establishment of such networks is not feasible without deploying an efficient networking model allowing a reliable exchange of information between UAVs. FANET inherits common features and characteristics from mobile ad hoc networks (MANETs) and their sub-classes, such as vehicular ad hoc networks (VANETs) and wireless sensor networks (WSNs). Unfortunately, UAVs are often deployed in the sky adopting a mobility model dictated by the nature of missions that they are expected to handle, and therefore, differentiate themselves from any traditional networks. Moreover, several flying constraints and the highly dynamic topology of FANETs make the design of routing protocols a complicated task. In this paper, a comprehensive survey is presented covering the architecture, the constraints, the mobility models, the routing techniques, and the simulation tools dedicated to FANETs. A classification, descriptions, and comparative studies of an important number of existing routing protocols dedicated to FANETs are detailed. Furthermore, the paper depicts future challenge perspectives, helping scientific researchers to discover some themes that have been addressed only ostensibly in the literature and need more investigation. The novelty of this survey is its uniqueness to provide a complete analysis of the major FANET routing protocols and to critically compare them according to different constraints based on crucial parameters, thus better presenting the state of the art of this specific area of research.

171 citations

Journal ArticleDOI
TL;DR: This survey guides the reader through a comprehensive discussion of the main characteristics of SDN and NFV technologies, and provides a thorough analysis of the different classifications, use cases, and challenges related to UAV-assisted systems.
Abstract: Unmanned Aerial Vehicles (UAVs) have become increasingly important in assisting 5G and beyond 5G (B5G) mobile networks. Indeed, UAVs have all the potentials to both satisfy the ever-increasing mobile data demands of such mobile networks and provide ubiquitous connectivity to different kinds of wireless devices. However, the UAV assistance paradigm faces a set of crucial issues and challenges. For example, the network management of current UAV-assisted systems is time consuming, complicated, and carried out manually, thus causing a multitude of interoperability issues. To efficiently address all these issues, Software-Defined Network (SDN) and Network Function Virtualization (NFV) are two promising technologies to efficiently manage and improve the UAV assistance for the next generation of mobile networks. In the literature, no clear guidelines are describing the different use cases of SDN and NFV in the context of UAV assistance to terrestrial networks, including mobile networks. Motivated by this fact, in this survey, we guide the reader through a comprehensive discussion of the main characteristics of SDN and NFV technologies. Moreover, we provide a thorough analysis of the different classifications, use cases, and challenges related to UAV-assisted systems. We then discuss SDN/NFV-enabled UAV-assisted systems, along with several case studies and issues, such as the involvement of UAVs in cellular communications, monitoring, and routing, to name a few. We furthermore present a set of open research challenges, high-level insights, and future research directions related to UAV-assisted systems.

137 citations


Cites background from "A survey on position-based routing ..."

  • ...[42] surveyed the most relevant position-based routing protocols dedicated to Flying Ad hoc Networks (FANETs)....

    [...]

References
More filters
01 Jul 2003
TL;DR: A logging instrument contains a pulsed neutron source and a pair of radiation detectors spaced along the length of the instrument to provide an indication of formation porosity which is substantially independent of the formation salinity.
Abstract: The Ad hoc On-Demand Distance Vector (AODV) routing protocol is intended for use by mobile nodes in an ad hoc network. It offers quick adaptation to dynamic link conditions, low processing and memory overhead, low network utilization, and determines unicast routes to destinations within the ad hoc network. It uses destination sequence numbers to ensure loop freedom at all times (even in the face of anomalous delivery of routing control messages), avoiding problems (such as "counting to infinity") associated with classical distance vector protocols.

11,490 citations

01 Jan 1994
TL;DR: In this article, the authors present a protocol for routing in ad hoc networks that uses dynamic source routing, which adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Abstract: An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any established infrastructure or centralized administration. In such an environment, it may be necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its destination, due to the limited range of each mobile host’s wireless transmissions. This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing. The protocol adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently. Based on results from a packet-level simulation of mobile hosts operating in an ad hoc network, the protocol performs well over a variety of environmental conditions such as host density and movement rates. For all but the highest rates of host movement simulated, the overhead of the protocol is quite low, falling to just 1% of total data packets transmitted for moderate movement rates in a network of 24 mobile hosts. In all cases, the difference in length between the routes used and the optimal route lengths is negligible, and in most cases, route lengths are on average within a factor of 1.01 of optimal.

8,614 citations

Book ChapterDOI
01 Jan 1996
TL;DR: This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing that adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Abstract: An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any established infrastructure or centralized administration. In such an environment, it may be necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its destination, due to the limited range of each mobile host’s wireless transmissions. This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing. The protocol adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently. Based on results from a packet-level simulation of mobile hosts operating in an ad hoc network, the protocol performs well over a variety of environmental conditions such as host density and movement rates. For all but the highest rates of host movement simulated, the overhead of the protocol is quite low, falling to just 1% of total data packets transmitted for moderate movement rates in a network of 24 mobile hosts. In all cases, the difference in length between the routes used and the optimal route lengths is negligible, and in most cases, route lengths are on average within a factor of 1.01 of optimal.

8,256 citations


"A survey on position-based routing ..." refers background or methods in this paper

  • ...Storecarryandforward No No No No No No Yes Yes Yes Yes Yes No No Greedy forwarding Yes No No Yes Yes Yes Yes No No No Yes No No Path discovery Yes Yes Yes No No No No No No Yes No No Yes Single path No No No Yes Yes Yes Yes Yes Yes No Yes Yes No Multi-path Yes Yes Yes No No No No No No Yes No No Yes Predictive Yes No Yes Yes Yes No No Yes Yes No No Yes No Recovery strategy1 GF Recalculate path T-H-P-F Movements prediction Store-arry-and-forward Store-carry-and-forward Reca path Location service √ × √ √ √ √ √ √ √ √ √ √ × GPS √ √ √ √ √ √ √ √ √ √ √ √ √ Neighbors Table √ √ √ √ √ √ × √ √ √ √ √ √ Infrastructure × × × × × √ × √ √ √ × √ √ Environment awareness × √ × × √ √ × √ √ √ √ √ √ Mobility model2 Modified RWP RM Gauss–Markov RM PR RWP – MM customized cust Mobility generator OPNET JAVA NS-2 OMNeT++ – NS-3 – NS-2 MobiSim VanetMobiSim – OMN Simulation tool OPNET Aero-MANET NS-2 INET NS-2 NS-3 QualNet NS-2 TestBed OMN Evaluation metrics3 P, D, O P, T, L P P, D, O P, D, H P, D, T P, O P, D, O P, D P, T P, D, H P, D P, D Latency Low Unknown Low High High High Med Drawbacks4 GFL, O, C O, C NEL, C C IFL, D D, C IFL, D IFL, D O, C D, O D, C, O C, O Type of network FANET FANET FANET FANET FANET FANET FANET FANET FANET FANET-MANET FANET-VANET FANET FAN 1 Recovery Strategy: (T-H-P-F: Two-Hop Perimeter Forwarding, GF: Greedy Forwarding)....

    [...]

  • ...• Random way point mobility model (RWP) [62]: this model is used in the most simulation scenarios to generate different movements based on straight trajectories in which each node selects a random destination, moves with a random speed, and a pause time at the destination....

    [...]

  • ...• Random movements [62]: different kinds of movements are selected randomly without limitations, i....

    [...]

  • ...[20] No No Yes No Yes Yes Yes No No No Yes Yes Yes No No No No No lculate Recalculate path Retransmission Store-carryand-forward × √ √ √ √ √ √ √ √ √ √ × √ √ √ omized customized RWP MM eT++ Infrastructure – MobiSim VanetMobiSim eT++ TestBed OMNeT++ NS-2 P, D –...

    [...]

  • ...Mobility models To be adequate for the unique characteristics of FANETs, several mobility models are proposed: • Random way point mobility model (RWP) [62]: this model is used in the most simulation scenarios to generate different movements based on straight trajectories in which each node selects a random destination, moves with a random speed, and a pause time at the destination....

    [...]

Proceedings ArticleDOI
01 Aug 2000
TL;DR: Greedy Perimeter Stateless Routing is presented, a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet's destination to make packet forwarding decisions and its scalability on densely deployed wireless networks is demonstrated.
Abstract: We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet's destination to make packet forwarding decisions. GPSR makes greedy forwarding decisions using only information about a router's immediate neighbors in the network topology. When a packet reaches a region where greedy forwarding is impossible, the algorithm recovers by routing around the perimeter of the region. By keeping state only about the local topology, GPSR scales better in per-router state than shortest-path and ad-hoc routing protocols as the number of network destinations increases. Under mobility's frequent topology changes, GPSR can use local topology information to find correct new routes quickly. We describe the GPSR protocol, and use extensive simulation of mobile wireless networks to compare its performance with that of Dynamic Source Routing. Our simulations demonstrate GPSR's scalability on densely deployed wireless networks.

7,384 citations


"A survey on position-based routing ..." refers methods in this paper

  • ...The same principle in GPSR (Greedy Perimeter Stateless Routing) [28] is used in MPGR....

    [...]

  • ...[28] B. Karp, H.-T. Kung, GPSR: greedy perimeter stateless routing for wireless networks, in: Proceedings of the 6th Annual ACM International Conference on Mobile Computing and Networking, 2000, pp. 243–254....

    [...]

  • ...GLSR is an extension of the protocol GPSR [28], which exploits the multiple paths between source and destination....

    [...]

  • ...Geographic Routing protocol for Aircraft Ad hoc Network (GRAA) [86] Hyeon et al. proposed Geographic Routing protocol for Aircraft Ad hoc Network (GRAA) [86], which is a geographic routing protocol based on GPSR....

    [...]

Proceedings ArticleDOI
01 Oct 1994
TL;DR: The modifications address some of the previous objections to the use of Bellman-Ford, related to the poor looping properties of such algorithms in the face of broken links and the resulting time dependent nature of the interconnection topology describing the links between the Mobile hosts.
Abstract: An ad-hoc network is the cooperative engagement of a collection of Mobile Hosts without the required intervention of any centralized Access Point. In this paper we present an innovative design for the operation of such ad-hoc networks. The basic idea of the design is to operate each Mobile Host as a specialized router, which periodically advertises its view of the interconnection topology with other Mobile Hosts within the network. This amounts to a new sort of routing protocol. We have investigated modifications to the basic Bellman-Ford routing mechanisms, as specified by RIP [5], to make it suitable for a dynamic and self-starting network mechanism as is required by users wishing to utilize ad hoc networks. Our modifications address some of the previous objections to the use of Bellman-Ford, related to the poor looping properties of such algorithms in the face of broken links and the resulting time dependent nature of the interconnection topology describing the links between the Mobile Hosts. Finally, we describe the ways in which the basic network-layer routing can be modified to provide MAC-layer support for ad-hoc networks.

6,877 citations