The overall performance of multi-hop cognitive radio networks (MHCRNs) can be improved significantly by employing the diversity of orthogonal licensed channels in underlay fashion. However, the mutual interference between secondary links and primary links and the congestion due to the contention among traffic flows traversing the shared link become obstacles to this realizing technique. How to control congestion efficiently in coordination with power and spectrum allocation optimally in order to obtain a high end-to-end throughput is motivating cross-layer designs for MHCRNs. In this paper, by taking into account the problem of joint rate adaption, power control, and spectrum allocation (JRPS), we propose a new cross-layer optimization framework for MHCRNs using orthogonal frequency division multiple access (OFDMA). Specifically, the JRPS formulation is shown to be a mix-integer non-linear programming (MINLP) problem, which is NP-Hard in general. To solve the problem, we first develop a partially distributed algorithm, which is shown to converge to the global optimum within a reasonable time interval. We next propose a suboptimal solution which addresses the shortcomings of the first. Using numerical results, we finally demonstrate the efficiency of the proposed algorithms.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Mui Van NGUYEN, Sungwon LEE, Choong Seon HONG, "Joint Rate Adaption, Power Control, and Spectrum Allocation in OFDMA-Based Multi-Hop CRNs" in IEICE TRANSACTIONS on Communications,
vol. E96-B, no. 1, pp. 242-253, January 2013, doi: 10.1587/transcom.E96.B.242.
Abstract: The overall performance of multi-hop cognitive radio networks (MHCRNs) can be improved significantly by employing the diversity of orthogonal licensed channels in underlay fashion. However, the mutual interference between secondary links and primary links and the congestion due to the contention among traffic flows traversing the shared link become obstacles to this realizing technique. How to control congestion efficiently in coordination with power and spectrum allocation optimally in order to obtain a high end-to-end throughput is motivating cross-layer designs for MHCRNs. In this paper, by taking into account the problem of joint rate adaption, power control, and spectrum allocation (JRPS), we propose a new cross-layer optimization framework for MHCRNs using orthogonal frequency division multiple access (OFDMA). Specifically, the JRPS formulation is shown to be a mix-integer non-linear programming (MINLP) problem, which is NP-Hard in general. To solve the problem, we first develop a partially distributed algorithm, which is shown to converge to the global optimum within a reasonable time interval. We next propose a suboptimal solution which addresses the shortcomings of the first. Using numerical results, we finally demonstrate the efficiency of the proposed algorithms.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E96.B.242/_p
Copy
@ARTICLE{e96-b_1_242,
author={Mui Van NGUYEN, Sungwon LEE, Choong Seon HONG, },
journal={IEICE TRANSACTIONS on Communications},
title={Joint Rate Adaption, Power Control, and Spectrum Allocation in OFDMA-Based Multi-Hop CRNs},
year={2013},
volume={E96-B},
number={1},
pages={242-253},
abstract={The overall performance of multi-hop cognitive radio networks (MHCRNs) can be improved significantly by employing the diversity of orthogonal licensed channels in underlay fashion. However, the mutual interference between secondary links and primary links and the congestion due to the contention among traffic flows traversing the shared link become obstacles to this realizing technique. How to control congestion efficiently in coordination with power and spectrum allocation optimally in order to obtain a high end-to-end throughput is motivating cross-layer designs for MHCRNs. In this paper, by taking into account the problem of joint rate adaption, power control, and spectrum allocation (JRPS), we propose a new cross-layer optimization framework for MHCRNs using orthogonal frequency division multiple access (OFDMA). Specifically, the JRPS formulation is shown to be a mix-integer non-linear programming (MINLP) problem, which is NP-Hard in general. To solve the problem, we first develop a partially distributed algorithm, which is shown to converge to the global optimum within a reasonable time interval. We next propose a suboptimal solution which addresses the shortcomings of the first. Using numerical results, we finally demonstrate the efficiency of the proposed algorithms.},
keywords={},
doi={10.1587/transcom.E96.B.242},
ISSN={1745-1345},
month={January},}
Copy
TY - JOUR
TI - Joint Rate Adaption, Power Control, and Spectrum Allocation in OFDMA-Based Multi-Hop CRNs
T2 - IEICE TRANSACTIONS on Communications
SP - 242
EP - 253
AU - Mui Van NGUYEN
AU - Sungwon LEE
AU - Choong Seon HONG
PY - 2013
DO - 10.1587/transcom.E96.B.242
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E96-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 2013
AB - The overall performance of multi-hop cognitive radio networks (MHCRNs) can be improved significantly by employing the diversity of orthogonal licensed channels in underlay fashion. However, the mutual interference between secondary links and primary links and the congestion due to the contention among traffic flows traversing the shared link become obstacles to this realizing technique. How to control congestion efficiently in coordination with power and spectrum allocation optimally in order to obtain a high end-to-end throughput is motivating cross-layer designs for MHCRNs. In this paper, by taking into account the problem of joint rate adaption, power control, and spectrum allocation (JRPS), we propose a new cross-layer optimization framework for MHCRNs using orthogonal frequency division multiple access (OFDMA). Specifically, the JRPS formulation is shown to be a mix-integer non-linear programming (MINLP) problem, which is NP-Hard in general. To solve the problem, we first develop a partially distributed algorithm, which is shown to converge to the global optimum within a reasonable time interval. We next propose a suboptimal solution which addresses the shortcomings of the first. Using numerical results, we finally demonstrate the efficiency of the proposed algorithms.
ER -