onr:"swepub:oai:research.chalmers.se:ee7e3d00-100e-43d3-bae9-3e50c9876101"
Search: onr:"swepub:oai:research.chalmers.se:ee7e3d00-100e-43d3-bae9-3e50c9876101" > Let the Tree Bloom:...
- 1 of 1
- Previous record
- Next record
- To hitlist
- Duquennoy, SimonRISE,Computer Systems Laboratory (author)
Let the Tree Bloom: Scalable Opportunistic Routing with ORPL
- Article/chapterEnglish2013
Publisher, publication year, extent ...
- 2013-11-11
- New York, NY, USA :ACM,2013
- electronicrdacarrier
Numbers
- LIBRIS-ID:oai:research.chalmers.se:ee7e3d00-100e-43d3-bae9-3e50c9876101
- ISBN:9781450320276
- https://research.chalmers.se/publication/191442URI
- https://doi.org/10.1145/2517351.2517369DOI
- https://urn.kb.se/resolve?urn=urn:nbn:se:ri:diva-24247URI
Supplementary language notes
- Language:English
- Summary in:English
Part of subdatabase
- SwePubSwePub
Classification
Notes
- 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 traffic with arbitrary patterns.We present ORPL, an opportunistic routing protocol that supports any-to-any, on-demand traffic. 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 bitmaps and Bloom filters to represent and propagate this information in a space-efficient 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.
Subject headings and genre
- NATURVETENSKAP Data- och informationsvetenskap Datavetenskap hsv//swe
- NATURAL SCIENCES Computer and Information Sciences Computer Sciences hsv//eng
- NATURVETENSKAP Data- och informationsvetenskap hsv//swe
- NATURAL SCIENCES Computer and Information Sciences hsv//eng
- wireless sensor network
- energy efficiency
- RPL
- opportunistic routing
Added entries (persons, corporate bodies, meetings, titles ...)
- Landsiedel, Olaf,1979Chalmers tekniska högskola,Chalmers University of Technology,Chalmers University of Technology, Sweden(Swepub:cth)olafl (author)
- Voigt, ThiemoRISE,Computer Systems Laboratory,Uppsala University, Sweden(Swepub:ri)ThiemoVo@ri.se (author)
- RISEComputer Systems Laboratory (creator_code:org_t)
Related titles
- In:SenSys '13: Proceedings of the 11th ACM Conference on Embedded Networked Sensor SystemsNew York, NY, USA : ACM9781450320276
Internet link
- http://publications.lib.chalmers.se/records/fulltext/191442/local_191442.pdfFULLTEXT
- http://publications.lib.chalmers.se/records/fulltext/191442/local_191442.pdf
- https://ri.diva-portal.org/smash/get/diva2:1043327/FULLTEXT01.pdffulltext:print
- https://research.chalmers.se/publication/191442
- https://doi.org/10.1145/2517351.2517369
- https://urn.kb.se/resolve?urn=urn:nbn:se:ri:diva-24247
Find in a library
- SenSys '13: Proceedings of the 11th ACM Conference on Embedded Networked Sensor ... (Search for host publication in LIBRIS)
To the university's database
- 1 of 1
- Previous record
- Next record
- To hitlist
Find more in SwePub
- By the author/editor
- Duquennoy, Simon
- Landsiedel, Olaf ...
- Voigt, Thiemo
- About the subject
-
- NATURAL SCIENCES
- NATURAL SCIENCES
- and Computer and Inf ...
- and Computer Science ...
-
- NATURAL SCIENCES
- NATURAL SCIENCES
- and Computer and Inf ...
- Articles in the publication
- SenSys '13: Proc ...
- By the university
- Chalmers University of Technology
- RISE
Search outside SwePub
- Extend your search to:
- Google Book Search
- Google Scholar
Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.
- Copyright © LIBRIS - National Library Systems
- LIBRIS.kb.se
