IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v29y2015i4d10.1007_s10878-013-9623-y.html
   My bibliography  Save this article

Delay efficient opportunistic routing in asynchronous multi-channel cognitive radio networks

Author

Listed:
  • Zhipeng Cai

    (Georgia State University)

  • Yueming Duan

    (Georgia State University)

  • Anu G. Bourgeois

    (Georgia State University)

Abstract

In this paper, we are interested in designing efficient distributed opportunistic routing protocols for multi-hop multi-channel cognitive radio networks (CRNs). In CRNs, secondary users (SUs) access unused primary channels opportunistically, which induces considerable end-to-end delays for multi-hop routing. The primary cause of the delay overhead is that the set of available channels change dynamically over time due to the activities of primary users, making it challenging to effectively explore the spectrum diversity. Our approach towards working with such a dynamic network is to construct a cross-layer distributed opportunistic routing protocol. Our protocol jointly considers the channel sensing strategy, the forwarder selection for each SU, and the package division scheme on each link. We mathematically model the expected delay of each hop along the routing path. This delay model sheds lights on our expected end-to-end delay analysis, from which we develop a distributed algorithm to derive the system parameters for the opportunistic routing protocol. Extensive simulation results indicate the improved performance of our opportunistic routing protocol in terms of end-to-end delay, especially for CRNs with highly dynamic channel conditions.

Suggested Citation

  • Zhipeng Cai & Yueming Duan & Anu G. Bourgeois, 2015. "Delay efficient opportunistic routing in asynchronous multi-channel cognitive radio networks," Journal of Combinatorial Optimization, Springer, vol. 29(4), pages 815-835, May.
  • Handle: RePEc:spr:jcomop:v:29:y:2015:i:4:d:10.1007_s10878-013-9623-y
    DOI: 10.1007/s10878-013-9623-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-013-9623-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10878-013-9623-y?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Cui Wang & Jiguo Yu & Dongxiao Yu & Baogui Huang & Shanshan Yu, 2016. "An improved approximation algorithm for the shortest link scheduling in wireless networks under SINR and hypergraph models," Journal of Combinatorial Optimization, Springer, vol. 32(4), pages 1052-1067, November.

    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:spr:jcomop:v:29:y:2015:i:4:d:10.1007_s10878-013-9623-y. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.