Performance for Device-to-Device Communication with Three-Time-Slot Two-Way Amplify-and-Forward Relay Protocol

Multi-hop device-to-device(D2D) communication can significantly improve the system performance. This paper studied the outage performance of D2 D communication assisted by another D2 D user using three-timeslot two-way amplify-and-forward relaying protocol over Rayleigh fading channels. Considering the co-channel interference from cellular user at the D2 D node,the approximate expression for the overall outage probability was derived. Furthermore,a power allocation optimum method to minimize the outage probability was developed,and the closed form expression for the optimal power allocation coefficient at the relay was derived. Simulation results demonstrate accuracy of the derived outage probability expressions. Simulation results also demonstrate that the outage performance can be improved using the proposed optimal power allocation method.

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.

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.

Outage Performance of Opportunistic Amplify-and-Forward Relaying over Asymmetric Fading Environments

This letter analyzes the outage probability of opportunistic amplify-and-forward relaying over asymmetric and independent but non-identically distributed (i.n.d) fading environments. The work investigates the scenarios where cooperative nodes are located at different geographical locations. As a result, the different signals are affected by different i.n.d fading channels, one may undergo Rician fading distribution and others may undergo Rayleigh fading distribution. In this letter, a lower bound of the outage probability for various asymmetric fading environments is derived at high SNR by applying the initial value theorem. The analytical model is validated through Monte-Carlo simulation results.

Parameter Optimization for Amplify-and-Forward Relaying Systems with Pilot Symbol Assisted Modulation Scheme

Cooperative diversity is a promising technology for future wireless networks. In this paper, we consider a cooperative communication system operating in an amplify-and-forward (AF) mode with a pilot symbol as-sisted modulation (PSAM) scheme. It is assumed that a linear minimum mean square estimator (LMMSE) is used for the channel estimation at the receiver. A simple and easy-to-evaluate asymptotical upper bound (AUB) of the symbol-error-rate (SER) is derived for uncoded AF cooperative communication systems with quadrature amplitude modulation (QAM) constellations. Based on the AUB, we propose a criterion for the parameter optimization in the PSAM scheme. We discuss how the pilot spacing and the length of the Wiener ?lter should be chosen under the constraint of a tradeoff between pilot overhead, estimation accuracy, and receiver complexity. We also formulate an power allocation problem for the considered system. It is shown that the power allocation problem can optimally be solved by means of a gradient search method. Numerical simulations are presented to verify the correctness of the theoretical results and to demonstrate the benefits of the parameter optimization.

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.

Optimization of Cooperative RelayingMolecular Communications for Nanomedical Applications

Recently,nano-systems based on molecular communications via diffusion(MCvD)have been implemented in a variety of nanomedical applications,most notably in targeted drug delivery system(TDDS)scenarios.Furthermore,because the MCvD is unreliable and there exists molecular noise and inter symbol interference(ISI),cooperative nano-relays can acquire the reliability for drug delivery to targeted diseased cells,especially if the separation distance between the nano transmitter and nano receiver is increased.In this work,we propose an approach for optimizing the performance of the nano system using cooperative molecular communications with a nano relay scheme,while accounting for blood flow effects in terms of drift velocity.The fractions of the molecular drug that should be allocated to the nano transmitter and nano relay positioning are computed using a collaborative optimization problem solved by theModified Central Force Optimization(MCFO)algorithm.Unlike the previous work,the probability of bit error is expressed in a closed-form expression.It is used as an objective function to determine the optimal velocity of the drug molecules and the detection threshold at the nano receiver.The simulation results show that the probability of bit error can be dramatically reduced by optimizing the drift velocity,detection threshold,location of the nano-relay in the proposed nano system,and molecular drug budget.

Security-Reliability Tradeoff Analysis for Jamming Aided Decode-and-Forward Relay Networks

In this paper,we explore a cooperative decode-and-forward(DF)relay network comprised of a source,a relay,and a destination in the presence of an eavesdropper.To improve physical-layer security of the relay system,we propose a jamming aided decodeand-forward relay(JDFR)scheme combining the use of artificial noise and DF relaying which requires two stages to transmit a packet.Specifically,in stage one,the source sends confidential message to the relay while the destination acts as a friendly jammer and transmits artificial noise to confound the eavesdropper.In stage two,the relay forwards its re-encoded message to the destination while the source emits artificial noise to confuse the eavesdropper.In addition,we analyze the security-reliability tradeoff(SRT)performance of the proposed JDFR scheme,where security and reliability are evaluated by deriving intercept probability(IP)and outage probability(OP),respectively.For the purpose of comparison,SRT of the traditional decode-and-forward relay(TDFR)scheme is also analyzed.Numerical results show that the SRT performance of the proposed JDFR scheme is better than that of the TDFR scheme.Also,it is shown that for the JDFR scheme,a better SRT performance can be obtained by the optimal power allocation(OPA)between the friendly jammer and user.

Average Secrecy Capacity of the Reconfigurable Intelligent Surface-Assisted Integrated Satellite Unmanned Aerial Vehicle Relay Networks

Integrated satellite unmanned aerial vehicle relay networks(ISUAVRNs)have become a prominent topic in recent years.This paper investigates the average secrecy capacity(ASC)for reconfigurable intelligent surface(RIS)-enabled ISUAVRNs.Especially,an eve is considered to intercept the legitimate information from the considered secrecy system.Besides,we get detailed expressions for the ASC of the regarded secrecy system with the aid of the reconfigurable intelligent.Furthermore,to gain insightful results of the major parameters on the ASC in high signalto-noise ratio regime,the approximate investigations are further gotten,which give an efficient method to value the secrecy analysis.At last,some representative computer results are obtained to prove the theoretical findings.

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.

Performance of transmit diversity assisted amplify-and-forward relay system with partial relay selection in mixed Rayleigh and Rician fading channels

The performance of transmit diversity （TD） assisted amplify-and-forward （AF） relay system with partial relay selection, which experiences mixed Rayleigh and Rician fading channels, is investigated. We first investigate the closed-form expression of the cumulative distribution function for the end-to-end equivalent signal-to-noise ratio （SNR）, and then the exact expressions of outage probability and average symbol error probability （SEP） are derived. The theoretical observations are verified by the Monte Carlo simulation results.

Channel estimation based on distributed compressed sensing in amplify-and-forward relay networks

In orthogonal frequency-division multiplexing （OFDM） amplify-and-forward （AF） relay networks,in order to exploit diversity gains over frequency-selective fading channels,the receiver needs to acquire the knowledge of channel state information （CSI）.In this article,based on the recent methodology of distributed compressed sensing （DCS）,a novel channel estimation scheme is proposed.The joint sparsity model 2 （JSM-2） in DCS theory and simultaneous orthogonal matching pursuit （SOMP） are both introduced to improve the estimation performance and increase the spectral efficiency.Simulation results show that compared with current compressed sensing （CS） methods,the estimation error of our scheme is reduced dramatically in high SNR region while the pilot number is still kept small.

Power control for two-way amplify-and-forward relaying over Rayleigh fading channels

We propose two novel power control policies for a two-way amplify-and-forward (AF) relaying system,in which each node (two sources and one relay) is assumed to operate under bothminimum and peak power constraints.Through the exploitation of instantaneous channel gains,the first policy can maximize the sum rate of the system.However,the instantaneous channel gains may be unavailable in a rapid time-varying system,where the first policy is inoperable.Consequently,a robust power control policy which requires only mean channel gains is proposed to maximize the upper bound of the average sum rate,and the properties of this policy are investigated.Simulation results show that,by comparison with the policy in which all the nodes use their peak transmit power,the proposed power control policies can provide considerable system performance improvement.Furthermore,the performance difference between the two proposed policies is negligible when the relay is close to one source.

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.

Efficient detection methods for amplify-and-forward relay-aided device-to-device systems with full-rate space-time block code

Relay-aided device-to-device (D2D) communication is a promising technology for the next-generation cellular network. We study the transmission schemes for an amplify-and-forward relay-aided D2D system which has multiple antennas. To circumvent the prohibitive complexity problem of traditional maximum likelihood (ML) detection for full-rate space-time block code (FSTBC) transmission, two low-complexity detection methods are proposed, i.e., the detection methods with the ML-combining (MLC) algorithm and the joint conditional ML (JCML)detector. Particularly, the method with the JCML detector reduces detection delay at the cost of more storage and performs well with parallel implementation. Simulation results indicate that the proposed detection methods achieve a symbol error probability similar to that of the traditional ML detector for FSTBC transmission but with less complexity, and the performance of FSTBC transmission is significantly better than that of spatial multiplexing transmission. Diversity analysis for the proposed detection methods is also demonstrated by simulations.

Performance of two-way amplify-and-forward relaying with adaptive modulation over Nakagami-m fading channels

This paper investigates the performance of a two-way amplify-and-forward （AF） relay system with adaptive modulation over independent and non-identical Nakagami-m fading channels. The tight closed-form cumulative distribution function （CDF） expression of the instantaneous end-to-end signal-to-noise ratio （SNR） is provided. Further, approximate closed-form expression for the average spectral efficiency of the two-way AF system with adaptive modulation is obtained. Then, a tight lower bound of outage probability is derived. Finally, we use numerical simulations to verify the tightness of our analytical results.

Multi-user diversity analysis in MISO amplify-and-forward relaying network

This article analyzed multi-user diversity performance for multiple input single output （MISO） amplify-and-forward （AF） relaying network with selection combiner, and the closed-form outage probabilities for variable gain relaying and fixed gain relaying network are derived. Based on these results, diversity order is presented for variable gain relaying network. Simulation results validate the derived theoretical results, and the diversity order of variable gain relaying network with Nr available relays is K （Nt ＋ Nr） in K users＇ scenario, where Nt is the number of source transmitter antennas.

Covert Communication with a Spectrum Sharing Relay in the Finite Blocklength Regime

In this paper,we investigate the feasibility and performance of the covert communication with a spectrum sharing relay in the finite blocklength regime.Specifically,the relay opportunistically forwards the source's messages to the primary receiver or conveys the covert messages to its own receiver via the sharing spectrum,while the warden attempts to detect the transmission.First,we derive a lower bound on the covertness constraint,and the analytical expressions of both the primary average effective covert throughput(AECT)and sum AECT are presented by considering the overall decoding error performance.Then,we formulate two optimization problems to maximize the primary and sum AECT respectively by optimizing the blocklength and the transmit power at the source and the relay.Our examinations show that there exists an optimal blocklength to maximize the primary and sum AECT.Besides,it is revealed that,to maximize the primary AECT,the optimal transmit power of each hop increases as its channel quality deteriorates.Furthermore,in the optimization for maximizing the sum AECT,the optimal transmit power at the source equals to zero when the channel quality from relay to the secondary receiver is not weaker than that from relay to the primary receiver.

A fixed clustering protocol based on random relay strategy for EHWSN

In Energy Harvesting Wireless Sensor Networks(EHWSN),the communication protocol will directly affect the final performance of the network,so it is necessary to study the communication protocol based on EHWSN.In this paper,for the low-cost fixed clustering problem,a fixed clustering protocol RRCEH is based on random relaying.Our proposed RRCEH abandons the inefficient inter-cluster communication method of the traditional fixed clustering protocol.To coordinate the data upload of the cluster head,RRCEH allocates different random relay vectors to each ring area of the network,and combines all the random relay vectors into a random relay matrix of RRCEH.In each communication round,the cluster head node randomly selects its relay target node to send data according to the probability distribution in the random relay vector in the area.For two different cluster head configuration scenarios,by optimizing the random relay matrix,RRCEH can effectively reduce the network's configuration requirements for cluster head energy harvesting capability,thus reducing the deployment cost of EHWSN.

Relay Selection and Power Allocation in Amplify-and-Forward Cognitive Radio Systems Based on Spectrum Sharing

In this paper, we consider a spectrum sharing scheme that is a joint optimization of relay selection and power allocation at the secondary transmitter, which aims to achieve the maximum possible throughput for the secondary user. This paper considers the scenario where the primary user is incapable of supporting its target signal-to-noise ratio (SNR). More especially, the secondary transmitter tries to assist the primary user with achieving its target SNR by cooperative amplify-and-forward (AF) relaying with two-phase. By exhaustive search for all candidate secondary transmitters, an optimal secondary transmitter can be selected, which not only can satisfy the primary user’s target SNR, but also maximize the secondary user’s throughput. The optimal secondary transmitter acts as a relay for the primary user by allocating a part of its power to amplify-and-forward the primary signal over the primary user’s licensed spectrum bands. At the same time, as a reward, the optimal secondary transmitter uses the remaining power to transmit its own signal over the remaining licensed spectrum bands. Thus, the secondary user obtains the spectrum access opportunities. Besides, there is no interference between the primary user and the secondary user. We study the joint optimization of relay selection and power allocation such that the secondary user’s throughput is maximized on the condition that it satisfies the primary user’s target SNR. From the simulation, it is shown that the joint optimization of relay selection and power allocation provides a significant throughput gain compared with random relay selection with optimal power allocation (OPA) and random relay selection with water-filling power allocation (WPA). Moreover, the simulation results also shown that our spectrum sharing scheme obtains the win-win solution for the primary system and the secondary system.