Neighbour-disjoint multipath for low-power and lossy networks

The submission of new items to CORA is currently unavailable due to a repository upgrade. For further information, please contact Thank you for your understanding.

Show simple item record Hossein, A. K. M. Mahtab Sreenan, Cormac J. De Paz Alberola, Rodolfo 2018-04-27T14:05:37Z 2018-04-27T14:05:37Z 2016-08
dc.identifier.citation Hossain, A. K. M. M., Sreenan, C. J. and Alberola, R. D. P. (2016) 'Neighbour-Disjoint Multipath for Low-Power and Lossy Networks', ACM Transactions on Sensor Networks , 12(3), 23 (25pp). doi: 10.1145/2914792 en
dc.identifier.volume 12 en
dc.identifier.issued 3 en
dc.identifier.startpage 23-1 en
dc.identifier.endpage 23-25 en
dc.identifier.issn 1550-4859
dc.identifier.issn 1550-4867
dc.identifier.doi 10.1145/2914792
dc.description.abstract In this article, we describe a neighbour disjoint multipath (NDM) scheme that is shown to be more resilient amidst node or link failures compared to the two well-known node disjoint and edge disjoint multipath techniques. A centralised NDM was first conceptualised in our initial published work utilising the spatial diversity among multiple paths to ensure robustness against localised poor channel quality or node failures. Here, we further introduce a distributed version of our NDM algorithm adapting to the low-power and lossy network (LLN) characteristics. We implement our distributed NDM algorithm in Contiki OS on top of LOADng—a lightweight On-demand Ad hoc Distance Vector Routing protocol. We compare this implementation's performance with a standard IPv6 Routing Protocol for Low power and Lossy Networks (RPL), and also with basic LOADng, running in the Cooja simulator. Standard performance metrics such as packet delivery ratio, end-to-end latency, overhead and average routing table size are identified for the comparison. The results and observations are provided considering a few different application traffic patterns, which serve to quantify the improvements in robustness arising from NDM. The results are confirmed by experiments using a public sensor network testbed with over 100 nodes. en
dc.format.mimetype application/pdf en
dc.language.iso en en
dc.publisher Association for Computing Machinery (ACM) en
dc.rights © ACM, 2016. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ACM Transactions on Sensor Networks (TOSN), Volume 12 Issue 3, August 2016 en
dc.subject Networks en
dc.subject Network algorithms en
dc.subject Routing protocols en
dc.subject Computer systems organization en
dc.subject Sensor networks en
dc.subject Redundancy en
dc.subject Neighbour disjoint multipath (NDM) en
dc.subject Wireless sensor networks en
dc.subject Node-disjoint multipath en
dc.subject Edge-disjoint multipath en
dc.subject LOADng en
dc.subject RPL en
dc.title Neighbour-disjoint multipath for low-power and lossy 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: en
dc.internal.availability Full text available en 2018-04-27T13:54:03Z
dc.description.version Accepted Version en
dc.internal.rssid 411920610
dc.contributor.funder Irish Research Council en
dc.contributor.funder United Technologies Research Center Ireland Ltd. en
dc.description.status Peer reviewed en
dc.identifier.journaltitle Acm Transactions On Sensor Networks en
dc.internal.copyrightchecked No !!CORA!! en
dc.internal.licenseacceptance Yes en
dc.internal.IRISemailaddress en

Files in this item

This item appears in the following Collection(s)

Show simple item record

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