Performance of AF Relay Networks with Multiple Relays and Multiple Antennas at Destination Using MRC Combining

Cooperative networking schemes in wireless networks provide cooperative diversity gain using differently located antennas that combat fadings induced by multipath propagation. In this paper, we present the optimal weight design for the destination in AF (Amplify and Forward) relay system, where the optimally designed MRC (Maximum Ratio Combining) is employed at the destination for S→D link (direct link between source and destination) and R→D links (indirect links between relays and destination). We investigate the BER performance of 1S→NR→LD system composed of one source, N relay nodes equipped with single antenna and one destination node equipped with L antennas, which also includes 1S→1R→LD and 1S→NR→1D. Simulation and numerical results are presented to verify our analysis.

Optimum Relay Location in Cooperative Communication Networks with Single AF Relay

In recent years cooperative diversity has been widely used in wireless networks. In particular, cooperative communication with a single relay is a simple, practical technology for wireless sensor networks. In this paper, we analyze several simple network topologies. Under the condition of equal power allocating, the optimum relay location of each network topology are respectively made sure by using symbol error rate (SER) formula. And these types of topologies are compared, the analysis results show that, linear network topology has the best system performance, the system performance of isosceles triangle topology is better than that of equilateral triangle topology.

PERFORMANCE ANALYSIS OF TWO-WAY AMPLIFY-AND-FORWARD RELAYING SYSTEM WITH MULTIPLE INTERFERERS AT THE RELAY

In this paper,we investigate the performance of the two-way Amplify-and-Forward(AF) relaying systems in an interference-limited Rayleigh fading environment.More specifically,assuming the presence of Rayleigh faded multiple interferers at the AF relay and noisy sources,an approximate closed-form expression for the Overall Outage Probability(OOP) and an integral expression for the average Symbol Error Probability(SEP) are derived.The analysis results are verified through com-parison with the Monte Carlo simulation results.

CHANNEL ESTIMATION TECHNIQUE IN MULTI-ANTENNA AF RELAY COMMUNICATION SYSTEMS

The channel estimation technique is investigated in OFDM communication systems with multi-antenna Amplify-and-Forward(AF) relay.The Space-Time Block Code(STBC) is applied at the transmitter of the relay to obtain diversity gain.According to the transmission characteristics of OFDM symbols on multiple antennas,a pilot-aided Linear Minimum Mean-Square-Error(LMMSE) channel estimation algorithm with low complexity is designed.Simulation results show that,the proposed LMMSE estimator outperforms least-square estimator and approaches the optimal estimator without error in the performance of Symbol Error Ratio(SER) under several modulation modes,and has a good estimation effect in the realistic relay communication scenario.

Optimal cooperative beamforming design schemes for AF MOMO two-way relay channels

In this paper,beamforming parameters in multiple input multiple output(MIMO) two-way relay channels(TWRCs) are designed.We investigate three communicating scenarios,in which,the source nodes are all equipped with multiple antennas.In the first scenario,one pair of source nodes are communicating with each other under the help of a single multi-antenna equipped relay.A centralized scheme is correspondingly developed where the optimal relay beamforming(RaB) is jointly designed with the transmit beamformings(TBs) and the receive beamformings(RcBs) at both source nodes to minimize the sum of mean square errors(SMSE).In the second scenario,one pair of users in the first scenario is extended to multi-pair of source nodes.We derive a general expression of the optimal RaB matrix of this scenario in the second scheme,and based on which,a RaB matrix is designed to cancel the inter-pair interference(IPI) and to minimize the intra-pair SMSE.At last,we consider a distributed scenario where multiple single-antenna equipped relays are helping the communication between one pair of source nodes.In the scheme associated with this scenario,beamformings are developed under relay total power constraint and relay individual power constraint,respectively.The simulation results reveal that beamformings at source and relay nodes significantly improve the performance in the sense of average bit error rate(BER).The proposed multi-pair scheme has made superior progress in BER performance because it not only can cancel the IPIs but also can balance the useful signal and the noise at each user.Moreover,in one-pair scenarios,the performance of the centralized scheme is better than the distributed one,but the latter is nevertheless much more practical.

Greedy Algorithm Applied to Relay Selection for Cooperative Communication Systems in Amplify-and-Forward Mode

Using a relaying system to provide spatial diversity and improve the system performance is a tendency in the wireless cooperative communications. Amplify-and-forward （AF） mode with a low complexity is easy to be implemented. Under the consideration of cooperative communication systems, the scenario includes one information source, M relay stations and N destinations. This work proposes a relay selection algorithm in the Raleigh fading channel. Based on the exhaustive search method, easily to realize, the optimal selection scheme can be found with a highly complicated calculation. In order to reduce the computational complexity, an approximate optimal solution with a greedy algorithm applied for the relay station selection is proposed. With different situations of the communication systems, the performance evaluation obtained by both the proposed algorithm and the exhaustive search algorithm are given for comparison. It shows the proposed algorithm could provide a solution approach to the optimal one.

Asymptotic analysis of multi-branch two-way amplify-and-forward relaying in Nakagami-m fading with arbitrary fading parameter

Two-way relay networks have received lots of attention, thanks to its ability to overcome the loss in the spectral efficiency due to half-duplex transmission. Asymptotic performance analysis can provide valuable insights in- to practical system designs. However, this is a gap in two-way relay network. In this paper, the asymptotic performance is studied for multi-branch dual-hop two-way amplify-and-forward （AF） relaying networks in independently but not necessarily identically distributed （i.n.i.d.） Nakagami-m fading channels, with arbitrary m 〉 5. The approximate prob- ability density function （PDF） of the instantaneous dual-hop link power at high SNR region is derived. Then we present the asymptotic outage probability expression, and analyze the diversity order and coding gain. Simulations are per- formed to verify the tightness of the presented analysis at medium and high SNR regions.

UAV-Assisted FSO Communication System with Amplify-and-Forward Protocol under AOA Fluctuations:A Performance Analysis

Free space optical(FSO)communication has recently aroused great interest in academia due to its unique features,such as large transmission band,high data rates,and strong anti-electromagnetic interference.With the aim of evaluating the performance of an FSO communication system and extending the line-of-sight transmission distance,we propose an unmanned aerial vehicle(UAV)-assisted dual-hop FSO communication system equipped with amplifyand-forward protocol at the relay node.Specifically,we consider impairments of atmospheric absorption,pointing errors,atmospheric turbulence,and link interruptions due to angle-of-arrival fluctuations in the relay system.The Gamma-Gamma and Malaga distributions are used to model the influence of atmospheric turbulence on the source-to-UAV and UAVto-destination links,respectively.We derive closedform expressions of the probability density function(PDF)and cumulative distribution function(CDF)for the proposed communication system,in terms of the Meijer-G function.Based on the precise PDF and CDF,analytical expressions for the outage probability,average bit error rate,and ergodic capacity are proposed with the aid of the extended generalized bivariate Fox’s H function.Finally,we show that there is a match between the analytical results and numerical results,and we analyze the influence of the system and channel parameters on the performance.

Performance Analysis of NOMA-Based Cooperative Networks with Relay Selection

Non-orthogonal multiple access(NOMA)technique is an expert on channel differences exploiting.In this paper,a dual-hop NOMA-based cooperative relaying network where a best relay is selected as an active node to accomplish the communication between a source and a destination is discussed.We assume that both decode-and-forward(DF)and amplify-and-forward(AF)protocols are applied to the selected relay.The metrics that ergodic sum-rate and outage probability are investigated,and the closed-form expressions of the latter for DF and AF protocols are derived.Numerical and simulation results are conducted to verify the validity of the theoretical analysis,in which we can see that the NOMA based DF relaying is better than the NOMA based AF relaying and other existing NOMA-based cooperative communication schemes.

MAC-PHY Cross-Layer for High Channel Capacity of Multiple-Hop MIMO Relay System

For the high end-to-end channel capacity, the amplify-and-forward scheme multiple-hop MIMO relays system is considered. The distance between each transceiver is optimized to prevent some relays from being the bottleneck and guarantee the high end-to-end channel capacity. However, in some cases, the location of relays can’t be set at the desired location, the transmit power of each relay should be optimized. Additionally, in order to achieve the higher end-to-end channel capacity, the distance and the transmit power are optimized simultaneously. We propose the Markov Chain Monte Carlo method to optimize both the distance and the transmit power in complex propagation environments. Moreover, when the system has no control over transmission of each relay, the interference signal is presented and the performance of system is deteriorated. The general protocol of control transmission for each relay on the MAC layer is analyzed and compared to the Carrier Sense Multiple Access-Collision Avoidance protocol. According to the number of relays, the Mac layer protocol for the highest end-to-end channel capacity is changed. We also analyze the end-to-end channel capacity when the number of antennas and relays tends to infinity.

Performance of Nth Worst Full-Duplex Relay Selection over Nakagami-M Fading Channels

The performance analysis of Nth worst relay selection for the full-duplex (FD) mode over Nakagami-m fading channels is studied. We assume the relay employs the amplify-and-forward (AF) protocol. The closed-form expres-sions for the outage performance in terms of the received signal-to-noise ratio cumulative distribution function are derived. In the high signal-to-noise ratio regime, asymptotic outage probability is also investigated. Based on these expressions, the effect of several important network parameters, i.e., the number of relays and the order of selected relay, as well as the quality of the relay links, source-relay links, relay-destination links, are analytically characterized. Finally, numerical results are provided to verify and illustrate our mathematical analysis.

The Improvement of Relay Selection Schemes in Two-Hop Cellular Networks

In wireless networks, cooperative relaying could improve throughput by exploiting diversity. In order to reduce the amount of feedback for the channel gain, a semi-distributed scheme based on the relay feasible condition is proposed. Each relay node can measure its backward and forward channel gains. If both the channel gains are larger than a pre-defined threshold, this relay node is feasible. The final decision on the best relay selection is still given by the base station. Besides, the switch-and-examine relay selection scheme, which selects the first feasible relay node, is also investigated. Simulation results are presented to illustrate the advantage of two proposed schemes.

An efficient multi-relay selection scheme in cooperative communication system

Cooperative relaying has played an important role in rapid evolution of wireless communications.The cooperative performance strongly depends on the selected relays.In this paper,we concentrate on relay selection in amplify-and-forward(AF)cooperative communication system,and an optimal multi-relay selection scheme is put forward to minimize the average symbol error rate(SER)of the system.Firstly,for the minimum average SER,on the basis of the statistic channel information,we define a parameter named equivalent channel gain which describes the channel status of two phases in the cooperative process.Then,under the constraint of equal power allocation,an optimal relay selection scheme is proposed in ascending order of equivalent channel gain(ECG).The scheme implies that the suitable number of relay nodes should be selected under the different signal-to-noise ratio(SNR)ranges to minimize the average SER.Computer simulation results show that the average SER rate of the proposed scheme is lower than these of the other schemes.

Relay Selection Strategy in the Secure Cooperative Communications System

With the low cost and low hardware complex considerations,cooperative systems are a tendency in the future communications.This work considers the secure cooperative communications systems.For a practical situation in the system,the scenario includes multiple source stations,multiple relay stations,multiple destination stations,and eavesdroppers.To analyze the optimal relay selection in the system,we begin with the performance analysis for a single source station and a single destination station.By applying two cooperative models,the amplify-andforward（AF） mode and decode-and-forward（DF）mode,the secrecy capacity is derived.Then,we apply the derived results to the considered environment to find the optimal relay assignment.By the way,the relay selection can be obtained by the exhaustive search algorithm.However,there are a lot of steps needed if the number of source stations is large.Hence,applying the characters of the cooperative modes in the relay selection,the pre-selection step is proposed with a mathematical derivation.It could be used for the practical situation without a long-time calculation.

OPTIMAL POWER ALLOCATION WITH AF AND SDF STRATEGIES IN DUAL-HOP COOPERATIVE MIMO NETWORKS

Dual-hop cooperative Multiple-Input Multiple-Output (MIMO) network with multi-relay cooperative communication is introduced. Power allocation problem with Amplify-and-Forward (AF) and Selective Decode-and-Forward (SDF) strategies in multi-node scenario are formulated and solved respectively. Optimal power allocation schemes that maximize system capacity with AF strategy are presented. In addition, optimal power allocation methods that minimize asymptotic Symbol Error Rate (SER) with SDF cooperative protocol in multi-node scenario are also proposed. Furthermore, performance comparisons are provided in terms of system capacity and approximate SER. Numerical and simulation results confirm our theoretical analysis. It is revealed that, maximum system capacity could be obtained when powers are allocated optimally with AF protocol, while minimization of system's SER could also be achieved with optimum power allocation in SDF strategy. In multi-node scenario, those optimal power allocation algorithms are superior to conventional equal power allocation schemes.

Modified Cooperative Subchannel Allocation Algorithms and PSO Based Power Allocation for an Alamouti Decode and Forward Relaying Protocol in Multiuser OFDMA Systems

The present work is a discussion on the performance analysis of Modified Cooperative Subchannel Allocation (CSA) Algorithms which is used in Alamouti Decoded and Forward (Alamouti DF) Relaying Protocol for wireless multi-user Orthogonal Frequency Division Multiplexing Access (OFDMA) systems. In addition, the performance of approximate Symbol Error Rate (SER) for the Alamouti DF Relaying Protocol with the Cooperative Maximum Ratio Combining Technique (C-MRC) is analyzed and compared with SER upper bound. The approximate SER is asymptotically tight bound at higher Signal-to-Noise Ratio (SNR). From the asymptotic tight bound approximate SER, Particle Swarm Optimization (PSO) based Power Allocation (PA) is determined for the Alamouti DF Relaying Protocol. The simulation results suggested that the Modified Throughput based Subchannel Allocation Algorithm achieved an improved throughput of 6% to 33% compared to that of existing cooperative diversity protocol. Further, the Modified Fairness based Subchannel Allocation Algorithm rendered fairness of 7.2% to 17% among the multiuser against the existing cooperative diversity protocol.

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. Simutation resutts 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.

Beamforming design for RIS-aided amplify-and-forward relay networks

The use of a reconfigurable intelligent surface(RIS)in the enhancement of the rate performance is considered to involve the limitation of the RIS being a passive reflector.To address this issue,we propose a RIS-aided amplify-and-forward(AF)relay network in this paper.By jointly optimizing the beamforming matrix at AF relay and the phase-shift matrices at RIS,two schemes are put forward to address a maximizing signal-to-noise ratio(SNR)problem.First,aiming at achieving a high rate,a high-performance alternating optimization(AO)method based on Charnes–Cooper transformation and semidefinite programming(CCT-SDP)is proposed,where the optimization problem is decomposed into three subproblems solved using CCT-SDP,and rank-one solutions can be recovered using Gaussian randomization.However,the optimization variables in the CCT-SDP method are matrices,leading to extremely high complexity.To reduce the complexity,a low-complexity AO scheme based on Dinkelbachs transformation and successive convex approximation(DT-SCA)is proposed,where the variables are represented in vector form,and the three decoupling subproblems are solved using DT-SCA.Simulation results verify that compared to three benchmarks(i.e.,a RIS-assisted AF relay network with random phase,an AF relay network without RIS,and a RIS-aided network without AF relay),the proposed CCT-SDP and DT-SCA schemes can harvest better rate performance.Furthermore,it is revealed that the rate of the low-complexity DT-SCA method is close to that of the CCT-SDP method.

Improving amplify-and-forward relay selection algorithm based on partial relay link

This article addresses the design problem of selecting an appropriate relay in amplify-and-forward （AF） cooperative diversity systems. In this regard, this article focuses on relay selection based on partial channel knowledge only across the source and relay links. In particular, the two fundamental questions will be answered, that is, whether to cooperate and whom to cooperate with. Through answering these two questions, an improved relay selection strategy based on partial relay link, which emphasizes that cooperation happens when necessary, is proposed to aim at maximizing the average mutual information. Then a joint optimization, in terms of power allocation and relay selection, is employed to guarantee a robust performance for relay selection based on partial relay link. Optimum power is allocated between the source and the selected relay to maximize the output signal-to-noise （SNR） at the destination. Simulation results turn out that the improved scheme can achieve better performance than previous work and the robust performance can be guaranteed by employing joint optimization.

Power Control and Routing Selection for Throughput Maximization in Energy Harvesting Cognitive Radio Networks

This paper investigates the power control and routing problem in the communication process of an energy harvesting(EH)multi-hop cognitive radio network(CRN).The secondary user(SU)nodes(i.e.,source node and relay nodes)harvest energy from the environment and use the energy exclusively for transmitting data.The SU nodes(i.e.,relay nodes)on the path,store and forward the received data to the destination node.We consider a real world scenario where the EH-SU node has only local causal knowledge,i.e.,at any time,each EH-SU node only has knowledge of its own EH process,channel state and currently received data.In order to study the power and routing issues,an optimization problem that maximizes path throughput considering quality of service(QoS)and available energy constraints is proposed.To solve this optimization problem,we propose a hybrid game theory routing and power control algorithm(HGRPC).The EH-SU nodes on the same path cooperate with each other,but EH-SU nodes on the different paths compete with each other.By selecting the best next hop node,we find the best strategy that can maximize throughput.In addition,we have established four steps to achieve routing,i.e.,route discovery,route selection,route reply,and route maintenance.Compared with the direct transmission,HGRPC has advantages in longer distances and higher hop counts.The algorithm generates more energy,reduces energy consumption and increases predictable residual energy.In particular,the time complexity of HGRPC is analyzed and its convergence is proved.In simulation experiments,the performance(i.e.,throughput and bit error rate(BER))of HGRPC is evaluated.Finally,experimental results show that HGRPC has higher throughput,longer network life,less latency,and lower energy consumption.