fulltext_2 - A Modied AODV Protocol with Multi-paths...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
A Modifed AODV Protocol with Multi-paths Considering Classes oF Services ? Min-Su Kim 1 , Ki Jin Kwon 1 , Min Young Chung 1 , Tae-Jin Lee 1 , and Jaehyung Park 2 1 School of Information and Communication Engineering, Sungkyunkwan University, 300, Chunchun-dong, Jangan-gu, Suwon, Kyunggi-do, 440-746, Korea { msu1119,kjkwon,mychung,tjlee } @ece.skku.ac.kr 2 Dept. of Electronics, Computer, & Information Eng., Chonnam National University, 300 Yongbong-dong, Puk-ku, Kwangju, 500-757, Korea [email protected] Abstract. In ad-hoc environments, a set of mobile nodes may construct a network to communicate with one another. Due to the movement of mobile nodes, the topology of ad-hoc networks can vary frequently as time goes by. This may result in the disruption of existing routes, and data being transferred through the disrupted routes may be lost un- til new routes are established. Considering the situations, we propose a routing protocol providing multiple paths in order to reduce lost packets due to the disconnection of existing routes. In our protocol, the num- ber of multiple routes between a source node and a destination node is determined according to service classes. We evaluate the performance of the proposed protocol and compare with that of the AODV protocol via simulations. The results show that the proposed protocol can reduce the packet loss ratio and the volume of routing messages compared with the conventional AODV. 1 Introduction An ad-hoc network is a collection of wireless mobile nodes communicating each other without help of any established infrastructure. In ad-hoc mobile networks, topologies are dynamically changing as mobile terminals move around from place to place, and routes consist of multihops because the radio propagation range is limited. In this context, one of the main issues in ad-hoc networks is routing to eFectively ±nd routes between communicating mobile terminals. Many works have been done on ad-hoc routing protocols and several routing protocols have been proposed such as Destination Sequenced Distance Vector Routing (DSDV) [1],[3], Dynamic Source Routing (DSR) [1],[2], Temporally Ordered Routing Al- gorithm (TORA) [1],[2], Ad-Hoc On-demand Distance Vector Routing (AODV) [1],[2],[4],[5], and so on. Among them, AODV provides both minimal control ? This research was supported by University IT Research Center Project. Dr. Chung is the corresponding author. A. Lagan`a et al. (Eds.): ICCSA 2004, LNCS 3043, pp. 1159–1168, 2004. c ± Springer-Verlag Berlin Heidelberg 2004
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
1160 M.-S. Kim et al. overhead and minimal route setup latency for discovering a route between a source and a destination node. The conventional AODV is a hybrid algorithm combining DSR with DSDV. In AODV, route search and maintenance mechanism is taken from DSR and hop-by-hop routing, sequence number, and periodical packet renewal are taken from DSDV. Since every mobile terminals have information on their neighbors, the size of memory to store routing information in AODV is smaller than that in both DSR and DSDV [1],[3],[5]. However, whenever a route between two mobile
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 05/12/2011 for the course COMP it-441 taught by Professor Mohitdua during the Spring '11 term at National Institute of Technology, Calicut.

Page1 / 10

fulltext_2 - A Modied AODV Protocol with Multi-paths...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online