SwePub - sökning: id:"swepub:oai:research.chalme...

Numrering	Referens	Omslagsbild	Hitta
1.	Duquennoy, Simon, et al. (författare) Let the Tree Bloom: Scalable Opportunistic Routing with ORPL 2013 Ingår i: SenSys '13: Proceedings of the 11th ACM Conference on Embedded Networked Sensor Systems. - New York, NY, USA : ACM. - 9781450320276 Konferensbidrag (refereegranskat)abstract 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.

Duquennoy, Simon, et al. (författare)
Let the Tree Bloom: Scalable Opportunistic Routing with ORPL
2013
Ingår i: SenSys '13: Proceedings of the 11th ACM Conference on Embedded Networked Sensor Systems. - New York, NY, USA : ACM. - 9781450320276
Konferensbidrag (refereegranskat)abstract
- 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.

Träfflista för sökning "id:"swepub:oai:research.chalmers.se:ee7e3d00-100e-43d3-bae9-3e50c9876101" "

Avgränsa träffmängd