Fairness Analysis and Comparison of Wireless Packet Scheduling Algorithm

Fairness and throughput are contradictory in wireless packet scheduling algorithm, for guaranteeing fairness is at the cost of sacrificing system throughput. Temporary fairness and utilitarian fairness of wireless packet scheduler based on Round Robin were defined in this paper. Then the maximum guaranteed temporary fairness and utilitarian fairness were developed for a given system throughput. It's proved theoretically that maximum temporary fairness is not less than utilitarian fairness for any given system throughput. Simulation result confirms the previous analysis.