The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Fault tolerant deployment and topology control in wireless networks
Abstract
This paper investigate fault tolerance for wireless ad hoc networks. We consider a large-scale of wireless networks whose nodes are distributed randomly in a unit-area square region. Given n wireless nodes V, each with transmission range rn, the wireless networks are often modeled by graph G(V,rn) in which two nodes are connected if their Euclidean distance is no more than rn.We first consider how the transmission range is related with the number of nodes in a fixed area such that the resulted network can sustain k fault nodes with high probability. We show that, for a unit-area square region, the probability that the network G(V,rn) is (k+1)-connected is at least e-e-α when the transmission radius rn satisfies n π rn2 ≥ ln n + (2k-1) ln ln n -2ln k! + 2α for k>0 and n sufficiently large. This result also applies to mobile networks when the moving of wireless nodes always generates randomly distributed positions. Our simulations show that n should be larger than 500 if k=2 or 3 and α = log n and n should be larger than 2500 if k=2 or 3 and α = log log n.We then present a localized method to control the network topology given a (k+1)-faults tolerant deployment G(V,rn) of wireless nodes such that the resulting topology is still (k+1)-faults tolerant but with O(kn) communication links maintained. We show that the constructed topology is also a length spanner. Here a subgraph H is spanner of graph G, if for any two nodes, the length of the shortest path connecting them in H is no more than a small constant factor of the length of the shortest path connecting them in G.Finally, we conduct some simulations to study the practical transmission range to achieve certain probability of k-connected when n is not large enough.
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
Cites
Bollobás, B. (2001) · doi:10.1017/cbo9780511814068 · Cited by 2,639
Cited by
On k-coverage in a mostly sleeping sensor network
Kumar, S., Lai, T. H., & Balogh, J. (2004) · Proceedings of the 10th annual international conference on Mobile computing and networking · doi:10.1145/1023720.1023735 · Cited by 639
A Theory of Network Localization
Aspnes, J., Eren, T., Goldenberg, D. K., Morse, A. S., Whiteley, W., Yang, Y. R., Anderson, B. D. O., & Belhumeur, P. N. (2006) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2006.174 · Cited by 635
Rigidity, computation, and randomization in network localization
Eren, T., Goldenberg, O. K., Whiteley, W., Yang, Y. R., Morse, A. S., Anderson, B. D. O., & Belhumeur, P. N. (2005) · IEEE INFOCOM 2004 · doi:10.1109/infcom.2004.1354686 · Cited by 517
Metadata
- Authors
- Li, X.-Y., Wan, P.-J., Wang, Y., & Yi, C.-W.
- Venue
- Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
- Publisher
- ACM
- Published
- 2003-06
- Pages
- 117-128
- OpenAlex
- W2002061013
- Cited by
- 188
- References
- 1
- FWCI
- 7.71
- Type
- conference paper
- 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: Fault tolerant deployment and topology control in wireless networks. https://app.cochat.ai/papers/10.1145/778415.778431
- The paper
- Li, X.-Y., Wan, P.-J., Wang, Y., & Yi, C.-W. (2003). Fault tolerant deployment and topology control in wireless networks. Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing. https://doi.org/10.1145/778415.778431
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.