Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
The cougar approach to in-network query processing in sensor networks
ACM SIGMOD Record
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
EnviroTrack: Towards an Environmental Computing Paradigm for Distributed Sensor Networks
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
The dynamic behavior of a data dissemination protocol for network programming at scale
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
TinyDB: an acquisitional query processing system for sensor networks
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
TWIST: a scalable and reconfigurable testbed for wireless indoor experiments with sensor networks
REALMAN '06 Proceedings of the 2nd international workshop on Multi-hop ad hoc networks: from theory to reality
Software-based on-line energy estimation for sensor nodes
Proceedings of the 4th workshop on Embedded networked sensors
An experimental study on the capture effect in 802.11a networks
Proceedings of the second ACM international workshop on Wireless network testbeds, experimental evaluation and characterization
A Formal Model of Crash Recovery in a Distributed System
IEEE Transactions on Software Engineering
CountTorrent: ubiquitous access to query aggregates in dynamic and mobile sensor networks
Proceedings of the 5th international conference on Embedded networked sensor systems
Synopsis diffusion for robust aggregation in sensor networks
ACM Transactions on Sensor Networks (TOSN)
The β-factor: measuring wireless link burstiness
Proceedings of the 6th ACM conference on Embedded network sensor 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
Proceedings of the 9th ACM Conference on Embedded Networked Sensor Systems
pTunes: runtime parameter adaptation for low-power MAC protocols
Proceedings of the 11th international conference on Information Processing in Sensor Networks
Data-aggregation techniques in sensor networks: a survey
IEEE Communications Surveys & Tutorials
Capacity of Slotted ALOHA in Rayleigh-Fading Channels
IEEE Journal on Selected Areas in Communications
Order matters: transmission reordering in wireless networks
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 10th ACM Conference on Embedded Network Sensor Systems
FlockLab: a testbed for distributed, synchronized tracing and profiling of wireless embedded systems
Proceedings of the 12th international conference on Information processing in sensor networks
JAG: Reliable and Predictable Wireless Agreement under External Radio Interference
RTSS '12 Proceedings of the 2012 IEEE 33rd Real-Time Systems Symposium
Splash: fast data dissemination with constructive interference in wireless sensor networks
nsdi'13 Proceedings of the 10th USENIX conference on Networked Systems Design and Implementation
Forwarder Selection in Multi-transmitter Networks
DCOSS '13 Proceedings of the 2013 IEEE International Conference on Distributed Computing in Sensor Systems
Proceedings of the 11th ACM Conference on Embedded Networked Sensor Systems
Hi-index | 0.00 |
An important building block for low-power wireless systems is to efficiently share and process data among all devices in a network. However, current approaches typically split such all-to-all interactions into sequential collection, processing, and dissemination phases, thus handling them inefficiently. We introduce Chaos, the first primitive that natively supports all-to-all data sharing in low-power wireless networks. Different from current approaches, Chaos embeds programmable in-network processing into a communication support based on synchronous transmissions. We show that this design enables a variety of common all-to-all interactions, including network-wide agreement and data aggregation. Results from three testbeds and simulations demonstrate that Chaos scales efficiently to networks consisting of hundreds of nodes, achieving severalfold improvements over LWB and CTP/Drip in radio duty cycle and latency with almost 100 % reliability across all scenarios we tested. For example, Chaos computes simple aggregates, such as the maximum, in a 100-node multi-hop network within less than 90 milliseconds.