Varying Overhead Ad Hoc on Demand Vector Routing in Highly Mobile Ad Hoc Network

Balaji Balaji

doi:10.3844/jcssp.2011.678.682

Abstract

Problem statement: An inherent feature of mobile ad hoc networks is the frequent change of network topology leading to stability and reliability problems of the network. Highly dynamic and dense network have to maintain acceptable level of service to data packets and limit the network control overheads. This capability is closely related as how quickly the network protocol control overhead is managed as a function of increased link changes. Dynamically limiting the routing control overheads based on the network topology improves the throughput of the network. Approach: In this study we propose Varying Overhead - Ad hoc on Demand Vector routing protocol (VO-AODV) for highly dynamic mobile Ad hoc network. The VO-AODV routing protocol proposed dynamically modifies the active route time based on the network topology. Results and Conclusion: Simulation results prove that the proposed model decreases the control overheads without decreasing the QOS of the network.

Highlights

A Mobile Ad Hoc Network (MANET) is a group of wireless mobile nodes dynamically forming a network for data transfer without any pre existing infrastructure or centralized administration
As routing plays an important role for the reliability of an Ad hoc network many routing methodologies have been proposed and these protocols can be broadly classified into proactive and reactive routing protocols
In this study we investigate the performance of a highly mobile network using Adhoc On Demand Distance Vector (AODV) routing protocol under different active route timeout and propose an enhanced routing algorithm Varying Overhead Adhoc On Demand Distance Vector (VO-Ad Hoc on Demand Distance Vector (AODV)) routing protocol

Summary

Introduction

A Mobile Ad Hoc Network (MANET) is a group of wireless mobile nodes dynamically forming a network for data transfer without any pre existing infrastructure or centralized administration. Proactive routing protocols discover routes for every pair of nodes by continuously updating the routing tables at fixed time intervals irrespective of data traffic between source and destination. Though the network control packet overheads are reduced in reactive routing protocol, the end to end delay increases due to the route discovery process (Alandzi and Quintero, 2007).

Results

Conclusion