@article{oai:kumadai.repo.nii.ac.jp:00021569,
 author = {北須賀, 輝明 and 中西, 恒夫 and 福田, 晃 and Furusho, Shinichi and フルショウ, シンイチ and Kitasuka, Teruaki and 中西, 恒夫 and Nakanishi, Tsuneo and 福田, 晃 and Fukuda, Akira},
 issue = {7},
 journal = {IEICE TRANSACTIONS on Communications},
 month = {Jul},
 note = {application/pdf, 論文(Article), 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., http://search.ieice.org/bin/summary.php?id=e87-b_7_1926&category=B&year=2004&lang=E&abst=&auth=1},
 pages = {1926--1930},
 title = {Node Mobility Aware Routing for Mobile Ad Hoc Network},
 volume = {E87-B},
 year = {2004},
 yomi = {ナカニシ, ツネオ and フクダ, アキラ}
}