The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
The Effect of Fading, Channel Inversion, and Threshold Scheduling on Ad Hoc Networks
Abstract
This paper addresses three issues in the field ofad hocnetwork capacity: the impact of (i) channel fading, (ii) channel inversion power control, and (iii) threshold–based scheduling on capacity. Channel inversion and threshold scheduling may be viewed as simple ways to exploit channel state information (CSI) without requiring cooperation across transmitters. We use thetransmission capacity(TC) as our metric, defined as the maximum spatial intensity of successful simultaneous transmissions subject to a constraint on the outage probability (OP). By assuming the nodes are located on the infinite plane according to a Poisson process, we are able to employ tools from stochastic geometry to obtain asymptotically tight bounds on the distribution of the signal-to-interference (SIR) level, yielding in turn tight bounds on the OP (relative to a given SIR threshold) and the TC. We demonstrate that in the absence of CSI, fading can significantly reduce the TC and somewhat surprisingly, channel inversion only makes matters worse. We develop a threshold-based transmission rule where transmitters are active only if the channel to their receiver is acceptably strong, obtain expressions for the optimal threshold, and show that this simple, fully distributed scheme can significantly reduce the effect of fading.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The capacity of wireless networks
Gupta, P., & Kumar, P. R. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.825799 · Cited by 8,292
Corless, R. M., Gonnet, G. H., Hare, D. E. G., Jeffrey, D. J., & Knuth, D. E. (1996) · Advances in Computational Mathematics · doi:10.1007/bf02124750 · Cited by 6,150
Mathematical Analysis of Random Noise
Rice, S. O. (1944) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1944.tb00874.x · Cited by 5,480
Stochastic Geometry and its Applications
(2013) · Wiley Series in Probability and Statistics · doi:10.1002/9781118658222 · Cited by 4,400
Resource Allocation and Cross-Layer Control in Wireless Networks
Georgiadis, L., Neely, M. J., & Tassiulas, L. (2005) · now publishers, Inc. eBooks · doi:10.1561/9781933019697 · Cited by 1,291
Stochastic Geometry and Its Applications.
Stoyan, D., Kendall, W. S., & Mecke, J. (1989) · Biometrics · doi:10.2307/2531521 · Cited by 1,134
Über spontane Stromschwankungen in verschiedenen Elektrizitätsleitern
Schottky, W. (1918) · Annalen der Physik · doi:10.1002/andp.19183622304 · Cited by 911
A Network Information Theory for Wireless Communication: Scaling Laws and Optimal Operation
Xie, L.-L., & Kumar, P. R. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.826631 · Cited by 723
An Aloha protocol for multihop mobile wireless networks
Baccelli, F., Blaszczyszyn, B., & Muhlethaler, P. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862098 · Cited by 715
Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks
Ozgur, A., Leveque, O., & Tse, D. N. C. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.905002 · Cited by 659
Levy, P. E. (1925) · Virtual Defense Library (Ministerio de Defensa) · Cited by 612
On Distances in Uniformly Random Networks
Haenggi, M. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.855610 · Cited by 611
Transmission Capacity of Wireless Ad Hoc Networks With Outage Constraints
Weber, S. P., Yang, X., Andrews, J. G., & deVeciana, G. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.858939 · Cited by 579
Self-citationÜber die Verbreiterung von Spektrallinien
Holtsmark, J. (1919) · Annalen der Physik · doi:10.1002/andp.19193630702 · Cited by 502
Optimum transmission ranges in a direct-sequence spread-spectrum multihop packet radio network
Sousa, E. S., & Silvester, J. A. (1990) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.56383 · Cited by 452
Transmission Capacity of Wireless Ad Hoc Networks With Successive Interference Cancellation
Weber, S. P., Andrews, J. G., Yang, X., & de Veciana, G. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.901153 · Cited by 342
Self-citationThe Guard Zone in Wireless Ad hoc Networks
Hasan, A., & Andrews, J. (2007) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2007.04793 · Cited by 300
Self-citationGame Theory in Wireless Networks: A Tutorial
Félegyházi, M., & Hubaux, J. (2006) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · Cited by 299
Analytic alpha-stable noise modeling in a Poisson field of interferers or scatterers
Ilow, J., & Hatzinakos, D. (1998) · IEEE Transactions on Signal Processing · doi:10.1109/78.678475 · Cited by 275
Performance of a spread spectrum packet radio network link in a Poisson field of interferers
Sousa, E. S. (1992) · IEEE Transactions on Information Theory · doi:10.1109/18.165447 · Cited by 238
Upper Bounds to Transport Capacity of Wireless Networks
Jovicic, A., Viswanath, P., & Kulkarni, S. R. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.836936 · Cited by 234
Lowen, S. B., & Teich, M. C. (1990) · IEEE Transactions on Information Theory · doi:10.1109/18.59930 · Cited by 227
The Transport Capacity of Wireless Networks Over Fading Channels
Xue, F., Xie, L.-L., & Kumar, P. R. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.842628 · Cited by 216
Klüppelberg, C. (2004) · Encyclopedia of Actuarial Science · doi:10.1002/9780470012505.tas039 · Cited by 144
Communication over a wireless network with random connections
Gowaikar, R., Hochwald, B. M., & Hassibi, B. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.876254 · Cited by 93
Interference modeling in a direct-sequence spread-spectrum packet radio network
Sousa, E. S. (1990) · IEEE Transactions on Communications · doi:10.1109/26.61388 · Cited by 87
Co-Channel Interference of Spread Spectrum Systems in a Multiple User Environment
Musa, S. A., & Wasylkiwskyj, W. (1978) · IRE Transactions on Communications Systems · doi:10.1109/tcom.1978.1093993 · Cited by 64
Cited by
Stochastic geometry and random graphs for the analysis and design of wireless networks
Haenggi, M., Andrews, J. G., Baccelli, F., Dousse, O., & Franceschetti, M. (2009) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2009.090902 · Cited by 1,719
Self-citationElSawy, H., Hossain, E., & Haenggi, M. (2013) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2013.052213.00000 · Cited by 976
Uplink capacity and interference avoidance for two-tier femtocell networks
Chandrasekhar, V., & Andrews, J. G. (2009) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2009.070475 · Cited by 526
Self-citationStochastic Geometry and Wireless Networks: Volume II Applications
François, B., & Błlaszczyszyn, B. (2010) · Foundations and Trends® in Networking · doi:10.1561/1300000026 · Cited by 430
An Overview of the Transmission Capacity of Wireless Networks
Weber, S., Andrews, J. G., & Jindal, N. (2010) · IEEE Transactions on Communications · doi:10.1109/tcomm.2010.093010.090478 · Cited by 422
Self-citation
Metadata
- Authors
- Weber, S., Andrews, J. G., & Jindal, N.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2007-11
- Volume
- 53
- Issue
- 11
- Pages
- 4127-4149
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2115094114
- Cited by
- 322
- References
- 27
- FWCI
- 44.98
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.