sofa

Sensor networks can nowadays deliver 99.9% of their data with duty cycles below 1%. This remarkable performance is, however, dependent on some important underlying assumptions: low traffic rates, medium size densities and static nodes. In this paper, we investigate the performance of these same resource-constrained devices, but under scenarios that present extreme conditions: high traffic rates, high densities and mobility. To cope with these stringent requirements, we propose a novel communication protocol named SOFA (Stop On First Ack). SOFA utilizes opportunistic anycast to drastically reduce the rendezvous times of asynchronous duty cycled nodes -long rendezvous times are the key limitation of protocols operating under high densities and high traffic conditions. SOFA is also stateless, which makes it resilient to mobility. We implemented SOFA in the Contiki OS and tested it both in simulation and on a 100-node testbed. Our results show that SOFA reliably communicates in mobile networks with extreme densities (hundreds of nodes) and higher traffic rates (packets per second) while maintaining a low duty cycle (~2%). Under these extreme conditions, current duty cycled protocols collapse.

In the first video, we use SOFA to run a push-pull, gossip-based protocol that computes the average of the nodes’ values. Nodes’ values are shown in red, while the averages are shown in black. In the second video, we run SLICE, a push-pull, gossip-based protocol to automatically partition the nodes’ values into “slices”. In this case the nodes’ values (in red) are partitioned in percentiles (in black). The experiment was recorded in real-time speed (1x) in the TU Delft testbed.