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 Modified Ant Colony Optimization (ACO) Algorithm for Routing in Vehicular Adhoc Networks

2019 ◽  
Vol 8 (11) ◽  
pp. 720-724
Keyword(s):  
Road Safety ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Intelligent Transportation System ◽  
Optimal Path ◽  
Energy Utilization ◽  
Network Simulator ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
Node Energy

Vehicular Ad hoc Network (VANET) is divided as Mobile Ad-hoc Networks (MANETs) application which comprises the capability to offer Intelligent Transportation System (ITS) and to enhance road safety. VANET has many difficulties that various from instability problem that gives higher topological change and higher energy utilization with many advantages. The main aim to construct a route optimal path technique is to reduce the probability of linkage failure and decrease the node energy utilization within the network. ACO heuristic for vehicle routing is proposed in this paper. In this method mobility prediction is employed for stability of network and to reduce the utilized energy two-tier mechanism is employed by Location Aided Routing (LAR) protocol. The simulation outcomes in Network simulator 2 of the proposed method enhanced the node energy utilization within the network and it takes lower energy

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.

Cluster-Based Location Aided Routing Algorithm for Mobile Ad Hoc Networks

2009 ◽  
Vol 20 (11) ◽  
pp. 3086-3100
Author(s):  
Yi WANG ◽  
Liang DONG ◽  
Tao-Tao LIANG ◽  
Xin-Yu YANG ◽  
De-Yun ZHANG
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Mobile Ad Hoc ◽  
Hoc Networks

scholarly journals Energy Efficient and robust routing with RPAR Protocol in Ad Hoc Networks

2017 ◽  
Vol 7 (1.1) ◽  
pp. 477
Author(s):  
Joshua Reginald Pullagura ◽  
D Venkata Rao
Keyword(s):  
Ad Hoc Networks ◽  
Energy Efficient ◽  
Ad Hoc ◽  
Life Time ◽  
Network Simulator ◽  
Mobile Nodes ◽  
Energy Efficient Routing ◽  
Hop Count ◽  
Routing Mechanism ◽  
Hoc Networks

In ad hoc network, the topology of network changes frequently due to the mobile nature of nodes where the communication is possible without any fixed network infrastructure. Mobile nodes are battery operated and so energy efficient routing should be provided which increases the network life time. The existing routing mechanisms do not consider both hop count and energy of nodes for data transmission. In this paper we propose a routing mechanism where data transfer from source to destination is based on the minimum hop count and residual energy of mobile nodes. The proposed RPAR protocol shows better performance when compared to existing Energy power aware routing  protocol .The analysis is carried out by using network simulator (NS-2), the simulation results shows that the proposed routing mechanism provides energy efficient and reliable  routing in ad hoc networks.

scholarly journals A Hop Count Based Heuristic Routing Protocol for Mobile Delay Tolerant Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Lei You ◽  
Jianbo Li ◽  
Changjiang Wei ◽  
Chenqu Dai ◽  
Jixing Xu ◽  
...  
Keyword(s):  
Routing Protocol ◽  
Ad Hoc ◽  
Delay Tolerant Networks ◽  
Network Partitioning ◽  
Heuristic Function ◽  
Hop Count ◽  
Dynamic Topology ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
Delay Tolerant

Routing in delay tolerant networks (DTNs) is a challenge since it must handle network partitioning, long delays, and dynamic topology. Meanwhile, routing protocols of the traditional mobile ad hoc networks (MANETs) cannot work well due to the failure of its assumption that most network connections are available. In this paper, we propose a hop count based heuristic routing protocol by utilizing the information carried by the peripatetic packets in the network. A heuristic function is defined to help in making the routing decision. We formally define a custom operation for square matrices so as to transform the heuristic value calculation into matrix manipulation. Finally, the performance of our proposed algorithm is evaluated by the simulation results, which show the advantage of such self-adaptive routing protocol in the diverse circumstance of DTNs.

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.

Sign in / Sign up

Export Citation Format

Share Document