Skip Navigation

Scholars Day 2006, Wednesday, April 12

Optimization of Routing Algorithms in 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. Network nodes usually have limited resources since these are typically portable and thus powered by limited capacity batteries. Each node plays an important part in the network, which may be that of being the source and/or destination of a communication or being a bypass node that relays data for the communication of other source/destination pairs. Failure or loss of power of a few nodes may result in the loss of operation of the network. Thus intelligent routing and selection of paths is of utmost importance. This research addresses two goals; first, we carry out a systematic performance comparison and study of AODV and DSR, the most popular wireless ad hoc routing protocols nowadays, and extract the relative merits of the two. Secondly, we follow two separate strategies to optimize performance of AODV and DSR, namely proactive and multipath routing. We base our analysis on extensive simulations using GloMoSim, a discrete event simulator for wireless networks. We implement our proactive and multipath versions of AODV and DSR and compare them with the traditional reactive and single-path AODV and DSR protocols in terms of network throughput, node mobility, node density and control overhead.

Presenter: Momchil Kyurkchiev (Undergraduate Student)
Topic: Computer Science
Location: 107 Holmes
Time: 9:30 am (Session I)