- 【Updated on May 12, 2025】 Integration of CiNii Dissertations and CiNii Books into CiNii Research
- Trial version of CiNii Research Knowledge Graph Search feature is available on CiNii Labs
- 【Updated on June 30, 2025】Suspension and deletion of data provided by Nikkei BP
- Regarding the recording of “Research Data” and “Evidence Data”
Mobility based algorithm for mobile ad-hoc network
Description
In ad-hoc on-demand routing algorithm, when a route is broken a relay node must perform error transaction and the initiator must do rerouting to discover an alternate route. Many packets generated by these processes cause packet congestion and apply load on nodes. Those degrade network performance. It is important to construct a stable route when route discovery. 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, our proposing algorithm can reduce route breaks: 3.1 times smaller than DSR. And our proposing algorithm can deliver more packets than DSR: 18.5% higher rate.
Journal
-
- 2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003) (Cat. No.03CH37490)
-
2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003) (Cat. No.03CH37490) 1 334-337, 2004-06-03
IEEE