Selective route discovery routing algorithm for mobile ad-hoc networks

Tae Eun Kim*, Won Tae Kim, Yong Jin Park


研究成果: Conference contribution

1 被引用数 (Scopus)


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.

ホスト出版物のタイトルLecture Notes in Computer Science
編集者C. Kim
出版ステータスPublished - 2005
イベントInternational Conference on Information Networking, ICOIN 2005 - Jeju Island, Korea, Republic of
継続期間: 2005 1月 312005 2月 2


OtherInternational Conference on Information Networking, ICOIN 2005
国/地域Korea, Republic of
CityJeju Island

ASJC Scopus subject areas

  • コンピュータ サイエンス(その他)


「Selective route discovery routing algorithm for mobile ad-hoc networks」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。