Cognitive Radio-Oriented Wireless Networks. 14th EAI International Conference, CrownCom 2019, Poznan, Poland, June 11–12, 2019, Proceedings

Research Article

Cooperative Delay-Constrained Cognitive Radio Networks: Throughput Maximization with Full-Duplex Capability Impact

Download
64 downloads
  • @INPROCEEDINGS{10.1007/978-3-030-25748-4_14,
        author={Ali Gaber and El-Sayed Youssef and Mohamed Rizk and Mohamed Salman and Karim Seddik},
        title={Cooperative Delay-Constrained Cognitive Radio Networks: Throughput Maximization with Full-Duplex Capability Impact},
        proceedings={Cognitive Radio-Oriented Wireless Networks. 14th EAI International Conference, CrownCom 2019, Poznan, Poland, June 11--12, 2019, Proceedings},
        proceedings_a={CROWNCOM},
        year={2019},
        month={8},
        keywords={},
        doi={10.1007/978-3-030-25748-4_14}
    }
    
  • Ali Gaber
    El-Sayed Youssef
    Mohamed Rizk
    Mohamed Salman
    Karim Seddik
    Year: 2019
    Cooperative Delay-Constrained Cognitive Radio Networks: Throughput Maximization with Full-Duplex Capability Impact
    CROWNCOM
    Springer
    DOI: 10.1007/978-3-030-25748-4_14
Ali Gaber1,*, El-Sayed Youssef1,*, Mohamed Rizk1,*, Mohamed Salman2,*, Karim Seddik3,*
  • 1: Alexandria University
  • 2: University of Colorado
  • 3: American University in Cairo
*Contact email: aligaber@alexu.edu.eg, dr.e.a.youssef@gmail.com, mrmrizk@ieee.org, mohamed.salman@colorado.edu, kseddik@aucegypt.edu

Abstract

In this paper, we study the problem of maximizing the secondary user (SU) throughput under a quality of service (QoS) delay requirement of the primary user (PU). In addition, we investigate the impact of having a full-duplex capability at the SU on the network performance, compared to the case of a half-duplex SU. We consider a cooperative cognitive radio (CR) network with multipacket reception (MPR) capabilities at the receiving nodes. In our proposed system, the SU not only exploits the idle time slots (i.e. when PU is not transmitting) but also chooses between cooperating or sharing the channel with the PU probabilistically. We formulate our optimization problem maximizing the SU throughput under a PU delay constraint; we optimize over the SU transmission modes’ selection probabilities. The resultant optimization problem turns out to be a non-convex quadratic constrained quadratic programming (QCQP) optimization problem, which is, in general, an NP-hard problem. An efficient approach is devised to solve it and characterize the stability region of the network under a delay constraint on the PU. Numerical results, surprisingly, reveal that the network performance with a full-duplex SU is not always better than that of a half-duplex SU. In fact, we show that a full-duplex capability at the SU can adversely affect the stability performance of the network especially if the channel condition between the SU and the destinations is weaker than that between the PU and the destinations.