Abstract
This paper present a new routing protocol for Ad hoc networks, called On-demand Tree-based Routing Protocol (OTRP). This protocol combines the idea of hop-by-hop routing such as AODV with an efficient route discovery algorithm called Tree-based Optimized Flooding (TOF) to improve scalability of Ad hoc networks when there is no previous knowledge about the destination. To achieve this in OTRP, route discovery overheads are minimized by selectively flooding the network through a limited set of nodes, referred to as branching-nodes. The theoretical analysis and simulation results showed that OTRP outperforms AODV, DYM0, and OLSR and it reduces overheads as number of nodes and traffic increase.
| Original language | English |
|---|---|
| Title of host publication | VTC Spring 2009 - IEEE 69th Vehicular Technology Conference |
| DOIs | |
| Publication status | Published - 2009 |
| Event | VTC Spring 2009 - IEEE 69th Vehicular Technology Conference - Barcelona, Spain Duration: Apr 26 2009 → Apr 29 2009 |
Other
| Other | VTC Spring 2009 - IEEE 69th Vehicular Technology Conference |
|---|---|
| Country | Spain |
| City | Barcelona |
| Period | 4/26/09 → 4/29/09 |
Fingerprint
ASJC Scopus subject areas
- Computer Science Applications
- Applied Mathematics
- Electrical and Electronic Engineering
Cite this
On optimising route discovery in absence of previous route information in MANETs. / AlAamri, Huda; Abolhasan, Mehran; Wysocki, Tadeusz.
VTC Spring 2009 - IEEE 69th Vehicular Technology Conference. 2009. 5073722.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - On optimising route discovery in absence of previous route information in MANETs
AU - AlAamri, Huda
AU - Abolhasan, Mehran
AU - Wysocki, Tadeusz
PY - 2009
Y1 - 2009
N2 - This paper present a new routing protocol for Ad hoc networks, called On-demand Tree-based Routing Protocol (OTRP). This protocol combines the idea of hop-by-hop routing such as AODV with an efficient route discovery algorithm called Tree-based Optimized Flooding (TOF) to improve scalability of Ad hoc networks when there is no previous knowledge about the destination. To achieve this in OTRP, route discovery overheads are minimized by selectively flooding the network through a limited set of nodes, referred to as branching-nodes. The theoretical analysis and simulation results showed that OTRP outperforms AODV, DYM0, and OLSR and it reduces overheads as number of nodes and traffic increase.
AB - This paper present a new routing protocol for Ad hoc networks, called On-demand Tree-based Routing Protocol (OTRP). This protocol combines the idea of hop-by-hop routing such as AODV with an efficient route discovery algorithm called Tree-based Optimized Flooding (TOF) to improve scalability of Ad hoc networks when there is no previous knowledge about the destination. To achieve this in OTRP, route discovery overheads are minimized by selectively flooding the network through a limited set of nodes, referred to as branching-nodes. The theoretical analysis and simulation results showed that OTRP outperforms AODV, DYM0, and OLSR and it reduces overheads as number of nodes and traffic increase.
UR - http://www.scopus.com/inward/record.url?scp=70349656615&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70349656615&partnerID=8YFLogxK
U2 - 10.1109/VETECS.2009.5073722
DO - 10.1109/VETECS.2009.5073722
M3 - Conference contribution
SN - 9781424425174
BT - VTC Spring 2009 - IEEE 69th Vehicular Technology Conference
ER -