abstract—in this paper, we theoretically study the proportional
fair (pf) scheduler in the context of ultra-dense networks (udns).
analytical results are obtained for the coverage probability and
the area spectral efficiency (ase) performance of dense small
cell networks (scns) with the pf scheduler employed at base
stations (bss). the key point of our analysis is that the typical
user is no longer a random user as assumed in most studies in
the literature. instead, a user with the maximum pf metric is
chosen by its serving bs as the typical user. by comparing the
previous results of the round-robin (rr) scheduler with our new
results of the pf scheduler, we quantify the loss of the multiuser diversity of the pf scheduler with the network densification,
which casts a new look at the role of the pf scheduler in udns.
our conclusion is that the rr scheduler should be used in udns
to simplify the radio resource management (rrm)1 .