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

Backup Routing Algorithm Based on Delay Constraint in Cognitive Radio Sensor Networks

Author

Listed:
  • Zhenguo Wu
  • Xiaozhu Liu
  • Yan Zhang
  • Hooman Samani
  • Rongbo Zhu

Abstract

In cognitive radio sensor networks (CRSNs), the frequency used by second users will be terminated unexpectedly as the preemption of primary user or reinitialized route discovery process in data transmission process, which will lead to unreliable communication and degrade the network performance greatly. In this paper, an efficient backup routing algorithm is proposed for reliable routing based on the uncorrelated degree and delay constraint in CRSNs. Numerical and simulation results show that the proposed algorithm can effectively overcome the intermittent connection problem and decrease delay greatly.

Suggested Citation

  • Zhenguo Wu & Xiaozhu Liu & Yan Zhang & Hooman Samani & Rongbo Zhu, 2015. "Backup Routing Algorithm Based on Delay Constraint in Cognitive Radio Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 11(10), pages 937104-9371, October.
    • Handle: RePEc:sae:intdis:v:11:y:2015:i:10:p:937104
    DOI: 10.1155/2015/937104
    as

    Download full text from publisher

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