Spatial Network Calculus and Performance Guarantees in Wireless Networks
Pages 5033 - 5047
Abstract
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.
References
[1]
R. L. Cruz, “A calculus for network delay. I. Network elements in isolation,” IEEE Trans. Inf. Theory, vol. 37, no. 1, pp. 114–131, Jan. 1991.
[2]
C.-S. Chang, Performance Guarantees in Communication Networks. Berlin, Germany: Springer, 2000.
[3]
J.-Y. Le Boudec and P. Thiran, Network Calculus: A Theory of Deterministic Queuing Systems for the Internet. Cham, Switzerland: Springer, 2001.
[4]
3rd Generation Partnership Project (3GPP), “Study on physical layer enhancements for NR ultra-reliable and low latency case (URLLC),” 3GPP, Tech. Rep. (TR) 38.824, Mar. 2019.
[5]
D. Cavalcanti, J. Perez-Ramirez, M. M. Rashid, J. Fang, M. Galeev, and K. B. Stanton, “Extending accurate time distribution and timeliness capabilities over the air to enable future wireless industrial automation systems,” Proc. IEEE, vol. 107, no. 6, pp. 1132–1152, Jun. 2019.
[6]
M. Haenggi, “The meta distribution of the SIR in Poisson bipolar and cellular networks,” IEEE Trans. Wireless Commun., vol. 15, no. 4, pp. 2577–2589, Apr. 2016.
[7]
K. Feng and M. Haenggi, “Separability, asymptotics, and applications of the SIR meta distribution in cellular networks,” IEEE Trans. Wireless Commun., vol. 19, no. 7, pp. 4806–4816, Jul. 2020.
[8]
M. Kountouris, N. Pappas, and A. Avranas, “QoS provisioning in large wireless networks,” in Proc. 16th Int. Symp. Model. Optim. Mobile, Ad Hoc, Wireless Netw. (WiOpt), May 2018, pp. 1–6.
[9]
A. Al-Hourani and M. Haenggi, “Performance of next-generation cellular networks guarded with frequency reuse distance,” IEEE Trans. Commun., vol. 67, no. 10, pp. 7277–7287, Oct. 2019.
[10]
H. Q. Nguyen, F. Baccelli, and D. Kofman, “A stochastic geometry analysis of dense IEEE 802.11 networks,” in Proc. 26th IEEE Int. Conf. Comput. Commun., Jul. 2007, pp. 1199–1207.
[11]
F. Baccelli, M. Klein, M. Lebourges, and S. Zuyev, “Stochastic geometry and architecture of communication networks,” Telecommun. Syst., vol. 7, no. 1, pp. 209–227, Jun. 1997. 10.1023/A:1019172312328.
[12]
J. G. Andrews, F. Baccelli, and R. K. Ganti, “A tractable approach to coverage and rate in cellular networks,” IEEE Trans. Commun., vol. 59, no. 11, pp. 3122–3134, Nov. 2011.
[13]
M. Haenggi, J. G. Andrews, F. Baccelli, O. Dousse, and M. Franceschetti, “Stochastic geometry and random graphs for the analysis and design of wireless networks,” IEEE J. Sel. Areas Commun., vol. 27, no. 7, pp. 1029–1046, Sep. 2009.
[14]
F. Baccelli, B. Błaszczyszyn, and M. Karray, Random Measures, Point Processes, and Stochastic Geometry. France: Inria, Jan. 2020.
[15]
O. Dousse, F. Baccelli, and P. Thiran, “Impact of interferences on connectivity in ad hoc networks,” IEEE/ACM Trans. Netw., vol. 13, no. 2, pp. 425–436, Apr. 2005.
[16]
F. Baccelli and B. Błaszczyszyn, Stochastic Geometry and Wireless Networks: Volume II Applications. Norwell, MA, USA: Now Publishers, 2009.
[17]
D. J. Daley and D. Vere-Jones, An Introduction to the Theory of Point Processes. Volume II: General Theory and Structure. Cham, Switzerland: Springer, 2008.
[18]
H. Cramér, “Sur un nouveau théorème-limite de la théorie des probabilités, Colloque consacré à la théorie des probabilités,” in Actualités Scientifiques et Industrielles, vol. 736. Paris, France: Hermann & Cie, 1938, pp. 2–23.
[19]
D. G. Kendall, “On the number of lattice points inside a random oval,” Quart. J. Math., vols. os–19, no. 1, pp. 1–26, Jan. 1948.
[20]
P. D. Lax and R. S. Phillips, “The asymptotic distribution of lattice points in Euclidean and non-Euclidean spaces,” J. Funct. Anal., vol. 46, no. 3, pp. 280–350, May 1982.
[21]
F. Baccelli, M.-O. Haji-Mirsadeghi, and A. Khezeli, “Eternal family trees and dynamics on unimodular random graphs,” Contemporary Math., vol. 719, pp. 85–127, Nov. 2018.
[22]
H. Al-Zubaidy, J. Liebeherr, and A. Burchard, “A (min, X) network calculus for multi-hop fading channels,” in Proc. IEEE INFOCOM, 2013, pp. 1833–1841.
[23]
Y. Zhong, M. Haenggi, T. Q. S. Quek, and W. Zhang, “On the stability of static Poisson networks under random access,” IEEE Trans. Commun., vol. 64, no. 7, pp. 2985–2998, Jul. 2016.
[24]
F. Baccelli and Brémaud, Elements of Queuing Theory: Palm-Martingale Calculus and Stochastic Recurrence. Berlin, Germany: Springer, 1994.
[25]
H. Bruneel, “Performance of discrete-time queueing systems,” Comput. Oper. Res., vol. 20, no. 3, pp. 303–320, Apr. 1993.
[26]
S. Asmussen, Applied Probability and Queues, vol. 2. Cham, Switzerland: Springer, 2003.
[27]
G. Grimmett, Percolation. Cham, Switzerland: Springer, 1999.
[28]
K. Böröczky Jr., Finite Packing and Covering. Cambridge, U.K.: Cambridge Univ. Press, 2004.
Recommendations
Performance evaluation of routing protocols for ad hoc wireless networks
A mobile ad hoc network is a collection of autonomous mobile nodes that communicate with each other over wireless links. Such networks are expected to play an increasingly important role in future civilian and military settings, being useful for ...
Influence of Routing Protocols in Performance of Wireless Mobile Adhoc Network
EAIT '11: Proceedings of the 2011 Second International Conference on Emerging Applications of Information TechnologyAn ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure or centralized administration. A number of routing protocols such as Dynamic Source Routing (DSR), ...
Comments
Information & Contributors
Information
Published In
1536-1276 © 2023 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See https://www.ieee.org/publications/rights/index.html for more information.
Publisher
IEEE Press
Publication History
Published: 19 October 2023
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 03 Sep 2024
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in