Search

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]

The composite multipath/shadowing model is key to accurate modeling of real-world wireless channels, due to the combination of the effects of both fading and shadowing. However, the fundamental limits of spectrum-sharing cognitive radio have not been studied for such propagation conditions, leaving a gap in the analysis of these systems and, hence, the communication strategies that can be built upon toward improving performance. In this paper, we consider a primary/secondary spectrum-sharing network and study the performance of the secondary's multihop link by taking the composite multipath/shadowing model, which is described by the generalized- $K$ distribution, for the radio channels. In the multihop system, communication between secondary users (SUs) is assisted by intermediate relay terminals, under coexistence constraints with the primary users (PUs) . We assess the performance of the multihop system, first by deriving the moment generating function (mgf) and the probability density function (pdf) of the upper bounded end-to-end signal-to-noise ratio in closed form. The result is then used to obtain closed-form expressions of bounds on the ergodic capacity and the average bit error rate (ABER) , under the resource sharing constraints. The theoretical results are assessed with numerical analysis for different operating conditions. [ABSTRACT FROM PUBLISHER]

In this paper, an energy harvesting dual-hop relaying system without/with the presence of co-channel interference (CCI) is investigated. Specifically, the energy constrained multi-antenna relay node is powered by either the information signal of the source or via the signal receiving from both the source and interferer. In particular, we first study the outage probability and ergodic capacity of an interference free system, and then extend the analysis to an interfering environment. To exploit the benefit of multiple antennas, three different linear processing schemes are investigated, namely, 1) Maximum ratio combining/maximum ratio transmission (MRC/MRT), 2) Zero-forcing/MRT (ZF/MRT) and 3) Minimum mean-square error/MRT (MMSE/MRT). For all schemes, both the systems outage probability and ergodic capacity are studied, and the achievable diversity order is also presented. In addition, the optimal power splitting ratio minimizing the outage probability is characterized. Our results show that the implementation of multiple antennas increases the energy harvesting capability, hence, significantly improves the systems performance. Moreover, it is demonstrated that the CCI could be potentially exploited to substantially boost the performance, while the choice of a linear processing scheme plays a critical role in determining how much gain could be extracted from the CCI. [ABSTRACT FROM PUBLISHER]

In this paper, the outage behavior of dual-hop multiuser multirelay cognitive radio networks under spectrum-sharing constraints is investigated. In the proposed cognitive radio network, the secondary network is composed of one secondary-user (SU) source that communicates with one out of L destinations through a direct link and also via the help of one out of N relays by using an efficient relay–destination selection scheme. Additionally, a selection combining (SC) scheme to select the best link (direct or dual-hop link) from the SU source is employed at the selected SU destination. Adopting an underlay approach, the SU communication is performed accounting for an interference constraint, where the overall transmit power is governed by the interference at the primary-user (PU) receiver, as well as by the maximum transmission power available at the respective nodes. Closed-form expressions for the outage probability are derived, from which an asymptotic analysis reveals that the diversity order of the considered system is not affected by the interference and is equal to N + L for both decode-and-forward (DF) and amplify-and-forward (AF) relaying protocols. The analytical results are corroborated by Monte Carlo simulations, and insightful discussions are provided. [ABSTRACT FROM PUBLISHER]

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 investigates the impact of practical operation conditions such as channel information imperfection (CII), independent nonidentical (i.n.i) fading distributions, strict power constraints (i.e., peak transmit power constraint and primary outage constraint), and primary interference on outage performance of opportunistic relay selection (ORS) in underlay cooperative cognitive networks (UCCNs). Toward this end, the power of secondary transmitters is first established to meet strict power constraints and account for primary interference and CII. Then, exact closed-form outage probability expressions for the secondary destination employing the maximum ratio combining (MRC) and the selection combining (SC) are proposed to promptly evaluate the effect of these conditions and provide useful insights into performance limits. Numerous results illustrate significant system performance deterioration due to primary interference and CII, performance saturation phenomenon in the secondary network, performance compromise between the secondary network and the primary network, significant performance improvement with respect to the increase in the number of involved relays, a large gap between the lower outage bound (MRC's outage performance) and the upper outage bound (SC's outage performance), and the advantage of utilizing direct channel between the source and the destination. [ABSTRACT FROM PUBLISHER]

In this paper, we consider collaborative beamforming for a cooperative two-way relay spectrum-sharing system where a pair of secondary transceivers communicates via a set of secondary decode-and-forward (DF) relays in the presence of multiple primary transceivers. Among the available relays, only those that receive the signals reliably participate in the cooperative beamforming process and use network coding to simultaneously transmit the weighted signals to the transceivers. Two practical two-way relaying strategies are investigated, namely, DF- xoring and DF-superposition. The former is based on bitwise-level xoring of the detected signals at the relays, whereas the latter is based on symbolwise-level addition at the relays. For each relaying strategy, we derive general optimal beamforming vectors at the relays to keep the interference inflicted on the primary receivers to a predefined threshold. Employing zero-forcing beamforming as a special case, we present an analytical framework of the performance of the secondary system considering the effect of the primary–secondary mutual cochannel interference (CCI). In particular, we derive closed-form expressions for the outage probability, bit error rate (BER), and achievable sum rates over independent and identically distributed Rayleigh fading channels. Numerical results demonstrate the effectiveness of beamforming in compensating for the cognitive system performance loss due to CCI in addition to mitigating the interference to the primary receivers. Simulation results also show that, when the received signals at the relays are equally weighted, DF- xor always outperforms both DF-superposition and amplify-and-forward (AF) relaying. [ABSTRACT FROM PUBLISHER]

In this paper, we propose a two-way secure communication scheme where two transceivers exchange confidential messages via a wireless-powered untrusted amplify-and-forward relay in the presence of an external jammer. We take into account both friendly jamming (FJ) and Gaussian noise jamming (GNJ) scenarios. Based on the time switching (TS) architecture at the relay, the data transmission is done in three phases. In the first phase, both the energy-starved nodes, the untrustworthy relay and the jammer, are charged by noninformation radio frequency (RF) signals from the sources. In the second phase, the two sources send their information signals and concurrently, the jammer transmits artificial noise to confuse the curious relay. Finally, the third phase is dedicated to forward a scaled version of the received signal from the relay to the sources. For the proposed secure transmission schemes, we derive new closed-form lower-bound expressions for the ergodic secrecy sum rate (ESSR) in the high signal-to-noise ratio (SNR) regime. We further analyze the asymptotic ESSR to determine the key parameters; the high SNR slope and the high SNR power offset of the jamming based scenarios. To highlight the performance advantage of the proposed FJ, we also examine the scenario of without jamming (WoJ). Finally, numerical examples and discussions are provided to acquire some engineering insights, and to demonstrate the impacts of different system parameters on the secrecy performance of the considered communication scenarios. The numerical results illustrate that the proposed FJ significantly outperforms the traditional one-way communication and the constellation rotation (CR) approach, as well as our proposed benchmarks, the two-way WoJ and GNJ scenarios. [ABSTRACT FROM AUTHOR]

This paper investigates the application of simultaneous wireless information and power transfer (SWIPT) to cooperative non-orthogonal multiple access (NOMA). A new cooperative multiple-input single-output (MISO) SWIPT NOMA protocol is proposed, where a user with a strong channel condition acts as an energy-harvesting (EH) relay by adopting power splitting (PS) scheme to help a user with a poor channel condition. By jointly optimizing the PS ratio and the beamforming vectors, we aim at maximizing the data rate of the “strong user” while satisfying the QoS requirement of the “weak user”. To resolve the formulated nonconvex problem, the semidefinite relaxation (SDR) technique is applied to reformulate the original problem, by proving the rank-one optimality. And then an iterative algorithm based on successive convex approximation (SCA) is proposed for complexity reduction, which can at least attain its stationary point efficiently. In view of the potential application scenarios, e.g., Internet of Things (IoT), the single-input single-output (SISO) case is also studied. The formulated problem is proved to be strictly unimodal with respect to the PS ratio. Hence, a golden section search (GSS) based algorithm with closed-form solution at each step is proposed to find the unique global optimal solution. It is worth pointing out that the SCA method can also converge to the optimal solution in SISO cases. In the numerical simulation, the proposed algorithm is numerically shown to converge within a few iterations, and the SWIPT-aided NOMA protocol outperforms the existing transmission protocols. [ABSTRACT FROM PUBLISHER]

In this paper, we propose an adaptive-rate transmission scheme with opportunistic scheduling in a two-hop relay network over a Rayleigh fading environment. We assume that only channel state information (CSI) at receivers is available in a decentralized network, where n source-to-destination pairs are completely independent and m half-duplex relays cooperate by exchanging their selected source IDs at the beginning of the two-hop transmission. In the limit of large n and fixed m, the system throughput of the scheme scales as (m/ \2)\log\, \log\, n. It is shown that this is the same achievable scaling even with perfect CSI assumptions at transmitters and full cooperation among nodes. Furthermore, it is shown that the optimal scaling of m is \Theta(\log\, n), under which a linear increase in throughput with m is obtained. A closed-form delay expression of the proposed scheme is also presented. [ABSTRACT FROM PUBLISHER]

Energy accumulation and information accumulation are two approaches to exploit multiple transmissions in wireless relay systems. There is a tradeoff between energy accumulation and information accumulation from an outage perspective, in which a packet is successfully received if the channel capacity exceeds the transmission rate. However, how to strike a balance between these two approaches is still unknown. In this paper, we propose a new rateless-coding-based transmission scheme in wireless relay systems, where the relay superposes two rateless-coded packets generated from different codebooks to strike a balance between energy accumulation and information accumulation. We analyze the average end-to-end throughput of the proposed scheme and formulate an optimization problem to find the optimal power allocation ratio. Simulation results will validate our analysis and show that, compared with pure energy accumulation and pure information accumulation, our proposed scheme can achieve substantial throughput gain. [ABSTRACT FROM PUBLISHER]

This paper presents a practical virtual multiple-input–multiple-output (MIMO) system that implements bit-interleaved coded modulation (BICM) and compress-and-forward (CF) cooperation. A minimum mean square error (MMSE) receiver is considered since it has low complexity and allows good performance when combined with BICM techniques. A closed-form upper bound for the system error probability is derived, and based on this we prove that the smallest singular value of the cooperative channel matrix determines the system error performance. Accordingly, an adaptive modulation and cooperation scheme is proposed, which uses the smallest singular value as the threshold strategy. Depending on the instantaneous channel conditions, the system could therefore adapt to choose a suitable modulation type for transmission and an appropriate quantization rate to perform CF cooperation. It is shown that the adaptive modulation and cooperation scheme not only enables the system to achieve comparable performance to the case with fixed quantization rates but eliminates unnecessary complexity for quantization operations and conference link communication as well. [ABSTRACT FROM PUBLISHER]

A multiple-relay assisted cooperative automatic-repeat-request (CARQ) system is proposed in interference-limited scenario, where multiple-user detection (MUD) receivers using successive interference cancellation (SIC) are employed at the relay nodes (RNs) and the destination node (DN) to combat cochannel interference (CCI). We analyze the outage performance and propose a novel best effort-detection-based opportunistic relay selection (BED-ORS) scheme, which achieves significantly better outage performance than the traditional highest SNR-based ORS scheme offered in the literature. Moreover, considering the effects of the outdated channel state information (CSI), an improved-BED-ORS (I-BED-ORS) scheme is proposed to enhance the robustness against CSI imperfections. [ABSTRACT FROM PUBLISHER]

We study the diversity-multiplexing tradeoff (DMT) for the slow fading interference channel with a relay (ICR). We derive four inner bounds on the DMT region: the first is based on the compress-and-forward (CF) relaying scheme, the second is based on the decode-and-forward (DF) relaying scheme, and the last two bounds are based on the half-duplex (HD) and full-duplex (FD) amplify-and-forward (AF) schemes. For the CF and DF schemes, we find conditions on the channel parameters and the multiplexing gains, under which the corresponding inner bound achieves the optimal DMT region. We also identify the cases in which the DMT region of the ICR corresponds to that of two parallel slow fading relay channels, implying that interference does not decrease the DMT for each pair, and that a single relay can be DMT-optimal for two pairs simultaneously. For the HD-AF scheme, we derive conditions on the channel coefficients under which the proposed scheme achieves the optimal DMT for the AF-based relay channel. Finally, we identify the conditions under which adding a relay strictly enlarges the DMT region relative to the interference channel without a relay. [ABSTRACT FROM AUTHOR]

We analyze a secure dual-hop mixed radio frequency-free space optical (RF-FSO) downlink simultaneous wireless information and power transfer system. The FSO link and all RF links experience Gamma–Gamma, independent, and identical Nakagami- $m$ fading, respectively. We analyze the effects of atmospheric turbulence, pointing error, detection technology, path loss, and energy harvesting on secrecy performance. Signal-to-noise ratios at both the legitimate and illegitimate receivers are not independent since they are both simultaneously influenced by the FSO link. We derive the closed-form expression of the secrecy outage probability (SOP) as well as the asymptotic result for SOP when signal-to-noise ratios at relay and legitimate destinations tend to infinity. Monte-Carlo simulations are performed to verify the accuracy of our analysis. The results show that the secrecy diversity order (SDO) depends on the fading parameter of the relay-destination link and the number of the destination’s antennas. In addition, the SDO also depends on the fading parameters, the pointing error parameter, and the detection type of the FSO link. [ABSTRACT FROM AUTHOR]

The emerging cognitive radio (CR) technology enables the introduction of hierarchical spectrum sharing in wireless networks, where the primary users (PUs) have transmission guarantees, but the coexisting secondary users (SUs) need to be cognitive toward primary activities and adjust their transmissions to conform to the primary constraints. We consider large-scale coexisting primary and secondary networks, where concurrent primary and secondary transmissions are allowed and where the SUs control the interference at the primary receivers by tuning the probability of transmitting and by forming a primary exclusive region (PER) around each primary receiver within which all SUs have to be silent. Moreover, the primary source–destination pairs utilize vertical cooperation by selecting a nearby SU to act as a cooperative relay. We define a unified analytic framework to model cognition and cooperative transmission in large-scale networks. We characterize the achievable gains considering the transmission density region and show that both of the networks have strong incentives to participate in the collaboration. [ABSTRACT FROM PUBLISHER]