Main Article Content

Authors

Anurag Misra

Abstract

Mobile Ad hoc Networks are typicallycharacterized by high mobility and frequent link failures. As a result, routingalgorithms selecting a single path during route creation have to make frequentroute discoveries resulting in decreased throughput and high end to end delay.Multipath routing approaches like AOMDV make use of pre-computed routesdetermined during route discovery. This solution, however, suffers during highmobility because the alternate paths are not actively maintained. Hence,precisely when needed, the routes are often broken. In this paper, theinformation gathered by a node about its neighbor, in addition to thoseproposed in , is used to dynamically determine the node to which a particulardata packet has to be forwarded. Using this approach a better load balancingcan be obtained in addition to utilization of the additional routes, iffeasible, and in the process maintaining these routes. We also explore thepossibility of implementing QoS using such a scheme. A Mobile Ad-Hoc Network(MANET) is a collection of wireless mobile nodes forming a temporary network withoutusing centralized access points, infrastructure, or centralized administration.Routing means the act of moving information across an internet work from asource to a destination. The biggest challenge in this kind of networks is tofind a path between the communication end points, what is aggravated throughthe node mobility. In this paper we present a new routing algorithm for mobile,multi-hop ad-hoc networks.

Downloads

Download data is not yet available.

Article Details

Section

Articles