This paper defines a new model which incorporates three key ingredients of a large class of wireless communication systems: (1) spatial interactions through interference, (2) dynamics of the queueing type, with users joining and leaving, and (3) carrier sensing and collision avoidance as used in, e.g., WiFi. In systems using (3), rather than directly accessing the shared resources upon arrival, a customer is considerate and waits to access them until nearby users in service have left. This new model can be seen as a missing piece of a larger puzzle that contains such dynamics as spatial birth-and-death processes, the Poisson-Hail model, and wireless dynamics as key other pieces. It is shown that, under natural assumptions, this model can be represented as a Markov process on the space of counting measures. The main results are then two-fold. The first result is on the shape of the stability region and, more precisely, on the characterization of the critical value of the arrival rate that separates stability from instability. The second result is of a more qualitative or perhaps even ethical nature. There is evidence that for natural values of the system parameters, the implementation of sensing and the delayed access for collision avoidance can stabilize a system that would be unstable if immediate access to the shared resources would be granted. In other words, for these parameters, renouncing greedy access makes sharing sustainable, whereas indulging in greedy access kills the system.

The reconfigurable intelligent surface (RIS) technology allows one to engineer spatial diversity in complex cellular networks. This paper provides a stochastic geometry framework for the system-level performance assessment of RIS-assisted networks. To account for the inherent randomness in the spatial deployments of base stations (BSs) and RISs, we model the RIS placements as point processes (PPs) conditioned on the associated BSs, which are modeled by a Poisson point process (PPP). We assume that the system uses the orthogonal frequency division multiplexing (OFDM) technique to exploit the multipath diversity provided by RISs. The downlink coverage probability and ergodic rate can be evaluated when RISs operate as batched powerless beamformers. The resulting analytical expressions provide a general methodology for assessing the impact of a parameterized RIS model on system performance. These RIS PPs can be adapted based on the deployment strategy. We focus on modeling the RISs as a Matérn cluster process (MCP), where each RIS cluster is a finite PPP within a ring centered on its associated BS. This model connects link-level knowledge to system-level impacts, such as overall interference and the effects of imperfect channel state information (CSI). It also evaluates key RIS deployment parameters, including batch size and RIS density. Furthermore, we analyze a variant of RIS placement in which RISs are deployed around coverage holes to demonstrate the framework’s flexibility and applicability. Numerical evaluations of the analytical expressions and Monte-Carlo simulations jointly validate the proposed analytical approach and provide valuable insights into the design of future RIS-assisted cellular networks.

Providing performance guarantees is one of the critical objectives of recent and future communication networks, toward which regulations, i.e., constraints on key system parameters, have played an indispensable role. This is the case for large wireless communication networks, where spatial regulations (e.g., constraints on intercell distance) have recently been shown, through a spatial network calculus, to be essential for establishing provable wireless link-level guarantees. In this work, we focus on performance guarantees for the downlink of cellular networks where we impose a hardcore (spatial) regulation on base station (BS) locations and evaluate how BS scheduling (which controls which BSs can transmit at a given time) impacts performance. Hardcore regulation is the simplest form of spatial regulation that enforces a minimal distance between any pair of transmitters in the network. Within this framework of spatial network calculus, we first provide an upper bound on the power of total interference for a spatially regulated cellular network, and then, identify the regimes where scheduling BSs yields better link-level rate guarantees compared to scenarios where base stations are always active. The hexagonal cellular network is analyzed as a special case. The results offer insights into what spatial regulations are needed, when to choose scheduling, and how to potentially reduce the network power consumption to provide a certain target performance guarantee.

This work develops a novel approach toward performance guarantees for all links in arbitrarily large wireless networks. It introduces a spatial network calculus, consisting of spatial regulation properties for stationary point processes and the first steps of a calculus for this regulation, which can be seen as an extension to space of the classical network calculus. Specifically, two classes of regulations are defined: one includes ball regulation and shot-noise regulation, which are shown to be equivalent and upper constraint interference; the other one includes void regulation, which lower constraints the signal power. These regulations are defined both in the strong and weak sense: the former requires the regulations to hold everywhere in space, whereas the latter only requires the regulations to hold as observed by a jointly stationary point process. Using this approach, we derive performance guarantees in device-to-device, ad hoc, and cellular networks under proper regulations. We give universal bounds on the SINR for all links, which give link service guarantees based on information-theoretic achievability. They are combined with classical network calculus to provide end-to-end latency guarantees for all packets in wireless queuing networks. Such guarantees do not exist in networks that are not spatially regulated, e.g., Poisson networks.

This work develops a novel approach towards performance guarantees for all links in arbitrarily large wireless networks. It introduces spatial regulation properties for stationary spatial point processes and develops the first steps of a calculus for this regulation, which can be seen as an extension to space of the classical network calculus. Specifically, two classes of regulations are defined: one includes ball regulation and shot-noise regulation, which are shown to be equivalent and leads to upper bounds on the interference power; the other one includes void regulation, which lower constraints the signal power. These regulations are defined both in the strong and weak sense: the former requires the regulations to hold everywhere in space, whereas the latter only requires the regulations to hold as observed by a jointly stationary point process. Focusing on device-to-device networks, we then derive universal bounds on the SINR based on spatial regulations and, in turn, link service guarantees assuming information theoretic achievability. They are combined with classical network calculus to provide end-to-end latency guarantees for all packets in such wireless queuing networks. Such guarantees do not exist in networks that are not spatially regulated, e.g., Poisson networks.

In coverage-oriented networks, base stations (BSs) are deployed in a way such that users at the cell boundaries achieve sufficient signal strength. The shape and size of cells vary from BS to BS, since the large-scale signal propagation conditions differ in different geographical regions. This work proposes and studies a joint spatial-propagation (JSP) model, which considers the correlation between cell radii and the large-scale signal propagation (captured by shadowing). We first introduce the notion of the directional radius of Voronoi cells, which has applications in cellular networks and beyond. The directional radius of a cell is defined as the distance from the nucleus to the cell boundary at an angle relative to the direction of a uniformly random location in the cell. We study the distribution of the radii in two types of cells in the Poisson Voronoi tessellations: the zero-cell, which contains the origin, and the typical cell. The results are applied to analyze the JSP model. We show that, even though the Poisson point process (PPP) is often considered as a pessimistic spatial model for BS locations, the JSP model with the PPP achieves coverage performance close to the most optimistic one-the standard triangular lattice model. Further, we show that the network performance depends critically on the variance of the large-scale path loss along the cell boundary.

The signal-to-interference-ratio (SIR) meta distribution (MD) characterizes the link performance in interference-limited wireless networks: it evaluates the fraction of links that achieve an SIR threshold θ with a reliability above x. In this work, we show that in Poisson networks, for any independent fading and power-law path loss with exponent α, the SIR MD can be expressed as the product of θ-2/αand a function of x when (θ, x) is in the so-called “separable region”. We show by simulation that the separable form serves as a good approximation of the SIR MD in Ginibre and triangular lattice networks when θ is chosen large enough. Given the quest for ultra-reliable transmission, we study the asymptotics of the SIR MD as x → 1 for general cellular networks with Rayleigh fading. Finally, we apply our results to characterize the distribution of the link rate, where each link transmits with a rate satisfying a given reliability x, and the asymptotic distribution of the local delay, defined as the number of transmissions needed for a message to be received successfully.

The link quality in cellular networks strongly depends on the location of the users relative to the serving and interfering base stations (BSs). This paper proposes a location-dependent BS cooperation scheme for general cellular networks, where BSs are modeled using a stationary point process and the Voronoi diagram forms the cell structure. The cooperation scheme is based on the relative average received signal strength from the three strongest BSs. For the channel model where Rayleigh fading and power-law path loss are considered, each cell is partitioned into three regions based on the relative distance to the three nearest BSs: the cell center region, cell edge region, and cell corner region. The area fraction of each region is tuned by the so-called cooperation level -y ∈ [0, 1]. We study the scheme where users in the above regions receive the non-coherent joint transmission from one, two, and three nearest BSs, respectively. As such, the scheme primarily helps users vulnerable to interference. We analyze the signal-to-interference ratio (SIR) in Poisson networks and show that a moderate -y jointly improves the average SIR performance and the network fairness.