Options
Let the tree bloom: Scalable opportunistic routing with ORPL
Publikationstyp
Conference Paper
Date Issued
2013-01-01
Sprache
English
Author(s)
Article Number
2
Citation
Proceedings of the 11th ACM Conference on Embedded Networked Sensor Systems: 2 (2013)
Contribution to Conference
Publisher DOI
Scopus ID
Publisher
ACM
ISBN
9781450320276
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.
Subjects
Energy Eficiency | Opportunistic Routing | RPL | Wireless Sensor Network
DDC Class
620: Engineering