No Arabic abstract
Two mobile users communicate with a central decoder via two base stations. Communication between the mobile users and the base stations takes place over a Gaussian interference channel with constant channel gains or quasi-static fading. Instead, the base stations are connected to the central decoder through orthogonal finite-capacity links, whose connectivity is subject to random fluctuations. There is only receive-side channel state information, and hence the mobile users are unaware of the channel state and of the backhaul connectivity state, while the base stations know the fading coefficients but are uncertain about the backhaul links state. The base stations are oblivious to the mobile users codebooks and employ compress-and-forward to relay information to the central decoder. Upper and lower bounds are derived on average achievable throughput with respect to the prior distribution of the fading coefficients and of the backhaul links states. The lower bounds are obtained by proposing strategies that combine the broadcast coding approach and layered distributed compression techniques. The upper bound is obtained by assuming that all the nodes know the channel state. Numerical results confirm the advantages of the proposed approach with respect to conventional non-robust strategies in both scenarios with and without fading.
The fading wire-tap channel is investigated, where the source-to-destination channel and the source-to-wire-tapper channel are corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel state information is assumed to be known at both the transmitter and the receiver. The parallel wire-tap channel with independent subchannels is first studied, which serves as an information-theoretic model for the fading wire-tap channel. The secrecy capacity of the parallel wire-tap channel is established. This result is then specialized to give the secrecy capacity of the fading wire-tap channel, which is achieved with the source node dynamically changing the power allocation according to the channel state realization. An optimal source power allocation is obtained to achieve the secrecy capacity.
In this paper, we study covert communications between {a pair of} legitimate transmitter-receiver against a watchful warden over slow fading channels. There coexist multiple friendly helper nodes who are willing to protect the covert communication from being detected by the warden. We propose an uncoordinated jammer selection scheme where those helpers whose instantaneous channel gains to the legitimate receiver fall below a pre-established selection threshold will be chosen as jammers radiating jamming signals to defeat the warden. By doing so, the detection accuracy of the warden is expected to be severely degraded while the desired covert communication is rarely affected. We then jointly design the optimal selection threshold and message transmission rate for maximizing covert throughput under the premise that the detection error of the warden exceeds a certain level. Numerical results are presented to validate our theoretical analyses. It is shown that the multi-jammer assisted covert communication outperforms the conventional single-jammer method in terms of covert throughput, and the maximal covert throughput improves significantly as the total number of helpers increases, which demonstrates the validity and superiority of our proposed scheme.
A major performance degrading factor in free space optical communication (FSO) systems is atmospheric turbulence. Spatial diversity techniques provide a promising approach to mitigate turbulence-induced fading. In this paper, we study the error rate performance of FSO links with spatial diversity over atmospheric turbulence channels described by the Double Generalized Gamma distribution which is a new generic statistical model covering all turbulence conditions. We assume intensity modulation/direct detection with on-off keying and present the BER performance of single-input multiple-output (SIMO), multiple-input single-output (MISO) and multiple-input multiple-output (MIMO) FSO systems over this new channel model.
This paper considers the cooperative device-to-device (D2D) systems with non-orthogonal multiple access (NOMA). We assume that the base station (BS) can communicate simultaneously with all users to satisfy the full information transmission. In order to characterize the impact of the weak channel and different decoding schemes, two kinds of decoding strategies are proposed: emph{single signal decoding scheme} and emph{MRC decoding scheme}, respectively. For the emph{single signal decoding scheme}, the users immediately decode the received signals after receptions from the BS. Meanwhile, for the emph{MRC decoding scheme}, instead of decoding, the users will keep the receptions in reserve until the corresponding phase comes and the users jointly decode the received signals by employing maximum ratio combining (MRC). Considering Rayleigh fading channels, the ergodic sum-rate (SR), outage probability and outage capacity of the proposed D2D-NOMA system are analyzed. Moreover, approximate expressions for the ergodic SR are also provided with a negligible performance loss. Numerical results demonstrate that the ergodic SR and outage probability of the proposed D2D-NOMA scheme overwhelm that of the conventional NOMA schemes. Furthermore, it is also revealed that the system performance including the ergodic SR and outage probability are limited by the poor channel condition for both the emph{single signal decoding scheme} and conventional NOMA schemes.
In this work new achievable rates are derived, for the uplink channel of a cellular network with joint multicell processing, where unlike previous results, the ideal backhaul network has finite capacity per-cell. Namely, the cell sites are linked to the central joint processor via lossless links with finite capacity. The cellular network is abstracted by symmetric models, which render analytical treatment plausible. For this idealistic model family, achievable rates are presented for cell-sites that use compress-and-forward schemes combined with local decoding, for both Gaussian and fading channels. The rates are given in closed form for the classical Wyner model and the soft-handover model. These rates are then demonstrated to be rather close to the optimal unlimited backhaul joint processing rates, already for modest backhaul capacities, supporting the potential gain offered by the joint multicell processing approach. Particular attention is also given to the low-SNR characterization of these rates through which the effect of the limited backhaul network is explicitly revealed. In addition, the rate at which the backhaul capacity should scale in order to maintain the original high-SNR characterization of an unlimited backhaul capacity system is found.