IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v323y2023i1d10.1007_s10479-022-05160-x.html
   My bibliography  Save this article

Effectiveness, fairness and social welfare maximization: service rules for the interrupted secondary users in cognitive radio networks

Author

Listed:
  • Yu Zhang

    (University of Science and Technology Beijing)

  • Jinting Wang

    (Central University of Finance and Economics)

Abstract

Cognitive radio networks that accommodate primary users (PUs) and secondary users (SUs) are usually modeled using a queueing system that gives PUs absolute priority over SUs. Under the back-off protocol, if a PU enters a band that is currently in use by an SU, the SU’s transmission is interrupted and the interrupted SU either (1) stays on the band ready to resume service after the PU’s transmission ends, (2) reattempts to associate with the current band at a later time (ISR), or (3) gets discarded by the system (ISD). In this paper, we compare these three service mechanisms from the perspectives of (a) effectiveness (i.e., the throughput of PU requests), (b) fairness among SUs and (c) the social welfare of the system. We first consider a system with non-strategic SUs to procure the system characteristics with which to make comparisons. The counterpart system with strategic SUs is then investigated, which includes SU joining strategies for both cooperative and non-cooperative scenarios. Our comparison results indicate that when SUs are non-strategic the ISD mechanism performs best. When SUs are strategic (i.e., when they choose to join the system or not by weighing up the waiting cost against any reward or compensation), the ISD mechanism still brings the greatest social welfare for both the cooperative and non-cooperative strategies. However, the ISD mechanism performs best in terms of effectiveness only when the ratio of the reward or compensation to the waiting cost is greater than a certain threshold; when the ratio is below this threshold, the ISR mechanism is best. Regarding fairness among SUs, the ISD mechanism performs best when SUs adopt uncooperative joining strategies, but no clear result is found when the SUs follow cooperative strategies. For this scenario, we carry out numerical experiments to show how the optimal mechanism changes as the system parameters vary.

Suggested Citation

  • Yu Zhang & Jinting Wang, 2023. "Effectiveness, fairness and social welfare maximization: service rules for the interrupted secondary users in cognitive radio networks," Annals of Operations Research, Springer, vol. 323(1), pages 247-286, April.
    • Handle: RePEc:spr:annopr:v:323:y:2023:i:1:d:10.1007_s10479-022-05160-x
    DOI: 10.1007/s10479-022-05160-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-022-05160-x
    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/s10479-022-05160-x?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.

    References listed on IDEAS

    as
    1. Jinting Wang & Fang Wang & Wei Wayne Li, 2017. "Strategic spectrum occupancy for secondary users in cognitive radio networks with retrials," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(7), pages 599-609, October.
    2. Jianping Liu & Shunfu Jin & Wuyi Yue, 2019. "Performance evaluation and system optimization of Green cognitive radio networks with a multiple-sleep mode," Annals of Operations Research, Springer, vol. 277(2), pages 371-391, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Evsey Morozov & Stepan Rogozin & Hung Q. Nguyen & Tuan Phung-Duc, 2022. "Modified Erlang Loss System for Cognitive Wireless Networks," Mathematics, MDPI, vol. 10(12), pages 1-20, June.
    2. Shi Wang & Hao Sun & Xiaoying Zhu & Tingyue Bian & Yang Yang, 2024. "A novel dynamic channel allocation protocol based on data traffic characterization model in CR-IoT network," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 87(3), pages 625-638, November.
    3. Jinting Wang & Zhongbin Wang & Yunan Liu, 2020. "Reducing Delay in Retrial Queues by Simultaneously Differentiating Service and Retrial Rates," Operations Research, INFORMS, vol. 68(6), pages 1648-1667, 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:annopr:v:323:y:2023:i:1:d:10.1007_s10479-022-05160-x. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.