scholarly journals Soft Computing approach to enhance the Performance of AODV (Ad-hoc On-Demand Distance Vector) Routing Protocol using Active Route TimeOut (ART) Parameter in MANETs

2021 ◽  
Vol 12 (2) ◽  
pp. 3060-3068
Author(s):  
Bonu Satish Kumar , Et. al.
Keyword(s):  
Routing Protocol ◽  
Ad Hoc ◽  
Task Force ◽  
Hop Count ◽  
Control Packet ◽  
Examination Protocol ◽  
Distance Vector ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
Computing Approach

While its advancement inside MANETs, the AODV routing protocol convention has been and stays a powerful and gainful examination protocol, with association with its course Active Route Timeout (ART), AODV utilizes a predictable worth that demonstrates the time and the course which may stay dynamic in the directing table. A long period of the course might be chosen powerfully, dependably through the estimation, as opposed to reliable worth. For this reason, a Fuzzy rationale framework is utilized to procure the versatile qualities for ART dependent on the transmitter conditions and interceding hubs.As indicated by the pre-essentials of the International Engineering Task Force (IETF), we shouldn't be taking stil qualities in the powerful atmosphere. Subsequently, ART's tweaking of turncoat esteems is accomplished by applies fluffy principles on the info factors hop-count, Sent Control Packet, and Nodes Number. AODV convention yield is assessed after the utilization of Fuzzy based methodology. The proficiency of AODV and FBARTAODV Routing Protocols for Mobile Ad Hoc Networks will be examined with results. In this paper we give outcome show so as to the FBARTAODV perform enhanced compared to the in progress AODV.

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 Performance Evaluation of GPSR and AODV Routing Protocols in MANETS

2019 ◽  
Vol 9 (2S) ◽  
pp. 459-461
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Ad Hoc ◽  
On Demand ◽  
Protocol Performance ◽  
Military Applications ◽  
Wireless Medium ◽  
Distance Vector ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Mobile ad hoc networks (MANETs) are collection of nodes connected through wireless medium and do not require infrastructure for operation. Network Topology keeps on changing because mobility of nodes are high. Therefore, it is important for MANETs to provide excellent routing and security features. Since MANETs do not require any pre-existing infrastructure, they are extensively used in emergency and rescue and military applications. MANETs thus will form essentially an important part in wireless networks. In this paper, Ad hoc On-Demand Distance Vector (AODV) and Greedy Perimeter Stateless Routing (GPSR) routing protocol performance is compared with respect to Throughput and E2ED and observed that there is an improvement in throughput by 11% in case of GPSR. Simulation is performed using NS3.

scholarly journals New algorithm for packet routing in mobile ad-hoc networks

2010 ◽  
Vol 20 (1) ◽  
pp. 9-16 ◽  
Author(s):  
Nenad Kojic ◽  
Marija Zajeganovic-Ivancic ◽  
Irini Reljin ◽  
Branimir Reljin
Keyword(s):  
Wireless Networks ◽  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Routing Protocol ◽  
Ad Hoc ◽  
Mesh Network ◽  
Ad Hoc Routing ◽  
Hop Count ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Mobile ad-hoc networks (MANET) are one of wireless networks implementation. MANET is very popular technology initially based on military purposes. Specific modifications of MANET created a possibility to implement several new wireless networks. One of them is a wireless mesh network (WMN). Over the last ten years, WMNs have gained more and more attention and are now considered as a convincing solution for providing better Internet access services for end users. WMN is an emerging technology that offers a cost-effective and scalable method to connect wireless devices. The main problem in WMNs is a routing protocol, especially because it has to enable the access to network for both mesh and conventional clients. Most of the existing ad hoc routing protocols use minimum hop-count as a metric for identifying the best packet routes. This paper presents neural network based approach to routing protocol for WMN. Neural networks are capable to analyze very complex network environments and solve routing problems on optimal (or almost optimal) way.

Sign in / Sign up

Export Citation Format

Share Document