By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Wiczanowski, M. ; Univ. of Technol. Berlin, Berlin ; Boche, H. ; Stanczak, S.

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.

Published in:

Communications, 2007. ICC '07. IEEE International Conference on

Date of Conference:

24-28 June 2007