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

AlAamri, H; Abolhasan, M; Wysocki, T

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

AlAamri, H Abolhasan, M

Wysocki, T

Permalink

Publication Type:: Conference Proceeding
Citation:: IEEE Vehicular Technology Conference, 2009
Issue Date:: 2009-10-12

Closed Access

	Filename	Description	Size
	2009006335OK.pdf		188.11 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	AlAamri, H	en_US
dc.contributor.author	Abolhasan, M https://orcid.org/0000-0002-4282-6666	en_US
dc.contributor.author	Wysocki, T	en_US
dc.date.issued	2009-10-12	en_US
dc.identifier.citation	IEEE Vehicular Technology Conference, 2009	en_US
dc.identifier.isbn	9781424425174	en_US
dc.identifier.issn	1550-2252	en_US
dc.identifier.uri	http://hdl.handle.net/10453/16447
dc.description.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. © 2009 IEEE.	en_US
dc.relation.ispartof	IEEE Vehicular Technology Conference	en_US
dc.relation.isbasedon	10.1109/VETECS.2009.5073722	en_US
dc.title	On optimising route discovery in absence of previous route information in MANETs	en_US
dc.type	Conference Proceeding
utslib.for	0902 Automotive Engineering	en_US
dc.location.activity	Barcelona, Spain	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
pubs.organisational-group	/University of Technology Sydney/Strength - CRIN - Realtime Information Networks
pubs.organisational-group	/University of Technology Sydney/Strength - GBDTC - Global Big Data Technologies
utslib.copyright.status	closed_access
pubs.publication-status	Published	en_US

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. © 2009 IEEE.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/16447