.png){kind=icon}
返回
Optimal Solution for a Joint Power Allocation and Relay Assignment Problem
.png){kind=icon}
PRE
AI
DOI：10.1109/TVT.2015.2467177.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The ultimate efficiency of a wireless network is achieved when various resources are allocated in a joint optimization process. This paper proposes the optimal solution for a joint power allocation and relay assignment (JPARA) problem subject to the sum-power constraint at the source node. This formulation is applicable to different system models. Specifically, we assume a network consisting of one source node, one destination node, and N relays, where the source node uses orthogonal frequency-division multiplexing (OFDM) to transmit its information to the destination. Each relay should be assigned to one of the subcarriers, and the source node should distribute its power among the subcarriers. We propose an algorithm to find the JPARA solution based on the max-min criterion. The optimality of the proposed algorithm is analytically proved, and its complexity is calculated to be O(N-4). We show that our proposed algorithm offers significant improvement in the performance of the worst end-to-end link compared with the separate optimization case. To further improve the performance, a new approach is proposed, in which each subcarrier is assigned a predetermined initial power, and the remaining power is distributed through the proposed JPARA algorithm.
Keyword:
Cooperative networks
joint power allocation and relay assignment (JPARA)
max-min criterion
sum-rate criterion
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.1
论文数:
1.8W
被引数:
6.6W
机构
引用论文
.png){kind=icon}
Joint Opportunistic Subchannel and Power Scheduling for Relay-Based OFDMA Networks With Scheduling at Relay Stations基于中继站调度的基于中继的OFDMA网络的联合机会子信道和功率调度
PREAI
分享收藏分享收藏
查看更多内容