Exchange routing information between new neighbor nodes to improve AODV performance

Le, Anhtuan and Luo, Yuan Roger ORCID logoORCID: https://orcid.org/0000-0002-9812-5543 (2009) Exchange routing information between new neighbor nodes to improve AODV performance. In: 6th international conference on Information Technology: New Generations, 2009. Proceedings. IEEE Computer Society, pp. 1661-1662. ISBN 9781424437702. [Book Section] (doi:10.1109/ITNG.2009.68)

[img]
Preview
PDF - UNSPECIFIED
Download (239kB) | Preview

Abstract

In Ad hoc On-Demand Distance Vector (AODV) protocol, once an on-demand link is established, it only maintains that link and does not care about any other paths. AODV may not use some more optimal or reserved paths which occur later but may improve its current transfer. We modify AODV that each node uses routing information provided by the new neighbour nodes to find out and update to better paths and create accumulated routes for later use. Our modeling results in NS2 show that the approach can create more optimal routes and significantly improve the performance with high mobility and traffic level network in term of delay and packet delivery ratio.

Item Type: Book Section
Additional Information: Sixth International Conference on Information Technology: New Generations, 2009. ITNG '09.
Date of Conference: 27-29 April 2009.
Conference Location : Las Vegas, NV.
Research Areas: A. > School of Science and Technology > Computer and Communications Engineering
Item ID: 11122
Useful Links:
Depositing User: Yuan Roger Luo
Date Deposited: 04 Jul 2013 08:24
Last Modified: 07 Jun 2022 05:43
URI: https://eprints.mdx.ac.uk/id/eprint/11122

Actions (login required)

View Item View Item

Statistics

Activity Overview
6 month trend
242Downloads
6 month trend
388Hits

Additional statistics are available via IRStats2.