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

Exploiting Multiple Channels for Low Latency and Semireliable Broadcasting in Cognitive Wireless Sensor Networks

Author

Listed:
  • Tae-Sung Kim
  • Sok-Hyong Kim
  • Bo-Kyum Kim
  • Young-Yong Kim

Abstract

In Wireless Sensor Networks (WSNs), disaster management is a crucial issue that focuses on disaster relief and recovery. Mobile sensor nodes support disaster relief and recovery by means of real-time bidirectional communication. For its high data rate requirement, IEEE 802.11 specification can be used for the radio interface of sensor nodes, and the nodes can be equipped with multiple 802.11 radios to utilize multiple channels and link data rates. Channel assignment algorithms can be applied in cognitive radio enabled networks which performs dynamic channel configuration for utilizing multiple channels. For efficient and semireliable broadcast in cognitive radio WSNs, we focus on reducing broadcast latency and achieving 100% delivery percentage. To realize these goals, in this study, we present our design for a novel Channel Assignment Algorithm for a Collision-Reduced Broadcast Tree (CA-CBT). Fundamentally, CA-CBT builds a broadcast tree and then uses several heuristic procedures to allocate collision-free channels to links on the tree. If CA-CBT fails to allocate collision-free channels due to a limited number of available channels, it allocates non-collision-free channels with the smallest number of interfering nodes. Through extensive simulations, we demonstrated that CA-CBT supports lower broadcast latency and higher delivery percentages compared with existing broadcast algorithms.

Suggested Citation

  • Tae-Sung Kim & Sok-Hyong Kim & Bo-Kyum Kim & Young-Yong Kim, 2015. "Exploiting Multiple Channels for Low Latency and Semireliable Broadcasting in Cognitive Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 11(10), pages 241208-2412, October.
    • Handle: RePEc:sae:intdis:v:11:y:2015:i:10:p:241208
    DOI: 10.1155/2015/241208
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2015/241208
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2015/241208?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:10:p:241208. 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.