基于萤火虫算法的多中继功率分配

为了充分实现中继协作,降低多中继协作通信系统功率分配优化问题的计算复杂度,提出了基于萤火虫算法的多中继功率分配方案。在一定的总功率和节点功率约束下,以最大化平均信噪比为优化目标函数,建立了多中继协作系统的功率分配最优化模型。选取该目标函数作为萤火虫的适应度函数,用向量表示萤火虫的状态,该向量的维数为待分配源节点和中继节点的个数,通过萤火虫聚集得到种群中最好的萤火虫,即可获得渐进最优功率分配。仿真结果表明,与平均功率分配相比,基于萤火虫算法的功率分配方案能降低2.44%~6.17%的比特差错率,提高了系统性能。     

协作通信中的中继技术研究

随着无线信道环境的复杂多样,本文引入了协作通信,并探讨了协作通信中的中继节点选择和功率分配两个重要的技术,最后提出了基于中继节点选择和功率分配的联合优化算法。     

一种多源协作网络的分布式功率分配与中继选择算法

该文针对多源-多中继放大转发协作通信网络,以最小化系统总功率为目标,在保证系统满足一定中断概率的前提下,提出了一种分布式功率分配与中继选择算法.算法由源节点自主选择为其转发信息的中继节点,并引入定时器,通过竞争方式避免了分布式所导致的中继选择冲突.中继收到来自源节点的信号后,只需根据转发门限自主判断是否进行转发,从而完成传输.仿真结果表明该分布式算法能够有效降低传输所需要的总发射功率.并且与集中式控制所获得的最优中继选择与功率分配算法相比性能相近,但所提分布式算法显著降低了系统的控制开销.     

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

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

双向能量协作的中继系统功率分配算法

在无线中继系统中,考虑源节点和中继节点都是能量采集的,而源与中继之间可以进行能量协作,即可双向传递能量,针对瑞利衰落信道场景以最大化系统吞吐量为目标,联合优化源节点的发射功率、中继节点的发射功率以及传递的能量值,提出了双向能量传递的最优功率分配算法。本文根据场景模型建立了最优化问题,利用凸优化知识求得最优解的形式,假设能量传递无损耗情况下提出了理想功率分配方案;然后以此为基础,在满足能量因果性和数据因果性的条件下,对传递的能量和发送的功率进行优化。仿真结果表明,本文提出的双向能量传递的功率分配算法优于其它的功率分配算法,能有效的提高系统吞吐量。      

跨小区多跳中继协作通信的无线通信能效优化 *

针对蜂窝网中某一基站处于体眠状态时引起各用户的通信中断问题,提出利用中继协作通信实现跨小区多跳通信的迭代中继选择算法.该算法是在有多个中继节点可为目的节点提供协作中继时,将源节点到目的节点的数据传输分为3个连续时隙,选择满足目的节点信噪比最大化的中继,以协作效率为依据删除协作效率最小的中继节点,从而逐次优化中继选择结果.仿真结果表明,该算法在跨小区多跳的通信过程中,能选择出协作效率最高的中继节点,减少协作中继的数量,可以减少中继对能源不必要的消耗,改善小区内中继协作效率,在多跳的过程中节省源节点的发射功率,从而达到能效优化的目的.     

基于空时码的协作节点功率分配策略

为了优化协作通信系统的性能,文中提出了一种基于空时编码、以最大化系统互信息量为目标的各节点最优功率分配算法。通过采用凸优化的算法,功率在源节点和中继节点间得到了合理的分配。采用了更接近实际衰落环境的Nakagami模型。理论分析和仿真表明,所提算法能显著提高系统性能和功率效率,因而可以有效地用于协作通信中。     

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

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

一种基于混合智能算法的协作中继选择新方法

针对多用户多中继场景下协作通信系统的中继选择问题,提出了一种基于混合智能算法的协作中继选择新方法。不同于现有的为每个源节点分配一个中继节点的中继选择方法,新方法建立了为每个源节点分配一个或多个中继节点的优化模型,以最大化多用户多中继协作系统的最小接收信噪比为优化目标,采用结合了模拟退火与遗传算法的混合智能算法来搜寻中继选择问题的最优解。仿真结果表明,所提方法可显著提高目的端的接收信噪比,且算法具有较强的全局搜索和快速寻优能力。     

无线并行放大转发中继传输中基于信噪比的功率分配研究

在无线通信网中,高效的功率分配可显著降低资源消耗、获得更好的服务质量、并减少网络内干扰.本文以无线并行中继协作通信系统为背景,在目的节点目标信噪比的约束条件下,对如何最小化中继链路中各通信节点的发射功率进行了研究.文章首先建立了无线中继协作通信系统模型,推导出了无线中继协作通信系统中信噪比的表达式.接着,文章将功率分配...     

Distributed Relay Selection and Power Control for Multiuser Cooperative Communication Networks Using Stackelberg Game

The performance in cooperative communication depends on careful resource allocation such as relay selection and power control, but the traditional centralized resource allocation requires precise measurements of channel state information (CSI). In this paper, we propose a distributed game-theoretical framework over multiuser cooperative communication networks to achieve optimal relay selection and power allocation without knowledge of CSI. A two-level Stackelberg game is employed to jointly consider the benefits of the source node and the relay nodes in which the source node is modeled as a buyer and the relay nodes are modeled as sellers, respectively. The proposed approach not only helps the source find the relays at relatively better locations and "buy” an optimal amount of power from the relays, but also helps the competing relays maximize their own utilities by asking the optimal prices. The game is proved to converge to a unique optimal equilibrium. Moreover, the proposed resource allocation scheme with the distributed game can achieve comparable performance to that employing centralized schemes.     

一种联合中继节点选择的博弈功率控制算法

有效的资源分配在协同通信中占有举足轻重的地位,鉴于此,该文研究了其中的中继节点选择和功率控制问题,提出了一种联合中继节点选择的博弈功率控制算法。它的主要思想是从各节点信噪比的角度建立收益函数,并具体针对源节点和中继节点建立不同的代价函数。在认为每个节点都负责的前提下,通过调整各节点功率达到各自效用的最大化,并依据中继节点发送功率的策略空间,优化参与协同的中继节点集合。同时,该文还对纳什均衡的性能进行了数学分析。从仿真结果可以看出,所提算法在复杂度可接受的前提下,能使各节点间的功率得到合理有效的使用,确能改善系统性能。     

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.     

QoS-guaranteed multi-relay selection and power allocation optimization in cooperative systems

This paper investigates the relay selection and power allocation problem in multi-user based cooperative networks, where intermediate relay nodes help source forward information to destination using decode-and-forward (DF) relaying protocol. Specifically, we propose a novel multi-relay nodes selection strategy taking both instantaneous channel state information (I-CSI) and residual energy into consideration, by which 'emergence' diversity gain can be achieved and the imbalance of resource utilization can be overcome. Besides, using Largangian dual-primal decomposition and subgradient projection approach, an optimal power allocation algorithm at source and cooperative relay nodes is presented with the constraints of each user's individual quality of service (QoS) requirements and system total transmit power. Theoretical analysis and simulation results demonstrate that the proposed scheme can significantly improve energy efficiency, while guaranteeing a good balance between achievable data rate and average network lifetime with relatively low implementation complexity.     

A utility-based capacity optimization framework for achieving cooperative diversity in the hierarchical converged heterogeneous wireless networks

A hierarchical convergence mechanism for the heterogeneous wireless communication system via the heterogeneous cooperative relay node is presented in this paper, in which the techniques of cooperative communication and wireless relay are utilized to improve performances of the individual user and the overall converged networks. In order to evaluate the benefits of the proposal, a utility-based capacity optimization framework for achieving the heterogeneous cooperative diversity gain is proposed. The heterogeneous cooperative capacity, relay selection and power allocation theoretical models are derived individually. The joint optimization model for relay selection and power allocation is presented as well. Owing to the computation complexity, the sub-optimal cooperative relay selection algorithm, the sub-optimal power allocation algorithm and the sub-optimal joint algorithm are determined to approach the maximum overall networks' spectrum efficiency. These proposed algorithms are designed in conformance to guarantee the equivalent transmission rates of the different wireless access networks. The simulation results demonstrate that the utility-based capacity model is available for the heterogeneous cooperative wireless communication system, and the proposed algorithms can improve performances by achieving the cooperative gain and taking full advantage of the cross-layer design. Copyright © 2008 John Wiley & Sons, Ltd.     

Effects of Nodes Geometry and Power Allocation in Space-Time Coded Cooperative Wireless Systems

Cooperative communications are effective in improving the performance and extend the coverage of wireless networks. One issue is to find proper methods to allocate cooperative nodes. In this paper we investigate the effects of relay position and power allocation strategy in cooperative communications employing space-time codes (STCs). We consider non-ideal links between source, relay, and destination enabling the analysis of relay allocation problem based on the performance of each link in realistic scenarios. The frame error rate for various channel conditions, available diversity, relay positions, and transmitted power levels is obtained. Both the situation of balanced and unbalanced transmit power levels for source, relay, and destination are compared. Cooperative pragmatic STCs in block fading channel (BFC) are considered for our analysis. The results provide insight on how to allocate relay nodes based on geometry, link quality, and transmitted power considerations.     

Joint Optimization of Source Power Allocation and Relay Beamforming in Multiuser Cooperative Wireless Networks

Relay beamforming techniques have been shown to significantly enhance the sum capacity of a multiuser cooperative wireless network through the optimization of the relay weights, where concurrent communications of multiple source-destination pairs are achieved via spatial multiplexing. Further optimization of the transmit power allocation over the source nodes is expected to improve the network throughput as well. In this paper, we maximize the sum capacity of a multiuser cooperative wireless network through the joint optimization of power allocation among source nodes and relay beamforming weights across the relay nodes. We consider a two-hop cooperative wireless network, consisting of single-antenna nodes, in which multiple concurrent links are relayed by a number of cooperative nodes. When a large number of relay nodes are available, the channels of different source-destination pairs can be orthogonalized, yielding enhanced sum network capacity. Such cooperative advantage is particularly significant in high signal-to-noise ratio (SNR) regime, in which the capacity follows a logarithm law with the SNR, whereas exploiting spatial multiplexing of multiple links yields capacity increment linear to the number of users. However, the capacity performance is compromised when the input SNR is low and/or when the number of relay nodes is limited. Joint optimization of source power allocation and relay beamforming is important when the input SNR and/or the number of relay nodes are moderate or the wireless channels experience different channel variances. In these cases, joint optimization of source power and distributed beamforming weights achieves significant capacity increment over both source selection and equal source power spatial multiplexing schemes. With consideration of the needs to deliver data from each source node, we further examine the optimization of global sum capacity in the presence of individual capacity requirements by maximizing sum capacity of the network subject to a minimum capacity constraint over each individual user.     

Selection Cooperation in Heterogeneous Cooperative Networks

Selection cooperation is an attractive cooperative strategy for wireless networks due to its simplicity and efficiency. In this paper, we consider a heterogeneous cooperative network consisting of different kinds of nodes with low-cost radios where the activities of one kind of nodes are triggered by the other kinds of nodes. This is a common scenario for many networks, such as wireless sensor networks. By exploiting the transmission relationship between heterogeneous nodes, we propose a selection cooperation protocol where inducing nodes can cooperate with the following nodes after their own transmissions for improving the communication reliability of the latter nodes. Through performance analysis, we show an interesting feature that the diversity-multiplexing tradeoff of the proposed protocol does not rely on the best relay selection method and the protocol always achieves the full diversity gain. We further develop an energy-efficient best relay selection method based on power control where the power consumption is minimized without decreasing the full diversity order. Simulation results demonstrate the good performance of the protocol and the remarkable energy reduction of the proposed best relay selection method.     

Hierarchical modulation-based cooperation utilizing relay-assistant full-duplex diversity

In this paper, we present a hierarchical modulation-based cooperation (HMC) scheme to overcome capacity degradation due to half-duplex transmissions in conventional cooperative relay systems. In the HMC scheme, two relay terminals are used for both transmit and receive operations, i.e., full-duplex transmission. This scheme reduces the required number of time slots for cooperation. Utilizing this cooperative mechanism, the HMC scheme achieves cooperative diversity at the destination node by combining the signals delivered from the source and relay nodes. In addition, we derive a closed form of the end-to-end bit error rate for the HMC scheme, which is utilized to determine an optimal power ratio for hierarchical signals at the source node. In concurrence with the HMC scheme, we develop the best relay selection scheme for a practical wireless communication networks.