Evaluation of available bandwidth as a routing metric for delay-sensitive IEEE 802.15.4-based ad-hoc networks

Show simple item record

dc.contributor.author Farooq, Muhammad O.
dc.contributor.author Kunz, Thomas
dc.contributor.author Sreenan, Cormac J.
dc.contributor.author Brown, Kenneth N.
dc.date.accessioned 2017-11-21T12:33:07Z
dc.date.available 2017-11-21T12:33:07Z
dc.date.issued 2015-10-30
dc.identifier.citation Farooq, M. O., Kunz, T., Sreenan, C. J. and Brown, K. N. (2016) 'Evaluation of available bandwidth as a routing metric for delay-sensitive IEEE 802.15.4-based ad-hoc networks', Ad Hoc Networks, 37(Part 2), pp. 526-542. doi: 10.1016/j.adhoc.2015.10.005 en
dc.identifier.volume 37 en
dc.identifier.startpage 526 en
dc.identifier.endpage 542 en
dc.identifier.issn 1570-8705
dc.identifier.uri http://hdl.handle.net/10468/5080
dc.identifier.doi 10.1016/j.adhoc.2015.10.005
dc.description.abstract In this paper, we evaluate available bandwidth as a routing metric for IEEE 802.15.4-based ad-hoc networks. The available bandwidth on a data forwarding path is an approximation of the forwarding path’s residual data relaying capacity. High available bandwidth on a data forwarding path implies low data traffic load on the path, therefore data flows may experience low delay and high packet delivery ratio (PDR). Our aim is to evaluate available bandwidth as a routing metric. We present different available-bandwidth-based routing protocols for IEEE 802.15.40-based networks, namely: end-to-end available-bandwidth-based routing protocol (ABR), available bandwidth and contention-aware routing protocol (ABCR), and shortest hop-count and available-bandwidth-based opportunistic routing protocol (ABOR). Moreover, we also present variants of ABR and ABCR capable of distributing a flow’s data packets on multiple paths by maintaining the top K downstream nodes (the downstream nodes that advertised best data forwarding paths towards a sink node) corresponding to each sink node in a routing table. We focus on both single-sink and multi-sink networks. We performed extensive simulations, and the simulation results demonstrate that the available bandwidth routing metric shows better results when combined with a routing metric that helps to limit a data forwarding path’s length, i.e., shortest hop-count or intra-flow contention count. For multi-path data forwarding towards the same sink node, and at high traffic volumes, the available bandwidth metric demonstrates best performance when combined with the shortest hop-count routing metric. en
dc.description.sponsorship Science Foundation Ireland ((10/CE/I1853) as part of CTVR, the telecommunications research centre) en
dc.format.mimetype application/pdf en
dc.language.iso en en
dc.publisher Elsevier en
dc.relation.uri http://www.sciencedirect.com/science/article/pii/S1570870515002358
dc.rights © 2015 Elsevier B.V. This manuscript version is made available under the CC BY-NC-ND 4.0 license.5 en
dc.rights.uri http://creativecommons.org/licenses/by-nc-nd/4.0/ en
dc.subject IEEE 802.15.4 en
dc.subject Available-bandwidth-based routing en
dc.subject Ad-hoc networks en
dc.subject Un-slotted CSMA-CA en
dc.subject Wireless sensor networks en
dc.title Evaluation of available bandwidth as a routing metric for delay-sensitive IEEE 802.15.4-based ad-hoc networks en
dc.type Article (peer-reviewed) en
dc.internal.authorcontactother Cormac Sreenan, Computer Science, University College Cork, Cork, Ireland. +353-21-490-3000 Email: c.sreenan@cs.ucc.ie en
dc.internal.availability Full text available en
dc.date.updated 2017-11-16T14:44:08Z
dc.description.version Accepted Version en
dc.internal.rssid 348787379
dc.internal.wokid WOS:000366775100027
dc.contributor.funder Science Foundation Ireland en
dc.description.status Peer reviewed en
dc.identifier.journaltitle Ad Hoc Networks en
dc.internal.copyrightchecked No !!CORA!! en
dc.internal.licenseacceptance Yes en
dc.internal.IRISemailaddress c.sreenan@cs.ucc.ie en


Files in this item

This item appears in the following Collection(s)

Show simple item record

© 2015 Elsevier B.V. This manuscript version is made available under the CC BY-NC-ND 4.0 license.5 Except where otherwise noted, this item's license is described as © 2015 Elsevier B.V. This manuscript version is made available under the CC BY-NC-ND 4.0 license.5
This website uses cookies. By using this website, you consent to the use of cookies in accordance with the UCC Privacy and Cookies Statement. For more information about cookies and how you can disable them, visit our Privacy and Cookies statement