能量收集双向中继网络的高能效联合中继选择和功率分配算法

为了实现双向中继系统在满足传输速率要求时的最小功率消耗,基于功率分割中继协议,在完美和非完美的信道估计两种不同的情况下,提出了能量收集双向中继网络的高能效联合中继选择和功率分配算法,得到了两个信源的最优功率分配和中继节点最优的能量收集比例.仿真结果表明,信道估计误差会增加系统的功率消耗;与传统双向中继比较发现,能量收集双向中继能够实现更少的系统功率消耗.     

Energy‐Aware Hybrid Cooperative Relaying with Asymmetric Traffic

In this paper, we study an asymmetric two‐way relaying network where two source nodes intend to exchange information with the help of multiple relay nodes. A hybrid time‐division broadcast relaying scheme with joint relay selection (RS) and power allocation (PA) is proposed to realize energy‐efficient transmission. Our scheme is based on the asymmetric level of the two source nodes’ target signal‐to‐noise ratio indexes to minimize the total power consumed by the relay nodes. An optimization model with joint RS and PA is studied here to guarantee hybrid relaying transmissions. Next, with the aid of our proposed intelligent optimization algorithm, which combines a genetic algorithm and a simulated annealing algorithm, the formulated optimization model can be effectively solved. Theoretical analyses and numerical results verify that our proposed hybrid relaying scheme can substantially reduce the total power consumption of relays under a traffic asymmetric scenario; meanwhile, the proposed intelligent optimization algorithm can eventually converge to a better solution.     

分布式双向中继选择算法及用户功率分配

针对放大转发的瑞利双向中继信道的节点选择问题,提出了基于部分信道信息的分布式双向中继选择算法。算法通过计算双向链路的接收信噪比,推导出满足目标接收信噪比的转发阈值,各中继节点根据该阈值决定是否参与转发,从而实现分布式选择。此外,考虑用户总功率受限的情况,在分布式中继选择基础上提出了优化功率分配策略,使双向信道的接收信噪比更加接近。仿真结果表明,分布式中继选择算法与最优多中继算法的系统传输速率相似,计算复杂度大大降低,尤其是在中继数目增大的情况下更加明显。优化功率分配策略能进一步提高系统能量效率,在相同性能下可节省7%左右的功率。     

Cognitive Bidirectional Buffer-Aided DF Relay Networks: Protocol design and Power Allocation

In this paper, we consider bidirectional decode-and-forward buffer-aided relay selection and transmission power allocation schemes for underlay cognitive radio relay networks. First, a low complexity delay-constrained bidirectional relaying protocol is proposed. The proposed protocol maximizes the single-hop normalized sum of the primary network (PN) and secondary network (SN) rates and controls the maximum packet delay caused by physical layer buffering at relays. Second, optimal transmission power expressions that maximize the single-hop normalized sum rate are derived for each possible transmission mode. Simulation results are provided to evaluate the performance of the proposed relaying protocol and transmission power allocation scheme and compare their performance with that of the optimal scenario. Additionally, the impacts of several system parameters including maximum buffer size, interference threshold, maximum packet delay and number of relays on the network performance are also investigated. The results reveal that the proposed bidirectional relaying protocol and antenna transmission power allocation schemes introduce a satisfactory performance with much lower complexity compared to the optimal relay selection and power allocation schemes and provide an application dependent delay-controlling mechanism. It is also found that the network performance degrades as the delay constraint is more restricted until it matches the performance of conventional unbuffered relaying with delay constraints of three. Additionally, findings show that using buffer-aided relaying significantly enhances the SN performance while slightly weakens the performance of the PN.     

Adaptive Path Selection Scheme with Combining for Multiple Relaying Cooperative Communications Networks

In future communications, cooperative communications with relay networks will be one of the most effective schemes to enlarge the coverage area and to boost the data rate. In the recent research results, the path selection, power allocation, and relay protocols on relay networks are the most important factors to improve the system performance. However, the channel quality of the direct transmission path and the relaying path has an influential effect on the performance of relay networks. Therefore, in this paper, we propose a best relaying path selection (BRPS) scheme to obtain the path diversity to improve the system capacity and data rate for cooperative networks (CNs). Simulation results show that the more the relay nodes are selected, the lower the bit error rate (BER) is. The proposed BRPS scheme obtains a high concession between both BER and system capacity for CNs.     

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.     

Impact of loop-back interference and channel estimation errors on full-duplex relay networks

This paper investigates the rate performance of full-duplex (FD) relay systems under the effect of channel estimation error and residual loop-back interference. The study considers both one-way and two-way amplify and forward (AF) relaying schemes. Power allocation techniques, applied at the sources and the relay, are proposed and shown to be effective that leads to near optimal solution. Comparison between the half-duplex (HD) and FD systems using optimum power allocation are made. Also, the impact of channel estimation error and loop-back interference on the rate of FD transmission are compared. It is shown that the destructive effect of loop-back interference dominates the effect of channel estimation error. Finally, assuming a bidirectional network, the performance of two-way analog network coding (ANC) scheme is compared to the plan of using two one-way AF relaying connections. The results show that it is better to use FD ANC for low transmission power and HD one for high power than using two one-way relaying schemes.     

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.     

D2D communications with subchannel reusing for throughput‐guaranteed relay selection in LTE

Using full‐duplex relaying in device‐to‐device (D2D) communication, spectrum efficiency can be further improved as compared with traditional half‐duplex relaying. Due to the increasing demands for more system capacities and higher data rate, a throughput‐guaranteed and power‐aware relay selection mechanism is essential so that services can be successfully accomplished within tolerable power consumption. It is also imperative to prevent cellular users from interfering and preserve resources for more users at the same time. In current paper, we proposed an efficient relay selection scheme with subchannel reusing. Using the nonconflict group discovery algorithm, firstly, we divided D2D pairs into different groups based on the neighbor lists of all the devices. The D2D pairs in the same group were considered nonconflictive. By building a matrix that represents the power consumption of D2D transmission peers through relays, we proposed a group‐oriented relay selection scheme based on the Hungarian method allowing subchannel reuse over relay‐assisted D2D networks. Applying this mechanism, different D2D pairs are able to transmit messages at the same subchannel, whenever they are in the same group. Better throughput and spectrum usage than currently available relay selection schemes without subchannel reusing can be obtained. Particularly, more D2D pairs in high dense networks can be accommodated, and spectrum resources can be better preserved. The simulation results showed that our proposed mechanism can improve the total throughput by up to 35% as compared with an existing relay selection scheme without subchannel reusing, called as PRS‐D2D, when most D2D pairs are in a few groups.     

衰落信道下基于中继选择与功率控制的节能协作通信

In order to save energy and make more efficient use of wireless channel, this article puts forward an energy saving cooperative relaying scheme which actuates the cooperative transmission only when the feedback from the destination indicates failure of the direct transmission. The proposed scheme selects the optimal relay and its corresponding transmission power in each time slot based on channel condition and residual energy with the objective of minimizing energy consumption and extending network lifetime. In the study, the finitestate Markov channel model is used to characterize the correlation structure of channel fading in wireless networks, and the procedure of relay selection and transmission power decision is formulated as a Markov decision process. Numerical and simulation results show that the proposed scheme consumes less energy and prolongs the network lifetime.     

Optimal Resource Allocation for Two-Way Relay-Assisted OFDMA

This paper studies the resource allocation problem for the relay-assisted orthogonal frequency-division multiple-access (OFDMA)-based multiuser system. A new transmission protocol, named hierarchical OFDMA, is proposed to support two-way communications between the base station (BS) and each mobile user (MU) with or without an assisting relay station (RS) in “relay” or “direct” mode, respectively. In particular, the recently discovered two-way relaying technology, based on the principle of network coding, is applied to MUs in relay mode with two possible relay-operations, namely, decode-and-forward (DF) and amplify-and-forward (AF). By applying convex optimization techniques, efficient algorithms are developed for optimal allocation of transmit resources such as power levels, bit rates, and OFDM subcarriers at the BS, RSs, and MUs. Simulation results show that substantial system throughput gains are achievable by the proposed two-way relaying and optimal resource allocation schemes over the traditional one-way relaying and fixed resource allocation schemes for relay-assisted OFDMA-based wireless networks.      

Energy efficiency optimization of one-way and two-way DF relaying considering circuit power

In this paper, the energy efficiency (EE) of a decode and forward (DF) relay system is studied, where two sources communicate through a half-duplex relay node in one-way and two-way relaying strategies. Both the circuitry power and the transmission power of all nodes are taken into consideration. In addition, three different coding schemes for two-way DF relaying strategy with two phases and two-way DF relaying with three phases are considered. The aim is to maximize the EE of the system for a constant spectral efficiency (SE). For this purpose, the transmission time and the transmission power of each node are optimized. Simulations are used to compare the EE–SE curve of different DF strategies with one-way and two-way amplify and forward (AF) strategies and direct transmission (DT), to find the best energy efficient strategy in different SE conditions. Analytical and simulation results demonstrate that in low SE conditions, DF relaying strategies are more energy efficient compared to that of AF strategies and DT. However, in high SE conditions, the EE of two-way AF relaying and DT strategy outperform some of the DF relaying strategies. In simulations, the impact of different circuitry power and different channel conditions on the EE–SE curves are also investigated.     

Optimised secure transmission through untrusted AF relays using link adaptation

A new transmission scheme is presented for a two-hop relay network including two AF relays, considering physical layer security where relays are not able to detect signal with an acceptable bit error rate (BER) but the combined received signal is detected with an acceptable BER at the final receiver. It is assumed that there is no direct path between the transmitter and the receiver (relay network without diversity). Adaptive modulation and coding is utilised at the transmitter and transmission powers of the transmitter and of the relays are continuously adapted provisioning individual average power constraint for each node. Numerical evaluations show that an acceptable performance degradation is seen by the proposed secure relaying scheme compared to the optimum relay selection scheme without security constraint.     

放大转发中继网络中的一种中继选择方案

提出了一种放大转发网络中的中继选择方案,假设目的节点配置多个天线,源节点和所有中继节点都配置单个天线,方案选择一组中继同时在相同的频带上放大转发接收到的源节点信息以最大化接收信噪比。与只择一个最优中继的方案相比,方案在保持满分集阶数的情况下获得了更高的中断容量和更优的误符号率性能。与只选择一个最优中继的方案相比,在0.000 01的误符号率水平上,少需要发射功率1.6 dB。     

两阶段中继选择策略下SWIPT-CR-NOMA网络的中断性能分析

针对采用无线携能传输(SWIPT)的多中继协作底层认知NOMA网络,提出一种基于NOMA和串行干扰消除协议的两阶段中继选择策略(TSRS),次级网络源节点和所选中继采用相同的功率分配生成多用户叠加信号,中继只利用采集能量提供解码转发服务。推导了用户中断概率的闭合表达式,进行了蒙特卡洛仿真验证,分析了功率分配因子、能量分裂参数、干扰温度限和中继数量等系统参数对中断性能的影响。仿真结果表明,所提方案可显著提升协作系统中断性能。      

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.     

Joint resource allocation,routing and CAC for uplink OFDMA networks with cooperative relaying

In this paper, we propose a joint resource allocation, routing, and connection admission control (CAC) scheme for uplink transmission in orthogonal frequency division multiple access (OFDMA) relay networks with cooperative relaying. For cooperative relaying, relay station can relay uplink data from mobile station (MS) to base station with cooperation of the MS using transmit diversity. Transmit diversity can be achieved by virtual MISO via distributed space–time coding. The proposed scheme jointly allocates OFDMA resources and selects path for each user with CAC to maximize the upink throughput of cooperative OFDMA relay networks. The basic OFDMA resource unit is considered as a resource element which is one subcarrier over one OFDMA symbol. An efficient multi-choice multi-dimensional knapsack (MMKP) algorithm is presented for the proposed scheme. The proposed MMKP algorithm provides a unified framework which is applicable to OFDMA networks with and without cooperative relaying. We evaluate the performance of the proposed scheme with and without cooperative relaying in a hilly terrain with heavy tree density by using OPNET-based simulation. We show that the cooperative relaying improve the uplink system throughput compared with non-cooperative relaying, and the proposed scheme outperforms the conventional link quality-based scheme in both cooperative and non-cooperative relay networks.     

Opportunistic Relay Selection in Cooperative Systems With Dirty-Paper Coding

This paper investigates an optimization of the conventional relay selection for multirelay environments. In contrast with previously reported selection schemes, where a selected relay accesses the channel in a dedicated cooperative slot, the proposed scheme recovers the bandwidth loss of the half-duplex constraint by allowing two relays to simultaneously access the channels. Based on an appropriate dirty-paper coding (DPC) technique among relays, the proposed scheme enables a relay to establish communication with the destination at the same time that another relay forwards the data from the source. It is proven that the interplay between relay selection and the superposition DPC weight factor provides a tradeoff between relaying and new data performance. Hence, an appropriate codesign of the superposition DPC parameter and opportunistic relay selection can achieve efficient communication for the new data without affecting the relaying performance. The proposed scheme is compared with conventional relaying approaches, and its enhancements are provided through theoretical studies and numerical results.      

全双工中继协作下的移动边缘计算系统能耗优化算法

为缓解终端设备处理大数据量、低时延业务的压力,该文提出一种基于全双工中继的移动边缘计算网络资源分配算法。首先,在满足计算任务时延约束、用户最大计算能力、用户和中继的最大发射功率约束条件下,考虑中继选择与子载波分配因子、用户任务卸载系数、用户与中继的传输功率的联合优化,建立了系统总能耗最小化问题。其次,利用交替迭代和变量代换的方法,将原非凸问题分解为两个凸优化子问题,并利用内点法和拉格朗日对偶原理分别进行求解。仿真结果表明,所提算法具有较低的能量消耗。     

Wireless information and power transfer using single and multiple path relays

A relay‐based wireless communication model can relay information along with the power bidirectionally using the amplify‐and‐forward scheme. This paper studies such model extensively. Three information and power relaying protocols, that is, time‐based switching relaying, power‐based splitting relaying, and hybrid time switching‐based and power splitting‐based relaying (HTPSR) are used to carry forward bidirectional information and power transfer. First, a solo relay model is studied, for which, we derived a throughput expression for end‐to‐end information transfer, and this is done for all the three relaying protocols. The paper indicates that the system throughput depends upon the time switching and the power splitting ratio. Further, to make the system more reliable and robust, multiple relays are used in the path. Various relay selection schemes are used for path selection in each transmission, thereby yielding different throughput performances. The results show that an optimal throughput is obtained for a given relay location at an optimal set of values of splitting and switching ratio. Moreover, the HTPSR outperforms both the power splitting and time switching protocol in system throughput performance for a single as well as a multiple‐relay model. Whereas, in relay selection schemes, the best SNR selection scheme outperforms in all the schemes used. The simulated results confirm that the system throughput is an active function of relay placement.