2008/02/21 by Daeyoung Park, Giuseppe Caire, Park, Daeyoung +1
Computer Science · Engineering · #Advanced Wireless Communication Technologies #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques
paper · pdf · doi:10.48550/arxiv.0802.2975
openalex publication_date 2008/02/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We consider the uplink of a cellular communication system with K users per cell and infinite base stations equally spaced on a line. The system is conventional, i.e., it does not make use of joint cell-site processing. A hard fairness (HF) system serves all users with the same rate in any channel state. In contrast, a system based on proportional fairness serves the users with variable instantaneous rates depending on their channel state. We compare these two options in terms of the system spectral efficiency \textsfC (bit/s/Hz) versus Eb/N0. Proportional fair scheduling (PFS) performs generally better than the more restrictive HF system in the regime of low to moderate SNR, but for high SNR an optimized HF system achieves throughput comparable to that of PFS system for finite K. The hard-fairness system is interference limited. We characterize this limit and validate a commonly used simplified model that treats outer cell interference power as proportional to the in-cell total power and we analytically characterize the proportionality constant. In contrast, the spectral efficiency of PFS can grow unbounded for K → ∞ thanks to the multiuser diversity effect. We also show that partial frequency/time reuse can mitigate the throughput penalty of the HF system, especially at high SNR.