The DOI matches its Crossref record.
On Distances in Uniformly Random Networks
Abstract
The distribution of Euclidean distances in Poisson point processes is determined. The main result is the density function of the distance to the n-nearest neighbor of a homogeneous process in Ropfm, which is shown to be governed by a generalized Gamma distribution. The result has many implications for large wireless networks of randomly distributed nodes
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
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-citationRandom Beamforming in Millimeter-Wave NOMA Networks
Ding, Z., Fan, P., & Poor, H. V. (2017) · IEEE Access · doi:10.1109/access.2017.2673248 · Cited by 298
Distance Distributions in Finite Uniformly Random Networks: Theory and Applications
Srinivasa, S., & Haenggi, M. (2010) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2009.2035044 · Cited by 285
Self-citationOptimal Cell Load and Throughput in Green Small Cell Networks With Generalized Cell Association
Liu, C.-H., & Wang, L.-C. (2016) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2016.2520218 · Cited by 66
Metadata
- Authors
- Haenggi, M.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2005-10
- Volume
- 51
- Issue
- 10
- Pages
- 3584-3586
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2102413189
- Cited by
- 611
- References
- 0
- FWCI
- 14.62
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On Distances in Uniformly Random Networks. https://app.cochat.ai/papers/10.1109/tit.2005.855610
- The paper
- Haenggi, M. (2005). On Distances in Uniformly Random Networks. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2005.855610
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.
