Node mobility aware routing for mobile ad hoc network

Shinichi Furusho, Teruaki Kitasuka, Tsuneo Nakanishi, Akira Fukuda

研究成果: ジャーナルへの寄稿記事

1 引用 (Scopus)


In ad-hoc on-demand routing algorithm, when a route is broken a relay node must perform error transaction and the source node must do rerouting to discover an alternate route. It is important to construct a stable route when route discovery occurs. In this paper, we use relative speeds among nodes as a measure of node mobility. Our routing algorithm chooses nodes of lower relative speed as relay nodes. As a result of our simulation, when there is one session in the network, our proposing algorithm can reduce the number of route breaks: about 3 times smaller than DSR. And our proposing algorithm can deliver more packets than DSR: 18% higher rate. However, in the congested traffic situation our algorithm should be improved.

ジャーナルIEICE Transactions on Communications
出版物ステータス出版済み - 7 2004

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

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

  • これを引用

    Furusho, S., Kitasuka, T., Nakanishi, T., & Fukuda, A. (2004). Node mobility aware routing for mobile ad hoc network. IEICE Transactions on Communications, E87-B(7), 1926-1930.