Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Performance in Practice of String Hashing Functions
Proceedings of the Fifth International Conference on Database Systems for Advanced Applications (DASFAA)
Random Asynchronous Wakeup Protocol for Sensor Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Contiki - A Lightweight and Flexible Operating System for Tiny Networked Sensors
LCN '04 Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks
ExOR: opportunistic multi-hop routing for wireless networks
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
A high-throughput path metric for multi-hop wireless routing
Wireless Networks - Special issue: Selected papers from ACM MobiCom 2003
Beyond bloom filters: from approximate membership checks to approximate state machines
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Dozer: ultra-low power data gathering in sensor networks
Proceedings of the 6th international conference on Information processing in sensor networks
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Software-based on-line energy estimation for sensor nodes
Proceedings of the 4th workshop on Embedded networked sensors
Trading structure for randomness in wireless opportunistic routing
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Opportunistic forwarding in wireless networks with duty cycling
Proceedings of the third ACM workshop on Challenged networks
Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Energy and Latency Performance
IEEE Transactions on Mobile Computing
The β-factor: measuring wireless link burstiness
Proceedings of the 6th ACM conference on Embedded network sensor systems
Potentials of Opportunistic Routing in Energy-Constrained Wireless Sensor Networks
EWSN '09 Proceedings of the 6th European Conference on Wireless Sensor Networks
ACM Transactions on Sensor Networks (TOSN)
Energy efficient opportunistic routing in wireless networks
Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems
The κ factor: inferring protocol performance using inter-link reception correlation
Proceedings of the sixteenth annual international conference on Mobile computing and networking
Proceedings of the 8th ACM Conference on Embedded Networked Sensor Systems
Exploiting routing redundancy using MAC layer anycast to improve delay in WSN
ACM SIGMOBILE Mobile Computing and Communications Review
Valuable detours: least-cost anypath routing
IEEE/ACM Transactions on Networking (TON)
Optimal anycast technique for delay-sensitive energy-constrained asynchronous sensor networks
IEEE/ACM Transactions on Networking (TON)
Multipath opportunistic RPL routing over IEEE 802.15.4
Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Lossy links, low power, high throughput
Proceedings of the 9th ACM Conference on Embedded Networked Sensor Systems
Low power, low delay: opportunistic routing meets duty cycling
Proceedings of the 11th international conference on Information Processing in Sensor Networks
Opportunistic, receiver-initiated data-collection protocol
EWSN'12 Proceedings of the 9th European conference on Wireless Sensor Networks
Proceedings of the 10th ACM Conference on Embedded Network Sensor Systems
| Hi-index | 0.00 |
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.