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

Distributed Broadcast with Minimum Latency in Asynchronous Wireless Sensor Networks under SINR-Based Interference

Author

Listed:
  • Shiliang Xiao
  • Lebing Pan
  • Jianpo Liu
  • Baoqing Li
  • Xiaobing Yuan

Abstract

Data broadcast is a fundamental operation in wireless sensor networks (WSNs). The existence of wireless interference makes it nontrivial to design a minimum-latency broadcast scheme, which is known to be NP-hard. Existing works all assume strict time synchronization and provide centralized TDMA scheduling algorithms. However, WSNs in practice are more likely to be distributed asynchronous systems. In this paper, we investigate the problem of data broadcast with minimum latency for distributed asynchronous WSNs. To this end, we propose a Distributed Asynchronous Broadcast (DAB) algorithm which crucially leverages an elaborately optimized carrier-sensing range together with collision-backoff schemes to coordinate the transmissions among the nodes on a predetermined broadcast backbone. Theoretical analysis shows that DAB is order-optimal and achieves constant factor approximation to the optimal delay. We then conduct extensive simulations to evaluate the practical capability of DAB in asynchronous WSNs and the results corroborate our theoretical analysis.

Suggested Citation

  • Shiliang Xiao & Lebing Pan & Jianpo Liu & Baoqing Li & Xiaobing Yuan, 2013. "Distributed Broadcast with Minimum Latency in Asynchronous Wireless Sensor Networks under SINR-Based Interference," International Journal of Distributed Sensor Networks, , vol. 9(11), pages 506797-5067, November.
  • Handle: RePEc:sae:intdis:v:9:y:2013:i:11:p:506797
    DOI: 10.1155/2013/506797
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2013/506797
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2013/506797?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:9:y:2013:i:11:p:506797. 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.