IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v70y2019i3d10.1007_s11235-018-0480-y.html
   My bibliography  Save this article

Speedy leader election to avoid application discontinuity in cognitive radio networks

Author

Listed:
  • Mahendra Kumar Murmu

    (National Institute of Technology)

  • Awadhesh Kumar Singh

    (National Institute of Technology)

Abstract

In cognitive radio networks (CRN), secondary user (SU) nodes operate in primary users’ unused spectrum bands. Thus, the link between SU nodes may be short lived due to (largely) unpredictable appearance of PU despite SU’s being capable of multiple channel access. Further, the nodes may suffer frequent disconnection due to node mobility and spectrum mobility. A network is considered reliable if SU’s have been carefully synchronized to ensure timely use of the available channel(s). Many computing applications require a leader node to carry out efficient coordination among the participant nodes. In this paper, we propose a diffusion computation based leader election protocol for CRN. We apply a handover mechanism for control transfer. Our handover mechanism can avoid the premature termination of some applications and thus enhances system throughput. The objective is to find maximum Id node as leader in a connected component. In extent, we validate our algorithm using simulation results and include illustration for correctness proof.

Suggested Citation

  • Mahendra Kumar Murmu & Awadhesh Kumar Singh, 2019. "Speedy leader election to avoid application discontinuity in cognitive radio networks," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 70(3), pages 349-364, March.
    • Handle: RePEc:spr:telsys:v:70:y:2019:i:3:d:10.1007_s11235-018-0480-y
    DOI: 10.1007/s11235-018-0480-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-018-0480-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/s11235-018-0480-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.

    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:telsys:v:70:y:2019:i:3:d:10.1007_s11235-018-0480-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.