Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Let the Tree Bloom: Scalable Opportunistic Routing with ORPL
RISE, Swedish ICT, SICS, Computer Systems Laboratory.ORCID iD: 0000-0001-7592-1048
Chalmers University of Technology, Sweden.
RISE, Swedish ICT, SICS, Computer Systems Laboratory. Uppsala University, Sweden.ORCID iD: 0000-0002-2586-8573
2013 (English)Conference paper, Published paper (Refereed)
Abstract [en]

Routing in battery-operated wireless networks is challenging, posing a tradeoff between energy and latency. Previous work has shown that opportunistic routing can achieve low latency data collection in duty cycled networks. However, applications are now considered where nodes are not only periodic data sources, but rather addressable end points generating trafic with arbitrary patterns. We present ORPL, an opportunistic routing protocol that supports any-to-any, on-demand trafic. ORPL builds upon RPL, the standard protocol for low-power IPv6 networks. By combining RPL's tree-like topology with opportunistic routing, ORPL forwards data to any destination based on the mere knowledge of the nodes' sub-tree. We use bitmapsnd Bloom filters to represent and propagate this information in a spaceeficient way, making ORPL scale to large networks of addressable nodes. Our results in a 135-node testbed show that ORPL outperforms a number of state- of-the-art solutions including RPL and CTP, conciliating a sub-second latency and a sub-percent duty cycle. ORPL also increases robustness and scalability, addressing the whole network reliably through a 64-byte Bloom filter, where RPL needs kilobytes of routing tables for the same task.

Place, publisher, year, edition, pages
2013, 9. article id 2
Keywords [en]
Energy Eficiency, Opportunistic Routing, RPL, Wireless Sensor Network
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:ri:diva-24247DOI: 10.1145/2517351.2517369Scopus ID: 2-s2.0-84905715304OAI: oai:DiVA.org:ri-24247DiVA, id: diva2:1043327
Conference
ACM SenSys 2013
Projects
PromosCALIPSOAvailable from: 2016-10-31 Created: 2016-10-31 Last updated: 2023-06-08Bibliographically approved

Open Access in DiVA

fulltext(1830 kB)386 downloads
File information
File name FULLTEXT01.pdfFile size 1830 kBChecksum SHA-512
e6569faa92cf3ebc7d70ba0e8710c3aecd2be07daf3a1ad911c78bf862f66325f2a26d66466665591579b91a25557def8807f389f51c272019f1d6660d3ce6ea
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Authority records

Duquennoy, SimonVoigt, Thiemo

Search in DiVA

By author/editor
Duquennoy, SimonVoigt, Thiemo
By organisation
Computer Systems Laboratory
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 386 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 143 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf