This article proposes and evaluates a technique to predict the level of interference in wireless networks. We design a recursive predictor that computes future interference values at a given location by filtering measured interference at this location. The parametrization of the predictor is done offline by translating the autocorrelation of interference into an autoregressive moving average (ARMA) representation. This ARMA model is inserted into a steady-state Kalman filter enabling nodes to predict with low computational effort. Results show good performance in terms of accuracy between predicted and true values for relevant time horizons. Although the predictor is parametrized for the case of Poisson networks, Rayleigh fading, and fixed message lengths, a sensitivity analysis shows that it also works well in more general network scenarios. Numerical examples for underlay device-to-device communications and a common wireless sensor technology illustrate its broad applicability. The predictor can be applied as part of interference management to improve medium access, scheduling, and resource allocation.
In this context, interference is described as a random variable whose properties depend on several parameters including node locations, mobility, and data traffic patterns. These properties can be calculated in a given setup using tools from stochastic geometry. Examples include the mean interference (see @cite_18 @cite_36 ), higher-order statistics @cite_12 , and distribution (see @cite_31 @cite_0 @cite_30 @cite_9 @cite_41 ). These publications take into account the spatial features of wireless networks, which is fundamentally different to many classical" works on interference modeling and analysis (such as @cite_8 @cite_9 ). The past years have also seen a branch of research that analyzes how interference changes over time and space @cite_24 @cite_27 @cite_22 @cite_21 @cite_38 @cite_4 . Such interference dynamics can be described, for example, in terms of the autocorrelation of the received interference power (see @cite_27 @cite_34 ). Correlation influences the system behavior, such as the performance of diversity, relaying, multiple-input multiple-output (MIMO), and MAC protocols (see @cite_13 @cite_22 @cite_21 @cite_15 ).
@cite_30 @cite_38 @cite_18 @cite_4 @cite_22 @cite_8 @cite_36 @cite_41 @cite_9 @cite_21 @cite_15 @cite_0 @cite_24 @cite_27 @cite_31 @cite_34 @cite_13 @cite_12
2097395379 2022637917 2952966314 2121714289
We investigate spatial interference statistics for multigigabit outdoor mesh networks operating in the unlicensed 60-GHz "millimeter (mm) wave" band. The links in such networks are highly directional: Because of the small carrier wavelength (an order of magnitude smaller than those for existing cellular and wireless local area networks), narrow beams are essential for overcoming higher path loss and can be implemented using compact electronically steerable antenna arrays. Directionality drastically reduces interference, but it also leads to "deafness," making implicit coordination using carrier sense infeasible. In this paper, we make a quantitative case for rethinking medium access control (MAC) design in such settings. Unlike existing MAC protocols for omnidirectional networks, where the focus is on interference management, we contend that MAC design for 60-GHz mesh networks can essentially ignore interference and must focus instead on the challenge of scheduling half-duplex transmissions with deaf neighbors. Our main contribution is an analytical framework for estimating the collision probability in such networks as a function of the antenna patterns and the density of simultaneously transmitting nodes. The numerical results from our interference analysis show that highly directional links can indeed be modeled as pseudowired, in that the collision probability is small even with a significant density of transmitters. Furthermore, simulation of a rudimentary directional slotted Aloha protocol shows that packet losses due to failed coordination are an order of magnitude higher than those due to collisions, confirming our analytical results and highlighting the need for more sophisticated coordination mechanisms. In mobile networks, distance variations caused by node mobility generate fluctuations in the channel gains. Such fluctuations can be treated as another type of fading besides multipath effects. In this paper, the interference statistics in mobile random networks are characterized by incorporating the distance variations of mobile nodes to the channel gain fluctuations. The mean interference is calculated at the origin and at the border of a finite mobile network. The network performance is evaluated in terms of the outage probability. Compared to a static network, the interference in a single snapshot does not change under uniform mobility models. However, random waypoint mobility increases (decreases) the interference at the origin (at the border). Furthermore, due to the correlation of the node locations, the interference and outage are temporally and spatially correlated. We quantify the temporal correlation of the interference and outage in mobile Poisson networks in terms of the correlation coefficient and conditional outage probability, respectively. The results show that it is essential that routing, MAC, and retransmission schemes need to be smart (i.e., correlation-aware) to avoid bursts of transmission failures. A generalization of the Gaussian dirty-paper problem to a multiple access setup is considered. There are two additive interference signals, one known to each transmitter but none to the receiver. The rates achievable using Costa's strategies (i.e. by a random binning scheme induced by Costa's auxiliary random variables) vanish in the limit when the interference signals are strong. In contrast, it is shown that lattice strategies ("lattice precoding") can achieve positive rates independent of the interferences, and in fact in some cases - which depend on the noise variance and power constraints - they are optimal. In particular, lattice strategies are optimal in the limit of high SNR. It is also shown that the gap between the achievable rate region and the capacity region is at most 0.167 bit. Thus, the dirty MAC is another instance of a network setup, like the Korner-Marton modulo-two sum problem, where linear coding is potentially better than random binning. Lattice transmission schemes and conditions for optimality for the asymmetric case, where there is only one interference which is known to one of the users (who serves as a "helper" to the other user), and for the "common interference" case are also derived. In the former case the gap between the helper achievable rate and its capacity is at most 0.085 bit. In Costa's dirty-paper channel, Gaussian random binning is able to eliminate the effect of interference which is known at the transmitter, and thus achieve capacity. We examine a generalization of the dirty-paper problem to a multiple access channel (MAC) setup, where structured (lattice-based) binning seems to be necessary to achieve capacity. In the dirty-MAC, two additive interference signals are present, one known to each transmitter but none to the receiver. The achievable rates using Costa's Gaussian binning vanish if both interference signals are strong. In contrast, it is shown that lattice-strategies (“lattice precoding”) can achieve positive rates, independent of the interference power. Furthermore, in some cases-which depend on the noise variance and power constraints-high-dimensional lattice strategies are in fact optimal. In particular, they are optimal in the limit of high SNR-where the capacity region of the dirty MAC with strong interference approaches that of a clean MAC whose power is governed by the minimum of the users' powers rather than their sum. The rate gap at high SNR between lattice-strategies and optimum (rather than Gaussian) random binning is conjectured to be 1 2 log2(πe 6) ≈ 0.254 bit. Thus, the doubly dirty MAC is another instance of a network setting, like the Korner-Marton problem, where (linear) structured coding is potentially better than random binning.