Loading [a11y]/accessibility-menu.js
Characterization of max-min fair performance in large networks via Szemeredi's Regularity Lemma | IEEE Conference Publication | IEEE Xplore

Characterization of max-min fair performance in large networks via Szemeredi's Regularity Lemma


Abstract:

In this work, we provide asymptotically almost sure lower and upper bounds on the max-min fair performance in large single-hop networks with arbitrary channel fading. Our...Show More

Abstract:

In this work, we provide asymptotically almost sure lower and upper bounds on the max-min fair performance in large single-hop networks with arbitrary channel fading. Our results are asymptotic in nature and we consider two cases of the limiting regime where the number of links (users) tends to infinity. The provided bounds apply to orthogonal networks as well as to a special class of nonorthogonal networks.
Date of Conference: 24-29 June 2007
Date Added to IEEE Xplore: 09 July 2008
ISBN Information:

ISSN Information:

Conference Location: Nice, France

References

References is not available for this document.