Skip to main content
Journal ArticleOPEN ACCESS

Performance evaluation of two congestion control mechanisms with on-demand distance vector (AODV) routing protocol for mobile and wireless networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 2790 1099-1108
DOI: 10.1007/978-3-540-45209-6_148
2Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper, we focus upon the congestion control problem in on-demand distance vector routing (AODV) protocol for mobile and wireless ad hoc networks. We propose to study two mechanisms to deal with the congestion problem within AODV routing protocol. First, we investigate a randomized approach of AODV protocol, then we present a preemptive ad hoc on-demand distance vector routing protocol for mobile ad hoc networks. We discuss the implementation of both algorithms, and report on the performance results of simulation of several scenarios using the ns-2 ad hoc network simulator. © Springer-Verlag 2003.

Cite

CITATION STYLE

APA

Boukerche, A. (2004). Performance evaluation of two congestion control mechanisms with on-demand distance vector (AODV) routing protocol for mobile and wireless networks. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2790, 1099–1108. https://doi.org/10.1007/978-3-540-45209-6_148

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free