DocumentCode :
2021269
Title :
Characterization of max-min fair performance in large networks via Szemeredi´s Regularity Lemma
Author :
Wiczanowski, M. ; Boche, Holger ; Stanczak, Slawomir
Author_Institution :
Univ. of Technol. Berlin, Berlin
fYear :
2007
fDate :
24-29 June 2007
Firstpage :
146
Lastpage :
150
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.
Keywords :
fading channels; minimax techniques; wireless sensor networks; Szemeredi´s regularity lemma; channel fading; large single-hop networks; max-min fair performance; nonorthogonal networks; Fading; H infinity control; Mobile communication; Multiaccess communication; Spread spectrum communication; Throughput; Time division multiple access; Upper bound; Wireless communication; Wireless networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2007. ISIT 2007. IEEE International Symposium on
Conference_Location :
Nice
Print_ISBN :
978-1-4244-1397-3
Type :
conf
DOI :
10.1109/ISIT.2007.4557218
Filename :
4557218
Link To Document :
بازگشت