IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v11y2015i8p603172.html
   My bibliography  Save this article

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

Author

Listed:
  • Xiaohui Liu
  • Yu Chen
  • Hongwei Zhang

Abstract

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.

Suggested Citation

  • Xiaohui Liu & Yu Chen & Hongwei Zhang, 2015. "A Maximal Concurrency and Low Latency Distributed Scheduling Protocol for Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 11(8), pages 603172-6031, August.
    • Handle: RePEc:sae:intdis:v:11:y:2015:i:8:p:603172
    DOI: 10.1155/2015/603172
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2015/603172
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2015/603172?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:11:y:2015:i:8:p:603172. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.