An agent based routing search methodology for improving qos in manet

8Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

The routing performance of the In Mobile Ad-hoc Networks (MANETs) depends on the individual nodes that represent the network. In this paper, a new protocol based on self-monitoring (agent-based) and following the Ad Hoc on Demand Distance Vector (AODV) Routing Algorithm is presented. This protocol may be called Agent-Based Ad Hoc on Demand Distance Vector Routing Algorithm (AB-AODV) Protocol for MANETs. The main objective of the proposed method is to manage trusted information locally with minimal overhead in terms of extra messages and time delay. This objective is achieved through installing in each participating node in the network a multi-agent system. Multi-agent system consists of two types of agents: monitoring agent and routing agent. A new mathematical and more practical objective model for measuring the trust value is introduced. This model is weighted by both the number and size of routed packets to react to the selective forwarding behavior of a node. The performance evaluation via simulation using NS-3 shows that the proposed protocol is better than standard AODV. The simulation is done under a variety of environmental conditions such as the number of malicious nodes, host density, and movement rates.

Cite

CITATION STYLE

APA

Bairwa, A. K., & Joshi, S. (2020). An agent based routing search methodology for improving qos in manet. Ingeniare, 28(4), 558–564. https://doi.org/10.4067/S0718-33052020000400558

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free