Selective route discovery routing algorithm for mobile ad-hoc networks

Tae Eun Kim, Won Tae Kim, Yong Jin Park

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

In mobile ad-hoc networks the real traffic of a node is commonly concentrated in a small number of particular nodes. This characteristic has not been considered in the design of the existing routing algorithms. Therefore, it is difficult to guarantee performance in a simulation environment with realistic accuracy. To resolve this problem we propose a new routing algorithm called the Selective Route Discovery (SRD) algorithm. In this algorithm, each node selects frequently accessed nodes and periodically sends additional RREQ messages. Therefore, it can quickly adapt to the changes in network topology according to the movement of the nodes. This paper shows that the SRD algorithm has a shorter packet delivery time than the AODV algorithm when the simulation condition is improved so that the traffic concentration for each destination node varies.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science
EditorsC. Kim
Pages152-159
Number of pages8
Volume3391
Publication statusPublished - 2005
Externally publishedYes
EventInternational Conference on Information Networking, ICOIN 2005 - Jeju Island, Korea, Republic of
Duration: 2005 Jan 312005 Feb 2

Other

OtherInternational Conference on Information Networking, ICOIN 2005
CountryKorea, Republic of
CityJeju Island
Period05/1/3105/2/2

    Fingerprint

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

Kim, T. E., Kim, W. T., & Park, Y. J. (2005). Selective route discovery routing algorithm for mobile ad-hoc networks. In C. Kim (Ed.), Lecture Notes in Computer Science (Vol. 3391, pp. 152-159)