scholarly journals Dynamic Routing in Flying Ad-Hoc Networks Using Topology-Based Routing Protocols

Drones ◽  
2018 ◽  
Vol 2 (3) ◽  
pp. 27 ◽  
Author(s):  
Muhammad Asghar Khan ◽  
Inam Ullah Khan ◽  
Alamgir Safi ◽  
Ijaz Mansoor Quershi
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocols ◽  
Ad Hoc ◽  
Rapid Evolution ◽  
High Mobility ◽  
Literature Study ◽  
End To End Delay ◽  
Network Load ◽  
End To End ◽  
Hoc Networks

The ever-increasing demand for flexible and portable communications has led to a rapid evolution in networking between unmanned aerial vehicles (UAVs) often referred to as flying ad-hoc networks (FANETs). However, due to the exclusive characteristics of UAVs such as high mobility, frequent topology change and 3D space movement, make routing a challenging task in FANETs. Due to these characteristics, designing new routing protocols for FANETs is quite difficult. In the literature study of FANETs, a variety of traditional ad-hoc networking protocols have been suggested and tested for FANETs to establish an efficient and robust communication among the UAVs. In this context, topology-based routing is considered the most significant approach for solving the routing issues in FANETs. Therefore, in this article we specifically focus on topology-based routing protocols with the aim of improving the efficiency of the network in terms of throughput, end-to-end delay, and network load. We present a brief review of the most important topology-based routing protocols in the context of FANETs. We provide them with their working features for exchanging information, along with the pros and cons of each protocol. Moreover, simulation analyses of some of the topology-based routing protocols are also evaluated in terms of end-to-end delay, throughput and network load the using optimized network engineering tools (OPNET) simulator. Furthermore, this work can be used as a source of reference for researchers and network engineers who seek literature that is relevant to routing in FANETs.

scholarly journals Delay-Constrained Routing Based on Stochastic Model for Flying Ad Hoc Networks

2018 ◽  
Vol 2018 ◽  
pp. 1-12 ◽  
Author(s):  
Shaojie Wen ◽  
Chuanhe Huang
Keyword(s):  
Ad Hoc Networks ◽  
Stochastic Model ◽  
Ad Hoc ◽  
Transition Probability ◽  
Relay Node ◽  
Link Quality ◽  
Mathematical Form ◽  
End To End Delay ◽  
End To End ◽  
Hoc Networks

This paper aims at solving the end-to-end delay-constrained routing problem in a local way for flying ad hoc networks (FANETs). Due to the high mobility, it is difficult for each node in FANETs to obtain the global information. To solve this issue, we propose an adaptive delay-constrained routing with the aid of a stochastic model, which allows the senders to deliver the packets with only local information. We represent the problem in a mathematical form, where the effective transmission rate is viewed as the optimization objective and the link quality and end-to-end delay as the constraints. And, some mathematical tools are used to obtain the approximate solutions for the optimization problem. Before designing the routing scheme, the senders calculate the transition probability for its relay node by jointly considering local delay estimation and expected one-hop delay. Then, the sender transmits the packets to their relay node with transition probability. Finally, we prove the convergence of the proposed routing algorithm and analyse its performances. The simulation results show that the proposed routing policy can improve the network performance effectively in terms of throughput, loss rate, and end-to-end delay.

scholarly journals Performance Comparison of IACO,AODV Networking Routing Protocols

2011 ◽  
pp. 33-37
Author(s):  
Miss Shweta Mod ◽  
Mr. Jitendra Prithvira
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Routing Protocols ◽  
Ad Hoc ◽  
Performance Comparison ◽  
Delivery Ratio ◽  
End To End Delay ◽  
Distance Vector ◽  
Mobile Ad Hoc ◽  
Hoc Networks

There are several standard protocols for Mobile Ad hoc Networks (MANET) that have been developed for devices with higher computing features. The Efficient routing protocols can provide significant benefits to mobile ad hoc networks, in terms of both performance and reliability. Many routing protocols for such networks have been proposed so far. Amongst the most popular ones are Ad hoc On-demand Distance Vector (AODV), Improved Ant Colony Optimization (IACO). In this paper we present our observations regarding the performance comparison of the above protocols in mobile ad hoc networks (MANETs). We perform extensive simulations, using NS-2 simulator. The Average end-to-end delay and the Packet Delivery Ratio have been considered as the two performance parameters

scholarly journals Performance evaluation for vehicular ad-hoc networks based routing protocols

2021 ◽  
Vol 10 (2) ◽  
pp. 1080-1091
Author(s):  
Hussain Falih Mahdi ◽  
Mohammed Salah Abood ◽  
Mustafa Maad Hamdi
Keyword(s):  
Routing Protocols ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Delivery Ratio ◽  
Wireless Router ◽  
End To End Delay ◽  
Aodv Protocol ◽  
Wide Range ◽  
End To End ◽  
Hoc Networks

VANET is a branch of MANETS, where each vehicle is a node, and a wireless router will run. The vehicles are similar to each other will interact with a wide range of nodes or vehicles and establish a network. VANETs provide us with the infrastructure to build new solutions for improving safety and comfort for drivers and passengers. There are several routing protocols proposed and evaluated for improving VANET's performance. The simulator is preferred over external experience because it is easy, simple, and inexpensive. In this paper, we choose AODV protocol, DSDV protocol, and DSR protocol with five different nodes density. For each protocol, as regards specific parameters like (throughput, packet delivery ratio, and end- to- end delay). On simulators that allow users to build real-time navigation models of simulations using VANET. Tools (SUMO, MOVE, and NS-2) were used for this paper, then graphs were plotted for evaluation using Trace-graph. The results showed the DSR is much higher than AODV and DSDV, In terms of throughput. While DSDV is the best choice because of the low average end to end delay. From the above, we conclude that each strategy has its own negative and positive aspects that make it ideally suited to a particular scenario than other scenarios.

Sign in / Sign up

Export Citation Format

Share Document