Flying Ad-Hoc Networks: Routing Protocols, Mobility Models, Issues
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2016, Vol 7, Issue 6
Abstract
Flying Ad-Hoc Networks (FANETs) is a group of Unmanned Air Vehicles (UAVs) which completed their work without human intervention. There are some problems in this kind of networks: the first one is the communication between (UAVs). Various routing protocols introduced classified into three categories, static, proactive, reactive routing protocols in order to solve this problem. The second problem is the network design, which depends on the network mobility, in which is the process of cooperation and collaboration between the UAV. Mobility model of FANET is introduced in order to solve this problem. In Mobility Model, the path and speed variations of the UAV and represents their position are defined. As of today, Random Way Point Model is utilized as manufactured one for Mobility in the greater part of recreation situations. The Arbitrary Way Point model is not relevant for the UAV in light of the fact that UAV do not alter their course and versatility, speed quickly at one time because of this reason, we consider more practical models, called Semi-Random Circular Movement (SRCM) Mobility Model. Also, we consider different portability models, Mission Plan-Based (MPB) Mobility Model, Pheromone-Based Model. Moreover, Paparazzi Mobility Model (PPRZM). This paper presented and discussed the main routing protocols and main mobility models used to solve the communication, cooperation, and collaboration in FANET networks.
Authors and Affiliations
Muneer Yassein, "Nour Alhuda” Damer
Recurrence Relation for Projectile Simulation Project and Game based Learning
Huge Gap has been observed on study of projectile simulation models relating it to speed of camera or frame per seconds. The objective of this paper is to explore and investigate time driven simulation models to mimic pr...
Improved Discrete Differential Evolution Algorithm in Solving Quadratic Assignment Problem for best Solutions
The combinatorial optimization problems are very important in the branch of optimization or in the field of operation research in mathematics. The quadratic assignment problem (QAP) is in the category of facilities locat...
A Global Convergence Algorithm for the Supply Chain Network Equilibrium Model
In this paper, we first present an auxiliary problem method for solving the generalized variational inequalities problem on the supply chain network equilibrium model (GVIP), then its global convergence is also establish...
Directed and Almost-Directed Flow Loops in Real Networks
Directed flow loops are highly undesirable because they are associated with wastage of energy for maintaining them and entail big losses to the world economy. It is shown that directed flow loops may appear in networks e...
Automatic Pavement Cracks Detection using Image Processing Techniques and Neural Network
Feature extraction methods and subsequent neural network performances were used in this research to impose proper assessment for distressed roads for a case study area in the North of Jordan. Object recognition method wa...