Browse > Article
http://dx.doi.org/10.3745/KIPSTC.2006.13C.4.447

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

Sun Chang-Yoon (알앤비소프트웨어)
Kang Seung-Ho (전남대학교 대학원 전산학과)
Lim Hyeong-Seok (전남대학교 전자컴퓨터공학부)
Publication Information
The KIPS Transactions:PartC / v.13C, no.4, 2006 , pp. 447-454 More about this Journal
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.
Keywords
Ad-hoc Network; AODV(Ad-hoc On-demand Distance Vector); ERS(Expanding Ring Search) Algorithm; NTT(Node Travesal Time);
Citations & Related Records
연도 인용수 순위
  • Reference
1 RFC 793-TCP(Transmission Control Protocol), http://www.faqs.org/rfcs/rfc793.html
2 S. Das, C. E. Perkins, and E. M. Royer, 'Performance Comparison of Two On-demand Routing Protocols for Ad Hoc Networks,' In Proc. of INFOCOM-2000, pp.3-12, Mar., 2000   DOI
3 The networks simulator - ns2, http://www.isi.edu/nsnam/ns
4 V. D. Park and M. S. Corson, 'A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks,' IEEE INFOCOM '97 Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies Proceedings IEEE, Vo1.3, pp.1405-1413, Apr., 1997
5 Zone Routing Protocol (ZRP), http://www.tct.hut.fi/opetus/s38030/k02/ Papers/08-Nicklas.pdf
6 김종천, 김영용, 'Ad Hoc 통신망 프로토콜 개발동향', Telecommunication Review 제12권3호, pp.298-311, 2002
7 김현창, 'Ad Hoc 네트워크에서 Timestamp를 이용한 AODV 프로토콜의 최적화', 연세대학교 대학원 전기전자공학과, http://nasla.yonsei.ac.kr/publications/hpmn_papaers/ms/2002/AdHoc 네트워크에서 Timestamp를 이용한 AODV프로토콜의최적화.pdf, 2002
8 K. Carlberg and J. Crowcroft, 'Building Shared Trees Using a One-to-Many Joining Mechanism,' ACM Computer Communication Review, Vol.27, No.1, pp.5-11, 1997   DOI
9 D. Johnson and D. Maltz, 'The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks,' IETF MANET Working Group, Internet Draft, http//www-2.cs.cmu.edu/~dmaltz/intemet-drafts/draft-ietf-manet-dsr-09.txt, 15. Apr., 2003
10 C. E. Perkins and E. M. Royer, 'Ad-hoc On-demand Distance Vector Routing,' Mobile Computing Systems and Applications, Proceedings WMCSA '99. Second IEEE Workshop on, pp.90-100, Feb., 1999   DOI
11 RFC 3561 - Ad hoc On-demand Distance Vector(AODV) Routing, http://www.faqs.org/rfcs/rfc3561.html
12 C. K. Toh, 'Associativity-Based Routing For Ad-Hoc Mobile Networks,' University of Cambridge Computer Laboratory Cambridge CB2 3QG, United Kingdom, Prentice Hall PTR, pp.79-95, Nov., 1999   DOI
13 E. M. Royer and C. K. Toh, 'A Review of Current Routing Protocols for Ad-Hoc Mobile Wireless Networks,' IEEE Personal Communications, pp.46-55, Apr., 1998   DOI   ScienceOn
14 C. K. Toh, 'Ad Hoc Mobile Wireless Networks Protocols and System,' Prentice Hall PTR, pp.13-25, 2002
15 C. E. Perkins and P. Bhagwat, 'Highly Dynamic Destination Sequenced Distance Vector Routing (DSDV) for Mobile Computers,' Computer Communication, pp.234-244, Oct., 1994   DOI
16 S. Murthy and J. J. Garcia-Luna-Aceves, 'An Efficient Routing Protocol for Wireless Networks,' ACM Mobile Networks and Applications Journal, Special issue on Routing in Mobile Communication Networks, pp.183-197, Oct. 1996   DOI