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 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. Using this approach, we derive performance guarantees in device-to-device, ad hoc, and cellular networks under proper regulations, respectively. We give universal bounds on the SINR for all links, which gives 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

翻译：本文提出了一种新颖的方法，用于在任意大规模无线网络中为所有链路提供性能保障。该方法引入了平稳空间点过程的空间调节特性，并建立了这一调节演算的初步框架，可视为经典网络演算在空间上的扩展。具体而言，定义了两类调节：一类包括球调节和散粒噪声调节，二者被证明等价，并可用于推导干扰功率的上界；另一类包括空洞调节，用于对信号功率进行下界约束。这些调节分别在强意义和弱意义下定义：前者要求调节在空间各处成立，而后者仅要求调节在联合平稳点过程的观测下成立。利用这一方法，我们分别在适当调节下推导了设备到设备网络、自组织网络和蜂窝网络中的性能保障。我们给出了所有链路上信干噪比的通用界，这基于信息论可达性提供了链路服务保障。这些保障与经典网络演算相结合，为无线排队网络中的所有数据包提供了端到端时延保障。此类保障在未进行空间调节的网络（如泊松网络）中并不存在。