Queue Analysis with Finite Buffer by Stochastic Geometry in Downlink Cellular Networks

In this work, we proposed a tractable mathematical framework to analyze the coverage probability in dynamic downlink cellular networks taking into account the queue dynamics with finite buffer restriction. In particular, the developed model is based on stochastic geometry and queueing theory to handle the interaction between the coverage probability and the queueing state evolution. We analyze the coverage probability as well as packet loss probability by discrete time Markov chain (DTMC) at stationary regime. We explicitly derive the influence of the packet buffer length to the coverage and packet loss probability. We show in particular that small buffer length leads to a better coverage probability but also to a larger packet loss probability, advocating for a tradeoff between these two metrics.