scholarly journals ASR-FANET: An adaptive SDN-based routing framework for FANET

2021 ◽  
Vol 11 (5) ◽  
pp. 4403
Author(s):  
Alaa Taima Albu-slaih ◽  
Hayder Ayad Khudhair
Keyword(s):  
Ad Hoc Network ◽  
Ad Hoc ◽  
Optimal Path ◽  
High Mobility ◽  
Topology Discovery ◽  
Mobile Adhoc Network ◽  
Network Connection ◽  
Topology Changes ◽  
The Status ◽  
Better Than

Flying ad hoc network (FANET) is widely used in many military, commercial and civilian applications. Compared with mobile adhoc network (MANET) and vehicular ad hoc network (VANET), FANET holds unique characteristics such as high mobility, intermittent links and frequent topology changes, which cause a challenging task in the design of routing protocols. A novel adaptive software defined networking (SDN)-based routing framework for FANET called ASR-FANET is proposed in this article to solve the above challenges. The ASR-FANET framework is mainly composed of three important parts, which are the topology discovery mechanism, statistics gathering mechanism and route computation mechanism. In topology discovery mechanism, the periodic information about network topology is collected, including nodes and links. In statistics gathering mechanism, the status of the wireless network connection and flight statistics are collected. In route computation mechanism, the optimal path is calculated based on link costs. The performance of ASR-FANET framework is also has been evaluated by comprehensive simulations. The simulation results show that proposed framework is much better than other traditional protocols in packet delivery fraction, average end to end delay, normalized routing load, packet loss and throughput.

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.

scholarly journals Multi Constraints Optimal Path based on Routing Protocols in VANETs

2020 ◽  
Vol 8 (6) ◽  
pp. 4274-4278
Keyword(s):  
Routing Protocols ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Power Transmission ◽  
Optimal Path ◽  
High Mobility ◽  
Road Maintenance ◽  
Hop Count ◽  
Narrow Road ◽  
Continuous Power

Vehicular Ad-hoc network (VANETs) is a type of ad hoc network which has faced many challenges for its implementation such as Technical issues which include are Large Size area, Routing, Security, Congestion, High Mobility, Limited road topology, Intermitted connectivity, Continuous power transmission for significant computing communication & sensing of the network & On road issues include narrow road, unstructured road, all roads are not allowed for all vehicles, busy road, no defined speed on road, no road maintenance, high frequency of accidents, poor sign board, no road side amenities, multiple numbers of toll booths etc. In order to enhance the performance of the desired real time network link between the nodes must be stable and reliable so that information can be transmitted reliably to the desired destination. This paper has experimentally studied the optimal path for different routing protocols in VANETs. This paper clearly concludes which routing protocol is better under different parameters such as number of hops, average hop count, total packet send and received for the realistic environment.

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 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 Physarum-Inspired Autonomous Optimized Routing Protocol for Coal Mine MANET

2020 ◽  
Vol 2020 ◽  
pp. 1-14
Author(s):  
Haifeng Jiang ◽  
Xiaoxiao Liu ◽  
Shuo Xiao ◽  
Chaogang Tang ◽  
Wei Chen
Keyword(s):  
Coal Mine ◽  
Routing Protocol ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Dynamic Network ◽  
Delivery Ratio ◽  
Network Load ◽  
The Status ◽  
Mobile Ad Hoc ◽  
Better Than

Mobile Ad Hoc Network (MANET) is suitable for complex environment communication in coal mine. The processes of nutrient flux transfer and path choice in Physarum networks are similar to data transmission and routing decision in MANET. In this paper, we use a Physarum optimization model to design Physarum-inspired autonomous optimized routing (PIAOR) protocol to adapt to the dynamic network topology in underground mine. PIAOR introduces the status of MANET into the Poisson equation in the Physarum model, selects reasonable parameters to represent the transmission performance of the network, and uses the differential evolution equation of the Physarum model to evolve the parameters. PIAOR has achieved the distributed routing decision by automatically reconstructing the optimal routing path, which has reduced the algorithm complexity. Based on NS2, simulation experiments are performed to evaluate the performance of PIAOR, and the results are compared with GPSR, PIMAR, and P-IRP routing algorithms. The experimental results show that the routing path selected by PIAOR is better than that selected by the other three protocols in the performance of average end-to-end delay, delivery ratio, and throughput. The balance of energy consumption and network load is reached, and the network lifetime is effectively prolonged when using the PIAOR protocol.

An Energy Efficient Geocast Routing Protocol Based on a Defer-Time Control Function for Vehicular Ad-Hoc Network

2011 ◽  
Vol 467-469 ◽  
pp. 972-977
Author(s):  
Bon Yeh Lin ◽  
Chi Hua Chen ◽  
Chi Chun Lo
Keyword(s):  
Routing Protocol ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Control Function ◽  
High Mobility ◽  
Cost Effective ◽  
Routing Algorithms ◽  
Vehicular Ad Hoc Network ◽  
Hop Count ◽  
Time Control

The Vehicular Ad-hoc NETwork (VANET) requires a suitable routing protocol to accommodate its special characteristics (e.g., high mobility, short-lived links, and fast-changing topology). There are many routing algorithms which are developed for transmitting information more quickly and cost-effective. In this paper, we propose a routing protocol which relies on Defer-Time Control Function (DTCF) to reduce the hop count, the transmission delay, and the probability of collisions during transmission. We provide an extensive analysis of DTCFs and choose the power-law model for routing protocol optimization. The function can be adjusted dynamically according to the distribution of the neighboring nodes (vehicles) of each hop. We also propose a mechanism to prevent the selected next-hop leaves the transmission range.

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>

Sign in / Sign up

Export Citation Format

Share Document