The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
CR(Symbiotic Cognitive Radio) 네트워크에서는 CR 사용자(CU)가 협력 시간 내에 1차 전송을 보조하고, 자신의 데이터 전송에 대한 인센티브 시간을 얻을 수 있다. 이 편지에서는 공생 CR 네트워크의 처리량 최대화 문제를 연구합니다. 공생 및 전송 전력 제약 조건 하에서 우리는 CU 간 기본 전송 및 전력 할당을 지원하기 위한 최적의 협력 시간을 찾는 것을 목표로 합니다. 협력 시간이 주어지면 개별 볼륨 제한이 있는 다단계 물 채우기(MWF)를 통해 최적의 전력 할당을 해결할 수 있습니다. 협력 시간에 대한 이론적 분석을 제시하고 차선의 협력 시간을 찾기 위해 복잡도가 낮은 수정된 이등분 알고리즘을 제안합니다. 시뮬레이션 결과는 CU의 수가 증가함에 따라 스펙트럼 사용 효율성이 크게 향상될 수 있음을 보여줍니다.
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.
부
Peng XUE, Peng GONG, Duk Kyung KIM, "Throughput Maximization in Cooperation Based Symbiotic Cognitive Radio Networks" in IEICE TRANSACTIONS on Communications,
vol. E93-B, no. 11, pp. 3207-3210, November 2010, doi: 10.1587/transcom.E93.B.3207.
Abstract: In the symbiotic cognitive radio (CR) networks, the CR users (CUs) may assist the primary transmission in a cooperation time, and obtain an incentive time for their own data transmission. In this letter, we study the throughput maximization problem in the symbiotic CR networks. Under the symbiosis and transmit power constraints, we aim to find the optimal cooperation time to assist the primary transmission and power allocations among the CUs. Given the cooperation time, the optimal power allocations can be solved by multi-level water-filling (MWF) with individual volume limits. A theoretical analysis is presented on the cooperation time and a modified bisection algorithm with low complexity is proposed to find the sub-optimal cooperation time. Simulation results show that the spectrum usage efficiency can be significantly improved as the number of CUs increases.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E93.B.3207/_p
부
@ARTICLE{e93-b_11_3207,
author={Peng XUE, Peng GONG, Duk Kyung KIM, },
journal={IEICE TRANSACTIONS on Communications},
title={Throughput Maximization in Cooperation Based Symbiotic Cognitive Radio Networks},
year={2010},
volume={E93-B},
number={11},
pages={3207-3210},
abstract={In the symbiotic cognitive radio (CR) networks, the CR users (CUs) may assist the primary transmission in a cooperation time, and obtain an incentive time for their own data transmission. In this letter, we study the throughput maximization problem in the symbiotic CR networks. Under the symbiosis and transmit power constraints, we aim to find the optimal cooperation time to assist the primary transmission and power allocations among the CUs. Given the cooperation time, the optimal power allocations can be solved by multi-level water-filling (MWF) with individual volume limits. A theoretical analysis is presented on the cooperation time and a modified bisection algorithm with low complexity is proposed to find the sub-optimal cooperation time. Simulation results show that the spectrum usage efficiency can be significantly improved as the number of CUs increases.},
keywords={},
doi={10.1587/transcom.E93.B.3207},
ISSN={1745-1345},
month={November},}
부
TY - JOUR
TI - Throughput Maximization in Cooperation Based Symbiotic Cognitive Radio Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 3207
EP - 3210
AU - Peng XUE
AU - Peng GONG
AU - Duk Kyung KIM
PY - 2010
DO - 10.1587/transcom.E93.B.3207
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E93-B
IS - 11
JA - IEICE TRANSACTIONS on Communications
Y1 - November 2010
AB - In the symbiotic cognitive radio (CR) networks, the CR users (CUs) may assist the primary transmission in a cooperation time, and obtain an incentive time for their own data transmission. In this letter, we study the throughput maximization problem in the symbiotic CR networks. Under the symbiosis and transmit power constraints, we aim to find the optimal cooperation time to assist the primary transmission and power allocations among the CUs. Given the cooperation time, the optimal power allocations can be solved by multi-level water-filling (MWF) with individual volume limits. A theoretical analysis is presented on the cooperation time and a modified bisection algorithm with low complexity is proposed to find the sub-optimal cooperation time. Simulation results show that the spectrum usage efficiency can be significantly improved as the number of CUs increases.
ER -