2004
DOI: 10.1109/tit.2004.826631
|View full text |Cite
|
Sign up to set email alerts
|

A Network Information Theory for Wireless Communication: Scaling Laws and Optimal Operation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

12
511
2

Year Published

2005
2005
2016
2016

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 586 publications
(525 citation statements)
references
References 17 publications
12
511
2
Order By: Relevance
“…The literature on scaling laws for wireless networks has concentrated on the two extremes where either the small-scale fading coefficient is not present in the model (h = 1) or is assumed to be independent and identically distributed across all node pairs in the wireless network. The results obtained can be roughly summarized as follows: for two-dimensional networks, the scaling law in (1) has been confirmed by information theoretic arguments for absorptive media (γ > 0) or under the assumption of large power path loss (α > 4), for both the cases where small scale fading is absent in the model (considered in [2], [4]) or is i.i.d across all node pairs in the network (considered in [3], [5]). For one-dimensional networks, (1) has been confirmed for α > 2.5.…”
Section: Introductionmentioning
confidence: 54%
See 4 more Smart Citations
“…The literature on scaling laws for wireless networks has concentrated on the two extremes where either the small-scale fading coefficient is not present in the model (h = 1) or is assumed to be independent and identically distributed across all node pairs in the wireless network. The results obtained can be roughly summarized as follows: for two-dimensional networks, the scaling law in (1) has been confirmed by information theoretic arguments for absorptive media (γ > 0) or under the assumption of large power path loss (α > 4), for both the cases where small scale fading is absent in the model (considered in [2], [4]) or is i.i.d across all node pairs in the network (considered in [3], [5]). For one-dimensional networks, (1) has been confirmed for α > 2.5.…”
Section: Introductionmentioning
confidence: 54%
“…2 We prove Theorem 2.1 in Section IV and Theorem 2.2 in Section V. The corresponding results for the transport capacity in Theorem 2.3 are discussed in Section VI. Section VII contains our conclusions.…”
Section: Theorem 23mentioning
confidence: 91%
See 3 more Smart Citations