Dual-Branch MRC Receivers under Spatial Interference Correlation and Nakagami Fading

Despite being ubiquitous in practice, the performance of maximal-ratio combining (MRC) in the presence of interference is not well understood. Because the interference received at each antenna originates from the same set of interferers, but partially de-correlates over the fading channel, it possesses a complex correlation structure. This work develops a realistic analytic model that accurately accounts for the interference correlation using stochastic geometry. Modeling interference by a Poisson shot noise process with independent Nakagami fading, we derive the link success probability for dual-branch interference-aware MRC. Using this result, we show that the common assumption that all receive antennas experience equal interference power underestimates the true performance, although this gap rapidly decays with increasing the Nakagami parameter $m_{\text{I}}$ of the interfering links. In contrast, ignoring interference correlation leads to a highly optimistic performance estimate for MRC, especially for large $m_{\text{I}}$. In the low outage probability regime, our success probability expression can be considerably simplified. Observations following from the analysis include: (i) for small path loss exponents, MRC and minimum mean square error combining exhibit similar performance, and (ii) the gains of MRC over selection combining are smaller in the interference-limited case than in the well-studied noise-limited case.Comment: to appear in IEEE Transactions on Communication

Outage analysis of superposition modulation aided network coded cooperation in the presence of network coding noise

We consider a network, where multiple sourcedestination pairs communicate with the aid of a half-duplex relay node (RN), which adopts decode-forward (DF) relaying and superposition-modulation (SPM) for combining the signals transmitted by the source nodes (SNs) and then forwards the composite signal to all the destination nodes (DNs). Each DN extracts the signals transmitted by its own SN from the composite signal by subtracting the signals overheard from the unwanted SNs. We derive tight lower-bounds for the outage probability for transmission over Rayleigh fading channels and invoke diversity combining at the DNs, which is validated by simulation for both the symmetric and the asymmetric network configurations. For the high signal-to-noise ratio regime, we derive both an upperbound as well as a lower-bound for the outage performance and analyse the achievable diversity gain. It is revealed that a diversity order of 2 is achieved, regardless of the number of SN-DN pairs in the network. We also highlight the fact that the outage performance is dominated by the quality of the worst overheated link, because it contributes most substantially to the network coding noise. Finally, we use the lower bound for designing a relay selection scheme for the proposed SPM based network coded cooperative communication (SPM-NC-CC) system.<br/

Multihop Diversity for Fading Mitigation in Multihop Wireless Networks

The concept of multihop diversity is proposed, where all the nodes of a multihop link are assumed to have buffers for temporarily storing their received packets. During each time-slot, the best hop having, for example, the highest signal-to-noise ratio (SNR), is selected from the set of those hops that have packets awaiting transmission in the buffer. The packet is then transmitted over the best hop. This hop-selection procedure yields selection diversity, but it requires the global channel knowledge of the hops’ channel quality. In this paper, we assume having perfect channel knowledge and focus our attention on the principles and performance bounds of the error probability and outage probability. Our studies show that relying on multiple hops has the potential of providing a significant diversity gain, which may be exploited for enhancing the reliability of wireless multihop communications

A Simple Cooperative Diversity Method Based on Network Path Selection

Cooperative diversity has been recently proposed as a way to form virtual antenna arrays that provide dramatic gains in slow fading wireless environments. However most of the proposed solutions require distributed space-time coding algorithms, the careful design of which is left for future investigation if there is more than one cooperative relay. We propose a novel scheme, that alleviates these problems and provides diversity gains on the order of the number of relays in the network. Our scheme first selects the best relay from a set of M available relays and then uses this best relay for cooperation between the source and the destination. We develop and analyze a distributed method to select the best relay that requires no topology information and is based on local measurements of the instantaneous channel conditions. This method also requires no explicit communication among the relays. The success (or failure) to select the best available path depends on the statistics of the wireless channel, and a methodology to evaluate performance for any kind of wireless channel statistics, is provided. Information theoretic analysis of outage probability shows that our scheme achieves the same diversity-multiplexing tradeoff as achieved by more complex protocols, where coordination and distributed space-time coding for M nodes is required, such as those proposed in [7]. The simplicity of the technique, allows for immediate implementation in existing radio hardware and its adoption could provide for improved flexibility, reliability and efficiency in future 4G wireless systems.Comment: To appear, IEEE JSAC, special issue on 4

On Dependable Wireless Communications through Multi-Connectivity

The realization of wireless ultra-reliable low-latency communications (URLLC) is one of the key challenges of the fifth generation (5G) of mobile communications systems and beyond. Ensuring ultra-high reliability together with a latency in the (sub-)millisecond range is expected to enable self-driving cars, wireless factory automation, and the Tactile Internet. In wireless communications, reliability is usually only considered as percentage of successful packet delivery, aiming for 1 − 10⁻⁵ up to 1 − 10⁻⁹ in URLLC