| Carl Friedrich Gauß Faculty | Department of Computer Science

Routing Table Sharing in AODV nodes with Mobility Prediction

Student(anonymous, Login required)
SupervisorDr. Habib-ur-Rehman
ProfessorProf. Dr.-Ing. Lars Wolf
IBR GroupCM (Prof. Wolf)

Overview: AODV (Ad-hoc On-demand Distance Vector routing) is a popular on demand routing protocol having recognition by IETF (RFC 3561). Reducing routing traffic is a key issue in AODV just as in other routing protocols for Ad-hoc Networks.

In our previous work, we suggested a technique for sharing routing table entries among the nodes to reduce the routing over head and make it more effective. However, this scheme was unable to achieve the expected results due to its high vulnerability to mobility.

We also suggested a Mobility Prediction scheme for AODV nodes which reduces the Normalized routing and MAC over head up to 50 % with almost 100 % packet delivery ratio.

We have intentions to integrate the above mentioned schemes to analyze their combine effectiveness.

Project: The basic task of the student working on this project is to understand the above discussed schemes and then implement them in integrated form. Mainly, he will be coding for the two schemes, performing simulations and analyzing the simulation results. The task which we are offering in this project is as under:

“Student will be provided with the detailed theoretical design/structure of the Routing Table Sharing scheme and Mobility Prediction scheme. He has to code these two into AODV module for NS-2 in an integrated form. Later, he will perform simulations using this updated module to evaluate the different performance characteristics of the scheme.”

We are using the AODV module designed by Uppsala University (AODV-UU).

Requirements: To accomplish this task, the student should have:

  • Good knowledge of AODV
  • Understanding of the NS-2 simulator
  • Good C/C++ programming skills


last changed 2006-07-07, 11:29 by Dr. Habib-ur-Rehman