Abstract
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.
| Original language | English |
|---|---|
| Pages | 334-337 |
| Number of pages | 4 |
| Publication status | Published - Nov 7 2003 |
| Event | 2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003) - Victoria, B.C., Canada Duration: Aug 28 2003 → Aug 30 2003 |
Other
| Other | 2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003) |
|---|---|
| Country | Canada |
| City | Victoria, B.C. |
| Period | 8/28/03 → 8/30/03 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Signal Processing
- Computer Networks and Communications
Cite this
Mobility Based Algorithm for Mobile Ad-hoc Network. / Furusho, Shinichi; Kitasuka, Teruaki; Nakanishi, Tsuneo; Fukuda, Akira.
2003. 334-337 Paper presented at 2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003), Victoria, B.C., Canada.Research output: Contribution to conference › Paper
}
TY - CONF
T1 - Mobility Based Algorithm for Mobile Ad-hoc Network
AU - Furusho, Shinichi
AU - Kitasuka, Teruaki
AU - Nakanishi, Tsuneo
AU - Fukuda, Akira
PY - 2003/11/7
Y1 - 2003/11/7
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0142230561&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0142230561&partnerID=8YFLogxK
M3 - Paper
SP - 334
EP - 337
ER -