Computing Methods of Node Traversal Time of ERS Algorithm to Reduce the Retransmission Rate in AODV Routing Protocol


The KIPS Transactions:PartC, Vol. 13, No. 4, pp. 447-454, Aug. 2006
10.3745/KIPSTC.2006.13.4.447,   PDF Download:

Abstract

An ad-hoc network routing protocol, AODV(Ad-hoc On-demand Distance Vector) initially uses ERS(Expanding Ring Search) algorithm to control the RREQ(Route Request) retransmission in the route discovery process. Because ERS uses the fixed NTT(Node Travesal Time), it does not reflect accurately ad-hoc network environment. In this paper, we propose an improved ERS algorithm which lowers the retransmission rate. It uses RREP(Route Reply) and gives different weights in NTT of each node in accordance with the adjacency to an originating node. To show the effectiveness of the proposed algorithm, we perform a simulation using ns2. The simulation results showed that the proposed algorithm has better performance than existing algorithms.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
C. Y. Sun, S. H. Kang, H. S. Lim, "Computing Methods of Node Traversal Time of ERS Algorithm to Reduce the Retransmission Rate in AODV Routing Protocol," The KIPS Transactions:PartC, vol. 13, no. 4, pp. 447-454, 2006. DOI: 10.3745/KIPSTC.2006.13.4.447.

[ACM Style]
Chang Yoon Sun, Seung Ho Kang, and Hyeong Seok Lim. 2006. Computing Methods of Node Traversal Time of ERS Algorithm to Reduce the Retransmission Rate in AODV Routing Protocol. The KIPS Transactions:PartC, 13, 4, (2006), 447-454. DOI: 10.3745/KIPSTC.2006.13.4.447.