OFDM中继系统的中继子载波对选择和功率分配

中继传输能够有效地提高系统功率效率以及传输容量。该文研究宽带OFDM中继系统的最优中继子载波对选择和功率分配。首先分别针对再生中继和非再生中继两种模式,提出中继子载波对的等效信道增益;然后利用匈牙利算法进行中继子载波对选择;最后在选择出的中继子载波对上利用注水法进行功率分配,从而达到最大化传输容量的目的。仿真结果表明,相对于随机中继子载波选择以及平均功率分配,该文算法与其它几种方法相比中继系统容量有较大提高。     

基于OFDM的DF多跳通信系统的功率分配

研究了DF多跳OFDM通信系统的功率分配优化.在总发射功率受限的条件下,提出了一种双向优化功率分配算法(D-OPA):先优化单个子载波上各中继节点的功率分配,使该子载波上的信道容量最大;再优化各个子载波间的功率分配,使单跳的信道容量最大,从而最大化系统的信道容量.仿真结果表明:提出的算法与自适应功率分配算法、平均功率分配算法相比,信道容量明显提高.     

基于两跳载波配对策略的非再生OFDM中继系统性能优化

该文针对非再生中继方式,分析了基于正交频分复用(OFDM)的两跳中继系统的容量,并推广到发送端具有两根天线采用空时块码(STBC)的情形。以最大化端到端的信息速率为优化准则,提出了非再生两跳载波配对定理,并结合注水定理分别在频域、空域,以及空频二维进行了资源联合优化。仿真结果表明,资源联合优化与传统的平均资源分配相比,显著提高系统容量,且STBC-OFDM能获得更高性能增益。通过子载波配对方案能进一步增强系统性能。     

Resource allocation for OFDM relay systems with statistical QoS guarantees

By integrating the concept of effective capacity, we propose the resource allocation schemes for subcarrier‐pair based OFDM decode‐and‐forward and amplify‐and‐forward relay systems for quality‐of‐service (QoS) guarantees. The objective is to maximize the system throughput subject to a given statistical delay QoS constraint. First, we pair the subcarriers over the source‐relay channel and the relay‐destination channel by the descending order of the subcarriers' channel gains. Second, by making use of the derived equivalent end‐to‐end channel gains of the subcarrier pairs, we apply joint water‐filling power allocation over the subcarrier pairs and then partition the power of the subcarrier pairs between the source and the relay. We prove that as the equivalent end‐to‐end channel gains of the subcarrier pairs are given, the combination of sorted subcarrier pairing and joint water‐filling power allocation is jointly optimal to maximize the effective capacity. The simulation results show that our proposed schemes achieve the highest effective capacity for OFDM decode‐and‐forward and amplify‐and‐forward relay systems as compared with other existing schemes. The results also verify that our proposed schemes can efficiently provide different levels of delay QoS guarantees, even if under the stringent delay QoS constraints. Copyright © 2012 John Wiley & Sons, Ltd.     

多天线双向中继系统中的中继处理与资源分配策略

该文在多天线放大转发双向中继系统中,根据最小和均方误差(MSMSE)准则,以较小的复杂度得到了MSE最优的中继处理矩阵的闭合表达式。为综合利用空域和频域分集,探讨了OFDM双向中继系统的资源分配策略,提出了实现复杂度低的分层子载波配对策略和功率优化分配策略。仿真结果显示,所设计的中继处理策略在系统和速率和误码率性能上均明显优于其他双向中继策略,且性能随着中继天线数的增加而提升;结合功率分配的分层子载波配对策略能明显提升系统和速率,性能接近最优策略。     

Dynamic joint resource allocation and relay selection for 5G multi-hop relay systems

LTE/LTE-A networks have become widely exploited to address the increasing demands of mobile traffic. Relay technologies have recently been introduced to fulfill such requirements. Currently, the LTE-A relay standard is restricted to two-hop relaying. This architecture minimizes system complexity, but multi-hop relay architecture could potentially provide greater capacity and coverage in the future. However, many complexities of the multi-hop relaying paradigm must be resolved. In this work, we focus on downlink resource allocation and relay selection, by which a user may be connected to a base station through a multi-hop relay and have several relay stations from which to choose within his range. To overcome the additional challenges introduced by multi-hop relay nodes, we propose a dynamic joint resource allocation and relay selection scheme. Numerical results are presented to demonstrate the validity of the proposed algorithm.     

基于补偿式CSI的分布式跨层联合资源分配算法

为消除过时信道状态信息(CSI)对分布式无线多跳网络环境下跨层资源分配效率的影响,提高跨层联合资源分配的准确性,基于信道相关性提出了一种补偿式跨层联合资源分配算法。利用瞬时和过时信道状态信息之间的条件概率密度函数,基于瑞利衰落信道模型求得信噪比(SINR) 模型下条件容量的闭式解。为补偿部分网络性能的损失,提出了一种考虑过时信道状态信息的联合拥塞控制、信道分配和功率控制的算法,在此过程中网络被建模成一个NUM 问题,可变的链路数据率和功率等资源限制作为约束条件。运用拉格朗日对偶分解技术,NUM问题被分布式求解。实验对比分析表明：在确保较低复杂度的前提下,该算法有效改善了分布式多跳网络资源分配的合理性,使其网络总体效用得到提升,降低了能耗。     

Resource allocation scheme in two-way multi-relay OFDM system

A joint optimization scheme for power allocation and subcarrier pairing under high SNR in two-way multi-relay OFDM system was proposed.Unlike those schemes in which relays use subcarriers separately,all the relays were allowed to forward signal on each subcarrier pair for providing much space diversity.With the constraint of total system power,the proposed scheme firstly allocated each relay power with Cauchy inequality with the assuming that the total relay power was fixed.Then the dichotomy was used to calculate the power allocation between the source node and the relay node by maximizing the equivalent channel gain for different subcarrier pairs.Lastly,the power of different subcarrier pairs was allocated by convex programming,and the subcarriers were paired by Hungarian algorithm to obtain the maximum system capacity.There was no optimal power allocation method with low complexity because of the complexity of the power allocation algorithm in two-way multi-relay networks.This algorithm greatly reduces the complexity of power allocation and simulation results show that the proposed scheme outperforms the relay selection scheme and the relays use subcarriers separately scheme.     

Joint overlay and underlay resource allocation with weighted fairness in OFDM‐based cognitive radio systems

In this paper, the problem of hybrid overlay and underlay spectrum access is investigated for OFDM‐based cognitive radio (CR) systems. Both the metrics for system (e.g. capacity) and users (e.g. fairness) are integrated into the unified framework of weighted‐capacity maximization with the interference constraint in CR systems. For easing the procedure of resource allocation, two criteria, respectively, for subcarrier assignment and power allocation are theoretically derived based on the Karush–Kuhn–Tucker conditions. Under the guidance of the two criteria, max‐capacity subcarrier assignment and optimal power allocation are proposed to flexibly distribute spectrum resources to secondary users. In order to reduce the computational complexity further, a suboptimal power allocation algorithm, referred to as cap‐limited waterfilling, is also presented by decomposing the interference constraint. Simulation results show that the capacity and fairness performance of the proposed algorithms is considerably better than the conventional ones in references. The proposed suboptimal algorithm with substantially lower complexity approaches to optimal power allocation in the vicinity of only 1% performance gap. Meanwhile, joint access model is greatly beneficial to spectrum efficiency enhancement in CR systems. Copyright © 2014 John Wiley & Sons, Ltd.     

Joint subcarrier and power allocation for uplink relay‐enhanced OFDM systems

There has been a lot of research works considering the resource allocation of the downlink multihop orthogonal frequency division multiplexing systems. However, due to the distributed nature of the uplink power constraints, the resource allocation in the uplink multihop systems, where multiple mobile stations transmit to one base station with the aid of one or many relay stations, has much difference and has not been well investigated so far. In this paper, we originally study the joint subcarrier and power allocation problem for the uplink dual‐hop transmission with the aim to maximize the system transmit rate. The resource allocation problem is approximated to be a concave maximization problem. By using mathematical decomposition techniques, the problem is first decoupled and solved by the proposed near‐optimal method, which has low‐computation complexity. Then, our algorithm is extended to the case with subcarrier matching on the dual hops. Numerical results show that our proposed algorithm improves the system transmission rate. Compared with the equal power allocation schemes, our algorithm can achieve significant gain in system transmit rate. Copyright © 2010 John Wiley & Sons, Ltd.     

多用户OFDM系统中一种新颖的自适应功率分配方案

针对多用户正交频分复用(OFDM)系统自适应资源分配的问题,提出了一种新的自适应子载波分配方案。子载波分配中首先通过松弛用户速率比例约束条件确定每个用户的子载波数量,然后对总功率在所有子载波间均等分配的前提下,按照最小比例速率用户优先选择子载波的方式实现子载波的分配;在功率分配中提出了一种基于人工蜂群算法和模拟退火算法(ABC-SA)相结合的新功率分配方案,并且通过ABC-SA算法的全局搜索实现了在所有用户之间的功率寻优,同时利用等功率的分配方式在每个用户下进行子载波间的功率分配,最终实现系统容量的最大化。仿真结果表明,与其他方案相比,所提方案在兼顾用户公平性的同时还能有效地提高系统的吞吐量,进而证明了所提方案的有效性。     

Resource allocation for multiuser two-way OFDMA relay networks with user rate constraints

This paper studies the resource allocation for a multi-user two-way amplify-and-forward (AF) relay network over orthogonal frequency-division multiplexing (OFDM) technology,where all users communicate with their pre-assigned partners.Using convex optimization techniques,an optimal solution tominimize the total transmit power while satisfy each user-pair’s data rate requirements is proposed.We divide the resource allocation problem into two subproblems:(1) power optimization within user-pair and relay in each subcarrier.(2) optimal subcarrier allocation and sum power assignment among N parallel OFDM subcarriers.Closed-form expressions of the power among user-pair and relay can be obtained in subproblem (1),and so the proposed algorithm decreases the variable dimensionality of the objective function to reduce the complexity of this optimization problem.To solve it,a three-step suboptimal approach is proposed to assign the resources to user-pairs:Firstly,decompose each user-pair into two sub user-pairs which have one-way and two-way relaying transmission modes.Secondly,allocate the subcarriers to the new mode user-pairs and assign the transmit power to each carrier.Thirdly,distribute the assigned power to three nodes allocated in the subcarrier.Simulation results demonstrate the significant power is saved with the proposed solutions,as compared to a fixed subcarrier allocation.     

Dynamic subcarrier and power allocation based on cooperative game theory in symmetric cooperative OFDMA networks

In order to improve the efficiency and fairness of radio resource utilization,a scheme of dynamic cooperative subcarrier and power allocation based on Nash bargaining solution(NBS-DCSPA) is proposed in the uplink of a three-node symmetric cooperative orthogonal frequency division multiple access(OFDMA) system.In the proposed NBS-DCSPA scheme,resource allocation problem is formulated as a two-person subcarrier and power allocation bargaining game(SPABG) to maximize the system utility,under the constraints of each user’s maximal power and minimal rate,while considering the fairness between the two users.Firstly,the equivalent direct channel gain of the relay link is introduced to decide the transmission mode of each subcarrier.Then,all subcarriers can be dynamically allocated to the two users in terms of their selected transmission mode.After that,the adaptive power allocation scheme combined with dynamic subcarrier allocation is optimized according to NBS.Finally,computer simulation is conducted to show the efficiency and fairness performance of the proposed NBS-DCSPA scheme.     

Joint power allocation and subcarrier pairing in OFDM-based cooperative relaying system

This paper proposes rate-maximized (MR) joint subcarrier pairing (SP) and power allocation (PA) (MR-SP&PA),a novel scheme for maximizing the weighted sum rate of the orthogonal-frequency-division multiplexing (OFDM) relaying system with a decode-and-forward (DF) relay.MR-SP&PA is based on the joint optimization of both SP and power allocation with total power constraint,and formulated as a mixed integer programming problem in the paper.The programming problem is then transformed to a convex optimization problem by using continuous relaxation,and solved in the Lagrangian dual domain.Simulation results show that MR-SP&PA can maximize the weighted sum rate under total power constraint and outperform equal power allocation (EPA) and proportion power allocation (PCG).     

协作系统中基于比例公平的资源分配方法

针对多用户协作中继系统中的资源分配问题,提出了一种在满足用户速率比例公平约束条件下的新算法。该算法先将由2个时隙组成的中继用户传输链路转换为一个等效信道链路,将涉及子载波分配、中继选择和功率分配的组合优化问题转化为分步的次优化问题。该算法在等功率分配情况下,根据各用户速率比例公平系数进行初步子载波数目分配;以瞬时信道增益最佳原则,进行剩余子载波数目分配及具体子载波分配,同时完成中继选择;在速率比例公平约束条件下推导出次优化功率分配的闭式表达式,从而完成各子载波上的功率分配。仿真结果表明,该算法在有效提高系统容量的同时,保证了各用户速率之间的比例公平性。     

A joint subcarrier selection and power allocation scheme using variational inequality in OFDM‐based cognitive relay networks

Introducing orthogonal frequency division multiplexing (OFDM) into cognitive radio (CR) can potentially increase the spectrum efficiency, but it also leads to further challenges for the resource allocation of CR networks. In OFDM‐based cognitive relay networks, two of the most significant research issues are subcarrier selection and power allocation. In this paper, a non‐cooperative game model is proposed to maximize the system throughput by jointly optimizing subcarrier selection and power allocation. First, taking the direct and relay links into consideration, an equivalent channel gain is presented to simplify the cooperative relay model into a non‐relay model. Then, a variational inequality method is utilized to prove the existence and uniqueness of the Nash equilibrium solution of the proposed non‐cooperative game. Moreover, to compute the solution of the game, a suboptimal algorithm based on the Lagrange function and distributed iterative water‐filling algorithm is proposed. The proposed algorithm can jointly optimize the process of subcarrier selection and power allocation. Finally, simulation results are shown to demonstrate the effectiveness of the proposed joint subcarrier selection and power allocation scheme. Copyright © 2015 John Wiley & Sons, Ltd.     

Multicast resource allocation with min-rate requirements in OFDM systems

This article addresses the multicast resource allocation problem with min-rate requirement constraints in orthogonal frequency division multiplexing (OFDM) systems. Due to the prohibitively high complexity for nonlinear and combinatorial optimization, the original problem is relaxed and reformulated to form a standard optimization problem. By theoretical derivation according to the Karush-Kuhn-Tucker (KKT) conditions, two propositions are presented as the necessary criteria for optimality. Furthermore, a two-step resource allocation scheme, including subcarrier assignment and power allocation, is proposed on a basis of the propositions for practical implementation. With the min-rate based multicast group order, subcarriers are assigned in a greedy fashion to maximize the capacity. When subcarrier assignment is determined, the proposed power allocation can achieve the optimal performance for the min-rate constrained capacity maximization with an acceptable complexity. Simulation results indicate that the proposed scheme approximates to optimal resource allocation obtained by exhaustive search with a negligible capacity gap, and considerably outperforms equal power distribution. Meanwhile, multicast is remarkably beneficial to resource utilization in OFDM systems.     

Discrete polynary coding immune clonal selection‐based joint subcarrier and power allocation in uplink cognitive OFDM network

Cognitive radio has been considered to be one of the main technologies to solve the problem of low spectrum utilization, while the adaptive allocation of network resource is one of the key technologies. A discrete polynary coding immune clonal selection (DPICS)‐based joint subcarrier and power allocation algorithm is proposed to solve the resource allocation problem in uplink cognitive OFDM networks. The novelties of DPICS include the following: A unique coding method is adopted to deal with multi‐value discrete variables. Compared with the traditional methods, the proposed method can acquire the shortest code. Meanwhile, the constraints of the subcarrier allocation are avoided. A heuristic mutation scheme is used to direct the mutation. Subcarriers are reallocated randomly to the secondary users with larger homotactic noise, which has a large probability to produce the optimal solution and improves the searching process. Subcarriers and power are allocated simultaneously, which is different with the traditional biphasic resource allocation algorithms. The biphasic resource allocation algorithms cannot acquire the subcarrier allocation result and power allocation result simultaneously, which makes the final result imprecise. The proposed algorithm avoids this situation and improves the accuracy of the final result. Compared with state‐of‐the‐art algorithms, the proposed algorithm is shown as effective by simulation results. Copyright © 2014 John Wiley & Sons, Ltd.     

Resource optimization in distributed cooperative multi-relay system based on STBC-OFDM

On the basis of the amplify-and-forward relaying mode, a two-hop distributed cooperative multi-relay system is proposed combining with the space-time block coding OFDM (STBC-OFDM) technique. Taking the maximum end-to-end data rate as optimization criterion, the signal-to-noise ratio (SNR) of receiving terminal is deduced. On the basis of the water-filling theory, the optimal power allocation (OPA) is achieved for each subcarrier in each antenna and each relay node (RN) of the two-hop, to realize the resource optimization. Monte Carlo method is adopted in simulation. The simulation results show that compared with the uniform resource allocation scheme, the proposed OPA strategy can improve the system capacity. And the energy consumption of each transmission bit will be decreased, indicating the improvement of resource efficiency. In the scenario that the total power is limited, the system performance can be enhanced further by the distributed cooperative multi-relay through the diversity gain.     

An ARQ mechanism considering resource and traffic priorities in cognitive radio systems

In multi-hop relaying systems that have many relay stations (RSs), a cognitive radio (CR) technique can improve system performance greatly, due to an efficient resource sharing between the RSs. In this letter, the performance of an ARQ mechanism for CR-based multi-hop relaying systems is studied, using Markov chain and matrix signal flow graph (MSFG) techniques. Also, a priority-based resource allocation scheme is proposed to prevent performance degradation caused by the usage of unstable resources acquired by the CR technique.