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

Xiaohui Liu | Zendy; Yu Chen | Zendy; Hongwei Zhang | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

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

Author(s) -

Xiaohui Liu,

Yu Chen,

Hongwei Zhang

Publication year - 2015

Publication title -

international journal of distributed sensor networks

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.324

H-Index - 53

eISSN - 1550-1477

pISSN - 1550-1329

DOI - 10.1155/2015/603172

Subject(s) - computer science , precomputation , concurrency , wireless sensor network , reuse , computer network , latency (audio) , distributed computing , scheduling (production processes) , throughput , protocol (science) , wireless , algorithm , operating system , medicine , ecology , telecommunications , operations management , alternative medicine , pathology , economics , computation , biology

Existing work that schedules concurrent transmissions without collisions 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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research