Journal Article10.1016/J.ADHOC.2012.12.004
Flying Ad-Hoc Networks (FANETs)
Ilker Bekmezci,Ozgur Koray Sahingoz,Samil Temel +2 more
- 01 May 2013
- Vol. 11, Iss: 3, pp 1254-1270
1.4K
TL;DR: In this paper, Flying Ad-Hoc Networks (FANETs) are surveyed which is an ad hoc network connecting the UAVs, and the main FANET design challenges are introduced.
read more
Abstract: One of the most important design problems for multi-UAV (Unmanned Air Vehicle) systems is the communication which is crucial for cooperation and collaboration between the UAVs. If all UAVs are directly connected to an infrastructure, such as a ground base or a satellite, the communication between UAVs can be realized through the in-frastructure. However, this infrastructure based communication architecture restricts the capabilities of the multi-UAV systems. Ad-hoc networking between UAVs can solve the problems arising from a fully infrastructure based UAV networks. In this paper, Flying Ad-Hoc Networks (FANETs) are surveyed which is an ad hoc network connecting the UAVs. The differences between FANETs, MANETs (Mobile Ad-hoc Networks) and VANETs (Vehicle Ad-Hoc Networks) are clarified first, and then the main FANET design challenges are introduced. Along with the existing FANET protocols, open research issues are also discussed.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Flying path optimization in UAV-assisted IoT sensor networks
TL;DR: An optimal flying path for unmanned aerial vehicle-assisted internet of things sensor networks using a location aware multi-layer information map considering different utility functions based on the sensor density, energy consumption, flight time, and flying risk level is presented.
50
A Comprehensive Survey in Towards to Future FANETs
TL;DR: This paper consists in a survey presenting to the reader concepts, architecture, applications, routing, simulators and possible integration among FANet and other technologies as well as challenges to be faced in the FANETs.
50
Joint Optimization of Area Coverage and Mobile-Edge Computing With Clustering for FANETs
TL;DR: The coverage efficiency is defined and an iterative coverage-efficient clustering algorithm (CECA) is proposed by applying penalty and block coordinate descent methods and shows that the proposed approach is superior to other approaches in terms of coverage efficiency and delay.
50
Optimal relay placement in multi-hop wireless networks
Roberto Magán-Carrión,Rafael A. Rodríguez-Gómez,José Camacho,Pedro García-Teodoro +3 more
- 01 Aug 2016
TL;DR: A new relay placement approach to maximize network connectivity in a multi-hop wireless network is presented, defined as a combination of inter-node reachability and network throughput.
Age-Delay Tradeoffs in Queueing Systems
Rajat Talak,Eytan Modiano +1 more
TL;DR: In this paper, the authors consider a server system where each server can service at most one update packet at a time and derive sufficient conditions to show that three heavy tailed service time distributions, namely Pareto, log-normal, and Weibull, asymptotically minimize the average AoI as their tail gets heavier.
50
References
•Book
Wireless Communications: Principles and Practice
Theodore S. Rappaport
- 15 Jan 1996
TL;DR: WireWireless Communications: Principles and Practice, Second Edition is the definitive modern text for wireless communications technology and system design as discussed by the authors, which covers the fundamental issues impacting all wireless networks and reviews virtually every important new wireless standard and technological development, offering especially comprehensive coverage of the 3G systems and wireless local area networks (WLANs).
20K
Ad-hoc on-demand distance vector routing
C.E. Perkins,E.M. Royer +1 more
- 25 Feb 1999
TL;DR: An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure and the proposed routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad- hoc networks.
Dynamic Source Routing in Ad Hoc Wireless Networks
David B. Johnson,David A. Maltz +1 more
- 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.
GPSR: greedy perimeter stateless routing for wireless networks
Brad Karp,Hsiang-Tsung Kung +1 more
- 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.
Wireless sensor network survey
TL;DR: This survey presents a comprehensive review of the recent literature since the publication of a survey on sensor networks, and gives an overview of several new applications and then reviews the literature on various aspects of WSNs.
6.4K