抄録
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 |
外部発表 | はい |
イベント | International Conference on Information Networking, ICOIN 2005 - Jeju Island, Korea, Republic of 継続期間: 2005 1 31 → 2005 2 2 |
Other
Other | International Conference on Information Networking, ICOIN 2005 |
---|---|
Country | Korea, Republic of |
City | Jeju Island |
Period | 05/1/31 → 05/2/2 |
ASJC Scopus subject areas
- Computer Science (miscellaneous)