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

On Minimum-Latency Broadcast in Multichannel Duty-Cycled Wireless Sensor Networks

Author

Listed:
  • Xianlong Jiao
  • Weidong Xiao
  • Bin Ge
  • Yuli Chen

Abstract

Broadcast has critical significance for wide application of wireless sensor networks (WSNs). Minimum-latency broadcast (MLB) studies how to devise a broadcast schedule, which can achieve minimum broadcast latency with no signal interference. In multichannel duty-cycled WSNs, nodes can exploit multiple channels to communicate and periodically fall asleep after working for some time. Nevertheless, most solutions to the MLB problem either focus on nonsleeping scenarios or only exploit one single channel. Therefore, we investigate the MLB problem in multichannel duty-cycled WSNs in this paper and call this problem as MLBCD problem. We prove that MLBCD problem is NP-hard. We propose a new concept of active interference graph (AIG). Based on AIG, we present one novel approximation broadcast algorithm called NAB to solve the MLBCD problem. We prove that our proposed NAB algorithm achieves provable performance guarantee. The results of our extensive evaluations show that NAB algorithm can significantly improve the broadcast latency.

Suggested Citation

  • Xianlong Jiao & Weidong Xiao & Bin Ge & Yuli Chen, 2015. "On Minimum-Latency Broadcast in Multichannel Duty-Cycled Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 11(8), pages 913451-9134, August.
  • Handle: RePEc:sae:intdis:v:11:y:2015:i:8:p:913451
    DOI: 10.1155/2015/913451
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2015/913451
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2015/913451?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:913451. 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.