Search

Channel estimation is challenging for the reconfigurable intelligent surface (RIS)-aided wireless communications. Since the number of coefficients of the cascaded channel among the base station (BS), the RIS, and the user equipment (UE), is the product of the number of BS antennas, the number of RIS elements, and the number of UEs, the pilot overhead can be prohibitively high. In this paper, we propose a two-timescale channel estimation framework to exploit the property that the BS-RIS channel is high-dimensional but quasi-static, while the RIS-UE channel is mobile but low-dimensional. Specifically, to estimate the quasi-static BS-RIS channel, we propose a dual-link pilot transmission scheme, where the BS transmits downlink pilots and receives uplink pilots reflected by the RIS. Then, we propose a coordinate descent-based algorithm to recover the BS-RIS channel. Since the quasi-static BS-RIS channel is estimated less frequently than the mobile channel is, the average pilot overhead can be reduced from a long-term perspective. Although the mobile RIS-UE channel has to be frequently estimated in a small timescale, the associated pilot overhead is low thanks to its low dimension. Simulation results show that the proposed two-timescale channel estimation framework can achieve accurate channel estimation with low pilot overhead. [ABSTRACT FROM AUTHOR]

Multiple-input Multiple-output (MIMO) technologies play an important role in modern and future wireless communication systems as they can improve the capacity without increasing the bandwidth. MIMO detection is one of the key technologies for MIMO system designs. MIMO detection schemes based on Message Passing (MP) algorithms have attracted extensive attention in recent years. The MIMO detection scheme based on Expectation Propagation (EP), which is also a kind of MP algorithms, has been proved to achieve the Bayes-optimal performance under the conditions of large system limit and compression rate threshold. However, there is improvement space for the detection performance of the EP algorithm when the conditions are not satisfied, which are the common cases in the practical applications. In this paper, when the conditions of the large system limit and compression rate threshold are not satisfied, we analyze the influences of two factors, the initial parameters selection and the moment matching strategy, on the performance of EP based detection scheme. As a result, we propose an improved EP detection scheme based on optimizing the two factors. Simulation results show that the proposed scheme outperforms the original EP detection scheme in different MIMO scenarios. [ABSTRACT FROM AUTHOR]

In this paper, we propose a new construction of generalized root protograph (GRP) low-density parity-check (LDPC) codes which has a guaranteed diversity order. New hybrid-automatic request with incremental redundancy (H-ARQ-IR) is also proposed to ensure high diversity and rate-compatibility in wireless communication systems, where the GRP LDPC codes are employed along with a method called feedback encoding. The proposed H-ARQ-IR has advantages of low-complexity and near-optimal performance. In order to show its performance behavior, theoretical analysis for the proposed scheme is conducted for the block fading channel. Furthermore, numerical analysis shows that it achieves near maximum diversity order under the belief propagation (BP) decoding with binary phase shift keying (BPSK) modulation and high-order quadrature amplitude modulations (QAMs). [ABSTRACT FROM AUTHOR]

Intelligent reflecting surface (IRS) that enables the control of wireless propagation environment has recently emerged as a promising cost-effective technology for boosting the spectral and energy efficiency of future wireless communication systems. Prior works on IRS are mainly based on the ideal phase shift model assuming full signal reflection by each of its elements regardless of the phase shift, which, however, is practically difficult to realize. In contrast, we propose in this paper a practical phase shift model that captures the phase-dependent amplitude variation in the element-wise reflection design. Based on the proposed model and considering an IRS-aided multiuser system with one IRS deployed to assist in the downlink communications from a multi-antenna access point (AP) to multiple single-antenna users, we formulate an optimization problem to minimize the total transmit power at the AP by jointly designing the AP transmit beamforming and the IRS reflect beamforming, subject to the users’ individual signal-to-interference-plus-noise ratio (SINR) constraints. Iterative algorithms are proposed to find suboptimal solutions to this problem efficiently by utilizing the alternating optimization (AO) as well as penalty-based optimization techniques. Moreover, to draw essential insight, we analyze the asymptotic performance loss of the IRS-aided system that employs practical phase shifters but assumes the ideal phase shift model for beamforming optimization, as the number of IRS elements goes to infinity. Simulation results unveil substantial performance gains achieved by the proposed beamforming optimization based on the practical phase shift model as compared to the conventional ideal model. [ABSTRACT FROM AUTHOR]

Full-duplex (FD) jamming transceivers recently have been shown to enhance the information security of wireless communication systems by simultaneously transmitting artificial noise (AN) while receiving information. In this paper, we investigate whether FD jamming can also improve the system’s secrecy energy efficiency (SEE) in terms of securely communicated bits per Joule when considering the additional power used for jamming and self-interference (SI) cancellation. Moreover, the degrading effect of the residual SI is also taken into account. In this regard, we formulate a set of SEE maximization problems for a FD multiple-input-multiple-output multiple-antenna eavesdropper (MIMOME) wiretap channel, considering both cases where exact or statistical channel state information (CSI) is available. Due to the intractable problem structure, we propose iterative solutions in each case with a proven convergence to a stationary point. Numerical simulations indicate only a marginal SEE gain, through the utilization of FD jamming, for a wide range of system conditions. However, when SI can efficiently be mitigated, the observed gain is considerable for scenarios with a small distance between the FD node and the eavesdropper, a high signal-to-noise ratio (SNR), or for a bidirectional FD communication setup. [ABSTRACT FROM AUTHOR]

Multi-channel (MC) optical wireless communication (OWC) systems employing wave-division multiplexing for outdoors free-space optical communications, or multi-user time-division multiple access for indoors visible-light communications, e.g., can be modeled as parallel channels. Multi-input multi-output OWC systems can also be transformed, possibly with some performance loss, to parallel channels using pre-/post-coding. Studying the performance of such MC-OWC systems requires characterizing the capacity of the underlying parallel channels. In this paper, upper and lower bounds on the capacity of constant parallel OWC channels with a total average intensity constraint are derived. Then, this paper focuses on finding intensity allocations that maximize the lower bounds given channel-state information at the transmitter (CSIT). Due to its nonconvexity, the Karush–Kuhn–Tucker conditions are used to describe a list of candidate allocations. Instead searching exhaustively for the best solution, low-complexity near-optimal algorithms are proposed. The resulting optimized lower bound nearly coincides with capacity at high signal-to-noise ratio (SNR). Under a quasi-static channel model and in the absence of CSIT, outage probability upper and lower bounds are derived. Those bounds also meet at high SNR, thus characterizing the outage capacity in this regime. Finally, the results are extended to a system with both average and peak intensity constraints. [ABSTRACT FROM PUBLISHER]

In this paper, we propose an imperfect quantized feedback-based diagonal precoding scheme for generalized orthogonal space-time block codes in an $N \times 1$ multiple-input single-output (MISO) wireless communication system employing $M$ -QAM constellation. It is well known that a feedback-based precoding scheme aids channel adaptive signaling in wireless communication system and capitulates large improvements in almost all performance metrics. However, a practical feedback link is susceptible to error due to wireless channel fading and leads to wrong precoder selection. Therefore, a signal-to-noise ratio (SNR) adaptive error-tolerant weighting scheme is introduced which provides significant gain in comparison with another proposed arbitrarily fixed SNR error-tolerant weighting scheme. At first, a tight approximate closed-form expression of average symbol-error-rate (SER) and an exact analytical expression of outage probability are derived under imperfect feedback information with the help of order statistics. By minimizing the derived average SER, optimized transmit weights for the diagonal precoding matrix (based on feedback bits) are obtained. Later, a closed-form expression of the ergodic capacity with erroneous feedback bits for arbitrary MISO system is also provided by using the moment generating function approach. Further, numerical results show that the considered error-tolerant schemes outperform the uniform power allocation scheme in term of all the investigated performance metrics. [ABSTRACT FROM AUTHOR]

The Beckmann distribution is a general multipath fading model for the received radio signal in the presence of a large number of scatterers, which can thence be modeled as a complex Gaussian random variable where both the in-phase and quadrature components have arbitrary mean and variance. However, the complicated nature of this distribution has prevented its widespread use and relatively few analytical results have been reported for this otherwise useful fading model. In this paper, we derive a closed-form expression for the generalized moment-generating function (MGF) of the signal-to-noise ratio (SNR) of Beckmann fading, which permits to circumvent the inherent analytical complexity of this model. This is a new and useful result, as it is a key for evaluating several important performance metrics of different wireless communication systems and also permits to readily compute the moments of the output SNR. Thus, we obtain simple exact expressions for the energy detection performance in Beckmann fading channels, both in terms of the receiver operating characteristic (ROC) curve and of the area under ROC curve. We also analyze the outage probability in interference limited systems affected by Beckmann fading, as well as the outage probability of secrecy capacity in wiretap Beckmann fading channels. Monte Carlo simulations have been performed to validate the derived expressions. [ABSTRACT FROM AUTHOR]

Considering a dual-hop energy-harvesting (EH) relaying system, this paper advocates novel relaying protocols based on adaptive time-switching (TS) for amplify-and-forward and decode-and-forward modes, respectively. The optimal TS factor is first studied, which is adaptively adjusted based on the dual-hop channel state information (CSI), accumulated energy, and threshold signal-to-noise ratio (SNR), to achieve the maximum throughput efficiency per block. To reduce the CSI overhead at the EH relay, a low-complexity TS factor design is presented, which only needs single-hop CSI to determine the TS factor. Theoretical results show that, in comparison with the conventional solutions, the proposed optimal/low-complexity TS factor can achieve higher limiting throughput efficiency for sufficiently small threshold SNR. As the threshold SNR approaches infinity, the throughput efficiency of the proposed optimal/low-complexity TS factor tends to zero in a much slower pace than that of the conventional solutions. Simulation results are presented to corroborate the proposed methodology. [ABSTRACT FROM PUBLISHER]

This paper analyzes the impact of statistical delay constraints on the achievable rate of a two-hop wireless communication link in which the communication between a source and a destination is accomplished via a buffer-aided relay node. It is assumed that there is no direct link between the source and the destination, and the buffer-aided relay forwards the information to the destination by employing the decode-and-forward scheme. Given statistical delay constraints specified via maximum delay and delay violation probability, the tradeoff between the statistical delay constraints imposed on any two concatenated queues is identified. With this characterization, the maximum constant arrival rates that can be supported by this two-hop link are obtained by determining the effective capacity of such links as a function of the statistical delay constraints, signal-to-noise ratios at the source and relay, and the fading distributions of the links. It is shown that asymmetric statistical delay constraints at the buffers of the source and relay node can improve the achievable rate. Overall, the impact of the statistical delay tradeoff on the achievable throughput is provided. [ABSTRACT FROM PUBLISHER]

This paper analyzes the performance of energy-constrained dual-hop amplify-and-forward relaying systems with multi-antenna nodes in the presence of multiple co-channel interferers at the destination. To maximize the overall signal-to-interference-plus-noise ratio, as well as the harvested energy so as to mitigate the severe effects of fading and enable long-distance wireless power transfer, hop-by-hop information and energy beamforming is proposed where the transmitted signal is steered along the strongest eigenmode of each hop. The wirelessly powered relay scavenges energy from the source information radio frequency signal through energy beamforming, where both the time-switching receiver and power-splitting receiver are considered, and then uses the harvested energy to forward the source message to the destination. To this end, tight lower and upper bound expressions for the outage probability and ergodic capacity are presented in closed form. These are employed to investigate the throughput of the delay-constrained and delay-tolerant transmission modes. In addition, the asymptotic high signal-to-noise ratio outage probability and ergodic capacity approximations are derived, where the achievable diversity order is also presented. Numerical results sustained by Monte Carlo simulations show the tightness of the proposed analytical expressions. The impact of various parameters, such as energy harvesting time, power-splitting ratio, source transmit power, and the number of antennas on the system throughput, is also considered. [ABSTRACT FROM PUBLISHER]

Although there has been a growing interest on the study of diversity-multiplexing tradeoff (DMT), the existing works are mostly restricted to the outcomes reported for Rayleigh, Rician, and Nakagami fading channels. In this paper, we investigate the optimal tradeoff in the presence of log-normal fading, which provides an accurate model for indoor wireless, optical wireless, and ultra-wideband channels. We consider a multiple-input multiple-output (MIMO) log-normal channel, derive the outage probability expression, and then present the asymptotical DMT expression. It is shown that the asymptotical maximum diversity gain tends to infinity with logarithm of signal-to-noise ratio (SNR). To have further insight, we normalize the DMT with that of single-input single-output case and express the relative asymptotical DMT of the MIMO log-normal channel as a function of the number of transmit and receive antennas. We further study DMT for finite SNRs and demonstrate convergence to the asymptotical case. Extensive numerical results are provided to corroborate the analytical derivation. [ABSTRACT FROM AUTHOR]

Compute-and-forward (C&F) is a promising new approach to interference management, enjoying several advantages over other information-theoretic schemes. C&F usually requires channel state information (CSI) at the receivers so that an “optimal” scaling factor can be computed for the purposes of decoding. In this paper, a blind C&F scheme—i.e., one not requiring CSI—is developed. Rather than attempting to compute the optimal scaling factor, this new scheme seeks one or more “good” scalars, i.e., scalars that allow correct decoding despite possibly being suboptimal. The region of all such good scalars is characterized. To find a good scalar, a computationally efficient scheme is proposed which involves error-detection, a hierarchically organized list, as well as a use of the smoothing lemma from lattice theory. Simulation results show that our blind C&F scheme achieves—for a class of nested lattice codes—the same throughput as its CSI-enabled counterpart at the expense of, approximately, a two-fold increase in computational complexity in the high-throughput region. Moreover, our blind C&F scheme can be applied to multisource multirelay networks with a good performance/complexity tradeoff. [ABSTRACT FROM AUTHOR]

This paper tackles the problem of minimum-energy cooperative transmission in wireless networks under the assumption of limited channel state information at the transmitters. It is assumed that only the average statistics of the fading channels are known to the transmitters. The objective here is to jointly optimize the set of relays and the transmission powers for both the broadcasting and cooperative transmission phases while satisfying probabilistic signal-to-noise ratio (SNR) constraints at the relays and at the destination node. Increasing the broadcasting power expands the set of potential relays and decreases the required power for cooperative transmission. Hence, there is a compromise in the selection of the power values, which is addressed in this work using a chance-constrained optimization framework. A closed-form approximate solution is also presented, which provides a low-complexity transmission scheme for energy-harvesting wireless networks. Simulations are presented to demonstrate the efficacy of the proposed approach and the approximate solution. [ABSTRACT FROM AUTHOR]

Wireless-powered cellular networks (WPCNs) are currently being investigated to ensure the reliability as well as improved battery lifetime of wireless devices. A WPCN leverages on a centralized base station (BS) that takes care of both wireless information and energy transfer. However, the harvested energy and, in turn, the spectral efficiency of uplink transmission of the users may significantly vary depending on the locations of the users and the channels used for energy and information transfer purposes. To this end, this paper theoretically characterizes the signal-to-noise ratio (SNR) outage zones in a WPCN and comparatively analyzes the performance of three useful configurations of dedicated energy sources that can potentially minimize the SNR outage zones. These configurations are: (i) harvesting energy from and information transfer to a full-duplex BS. This is considered as a baseline configuration; (ii) harvesting energy from symmetrically deployed power beacons (PBs) and information transfer to a conventional half-duplex BS; and (iii) harvesting energy from symmetrically deployed PBs that are colocated with the distributed antenna elements (DAEs) of a conventional half-duplex BS. For all the listed cases, we characterize the SNR outage probability and spectral efficiency of an arbitrarily located user within the cellular region. Based on the derived expressions, we also optimize the distance of the PBs from the BS to minimize the SNR outage probability and provide closed-form solutions for special cases. The optimum distance of the PBs is shown to be a function of the number of PBs and the coverage area of the BS. Numerical results validate the accuracy of the derived expressions, provide design insights related to WPCNs, and reveal the significance of the limited number of optimally placed PBs over a large number of randomly deployed PBs. [ABSTRACT FROM AUTHOR]

The newly emerging wireless powered communication networks (WPCNs) have recently drawn significant attention, where radio signals are used to power wireless terminals for information transmission. In this paper, we study a WPCN where one multi-antenna access point (AP) coordinates energy transfer and information transfer to/from a set of single-antenna users. A harvest-then-transmit protocol is assumed where the AP first broadcasts wireless power to all users via energy beamforming in the downlink (DL), and then, the users send their independent information to the AP simultaneously in the uplink (UL) using their harvested energy. To optimize the users' throughput and yet guarantee their rate fairness, we maximize the minimum throughput among all users by a joint design of the DL–UL time allocation, the DL energy beamforming, and the UL transmit power allocation, as well as receive beamforming. We solve this nonconvex problem optimally by two steps. First, we fix the DL–UL time allocation and obtain the optimal DL energy beamforming, UL power allocation, and receive beamforming to maximize the minimum signal-to-interference-plus-noise ratio of all users. This problem is shown to be still nonconvex; however, we convert it equivalently to a spectral radius minimization problem, which can be solved efficiently by applying the alternating optimization based on the nonnegative matrix theory. Then, the optimal time allocation is found by a one-dimensional search to maximize the minimum rate of all users. Furthermore, two suboptimal designs of lower complexity are also proposed, and their throughput performance is compared against that of the optimal solution. [ABSTRACT FROM AUTHOR]

In this paper, we consider a decode-and-forward-based wireless multihop network with a single source node, a single destination node, and $N$ intermediate nodes. To increase the spectral efficiency and energy efficiency of the system, we propose a cooperative multihop communication protocol with spatial reuse, in which interference is treated as noise or can be canceled. The performance of a spatial-reused space–time-coded cooperative multihop network is analyzed over Rayleigh fading channels. In particular, the exact closed-form expression for the outage probability at the $n$th receiving node is derived when there are multiple interference sources over non-i.i.d. Rayleigh fading channels. Furthermore, the outage probability expressions are derived when nodes are equipped with more than one antenna. In addition, to reduce the effect of interference on multihop transmission, we propose a simple power control scheme that is only dependent on the statistical knowledge of channels. In the second approach for managing the interference, linear interference cancelation schemes are employed for both noncooperative and cooperative spatial-reused multihop transmissions. Finally, the analytic results were confirmed by simulations. Simulation results show that the spatial-reused multihop transmission outperforms the interference-free multihop transmission in terms of energy efficiency in low- and medium-signal-to-noise scenarios. [ABSTRACT FROM PUBLISHER]

A novel physical layer authentication scheme is proposed in this paper by exploiting the time-varying carrier frequency offset (CFO) associated with each pair of wireless communications devices. In realistic scenarios, radio frequency oscillators in each transmitter-and-receiver pair always present device-dependent biases to the nominal oscillating frequency. The combination of these biases and mobility-induced Doppler shift, characterized as a time-varying CFO, can be used as a radiometric signature for wireless device authentication. In the proposed authentication scheme, the variable CFO values at different communication times are first estimated. Kalman filtering is then employed to predict the current value by tracking the past CFO variation, which is modeled as an autoregressive random process. To achieve the proposed authentication, the current CFO estimate is compared with the Kalman predicted CFO using hypothesis testing to determine whether the signal has followed a consistent CFO pattern. An adaptive CFO variation threshold is derived for device discrimination according to the signal-to-noise ratio and the Kalman prediction error. In addition, a software-defined radio (SDR) based prototype platform has been developed to validate the feasibility of using CFO for authentication. Simulation results further confirm the effectiveness of the proposed scheme in multipath fading channels. [ABSTRACT FROM AUTHOR]

In this paper, we introduce the Inverse Gaussian (IG) fading distribution to model the envelope and the power of the received signal in radio propagation fading channels and free-space optical (FSO) channels. The joint distribution of the IG process and its derivative and the marginal distribution of the derivative are developed. The obtained formulas are then used to derive the second-order statistics of the received signal envelope and the channel capacity under IG and Nakagami-IG (NIG) fading distributions. Numerical results sustaining our analysis are provided, and the impacts of various parameters on the system performance are investigated. [ABSTRACT FROM AUTHOR]

In this paper, we investigate data dissemination in delay tolerant networks (DTNs) via roadside wireless local area networks (RS-WLANs). The data dissemination service is destined to a group of nomadic nodes roaming in a large network region with a low node density. The local nodes within the coverage area of an RS-WLAN can provide packet caching and relaying capabilities. We consider a cooperative data dissemination approach where information packets are first pre-downloaded to the local nodes within the RS-WLAN before the visit of a pedestrian nomadic node, and then opportunistically scheduled to transmit to the nomadic node upon its arrival. In order to resolve the channel contention among multiple direct/relay links and exploit the predictable traffic characteristics as a result of packet pre-downloading, a double-loop receiver-initiated medium access control (DRMAC) scheme is proposed. The MAC scheme can achieve spatial and temporal diversity via the outer-loop and inner-loop MAC, respectively. A receiver initiated mechanism is used to reduce the signalling overhead, where the ACK message is used as an invitation of channel contention. An analytical model is established to evaluate the performance of the proposed MAC scheme. Numerical results demonstrate that the proposed MAC scheme can significantly improve the number of delivered packets from an RS-WLAN to a nomadic node as compared with the existing MAC schemes. [ABSTRACT FROM PUBLISHER]

In this paper, we show that the asymptotic probability density function (pdf) of the maxima of n independent and identically distributed (i.i.d.) sums of independent non-identically (i.n.i.d.) distributed gamma random variables (RVs) is a Gumbel pdf using Extreme Value Theory (EVT). We will also show that the asymptotic pdf of the maxima of n i.i.d. sums of correlated gamma RVs is a Gumbel pdf. Some applications in wireless communication are discussed where the maxima of n i.i.d. sums of correlated gamma RVs and maxima of n i.i.d. sums of i.n.i.d. gamma RVs arise. We discuss the utility of our results in the context of these applications. [ABSTRACT FROM PUBLISHER]

IEEE 802.11 wireless network supports multiple link rates at the physical layer. Each link rate is associated with a certain required Signal-to-Interference-and-Noise Ratio (SINR) threshold for successfully decoding received packets. On transmission failures, the 802.11 DCF performs a binary exponential backoff mechanism to discourage channel access attempts, hoping to reduce congestion. When traditional link adaptation is applied, both rate reduction and binary backoff represent double penalties for this wireless link, which may cause overly conservative transmission attempts. On the other hand, once transmission succeeds, 802.11 DCF resets the backoff contention window to the minimum value to encourage channel access attempts. At the same time, traditional link adaptation may also decide to increase the data rate, which leads to overly aggressive transmission attempts. We observe this improper interaction of link rate and backoff mechanism that harms the 802.11 system performance, due to separate consideration of those two parameters. In this paper, we propose to jointly adapt the rate and backoff parameters. Specifically, an Enhanced Adaptation of link Rate and Contention window, abbreviated as EARC, is devised. EARC is a closed-loop (receiver-assisted) link rate adaptation protocol that jointly considers the backoff mechanism. With only one extra byte carried by the DATA packet, EARC incurs little controlling overhead despite its receiver-assisted nature. Moreover, since SINR information commonly utilized by receiver-assisted protocols is not precisely supported in real devices, we introduce a rate selection reference (RSR) table empirically derived by constantly monitoring the environmental energy level and reception behavior. The RSR table then guides the receiver to select the best sustainable rate for the transmitter. Simulation results demonstrate the RSR table is a practical option for making the rate decision, and the proposed EARC approach is effective in maintaining high system throughput, compared to other link adaptation algorithms. [ABSTRACT FROM PUBLISHER]

The multi-path effect makes high speed broadband communications a very challenging task due to the severe inter-symbol interference (ISI). By concentrating energy in both the spatial and temporal domains, time-reversal (TR) transmission technique provides a great potential of low-complexity energy-efficient communications. In this paper, a novel concept of time-reversal division multiple access (TRDMA) is proposed as a wireless channel access method based on its high-resolution spatial focusing effect. It is proposed to use TR structure in multi-user downlink systems over multi-path channels, where signals of different users are separated solely by TRDMA. Both the single-transmit-antenna scheme and its enhanced version with multiple transmit antennas are developed and evaluated in this paper. The system performance is investigated in terms of its effective signal-to-interference-plus-noise ratio (SINR), the achievable sum rate and the achievable rates with outage. And some further discussions regarding its advantage over conventional rake receivers and the impact of spatial correlations between users are given at the end of this paper. It is shown in both analytical and simulation results that desirable properties and satisfying performances can be achieved in the proposed TRDMA multi-user downlink system, which makes TRDMA a promising candidate for future energy-efficient low-complexity broadband wireless communications. [ABSTRACT FROM AUTHOR]

The hybrid relay selection (HRS) scheme, which adaptively chooses amplify-and-forward (AF) and decode-and-forward (DF) protocols based on the decoding results at the relay, is very effective to achieve robust performance in wireless relay networks. This paper analyzes the frame error rate (FER) of the HRS scheme in general wireless relay networks without and with utilizing error control coding at the source node. We first develop an improved signal-to-noise ratio (SNR) threshold-based FER approximation model. Then, we derive an analytical average FER expression as well as a high SNR asymptotic expression for the HRS scheme and generalize to other relaying schemes. Simulation results exhibit an excellent agreement with the theoretical analysis, which validates the derived FER expressions. [ABSTRACT FROM AUTHOR]

This paper analyzes the performance of cooperative relay networks using adaptive decode-and-forward (DF) relaying in two-wave with diffuse power (TWDP) fading channels. Among the multiple parallel relays that participate in transmission, only the relays that successfully decode the source message retransmit the signals to the destination. At the destination, the direct signals from the source and the indirect signals via the relays are combined using maximal-ratio combining (MRC). We first derive a new closed-form expression for the outage probability, which encompasses the Rayleigh fading and Rician fading as special cases. We then derive a tight lower bound on the outage probability to reduce computational complexity. The correctness of our derivation is validated through Monte Carlo simulations. It is shown that increasing the number of relays decreases the outage probability at high signal-to-noise ratio (SNR), but increases the outage probability at low to medium SNR. [ABSTRACT FROM AUTHOR]