异构无线通信系统的融合机制和协同功率分配算法研究

该文提出了一种基于协同通信和无线中继技术的融合机制,以实现异构无线接入网的互联互通和融合。为了最大化所提异构协同网络方案的协同容量,从理论上给出了协同功率分配优化理论模型,并介绍了一种不同于传统注水理论的基于效用函数的协同功率分配算法,该算法在合理设置发射功率保证第1跳和第2跳链路的传输速率匹配的前提下能够优化系统性能。仿真结果表明所提协同功率分配算法有显著的性能增益。     

基于中断概率的协作通信中继选择与功率分配算法

研究了功率受限情况下多中继协作通信网络的中继选择和功率优化问题。在AF网络中,提出了一种低复杂度中继选择与功率分配算法,其目标是在总功率一定的条件下使系统的中断概率最小。本算法对源节点和所有潜在中继节点进行功率分配,结合当前信噪比选择最优的中继集合,通过最速下降法求出使系统中断概率最低的功率分配因子。该算法不需要知道大量瞬时信道信息、不需要系统在等功率条件下进行中继选择,只需求得中继节点排列矩阵便可根据当前信噪比自适应获得最优中继节点集合。仿真结果表明,在相同条件下,该算法明显优于不同中继节点集合下几种算法的中断性能,并且与传统的SAF及AAF算法相比,有效降低了中断概率,提升了系统性能和功率效率。     

一种多中继协作系统中的功率分配算法

提出了多中继无线通信系统的模型,研究其源节点和各中继节点间功率分配对系统容量的影响,在总功率一定的情况下,探讨了以容量最大化为准则的功率分配算法。对采用非再生协作中继方式的多中继协作通信系统进行了容量分析,并提出了一种低复杂度的最优功率分配算法(Optimum Power Allocation,OPA)。仿真结果表明,该算法相对于平均功率分配算法(Average Power Allocation,APA),系统容量得到了显著提高,在信道条件差的情况下,性能提高更明显。     

最小功耗的中继选择与功率分配的联合优化

研究采用放大转发协议的单向和双向中继网络中的中继选择与功率分配的联合优化策略。该策略以一定服务质量(QoS)要求为约束条件,以最小化中继网络中各节点的总功率为目标,建立优化问题。运用凸优化技术,得到了该优化问题的闭合解。仿真结果表明在满足相同的QoS要求下,该最优联合策略较传统的随机选择与等功率分配策略具有较低的功率消耗。     

一种基于非正交信道的分布式中继选择及功率分配方法

针对非正交两跳多中继协作通信系统中的分布式中继选择问题,提出了一种基于非正交信道的中继选择准则,简化了系统的设计。分析了其误码率性能,给出了其解析表达式和以总功率为约束条件下的最优功率分配方案。仿真结果表明,最佳中继选择准则明显优于传统的中继选择准则,且在最优功率分配方案下,可以获得明显的分集增益,系统的误码率显著下降。     

Optimal power‐aware relay placement for cooperative wireless sensor networks

We study the problem of optimizing the symbol error probability (SEP) performance of cluster‐based cooperative wireless sensor networks. Recent studies in literature show that an efficient relay selection protocol based on simple geographical information of the nodes to execute cooperative diversity can significantly improve the SEP performance at the destination of such networks. As well, similar line of research on optimal power allocation (for the source and relay nodes) can be found in literature. However, to achieve the best SEP performance at the destination of a cooperative wireless sensor network, joint optimization of power allocation and relay placement should be accomplished. To this aim, we reformulate the SEP of a multi‐hop cooperative communication in a general form and optimize transmitted power level and relay placement simultaneously. This analysis is developed for both amplify‐and‐forward and decode‐and‐forward relaying protocols. Simulation results demonstrate that the proposed joint optimization can effectively improve the SEP performance of the network. Copyright © 2013 John Wiley & Sons, Ltd.     

改进蛙跳算法的多中继协作系统最优功率分配

协作通信与直接通信相比能够显著地提高系统性能,功率分配是协作通信中的一个关键问题。为了获得合理的协作中继通信系统功率分配方案,提出一种基于改进蛙跳算法的多中继节点功率分配方法。首先对功率分配问题进行分析,将其转换为一个非线性优化问题,然后将青蛙表示为源节点,中继节点的功率,以平均信噪比作为青蛙的食物,并通过青蛙的信息交流和协作找到最优的功率分配方案,最后采用仿真对比实验对本文算法性能进行测试。仿真结果表明,相对于其它功率分配方法,改进蛙跳算法有效地提高了系统的信道容量,降低了中断概率,以较低的复杂度提高了系统的性能。     

Energy-efficient relay selection and optimal relay location in cooperative cellular networks with asymmetric traffic

Energy-efficient communication is an important requirement for mobile relay networks due to the limited battery power of user terminals. This paper considers energy-efficient relaying schemes through selection of mobile relays in cooperative cellular systems with asymmetric traffic. The total energy consumption per information bit of the battery-powered terminals, i. e. , the mobile station(MS)and the relay, is derived in theory. In the joint uplink and downlink relay selection(JUDRS)scheme we proposed, the relay which minimizes the total energy consumption is selected. Additionally, the energy-efficient cooperation regions are investigated, and the optimal relay location is found for cooperative cellular systems with asymmetric traffic. The results reveal that the MS-relay and the relay-base station(BS)channels have different influence over relay selection decisions for optimal energy-efficiency. Information theoretic analysis of the diversity-multiplexing tradeoff(DMT)demonstrates that the proposed scheme achieves full spatial diversity in the quantity of cooperating terminals in this network. Finally, numerical results further confirm a significant energy efficiency gain of the proposed algorithm comparing to the previous best worse channel selection and best harmonic mean selection algorithms.     

Power allocation of cooperative amplify-and-forward communications with multiple relays

Cooperative diversity is one of the most effective ways to mitigate the fading effect of wireless channels and obtain the spatial gain in wireless networks.In this paper,an optimal power allocation(OPA)scheme for a cooperative communication system using the amplify-and-forward(AF)transmit strategy with multiple relay users is proposed by minimizing the bit-error-rate(BER)at the destination under the constraint of the total transmit power of both the source user and the relay users.Simulation results indicate that the proposed power allocation method can achieve significant BER performance improvement than using the equal power allocation(EPA)scheme,while still attains low complexity.The system performance is improved significantly with the increasing of the number of relay users at high signal-noise ratio(SNR).However,at low SNR,the system performance decreases when the relay number increases.Thus,an adaptive relay selection scheme may be used to choose the appropriate relay numbers in different transmission scenarios to provide system performance improvement and keep the power allocation scheme with low complexity.     

无线协作网络中基于数据传输需求的分布式功率控制

在未来无线通信网络中,协作通信的性能依赖于通信资源的有效分配,比如中继选择和功率控制等.在本文中,我们建议了一个分布式买者和卖者博弈理论框架,以满足用户链路质量需求为基础,解决多用户协作通信中最优化中继选择和功率控制.本文联合考虑了源节点和中继节点的功率分配,进而优化源节点和中继节点的收益.这里提出的方法不仅有助于源节点找到相对位置较好的中继节点以及在源和中继之间进行最优化功率分配从而最小化源节点的支付,而且有助于相互竞争的中继节点提供优化的价格以最大化它们各自的收益.此外,这里的优化价格可以仅由局部信道状态信息和其他节点的能量价格决定.如果获得的中继节点总数增加,全网的能量消耗会更低.     

Stackelberg game theoretic pricing algorithm for bandwidth allocation in cooperative access

Cooperative access among user devices by sharing wireless access bandwidth opens a new paradigm in heterogeneous networks.However,how to stimulate cooperative relay nodes forwarding service data for others and allocating corresponding bandwidth to support it are two key issues in the cooperative access.This paper proposes a Stackelberg game based framework which is benefit participants including relay nodes and client nodes.This framework generalizes the pricing based bandwidth allocation algorithm by the Stackelberg game model,which optimizes the profit of the cooperative relay nodes while guaranteeing the bandwidth requirements of client nodes.We transform the profit maximization problem into a convex problem and solve it using the convex optimization method.The simulation results demonstrate that the proposed framework and corresponding algorithms outperform the bidding weight proportional fairness and fixed value bandwidth allocation ones significantly.     

基于网络编码的无线网络分布式协作通信机制

 本文提出了一种基于无线网络编码的协作通信机制NCCC.无线网络编码能够在取得合作分集的性能增益的同时,降低网络中断概率.分布式中继节点选择算法是NCCC机制的核心,该算法根据即时信道状态,选择执行网络编码操作的最优中继节点.理论和仿真结果证明, NCCC机制可以提高无线网络双向多信源多信宿传输的性能和鲁棒性.     

Optimization scheme with pre-processing for cooperative relay multicast networks in cellular system

For cooperative relay multicast networks, the general cross-layer optimization approaches converge to the global optimal value slowly because of the large quantity of relay terminals. However, the mobility of relay terminals requires quick converging optimization strategies to refresh the relay links frequently. Based on the capacity analysis of multiple relay channels, an improved cross-layer optimization scheme is proposed to resolve this problem, in which the bound of the relay selecting region is determined as a pre-processing. Utilizing the primal-dual algorithm, a cross-layer framework with pre-processing optimizes both the relay terminal selection and power allocation with quick convergence. The simulation results prove the effectiveness of the proposed algorithm.     

Nelder‐Mead–based power optimization for secrecy enhancement in amplify‐and‐forward cooperative relay networks

Cooperative communication based on relaying nodes has been considered as a promising technique to increase the physical layer security (PLS) performance in wireless communications. In this paper, an optimal power allocation (OPA) scheme based on Nelder‐Mead (NM) algorithm is proposed for improving the secrecy rate of amplify‐and‐forward (AF) cooperative relay networks employing cooperative jamming (CJ) scheme. The proposed hybrid jamming scheme allows the source and selected relay to transmit the jamming signal along with the information to confound the eavesdropper. The path selection probability of ant colony optimization (ACO) algorithm is used for selecting the relay for transmission. The performance based on secrecy rate is evaluated for “n” trusted relays distributed dispersedly between the source and destination. Gradient‐based optimization and three‐dimensional exhaustive search methods are used as benchmark schemes for comparison of the proposed power optimization algorithm. The secrecy performance is also compared with conventional AF scheme and CJ scheme without power optimization (EPA). The impact of single and multiple relays on secrecy performance is also evaluated. Numerical results reveal that, compared with the gradient method and exhaustive search algorithm, the proposed power allocation strategy achieves optimal performance. Also, the derived OPA results show a significantly higher secrecy rate than the EPA strategy for both CJ and AF schemes.     

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

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

Cooperative communications with relay selection for wireless networks: design issues and applications

Relay selection schemes for cooperative communications to achieve full cooperative diversity gains while maintaining spectral and energy efficiency have been extensively studied in a recent research. These schemes select only the best relay from multiple relaying candidates to cooperate with a communication link. In the present paper, we reviewed recently proposed cooperative communication protocols that integrate with relay selection mechanisms. The key design issues for relay selection mechanisms, for example, relaying candidate selection, optimal relay assignment, and cooperative transmission, were identified. We further discussed the challenges of optimal relay assignment in multi‐hop wireless sensor networks and presented the potential applications of cooperative communications with a relay selection in such networks. Future research directions were outlined, for example, the issues of service differentiation and system fairness in cooperative communication systems and the joint use of game theory and adaptive learning techniques in relaying candidate selection and optimal‐relay assignment mechanisms for efficient allocation of network resources. Copyright © 2011 John Wiley & Sons, Ltd.     

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.     

双向协作系统的中继选择和功率分配策略

针对瑞利衰落信道下双向多中继协作通信系统,为了降低中断概率,提出了一种基于最小化中断概率的中继选择策略和功率分配方案。首先联合考虑两条链路的中继节点处信噪比和信道增益实现双链路中继选择,然后推导出一种新的最优中继下双向放大转发协作中断概率的近似表达式上界,并利用凸优化求解得到使中断概率最小的最优功率分配解。仿真结果表明,与现有策略相比,提出的策略能够明显降低系统中断概率和误码率,显著提高系统性能。     

协作通信系统的中继选择算法研究

协作通信作为一种新颖的无线通信技术,它的主要思想是通过中继节点参与协作传输,在目的端获得两个或者多个在空间上独立的信号样本,实现空间分集,获得分集增益.因此如何合理选择中继节点成为协作通信的关键问题之一.本文在协作通信模型及原理的基础上,对基于信道状态信息的中继选择算法进行了介绍,并对具体的选择算法的性能进行了仿真.     

基于深度强化学习的协作通信中继选择

协作通信是无线传感器网络(Wireless Sensor Network,WSN)实现数据可靠传输的关键技术,而协作通信技术的关键在于中继方案的选择。为此,提出了一种基于深度强化学习的协作通信中继选择算法(Deep Q-Learning Based Relay Selection Scheme,DQ-RSS)。首先,将WSN中具有中继选择的协作通信过程建模为马尔科夫决策过程,并采用Q学习在未知网络模型的情况下获取最佳中继选择策略;其次,针对高维状态空间下Q学习收敛时间长的问题,采用DQN(Deep-Q-Net)算法来加速Q学习的收敛。对比仿真实验结果表明,DQ-RSS在中断概率、系统容量和能耗方面均优于现有的中继选择方案,且能够有效节省收敛时间。