scispace - formally typeset
Journal ArticleDOI

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

TLDR
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.

read more

Citations
More filters
Proceedings ArticleDOI

Greedy Forwarding and Limited Flooding based Routing Protocol for UAV Flying Ad-Hoc networks

TL;DR: Simulation results show that PSO-GLFR is efficient and may provide low-latency, low-energy routing support for UAV-FANETs.
Journal ArticleDOI

Delay Tolerant Network assisted flying Ad-Hoc network scenario: modeling and analytical perspective

TL;DR: The main objective of this work was to provide an alternative solution for the intermittently connected FANET by considering the philosophy of the Delay Tolerant Network (DTN) approach and obtaining a significant enhanced performance of the suggested DTN protocol for sparse FANet in a social scenario.
Journal ArticleDOI

3D Location Oriented Routing in Flying Ad-Hoc Networks for Information Dissemination

TL;DR: In this article, the authors proposed an Optimized Location-Aided Routing (O-LAR) protocol which is the modified version of LAR protocol, which established an optimal route between UAVs for information dissemination towards their respective destination UAV by considering weight function and a weighted function is used to decide the best next-hop node selection based on the parameters like residual energy, distance and UAV movement direction.
Journal ArticleDOI

SecRIP: Secure and reliable intercluster routing protocol for efficient data transmission in flying ad hoc networks

TL;DR: The results show that the SecRIP protocol achieves secure and reliable data transmission and is capable of maintaining the higher QoS and the QoE standards and also helps the nodes conserve their power without compromising on the performance.
Journal ArticleDOI

Predictive geographic multicast routing protocol in flying ad hoc networks

TL;DR: In uniform and random deployment scenarios, the MATLAB-based evaluation result has revealed that when the communication range increases, the probability of finding one-hop predicted forwarders to reach multicast destinations also increases.
References
More filters

Ad hoc On-Demand Distance Vector (AODV) Routing

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.

Dynamic Source Routing in Ad Hoc Wireless Networks.

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.
Book ChapterDOI

Dynamic Source Routing in Ad Hoc Wireless Networks

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.
Proceedings ArticleDOI

GPSR: greedy perimeter stateless routing for wireless networks

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.
Proceedings ArticleDOI

Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

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.
Related Papers (5)