A Maximal Concurrency and Low Latency Distributed Scheduling Protocol for Wireless Sensor Networks

TL;DR

This paper introduces ONAMA, a distributed scheduling protocol for wireless sensor networks that maximizes concurrency and reduces latency by using a novel pipelined precomputation technique, significantly improving throughput and delay.

Contribution

The paper presents ONAMA, a novel distributed scheduling protocol with pipelined precomputation, achieving maximal channel reuse and low latency in resource-constrained sensor networks.

Findings

Improves concurrency, throughput, and delay by factors of 3.7, 3.0, and 5.3 respectively.

Achieves maximal channel spatial reuse through a distributed maximal independent set algorithm.

Demonstrates superior performance on TelosB motes using TinyOS.

Abstract

Existing work that schedules concurrent transmissions collision-free suffers from low channel utilization. We propose the Optimal Node Activation Multiple Access (ONAMA) protocol to achieve maximal channel spatial reuse through a distributed maximal independent set (DMIS) algorithm. To overcome DMIS's excessive delay in finding a maximal independent set, we devise a novel technique called pipelined precomputation that decouples DMIS from data transmission. We implement ONAMA on resource-constrained TelosB motes using TinyOS. Extensive measurements on two testbeds independently attest to ONAMA's superb performance compared to existing work: improving concurrency, throughput, and delay by a factor of 3.7, 3.0, and 5.3, respectively, while still maintaining reliability.