Inter-cell interference (ICI) is one of the major performance-limiting factors in the context of modern cellular systems. To tackle ICI, coordinated multi-point (CoMP) schemes have been proposed as a key technology for next-generation mobile communication systems. Although CoMP schemes offer promising theoretical gains, their performance could degrade significantly because of practical issues such as limited backhaul. To address this issue, we explore a novel uplink interference management scheme called anywhere decoding, which requires exchanging just a few bits of information per coding interval among the base stations (BSs). In spite of the low overhead of anywhere decoding, we observe considerable gains in the outage probability performance of cell-edge users, compared to no cooperation between BSs. Additionally, asymptotic results of the outage probability for high-SNR regimes demonstrate that anywhere decoding schemes achieve full spatial diversity through multiple decoding opportunities, and they are within 1.5 dB of full cooperation.
: In this scheme, is necessary between the BSs. Instead, BSs estimate the channels of interfering terminals and either perform successive interference cancellation (SIC), take spatial characteristics of interference into account in adjusting receive filters, i.e., interference rejection combining (IRC), or implement a combination of these two schemes (IRC+SIC) @cite_1 .
@cite_1
2011266042 2131089922 2039876598 2067723929
Using a multi-tier Poisson model, this paper studies the performance gain of successive interference cancellation (SIC) in the downlink of K-tier heterogeneous cellular networks (HCNs). For each tier, a fraction of base stations (BSs) is non-accessible. By using a framework based on the marked path loss process with fading and calculating the equivalent access probability, we analytically characterize the coverage probability, i.e., the probability of successfully connecting to at least one accessible BS, for a typical user equipment with finite or infinite SIC capability. The results show how the performance gain of SIC depends on many system parameters including path loss exponent, coding rate, fading distributions and BS accessibilities and densities. We show for contemporary OFDM-based HCNs, infinite SIC capability is often unnecessary. In fact, under typical system parameters, most of the gain of SIC comes from the ability of canceling only a single non-accessible BS. The performance benefits of two interference cancellation methods, successive interference cancellation (SIC) and joint detection (JD), in wireless ad hoc networks are compared within the transmission capacity framework. SIC involves successively decoding and subtracting out strong interfering signals until the desired signal can be decoded, while higher-complexity JD refers to simultaneously decoding the desired signal and the signals of a few strong interferers. Tools from stochastic geometry are used to develop bounds on the outage probability as a function of the spatial density of interferers. These bounds show that SIC performs nearly as well as JD when the signal-to-interference ratio (SIR) threshold is less than one, but that SIC is essentially useless for SIR thresholds larger than one whereas JD provides a significant outage benefit regardless of the SIR threshold. In this paper, we address the problem of computing the probability that r out of n interfering wireless signals are "captured," i.e., received with sufficiently large Signal to Interference plus Noise Ratio (SINR) to correctly decode the signals by a receiver with multi-packet reception (MPR) and Successive Interference Cancellation (SIC) capabilities. We start by considering the simpler case of a pure MPR system without SIC, for which we provide an expression for the distribution of the number of captured packets, whose computational complexity scales with n and r. This analysis makes it possible to investigate the system throughput as a function of the MPR capabilities of the receiver. We then generalize the analysis to SIC systems. In addition to the exact expressions for the capture probability and the normalized system throughput, we also derive approximate expressions that are much easier to compute and provide accurate results in some practical scenarios. Finally, we present selected results for some case studies with the purpose of illustrating the potential of the proposed mathematical framework and validating the approximate methods. We study the question of determining locations of base stations (BSs) that may belong to the same or to competing service providers. We take into account the impact of these decisions on the behavior of intelligent mobile terminals that can connect to the base station that offers the best utility. The signal-to-interference-plus-noise ratio (SINR) is used as the quantity that determines the association. We first study the SINR association-game: We determine the cells corresponding to each base stations, i.e., the locations at which mobile terminals prefer to connect to a given base station than to others. We make some surprising observations: 1) displacing a base station a little in one direction may result in a displacement of the boundary of the corresponding cell to the opposite direction; 2) a cell corresponding to a BS may be the union of disconnected subcells. We then study the hierarchical equilibrium in the combined BS location and mobile association problem: We determine where to locate the BSs so as to maximize the revenues obtained at the induced SINR mobile association game. We consider the cases of single frequency band and two frequency bands of operation. Finally, we also consider hierarchical equilibria in two frequency systems with successive interference cancellation.