tailieunhanh - Báo cáo hóa học: " Research Article Unifying View on Min-Max Fairness, Max-Min Fairness, and Utility Optimization in Cellular "

Tuyển tập báo cáo các nghiên cứu khoa học quốc tế ngành hóa học dành cho các bạn yêu hóa học tham khảo đề tài: Research Article Unifying View on Min-Max Fairness, Max-Min Fairness, and Utility Optimization in Cellular | Hindawi Publishing Corporation EURASIP Journal on Wireless Communications and Networking Volume 2007 Article ID 34869 20 pages doi 2007 34869 Research Article Unifying View on Min-Max Fairness Max-Min Fairness and Utility Optimization in Cellular Networks Holger Boche 1 2 Marcin Wiczanowski 1 and Slawomir Stanczak2 1 Heinrich Hertz Chair for Mobile Communications Faculty of Electrical Engineering and Computer Science EECS Berlin University of Technology Einsteinufer 25 10587 Berlin Germany 2 German-Sino Lab for Mobile Communications MCI Fraunhofer Institute for Telecommunications Einsteinufer 37 10587 Berlin Germany Received 23 March 2006 Revised 21 September 2006 Accepted 3 November 2006 Recommended by Ivan Stojmenovic We are concerned with the control of quality of service QoS in wireless cellular networks utilizing linear receivers. We investigate the issues of fairness and total performance which are measured by a utility function in the form of a weighted sum of link QoS. We disprove the common conjecture on incompatibility of min-max fairness and utility optimality by characterizing network classes in which both goals can be accomplished concurrently. We characterize power and weight allocations achieving min-max fairness and utility optimality and show that they correspond to saddle points of the utility function. Next we address the problem of the difference between min-max fairness and max-min fairness. We show that in general there is a fairness gap between the performance achieved under min-max fairness and under max-min fairness. We characterize the network class for which both performance values coincide. Finally we characterize the corresponding network subclass in which both min-max fairness and max-min fairness are achievable by the same power allocation. Copyright 2007 Holger Boche et al. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use distribution and reproduction in