Find in Library

Most research on stochastic geometry has uniformly treated all users in cellular networks. In reality, the performance of a user depends strongly on the distances from a user to the tagged base station and other interfering base stations. Meanwhile, the throughput of a network is decided by the number of base stations and the number of users that can be served in the cell. This paper aims to investigate the achievable performance of users located at different positions in the Voronoi cell. First, we proposed a near formula of distribution of distances from users to their tagged base stations. Then, we deduce the coverage probabilities and ergodic rates of different users in the cell when the network is fully loaded or partially loaded. Finally, we proposed a novel definition of network throughput to respond to the networks' throughput in real time. We compare all our derivations to the Monte Carlo simulation. The numerical results are very close to the simulation results.