Referenced Items are not available for this document.
We present a new routing algorithm called adaptive distance vector (ADV) for mobile, ad hoc networks (MANETs). ADV is a distance vector routing algorithm that exhibits some on-demand characteristics by varying the frequency and the size of the routing updates in response to the network load and mobility conditions. Using simulations we show that ADV outperforms AODV and DSR especially in high mobility cases by giving significantly higher (50% or more) peak throughputs and lower packet delays. Furthermore, ADV uses fewer routing and control overhead packets than that of AODV and DSR, especially at moderate to high loads. Our results indicate the benefits of combining both proactive and on-demand routing techniques in designing suitable routing protocols for MANETs
Published in:
INFOCOM 2001. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE
(Volume:3
)
Date of Conference: 2001
- Page(s):
- 1753 - 1762 vol.3
- Meeting Date :
- 22 Apr 2001-26 Apr 2001
- ISSN :
- 0743-166X
- Print ISBN:
- 0-7803-7016-3
- INSPEC Accession Number:
- 7068484
- Conference Location :
- Anchorage, AK
- Digital Object Identifier :
- 10.1109/INFCOM.2001.916673
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
