Reduced overhead routing in short-range low-power and lossy wireless networks

Show simple item record

dc.contributor.author Farooq, Muhammad Omer
dc.contributor.author Pesch, Dirk
dc.date.accessioned 2019-11-19T10:08:26Z
dc.date.available 2019-11-19T10:08:26Z
dc.date.issued 2019-03-12
dc.identifier.citation Farooq, M.O. and Pesch, D., 2019. Reduced Overhead Routing in Short-Range Low-Power and Lossy Wireless Networks. Sensors, 19(5), (1240). DOI:10.3390/s19051240 en
dc.identifier.volume 19 en
dc.identifier.issued 5 en
dc.identifier.startpage 1 en
dc.identifier.endpage 19 en
dc.identifier.issn 1424-8220
dc.identifier.uri http://hdl.handle.net/10468/9036
dc.identifier.doi 10.3390/s19051240 en
dc.description.abstract In this paper we present enhanced routing protocol for low-lower and lossy networks (ERPL), a reduced overhead routing protocol for short-range low-power and lossy wireless networks, based on RPL. ERPL enhances peer-to-peer (P2P) route construction and data packet forwarding in RPL’s storing and non-storing modes of operation (MoPs). In order to minimize source routing overhead, it encodes routing paths in Bloom Filters (BF). The salient features of ERPL include the following: (i) optimized P2P routing and data forwarding; (ii) no additional control messages; and (iii) minimized source routing overhead. We extensively evaluated ERPL against RPL using emulation, simulation, and physical test-bed based experiments. Our results demonstrate that ERPL outperforms standard RPL in P2P communication and its optimized P2P route construction and data forwarding algorithms also positively impact the protocol’s performance in multi-point to point (MP2P) and point to multi-point (P2MP) communications. Our results demonstrate that the BF-based approach towards compressed source routing information is feasible for the kinds of networks considered in this paper. The BF-based approach results in 65% lower source routing control overhead compared to RPL. Our results also provide new insights into the performance of MP2P, P2MP, and P2P communications relative to RPL’s destination-oriented directed a-cyclic graph (DODAG) depth, i.e., a deeper DODAG negatively impacts the performance of MP2P and P2MP communications, however it positively impacts P2P communication, while the reverse holds true for a relatively shallow DODAG. en
dc.format.mimetype application/pdf en
dc.language.iso en en
dc.publisher MDPI en
dc.relation.uri https://www.mdpi.com/1424-8220/19/5/1240
dc.rights © 2019 by the authors. Licensee MDPI, Basel, Switzerland en
dc.rights.uri https://creativecommons.org/licenses/by/4.0/ en
dc.subject Low-power and lossy networks (LLNs) en
dc.subject Short-range wireless networks en
dc.subject Routing protocol en
dc.subject Probabilistic forwarding en
dc.title Reduced overhead routing in short-range low-power and lossy wireless networks en
dc.type Article (peer-reviewed) en
dc.internal.authorcontactother Dirk Pesch, School of Computer Science and IT, University College Cork, Cork, Ireland. +353-21-490-3000 Email: d.pesch@cs.ucc.ie en
dc.internal.availability Full text available en
dc.description.version Published Version en
dc.contributor.funder Science Foundation Ireland en
dc.contributor.funder European Regional Development Fund en
dc.description.status Peer reviewed en
dc.identifier.journaltitle Sensors en
dc.internal.IRISemailaddress d.pesch@cs.ucc.ie en
dc.identifier.articleid 1240 en
dc.relation.project info:eu-repo/grantAgreement/SFI/SFI Research Centres/13/RC/2077/IE/CONNECT: The Centre for Future Networks & Communications/ en
dc.identifier.eissn 1424-8220


Files in this item

This item appears in the following Collection(s)

Show simple item record

© 2019 by the authors. Licensee MDPI, Basel, Switzerland Except where otherwise noted, this item's license is described as © 2019 by the authors. Licensee MDPI, Basel, Switzerland
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