The DOI matches its Crossref record.
Critical Power for Asymptotic Connectivity in Wireless Networks
Abstract
In wireless data networks each transmitter’s power needs to be high enough to reach the intended receivers, while generating minimum interference on other receivers sharing the same channel. In particular, if the nodes in the network are assumed to cooperate in routing each others’ packets, as is the case in ad hoc wireless networks, each node should transmit with just enough power to guarantee connectivity in the network. Towards this end, we derive the critical power a node in the network needs to transmit in order to ensure that the network is connected with probability one as the number of nodes in the network goes to infinity. It is shown that if n nodes are placed in a disc of unit area in ℜ2 and each node transmits at a power level so as to cover an area of πr 2 = (log n + c(n))/n, then the resulting network is asymptotically connected with probability one if and only if c(n) → +∞.
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
Node clustering in wireless sensor networks: recent developments and deployment challenges
Younis, O., Krunz, M., & Ramasubramanian, S. (2006) · IEEE Network · doi:10.1109/mnet.2006.1637928 · Cited by 721
Frieze, A., & Karoński, M. (2015) · doi:10.1017/cbo9781316339831 · Cited by 576
Underwater optical wireless communications, networking, and localization: A survey
Saeed, N., Celik, A., Al-Naffouri, T. Y., & Alouini, M.-S. (2019) · Ad Hoc Networks · doi:10.1016/j.adhoc.2019.101935 · Cited by 560
(2013) · Journal of the Indian Institute of Science · Cited by 75
Metadata
- Authors
- Gupta, P., & Kumar, P. R.
- Venue
- Stochastic Analysis, Control, Optimization and Applications
- Publisher
- Birkhäuser Boston
- Published
- 1999
- Pages
- 547-566
- OpenAlex
- W1918250237
- Cited by
- 1,137
- References
- 0
- FWCI
- 11.58
- Type
- book chapter
- 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: Critical Power for Asymptotic Connectivity in Wireless Networks. https://app.cochat.ai/papers/10.1007/978-1-4612-1784-8_33
- The paper
- Gupta, P., & Kumar, P. R. (1999). Critical Power for Asymptotic Connectivity in Wireless Networks. Stochastic Analysis, Control, Optimization and Applications. https://doi.org/10.1007/978-1-4612-1784-8_33
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.
