Optimised relay selection for route discovery in reactive routing

DSpace/Manakin Repository

Search OPUS


Advanced Search

Browse

My Account

Show simple item record

dc.contributor.author Alaamri, H
dc.contributor.author Abolhasan, M
dc.contributor.author Franklin, D
dc.contributor.author Lipman, J
dc.date.accessioned 2013-08-11T18:10:24Z
dc.date.issued 2013-01
dc.identifier.citation Ad Hoc Networks, 2013, 11 (1), pp. 70 - 88
dc.identifier.issn 1570-8705
dc.identifier.other C1 en_US
dc.identifier.uri http://hdl.handle.net/10453/23434
dc.description.abstract On-demand routing protocols have the potential to provide scalable information delivery in large ad hoc networks. The novelty of these protocols is in their approach to route discovery, where a route is determined only when it is required by initiating a route discovery procedure. Much of the research in this area has focused on reducing the route discovery overhead when prior knowledge of the destination is available at the source or by routing through stable links. Hence, many of the protocols proposed to date still resort to flooding the network when prior knowledge about the destination is un-available. This paper proposes a novel routing protocol for ad hoc networks, called On-demand Tree-based Routing Protocol (OTRP). This protocol combines the idea of hop-by-hop routing (as used by AODV) with an efficient route discovery algorithm called Tree-based Optimised Flooding (TOF) to improve scalability of ad hoc networks when there is no prior knowledge about the destination. To achieve this in OTRP, route discovery overheads are minimised by selectively flooding the network through a limited set of nodes, referred to as branching nodes. The key factors governing the performance of OTRP are theoretically analysed and evaluated, including the number of branch nodes, location of branching nodes and number of Route REQuest (RREQ) retries. It was found that the performance of OTRP (evaluated using a variety of well-known metrics) improves as the number of branching nodes increases and the number of consumed RREQ retries is reduced. Additionally, theoretical analysis and simulation results shows that OTRP outperforms AODV, DYMO, and OLSR with reduced overheads as the number of nodes and traffic load increases. © 2012 Elsevier B.V. All rights reserved.
dc.language eng
dc.relation.isbasedon 10.1016/j.adhoc.2012.04.008
dc.title Optimised relay selection for route discovery in reactive routing
dc.type Journal Article
dc.parent Ad Hoc Networks
dc.journal.volume 1
dc.journal.volume 11
dc.journal.number 1 en_US
dc.publocation Netherlands en_US
dc.identifier.startpage 70 en_US
dc.identifier.endpage 88 en_US
dc.cauo.name FEIT.School of Computing and Communications en_US
dc.conference Verified OK en_US
dc.for 100510 Wireless Communications
dc.personcode 108935
dc.personcode 112263
dc.percentage 100 en_US
dc.classification.name Wireless Communications en_US
dc.classification.type FOR-08 en_US
dc.edition en_US
dc.custom en_US
dc.date.activity en_US
dc.location.activity en_US
dc.description.keywords Ad hoc network
dc.description.keywords Flooding
dc.description.keywords MANET
dc.description.keywords Route discovery
dc.description.keywords Routing protocols
dc.description.keywords Scalable routing
pubs.embargo.period Not known
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 Computing and Communications
pubs.organisational-group /University of Technology Sydney/Strength - Realtime Information Networks
utslib.copyright.status Closed Access
utslib.copyright.date 2015-04-15 12:17:09.805752+10
pubs.consider-herdc true
utslib.collection.history Closed (ID: 3)


Files in this item

This item appears in the following Collection(s)

Show simple item record