DocumentCode
1410739
Title
Interference Alignment-Based Sum Capacity Bounds for Random Dense Gaussian Interference Networks
Author
Johnson, Oliver ; Aldridge, Matthew ; Piechocki, Robert
Author_Institution
Dept. of Math., Univ. of Bristol, Bristol, UK
Volume
57
Issue
1
fYear
2011
Firstpage
282
Lastpage
290
Abstract
We consider a dense K user Gaussian interference network formed by paired transmitters and receivers placed independently at random in a fixed spatial region. Under natural conditions on the node position distributions and signal attenuation, we prove convergence in probability of the average per-user capacity CΣ/K to 1/2E log(1 + 2SNR). The achievability result follows directly from results based on an interference alignment scheme presented in recent work of Nazer et al. Our main contribution comes through an upper bound, motivated by ideas of "bottleneck capacity" developed in recent work of Jafar. By controlling the physical location of transmitter-receiver pairs, we can match a large proportion of these pairs to form so-called ε-bottleneck links, with consequent control of the sum capacity.
Keywords
Gaussian processes; interference (signal); probability; receivers; transmitters; convergence; fixed spatial region; interference alignment scheme; interference alignment-based sum capacity bounds; node position distributions; probability; random dense Gaussian interference networks; signal attenuation; transmitter-receiver pairs; Capacity planning; Convergence; Fading; Interference; Random variables; Receivers; Transmitters; Bottleneck states; Gaussian interference networks; dense networks; interference alignment; matching; sum capacity;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.2010.2090242
Filename
5673945
Link To Document