Unifying Characterization of Max-Min Fairness in Wireless Networks by Graphs

— We propose a unifying framework for max-min fairness in orthogonal networks and networks with interference. First, a universal formulation of the max-min fairness problem for orthogonal networks and networks with interference is presented. This shows that orthogonal networks and networks with interference can be universally described by a graph, induced by time sharing of resources and interference coupling, respectively. As a consequence, a unifying graph-related characterization of performance achieved under max-min fairness is obtained.

• Type: Conference
• Year: 2007
• Where: ICC
• Authors: Marcin Wiczanowski, Holger Boche, Slawomir Stanczak
• Keywords: Communications, ICC 2007, Max-min Fairness, Max-min Fairness Problem, Orthogonal Networks