Cooperative Delay-Constrained Cognitive Radio Networks: Delay-Throughput Trade-Off With Relaying Full-Duplex Capability
In this paper, the problem of maximizing the secondary user (SU) throughput under a primary user (PU) quality of service (QoS) delay requirement is studied. Moreover, the impact of having a full-duplex capability at the SU on the network performance is investigated compared to the case of a SU with...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2020-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/8951175/ |
| _version_ | 1818667771730329600 |
|---|---|
| author | Ali Gaber Mohamed Ali El-Sayed Ahmed Youssef Mohamed R. M. Rizk Mohamed Salman Karim G. Seddik |
| author_facet | Ali Gaber Mohamed Ali El-Sayed Ahmed Youssef Mohamed R. M. Rizk Mohamed Salman Karim G. Seddik |
| author_sort | Ali Gaber Mohamed Ali |
| collection | DOAJ |
| description | In this paper, the problem of maximizing the secondary user (SU) throughput under a primary user (PU) quality of service (QoS) delay requirement is studied. Moreover, the impact of having a full-duplex capability at the SU on the network performance is investigated compared to the case of a SU with half-duplex capability. We consider a cooperative cognitive radio (CR) network in which the receiving nodes have multi-packet reception (MPR) capabilities. In our proposed model, the SU not only benefits from the idle time slots (i.e. when PU is idle), but also chooses between sharing the channel or cooperating with the PU in a probabilistic manner. We formulate our optimization problem to maximize the SU throughput under a PU QoS, defined by a delay constraint; the optimization is performed over the transmission modes selection probabilities of the SU. The resultant optimization problem is found to be a non-convex quadratic constrained quadratic programming (QCQP) optimization problem, which is, generally, an NP-hard problem. We devise an efficient approach to solve it and to characterize the network stability region under a delay constraint set on the PU. Numerical results, surprisingly, reveal that the network performance when full-duplex capability exists at the SU is not always better compared to that of a half-duplex SU. In fact, we demonstrate that a full-duplex capability at the SU can, in some cases, adversely influence the network stability performance, especially if the direct channel conditions between the SU and the destinations are worse than that between the PU and the destinations. In addition, we formulate a multi-objective programming (MOP) optimization problem to investigate the trade-off between the PU delay and the SU throughput. Our MOP approach allows for assigning relative weights for our two conflicting performance metrics, i.e., PU delay and SU throughput. Numerical results also demonstrate that our cooperation policy outperforms conventional cooperative and non-cooperative policies presented in previous works. |
| first_indexed | 2024-12-17T06:25:43Z |
| format | Article |
| id | doaj.art-ef81e10952fa4ea6ab71701cfdedce2b |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-12-17T06:25:43Z |
| publishDate | 2020-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-ef81e10952fa4ea6ab71701cfdedce2b2022-12-21T22:00:19ZengIEEEIEEE Access2169-35362020-01-0189157917110.1109/ACCESS.2020.29645658951175Cooperative Delay-Constrained Cognitive Radio Networks: Delay-Throughput Trade-Off With Relaying Full-Duplex CapabilityAli Gaber Mohamed Ali0https://orcid.org/0000-0002-8190-7127El-Sayed Ahmed Youssef1https://orcid.org/0000-0001-7501-152XMohamed R. M. Rizk2https://orcid.org/0000-0003-1603-8516Mohamed Salman3https://orcid.org/0000-0002-9875-450XKarim G. Seddik4https://orcid.org/0000-0002-2279-592XDepartment of Electrical Engineering, Faculty of Engineering, Alexandria University, Alexandria, EgyptDepartment of Electrical Engineering, Faculty of Engineering, Alexandria University, Alexandria, EgyptDepartment of Electrical Engineering, Faculty of Engineering, Alexandria University, Alexandria, EgyptDepartment of Electrical, Computer, and Energy Engineering, University of Colorado at Boulder, Boulder, CO, USAECNG Department, American University in Cairo, Cairo, EgyptIn this paper, the problem of maximizing the secondary user (SU) throughput under a primary user (PU) quality of service (QoS) delay requirement is studied. Moreover, the impact of having a full-duplex capability at the SU on the network performance is investigated compared to the case of a SU with half-duplex capability. We consider a cooperative cognitive radio (CR) network in which the receiving nodes have multi-packet reception (MPR) capabilities. In our proposed model, the SU not only benefits from the idle time slots (i.e. when PU is idle), but also chooses between sharing the channel or cooperating with the PU in a probabilistic manner. We formulate our optimization problem to maximize the SU throughput under a PU QoS, defined by a delay constraint; the optimization is performed over the transmission modes selection probabilities of the SU. The resultant optimization problem is found to be a non-convex quadratic constrained quadratic programming (QCQP) optimization problem, which is, generally, an NP-hard problem. We devise an efficient approach to solve it and to characterize the network stability region under a delay constraint set on the PU. Numerical results, surprisingly, reveal that the network performance when full-duplex capability exists at the SU is not always better compared to that of a half-duplex SU. In fact, we demonstrate that a full-duplex capability at the SU can, in some cases, adversely influence the network stability performance, especially if the direct channel conditions between the SU and the destinations are worse than that between the PU and the destinations. In addition, we formulate a multi-objective programming (MOP) optimization problem to investigate the trade-off between the PU delay and the SU throughput. Our MOP approach allows for assigning relative weights for our two conflicting performance metrics, i.e., PU delay and SU throughput. Numerical results also demonstrate that our cooperation policy outperforms conventional cooperative and non-cooperative policies presented in previous works.https://ieeexplore.ieee.org/document/8951175/Cognitive radio (CR)throughputquadratic constrained quadratic programming (QCQP)multi-objective programming (MOP) |
| spellingShingle | Ali Gaber Mohamed Ali El-Sayed Ahmed Youssef Mohamed R. M. Rizk Mohamed Salman Karim G. Seddik Cooperative Delay-Constrained Cognitive Radio Networks: Delay-Throughput Trade-Off With Relaying Full-Duplex Capability IEEE Access Cognitive radio (CR) throughput quadratic constrained quadratic programming (QCQP) multi-objective programming (MOP) |
| title | Cooperative Delay-Constrained Cognitive Radio Networks: Delay-Throughput Trade-Off With Relaying Full-Duplex Capability |
| title_full | Cooperative Delay-Constrained Cognitive Radio Networks: Delay-Throughput Trade-Off With Relaying Full-Duplex Capability |
| title_fullStr | Cooperative Delay-Constrained Cognitive Radio Networks: Delay-Throughput Trade-Off With Relaying Full-Duplex Capability |
| title_full_unstemmed | Cooperative Delay-Constrained Cognitive Radio Networks: Delay-Throughput Trade-Off With Relaying Full-Duplex Capability |
| title_short | Cooperative Delay-Constrained Cognitive Radio Networks: Delay-Throughput Trade-Off With Relaying Full-Duplex Capability |
| title_sort | cooperative delay constrained cognitive radio networks delay throughput trade off with relaying full duplex capability |
| topic | Cognitive radio (CR) throughput quadratic constrained quadratic programming (QCQP) multi-objective programming (MOP) |
| url | https://ieeexplore.ieee.org/document/8951175/ |
| work_keys_str_mv | AT aligabermohamedali cooperativedelayconstrainedcognitiveradionetworksdelaythroughputtradeoffwithrelayingfullduplexcapability AT elsayedahmedyoussef cooperativedelayconstrainedcognitiveradionetworksdelaythroughputtradeoffwithrelayingfullduplexcapability AT mohamedrmrizk cooperativedelayconstrainedcognitiveradionetworksdelaythroughputtradeoffwithrelayingfullduplexcapability AT mohamedsalman cooperativedelayconstrainedcognitiveradionetworksdelaythroughputtradeoffwithrelayingfullduplexcapability AT karimgseddik cooperativedelayconstrainedcognitiveradionetworksdelaythroughputtradeoffwithrelayingfullduplexcapability |