distance-incorporated opportunistic scheduling
This paper highlights the deficiencies of classical figures of merit such as throughput and fairness index to evaluate different scheduling algorithms and proposes a new complementary figure of merit called as transport-throughput, which has been inspired from information theory literature to better represent trade-offs among throughput, fairness and coverage associated with a given scheduling algorithm. Furthermore, new objective functions for opportunistic scheduling are proposed that utilize the knowledge about the geographic distance of mobile terminals from the base station. The proposed concept can be easily integrated as an extension to classical scheduling algorithms and provides the ability to control the effective distribution of throughput across the network
distance scheduling ofdma