scholarly journals A Hybrid and Robust Delay and Link Stability Aware (DLSA) Routing Protocol for Unmanned Aerial Ad-hoc Networks (UAANETs)

2021 ◽  
Author(s):  
Altaf Hussain
Keyword(s):  
Network Lifetime ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Transmission Loss ◽  
Three Dimensional ◽  
High Mobility ◽  
Threshold Value ◽  
Delivery Ratio ◽  
Link Stability

Abstract Unmanned Aerial Ad-hoc Network (UAANET) also knows as by the name of Flying Ad-hoc NETwork (FANET) is a new class of Mobile Ad-hoc NETwork (MANET) in which the nodes move in three dimensional (3-D) ways in the air simultaneously. These nodes are known as Unmanned Aerial Vehicles (UAVs) that are operated live remotely or by pre-defined mechanism which involve no human personnel. Due to high mobility of nodes and dynamic topology, the link stability is a research challenge in FANET. From this viewpoint, recent research has focused on link stability with highest threshold value by maximizing Packet Delivery Ratio (PDR) and minimizing End-to-End Delay (E2ED). In this research, a hybrid scheme named Delay and Link Stability Aware (DLSA) routing scheme has been proposed with the contrast of Distributed Priority Tree-based Routing (DPTR) and Link Stability Estimation-based Routing (LEPR) FANET’s existing routing schemes. Unlike existing schemes, the proposed scheme possesses the features in collaborative data forwarding and link stability by merging the positive features of DPTR and LEPR. The link stability via maximum threshold value has been introduced to acquire and select the most feasible route from source to destination. The simulation was carried out using Matrix Laboratory (MATLAB) tool for the concerned research. Simulation results have showed improved performance of the proposed protocol in contrast to the selected existing ones in terms of E2ED, PDR, Network Lifetime and Transmission Loss. Average E2ED in (milliseconds) of DLSA measured 0.457, while DPTR was 1.492 and LEPR was 1.006. Similarly, Average PDR (in %age) of DLSA measured 3.106, while DPTR was 2.303 and LEPR was 0.682. Average Network Lifetime in (seconds) for DLSA measured 62.141, while DPTR was 23.036 and LEPR was 27.298. Average Transmission Loss in (dBm) for DLSA measured 0.975, while DPTR was 1.053 and LEPR was 1.227.

A Directional Forward Routing Protocol Based on Spray and Wait in Vehicular Ad Hoc Networks

2014 ◽  
Vol 687-691 ◽  
pp. 2442-2446
Author(s):  
Jie Han ◽  
Lun Tang ◽  
Xiao Qin Gu
Keyword(s):  
Ad Hoc Network ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Buffer Management ◽  
High Mobility ◽  
Packet Delivery Ratio ◽  
Delivery Ratio ◽  
Packet Delivery ◽  
Hoc Networks

In recent years, Vehicular Ad Hoc Network (VANET) attracts more and more attention. VANET is a special Mobile Ad Hoc Network, the network suffers from high mobility so that the end-to-end path may not exist all the time. First, this paper proposed the improvement of spray phase, combined with the real situation of VANET. Second, we choose the best performance of neighbor node as next hop in forward phase. Third, it has an available buffer management mechanism to increase packet delivery ratio and reduce the overhead. The Simulation results show that DFSB routing can significantly enhance packet delivery ratio and decrease routing delay.

scholarly journals A Bioinspired Adaptive Congestion-Avoidance Routing for Mobile Ad Hoc Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Huang Qiong ◽  
Yin Pengfei ◽  
Chen Qianbin ◽  
Gong Pu ◽  
Yang Xiaolong
Keyword(s):  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Threshold Value ◽  
Recovery Phase ◽  
Network Routing ◽  
Delivery Ratio ◽  
Route Maintenance ◽  
Random Manner ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Traditional mobile Ad Hoc network routing protocols are mainly based on the Shortest Path, which possibly results in many congestion nodes that incur routing instability and rerouting. To mitigate the side-efforts, this paper proposed a new bioinspired adaptive routing protocol (ATAR) based on a mathematics biology model ARAS. This paper improved the ARAS by reducing the randomness and by introducing a new routing-decision metric “the next-hop fitness” which was denoted as the congestion level of node and the length of routing path. In the route maintenance, the nodes decide to forward the data to next node according to a threshold value of the fitness. In the recovery phase, the node will adopt random manner to select the neighbor as the next hop by calculation of the improved ARAS. With this route mechanism, the ATAR could adaptively circumvent the congestion nodes and the rerouting action is taken in advance. Theoretical analysis and numerical simulation results show that the ATAR protocol outperforms AODV and MARAS in terms of delivery ratio, ETE delay, and the complexity. In particular, ATAR can efficiently mitigate the congestion.

scholarly journals A Novel Clustering Algorithm Based on Agent Technology for VANET

2016 ◽  
Vol 8 (2) ◽  
pp. 1 ◽  
Author(s):  
Samira Harrabi ◽  
Ines Ben Jaafar ◽  
Khaled Ghedira
Keyword(s):  
Traffic Congestion ◽  
Ad Hoc Network ◽  
Clustering Algorithm ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Clustering Algorithms ◽  
High Mobility ◽  
Agent Technology ◽  
Related Data ◽  
Network Overhead

Vehicular Ad-hoc Network (VANET) is a sub-family of Mobile Ad-hoc Network (MANET).The means goal of VANET is to provide communications between nearby nodes or between nodes and fixed infrastructure. Despite that VANET is considered as a subclass of MANET, it has for particularity the high mobility of vehicles producing the frequent changes of network topology that involve changing of road, varying node density and locations of vehicles existing in this road. That‘s why, the most proposed clustering algorithms for MANET are unsuitable for VANET. Various searches have been recently published deal with clustering for VANETs. But most of them are focused on minimizing network overhead value, number of created clusters and had not considered the vehicles interests which defined as any related data used to differentiate vehicle from another (such as traffic congestion, looking for free parking space etc). In this paper, we propose a novel clustering algorithm based on agent technology to solve the problems mentioned above and improve routing in VANET. Experimental part show promising results regarding the adoption of the proposed approach.

scholarly journals An improved harmony search algorithm for optimized link state routing protocol in vehicular ad hoc network

2018 ◽  
Vol 7 (2.14) ◽  
pp. 177
Author(s):  
Mustafa Raad Hammoodi ◽  
Ravie Chandren Muniyand
Keyword(s):  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Search Algorithm ◽  
Harmony Search ◽  
Harmony Search Algorithm ◽  
Delivery Ratio ◽  
Roulette Wheel Selection ◽  
Link State ◽  
Improved Harmony Search

Vehicle Ad-hoc Network (VANET) is a direct application of Mobile Ad-hoc Network (MANET). Nodes in VANET are vehicles that communicate using vehicle to vehicle (V2V) or vehicle to infrastructure (V2I). These types of communications have led to the emergence of various applications that provide safer driving. Due to the high changing of topology and frequent fragmentation of VANET, routing pack-ets in this type of network is a hard task. In this work, the authors deal with the well-known MANET proactive Optimized Link State Rout-ing protocol (OLSR). The deployment of OLSR in VANET gives the moderate performance; this is due to its necessity of constant ex-changing of control packets. The performance of OLSR is highly dependent on its parameters, thus finding optimal parameters configura-tions that best fit VANETs environment and improves the network is essential before its deployment. Therefore, this research proposes a modified Harmony Search optimization (HSO) by incorporating selection methods in its memory consideration; roulette wheel selection to obtain fine-tuned OLSR for high density and velocity scenario. The experimental analysis showed that the OLSR with the proposed ap-proach acquired promising results regarding packet delivery ratio, end-to-end delay and overhead when compared with previous approaches.  

scholarly journals TEKNIK KOMUNIKASI DATA PADA AD HOC NETWORK COMMUNICATION

2014 ◽  
Vol 11 (2) ◽  
Author(s):  
Budi Rahmadya
Keyword(s):  
Mobile Networks ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Data Communication ◽  
High Mobility ◽  
Delay Tolerant Network ◽  
Network Communication ◽  
Destination Node ◽  
Delivery Ratio ◽  
Data Packets

Ad Hoc Network Communication is mobile networks communications and have a high mobility for each of its nodes. This type of network communications is a temporary networkwith utilizing a WiFi network or Bluethoot as a medium of communications. In the entirenetwork, node moves with a speed varying and unpredictable direction. Packets data delivery from the source node to destination node by using an ad hoc network requires its owntechniques. In this research discussed the existing data communication technique inVehicular Ad Hoc Network (VANETs) Communications with attention: Broadcasting Time, Routing Protocol, Message Dissemination, Delay Tolerant Network Dissemination and / DTN.These techniques can increase the delivery ratio / sending data packets to the destination as well as a smaller delay time. In order to maintain the integrity of the data packets received bythe destination node, the authors have proposed a method of duplicate messages in thisresearch.

Analysis of Effective Routing Protocols for Flying Ad-Hoc Networks

2020 ◽  
Vol 3 (2) ◽  
pp. 1-18 ◽  
Author(s):  
Sudesh Kumar ◽  
Abhishek Bansal ◽  
Ram Shringar Raw
Keyword(s):  
Routing Protocol ◽  
Ad Hoc Network ◽  
High Speed ◽  
Ad Hoc ◽  
Network Formation ◽  
High Mobility ◽  
Delivery Ratio ◽  
Data Packets ◽  
Hoc Networks ◽  
Networking Technology

Recently, the flying ad-hoc network (FANETs) is a popular networking technology used to create a wireless network through unmanned aerial vehicles (UAVs). In this network, the UAV nodes work as intermediate nodes that communicate with each other to transmit data packets over the network, in the absence of fixed an infrastructure. Due to high mobility degree of UAV nodes, network formation and deformation among the UAVs are very frequent. Therefore, effective routing is a more challenging issue in FANETs. This paper presents performance evaluations and comparisons of the popular topology-based routing protocol namely AODV and position-based routing protocol, namely LAR for high speed mobility as well as a verity of the density of UAV nodes in the FANETs environment through NS-2 simulator. The extensive simulation results have shown that LAR gives better performance than AODV significantly in terms of the packet delivery ratio, normalized routing overhead, end-to-end delay, and average throughput, which make it a more effective routing protocol for the highly dynamic nature of FANETs.

scholarly journals Efficient Heuristic Based on Clustering Approach for OLSR

2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Ali Choukri ◽  
Ahmed Habbani ◽  
Mohamed El Koutbi
Keyword(s):  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Delivery Ratio ◽  
Dynamic Nature ◽  
End To End Delay ◽  
Delay Control ◽  
Clustering Approach ◽  
Mobile Ad Hoc

Due to the dynamic nature of mobile ad hoc network (MANET), the quality of service (QoS) requires several improvements. The present papercomeswithin the framework of research to optimize QoS in MANET. In this paper, we propose a novel version of OLSR based on the clustering approach which is inspired from Lin and Chu heuristic and adapted to beimplemented inOLSR. We studied its stability and we compared its performances to those of standard OLSR. The metrics we used in evaluating network performances were average end-to-end delay, control routing overhead, and packet delivery ratio. Experimental results show that our alternative significantly reduces the traffic reserved to monitoring the network, which positively influences other performances such as throughput, delay, and loss.

Analysis of Reinforcement Based Adaptive Routing in MANET

2016 ◽  
Vol 2 (3) ◽  
pp. 648 ◽  
Author(s):  
Rahul Desai ◽  
B P Patil
Keyword(s):  
Reinforcement Learning ◽  
Shortest Path ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Learning Algorithms ◽  
High Mobility ◽  
Delivery Ratio ◽  
Shortest Path Routing ◽  
Minimum Number ◽  
Shortest Path Algorithms

<p class="Abstract">This paper describes and evaluates the performance of various reinforcement learning algorithms with shortest path algorithms that are widely used for routing packets through the network. Shortest path routing is the simplest policy used for routing the packets along the path having minimum number of hops. In high traffic or high mobility conditions, the shortest path get flooded with huge number of packets and congestions occurs, So such shortest path does not provides the shortest path and increases delay for reaching the packets to the destination. Reinforcement learning algorithms are adaptive algorithms where the path is selected based on the traffic present on the network at real time. Thus they guarantee the least delivery time to reach the packets to the destination. Analysis done on a 6 by 6 irregular grid and sample ad hoc network shows that performance parameters used for judging the network - packet delivery ratio and delay provides optimum results using reinforcement learning algorithms. </p>

Study on a Novel GIS-Based Routing Strategy

2014 ◽  
Vol 644-650 ◽  
pp. 2969-2972
Author(s):  
Yue Wei Wang ◽  
Ding Yi Ji
Keyword(s):  
Routing Protocols ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
High Mobility ◽  
Delivery Ratio ◽  
Scenario Simulation ◽  
Packet Delivery ◽  
Routing Strategy ◽  
Topology Changes ◽  
The City

Given a scenario of Vehicle Ad hoc Network (VANET), this paper presented a GIS-Based routing (GBR) strategy to resolve frequent reconstruction caused by rapid topology changes. Due to the use of road information based on GIS, the protocol can evade permanent or temporary topology holes respectively which frequently occurred in the city scenario. Simulation results showed new routing protocols could achieve better performance in packet delivery ratio and proved GBR’s lower routing overhead, as well as it is better performances in high mobility, compared with DSR in urban vehicle environment.

Sign in / Sign up

Export Citation Format

Share Document