|Speaker :||Miodrag Jovanovic|
|Time:||2:00 pm - 3:00 pm|
|Location:||LINCS Meeting Room 40|
We assume a space-time Poisson process of call arrivals on the infinite plane, independently marked by data volumes and served by a cellular network modeled by an infinite ergodic point process of base stations. Each point of this point process represents the location of a base station that applies a processor sharing policy to serve users arriving in its vicinity, modeled by the Voronoi cell, possibly perturbed by some random signal propagation effects.Using ergodic arguments and the Palm theoretic formalism, we define a global mean user throughput in the cellular network and prove that it is equal to the ratio of mean traffic demand to the mean number of users in the steady state of the “typical cell” of the network. Here, both means account for double averaging: over time and network geometry, and can be related to the per-surface traffic demand, base-station density and the spatial distribution of the signal-to-interference-and-noise ratio. This latter accounts for network irregularities, shadowing and cell dependence via some cell-load equations.We validate our approach comparing analytical and simulation results for Poisson network model to real-network measurements. Little’s law allows expressing the mean user throughput in any region of the network as the ratio of the mean traffic demand to the steady-state mean number of users in this region. Corresponding statistics are usually collected in operational networks for each cell.