scholarly journals Hybrid Tabu-Shuffled Frog Leaping Algorithm for Multipath Quality Route Selection Routing In High Mobility Network

2019 ◽  
Vol 8 (11) ◽  
pp. 3529-3535
Keyword(s):  
Ad Hoc ◽  
Routing Algorithm ◽  
Optimal Path ◽  
High Mobility ◽  
Base Station ◽  
Mobile Nodes ◽  
Shuffled Frog Leaping Algorithm ◽  
Routing Optimization ◽  
Shuffled Frog Leaping ◽  
Hoc Networks

The Mobile Ad hoc Networks (MANETs) have been emerging as a technology offering many advantages to the users as regards cost and ease. The MANET is the collection of the connected mobile nodes and the connection is by the wireless links forming a temporary topology of network operating without centralized administration or the base station. Routing indicates a method by which information gets forwarded from transmitters to recipients. This is a strategy which guarantees the connection between two of the nodes in this network. For this work, there was a routing algorithm that was proposed for an efficient determination of an optimal path from the source to the destination in the MANETs. The Ad hoc On-Demand Distance Vector Routing (AODV) based protocol has been a routing protocol that has been designed for operating the MANET. This algorithm had been designed by means of using the TABU Search (TS) and the Shuffled Frog Leaping Algorithm (SFLA) which has been a metaheuristic algorithm that is a representation. The TABU_SFLA proposed had carried out two other operations generated in the neighbourhood for determining the optimal path and to minimize the time of execution. The results were compared to prove that the proposed TABU_SFLA was able to outperform all other algorithms that were well-suited for adapting the problem of routing optimization.

scholarly journals Routing Algorithm To Eliminate Stale Routes (RAESR) In Mobile Ad Hoc Networks

2019 ◽  
Vol 8 (12) ◽  
pp. 4503-4509
Keyword(s):  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Routing Algorithm ◽  
High Mobility ◽  
Propagation Delay ◽  
Link Failure ◽  
Mobile Nodes ◽  
Routing Overhead ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Mobile Ad-hoc Network (MANET) is a collection of self sustaining mobile nodes which are connected through many wi-fi links to form a temporary communication for sharing information between the users. Mobile nodes behave as a host as well as router. As nodes in MANET posse’s mobility in traits frequently leads to irregular link between the nodes. Link failure directs a significant routing overhead during high mobility and also maintaining all the information associated with nodes and routing paths are considered as an extra overhead on the table. In order to overcome these issues, the routing algorithm to eliminate stare routed in routing cache. The neighbor degree centrality table is introduced to recognize the valuable nodes, using the valuable nodes the routes are discovered and link failure information are disseminated across the network wide. The results and findings show that the elimination of stale routes leads to significant reduction in routing overhead which in turn reduces the route error propagation delay

Intelligent Transport Systems Services in VANETs and Case Study in Urban Environment

2018 ◽  
pp. 183-207
Author(s):  
Hamid Barkouk ◽  
El Mokhtar En-Naimi
Keyword(s):  
Ad Hoc ◽  
High Mobility ◽  
Base Station ◽  
Transport Systems ◽  
Mobile Nodes ◽  
Ad Hoc Routing ◽  
Intelligent Transport ◽  
Variable Topology ◽  
Hoc Networks ◽  
The Impact

The VANET (Vehicular Ad hoc Network) is a collection of mobile nodes forming a temporary network on variable topology, operating without base station and without centralized administration. Communication is possible between vehicles within each other's radio range as well as with fixed components on road side infrastructure. The characteristics of VANET network that distinguishes it from other ad hoc networks, such as high mobility and communication with the infrastructure to support security or comfort applications, have prompted researchers to develop models and mobility specific protocols. The main goal of this chapter is firstly to compare the performance of three Ad hoc routing protocols: OLSR, AODV and DSDV, and secondly to examine the impact of varying mobility, density and pause time on the functionality of these protocols. The results of this chapter demonstrate that AODV have better performance in terms of Throughput and Packets Delivery Rate (PDR), whereas OLSR have best performance in terms of Packet Delivery Time (Delay).

scholarly journals Progressive AODV: A Routing Algorithm Intended for Mobile Ad-Hoc Networks

2019 ◽  
Vol 9 (2) ◽  
pp. 70-74
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Optimal Path ◽  
Network Size ◽  
Base Station ◽  
Ad Hoc Routing ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Mobile ad hoc networks are an independent wireless network that is built without permanent infrastructure and base station support. Each node in the network uses a wireless connection for connections and acts not only as an end system but also as a path to accelerating packets. Meanwhile, the network nodes are mobile and can move in each path with changing steps, creating a great dynamic of the network. Therefore, the protocols set for general ad hoc networks are inappropriate for such a situation. In addition, the performance of ad hoc routing protocols decreases with increasing network size. In this context, suggest a new way to extend the recital of routing in MANETs: the on-demand Progressive Distance Vector (PAODV). It is a modified variant of the standard AODV routing protocol, which shrinks the dynamic path when an optimal path exists and switches the traffic to it. Simulation studies with NS2 show that the proposed method improves network performance as network size, weight, or flexibility increase.

scholarly journals Mobility-Assisted on-Demand Routing Algorithm for MANETs in the Presence of Location Errors

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Trung Kien Vu ◽  
Sungoh Kwon
Keyword(s):  
Ad Hoc ◽  
Routing Algorithm ◽  
Mobility Prediction ◽  
Location Awareness ◽  
Mobile Nodes ◽  
Location Errors ◽  
On Demand ◽  
Demand Routing ◽  
Hoc Networks ◽  
The Impact

We propose a mobility-assisted on-demand routing algorithm for mobile ad hoc networks in the presence of location errors. Location awareness enables mobile nodes to predict their mobility and enhances routing performance by estimating link duration and selecting reliable routes. However, measured locations intrinsically include errors in measurement. Such errors degrade mobility prediction and have been ignored in previous work. To mitigate the impact of location errors on routing, we propose an on-demand routing algorithm taking into account location errors. To that end, we adopt the Kalman filter to estimate accurate locations and consider route confidence in discovering routes. Via simulations, we compare our algorithm and previous algorithms in various environments. Our proposed mobility prediction is robust to the location errors.

scholarly journals ANT COLONY OPTIMIZED ROUTING FOR MOBILE ADHOC NETWORKS (MANET)

2013 ◽  
pp. 218-223
Author(s):  
DWEEPNA GARG ◽  
PARTH GOHIL
Keyword(s):  
Swarm Intelligence ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Routing Algorithm ◽  
Ant Colony ◽  
Node Mobility ◽  
Mobile Nodes ◽  
Ant Colony Algorithms ◽  
Mobile Ad Hoc ◽  
Hoc Networks

A Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without using centralized access points, infrastructure, or centralized administration. Routing means the act of moving information across an internet work from a source to a destination. The biggest challenge in this kind of networks is to find a path between the communication end points, what is aggravated through the node mobility. In this paper we present a new routing algorithm for mobile, multi-hop ad-hoc networks. The protocol is based on swarm intelligence. Ant colony algorithms are a subset of swarm intelligence and consider the ability of simple ants to solve complex problems by cooperation. The introduced routing protocol is well adaptive, efficient and scalable. The main goal in the design of the protocol is to reduce the overhead for routing. We refer to the protocol as the Ant Colony Optimization Routing (ACOR).

scholarly journals Greedy Data Transportation Scheme with Hard Packet Deadlines for Wireless Ad Hoc Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
HyungJune Lee
Keyword(s):  
Wireless Ad Hoc Networks ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Mobile Node ◽  
Network Services ◽  
Delivery Ratio ◽  
Mobile Nodes ◽  
Packet Delivery ◽  
Hoc Networks ◽  
Ad Hoc Sensor Networks

We present a greedy data transportation scheme with hard packet deadlines in ad hoc sensor networks of stationary nodes and multiple mobile nodes with scheduled trajectory path and arrival time. In the proposed routing strategy, each stationary ad hoc node en route decides whether to relay a shortest-path stationary node toward destination or a passing-by mobile node that will carry closer to destination. We aim to utilize mobile nodes to minimize the total routing cost as far as the selected route can satisfy the end-to-end packet deadline. We evaluate our proposed routing algorithm in terms of routing cost, packet delivery ratio, packet delivery time, and usability of mobile nodes based on network level simulations. Simulation results show that our proposed algorithm fully exploits the remaining time till packet deadline to turn into networking benefits of reducing the overall routing cost and improving packet delivery performance. Also, we demonstrate that the routing scheme guarantees packet delivery with hard deadlines, contributing to QoS improvement in various network services.

AN IMPLEMENTATION OF EFFICIENT PATH SELECTION METHOD FOR SUCCESSFUL DATA TRANSMISSION IN MOBILE AD HOC NETWORKS

2021 ◽  
Vol 12 (1) ◽  
pp. 36-48
Author(s):  
Arjun Jadhaw ◽  
◽  
Vikrant Sharma
Keyword(s):  
Ad Hoc ◽  
Routing Algorithm ◽  
Optimal Path ◽  
Network Routing ◽  
Path Selection ◽  
Network Simulator ◽  
Hop Count ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
Selection Of

Routing is a process of forwarding the data from a known source to the destination. In this procedure, the data might travel during some in-between paths, and there exist a required to select the best probable best possible nodes to forward the data. This best selection of nodes will permit to achieve a high presentation in the network. Big amount of worked has been carried out to find the best pathway in the network routing to progress its effectiveness and to eliminate overcrowding problems. A good routing algorithm should be able to find an optimal path and it must be simple. It also must have low overhead, and be robust and stable, converging rapidly, and must remain flexible. Routing in MANET by means of the direct pathway metric is not a sufficient situation to construct high quality pathway, since minimum hop count routing frequently chooses routes that have considerably less capacity than the best pathway that live in the network. In this article, we suggest a mechanism to prefer the routing protocol based on manifold measure like Throughput, PDR, energy expenditure etc. These paths are quite resourceful. Network presentation will be raise by using these paths. The efficiency of our mechanism is illustrated by simulations conducted using network simulator ns-2.

scholarly journals Enhancement of Link Stability and Connectivity in Vehicular Ad hoc Networks

2021 ◽  
Vol 12 (1S) ◽  
pp. 266-271
Author(s):  
Kishor N. Tayade, Et. al.
Keyword(s):  
Ad Hoc Networks ◽  
Intelligent Transportation Systems ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Intelligent Transportation ◽  
Transportation Systems ◽  
Mobile Nodes ◽  
The Road ◽  
Hoc Networks

Vehicular Ad hoc Networks is a promising sub-group of MANET. VANET is deployed on the highways, where the vehicles are mobile nodes. Safety and intelligent transportation are important VANET applications that require appropriate communication among vehicles, in particular routing technology. VANETs generally inherit their common features from MANETs where vehicles operate in a collaborative and dispersed way for promoting contact among vehicles and with network infrastructure like the Road Side Units (RSU) for enhanced traffic experience. In view of the fast growth of Intelligent Transportation Systems (ITS), VANETs has attracted considerable interest in this decade. VANET suffer from a major problem of link failure due to dynamic mobility of vehicles. In this paper we proposed a position based routing algorithm to identify stable path, this will improve the routing by decreasing overhead and interrupting the number of links. Link Expiration Time (LET) is used to provide the stable link, the link with the longest LET is considered as the most stable link. The multicast Ad-hoc On-demand Distance Vector (MAODV) is proposed to avoid the link breakages by using a link with longest LET.  Data loss is reduced by avoiding link breakages and enhance throughput by reducing the communication delay.

scholarly journals Hybrid Differential Evolution Based Probabilistic Model to Support Quality Aware Best Path Routing Scheme for Mobile Adhoc Networks

2020 ◽  
Vol 8 (4S5) ◽  
pp. 250-258
Keyword(s):  
Ad Hoc Networks ◽  
Differential Evolution ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Multipath Routing ◽  
Traffic Load ◽  
Destination Node ◽  
Mobile Nodes ◽  
Routing Scheme ◽  
Hoc Networks

The Mobile Ad hoc Networks (MANETs) today represent a new system containing wireless mobile nodes to dynamically and freely organize the topologies of the network without having any communication infrastructure. Owing to the traits such as temporary topology and the absence of a proper centralized authority routing can be a very important issue faced by the ad hoc networks. This multipath routing algorithm has established various paths between the source node and its destination node thus spreading traffic load along various routes. This will be able to alleviate congestion of traffic on a particular path. Thus, the multipath routing algorithms were able to provide route resilience that ensured data transmission reliability. For the purpose of this work, there was a multipath routing scheme which is called the Ad hoc On-demand Multipath Distance Vector Routing (AOMDV) Protocol. This was proposed by means of employing a hybrid Fire Fly (FF) with Differential Evolution (DE) algorithm. This approach was able to achieve better, as well as, reciprocal advantages in a dynamic and hostile network situation. Thus, the proposed scheme of routing was a very powerful method to find effective solutions to MANET routing problems. The proposed method is a well-known probabilistic metaheuristic algorithm to improve the quality aware best path routing protocol. Simulation results indicate that the proposed method FF-DE achieves better performance than AOMDV and FF.

Sign in / Sign up

Export Citation Format

Share Document