Upper bound of loss probability in an OFDMA system with randomly located users

For OFDMA systems, we find a rough but easily computed upper bound for the probability of loosing communications by insufficient number of sub-channels on downlink. We consider as random the positions of receiving users in the system as well as the number of sub-channels dedicated to each one. We use recent results of the theory of point processes which reduce our calculations to the first and second moments of the total required number of sub-carriers.

💡 Research Summary

The paper addresses the problem of quantifying the probability that an OFDMA downlink will run out of sub‑channels when serving a random set of users. Rather than relying on heavy Monte‑Carlo simulations or intricate optimization, the authors adopt a stochastic‑geometric viewpoint: users are modeled as points of a homogeneous Poisson point process (PPP) on the plane, and each user’s demand for sub‑channels is a random integer that depends on its distance to the base station, path‑loss, shadowing, noise, and a target SNR threshold.

Using the modern machinery of point‑process theory, the total number of sub‑channels required by the system, (S=\sum_i X_i), is expressed as a linear functional of the PPP. Campbell’s theorem provides a compact way to compute the first moment
\