Skip Navigation

Scholars Day 2005, Wednesday, April 13

A New Proactive Routing Algorithm for Wireless Mobile Ad Hoc Networks

Mobile Ad Hoc Networks (MANET) comprise of freely roaming wireless nodes that can communicate in an infrastructureless environment to provide an extremely flexible and rapidly deployable ad-hoc network for establishing communications. Since nodes move in an arbitrary manner a key issue in MANET is that of efficient routing. Today the most popular routing protocol is the Ad hoc On-Demand Distance Vector routing (AODV). AODV routing is reactive in nature, i.e. routes are computed only when needed, for example after a link is broken. However, due to the high mobility of nodes (and hence large link breakages) reactive routing can be highly inefficient for real-time traffic requiring lomg delays. In this paper we propose a new proactive routing algorithm for MANET that uses location management techniques to predict node movements and link breakages before they occur and reroute the traffic onto a new pre-computed path before the current path breaks thus reducing data loss and delay. We simulate our algorithm using GloMoSim, a discrete event simulator for wireless networks and compare it with the traditional AODV protocol in terms of network throughput, node mobility, node density and control overhead. Our simulations results and analysis shows that with increased mobility our proactive scheme can outperform AODV by increasing network throughput and decreasing traffic delay.

Presenter: Srinivas Krishnan (Undergraduate Student)
Topic: Computer Science
Location: 104 Edwards
Time: 2:50 pm (Session IV)