Exploring the Features of Accessibility Prediction in AODV

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 [1], we suggested an Accessibility Prediction scheme for AODV nodes which reduces the Normalized routing and MAC over head up to 50 % with almost 100 % packet delivery ratio.

In our further analysis, we identified a few characteristics like growth of routing tables, DELETE_PERIOD value, and learning from repeated RREQs which can affect the performance of this scheme. We have intentions to explore/analyze all these characteristics to further enhance our accessibility prediction scheme.

Project: The basic task of the student working on this project is to understand the Accessibility Prediction scheme in depth so that he/she has adequate knowledge about all the features and characteristics of this scheme. Then, he/she has to perform simulations and analyze the behavior of at least following features:

• Growths of Routing Tables as in our Accessibility Prediction scheme, no entries are deleted.
• Whether it would be beneficial to increase the value of DELETE_PERIOD rather then permanently keeping routing entries and if it is then what would be the suitable value.
• How repeated RREQs can be used to learn mobility of neighboring nodes
• Putting some timer that how long entries will remain in Inaccessible state
• Associate some numerical measure to the relative mobility information so that accessibility/mobility learning can be made more realistic.

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 or OPNET simulator
• Good C/C++ programming skills

References

• [1] Habib-ur Rehman and Lars Wolf, “Performance Enhancement in AODV with Accessibility Prediction”, 3rd International Workshop on Localized Communication and Topology Protocols for Ad hoc Networks (to appear)
• [2] Ad hoc On-Demand Distance Vector (AODV) Routing, INTERNET DRAFT 19 October, 2003, Charles E. Perkins, Elizabeth M. Belding-Royer, Ian D. Chakeres
• [3] Ad hoc On-Demand Distance Vector (AODV) Routing, RFC 3561, Charles E. Perkins, Elizabeth M. Belding-Royer, Samir R. Das
• [4] AODV-UU @ Uppsala University
• [5] The CMU Monarch Project, The CMU monarch extensions to the NS simulator