Unifying characterization of max-min fairness in wireless networks by graphs

Marcin Wiczanowski, Holger Boche, Slawomir Stanczak

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publication2007 IEEE International Conference on Communications, ICC'07
Pages797-802
Number of pages6
DOIs
StatePublished - 2007
Externally publishedYes
Event2007 IEEE International Conference on Communications, ICC'07 - Glasgow, Scotland, United Kingdom
Duration: 24 Jun 200728 Jun 2007

Publication series

NameIEEE International Conference on Communications
ISSN (Print)0536-1486

Conference

Conference2007 IEEE International Conference on Communications, ICC'07
Country/TerritoryUnited Kingdom
CityGlasgow, Scotland
Period24/06/0728/06/07

Fingerprint

Dive into the research topics of 'Unifying characterization of max-min fairness in wireless networks by graphs'. Together they form a unique fingerprint.

Cite this