On optimising route discovery in absence of previous route information in MANETs

Huda AlAamri; Mehran Abolhasan; Tadeusz Wysocki

doi:10.1109/VETECS.2009.5073722

On optimising route discovery in absence of previous route information in MANETs

Huda AlAamri, Mehran Abolhasan, Tadeusz Wysocki

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

14 Citations (Scopus)

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	https://doi.org/10.1109/VETECS.2009.5073722
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

AlAamri, H., Abolhasan, M., & Wysocki, T. (2009). On optimising route discovery in absence of previous route information in MANETs. In VTC Spring 2009 - IEEE 69th Vehicular Technology Conference [5073722] https://doi.org/10.1109/VETECS.2009.5073722

@inproceedings{360d26c791fa47a1afc773bf5b8b6f08,

title = "On optimising route discovery in absence of previous route information in MANETs",

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.",

author = "Huda AlAamri and Mehran Abolhasan and Tadeusz Wysocki",

year = "2009",

doi = "10.1109/VETECS.2009.5073722",

language = "English",

isbn = "9781424425174",

booktitle = "VTC Spring 2009 - IEEE 69th Vehicular Technology Conference",

note = "VTC Spring 2009 - IEEE 69th Vehicular Technology Conference ; Conference date: 26-04-2009 Through 29-04-2009",

}

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

AN - SCOPUS:70349656615

SN - 9781424425174

BT - VTC Spring 2009 - IEEE 69th Vehicular Technology Conference

T2 - VTC Spring 2009 - IEEE 69th Vehicular Technology Conference

Y2 - 26 April 2009 through 29 April 2009

ER -

Access to Document

10.1109/VETECS.2009.5073722