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.

元の言語English
ホスト出版物のタイトルLecture Notes in Computer Science
編集者C. Kim
ページ152-159
ページ数8
3391
出版物ステータスPublished - 2005
外部発表Yes
イベントInternational Conference on Information Networking, ICOIN 2005 - Jeju Island, Korea, Republic of
継続期間: 2005 1 312005 2 2

Other

OtherInternational Conference on Information Networking, ICOIN 2005
Korea, Republic of
Jeju Island
期間05/1/3105/2/2

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

フィンガープリント Selective route discovery routing algorithm for mobile ad-hoc networks' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用

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