Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 628

The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.

Distributed construction of connected dominating set in wireless ad hoc networks

Peng-Jun Wan, Alzoubi, K.M., Frieder, O.·2003·Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies

Abstract

The connected dominating set (CDS) has been proposed as the virtual backbone or spine of a wireless ad hoc network. Three distributed approximation algorithms have been proposed in the literature for minimum CDS. We first reinvestigate their performances. None of these algorithms have constant approximation factors. Thus these algorithms can not guarantee to generate a CDS of small size. Their message complexities can be as high as O(n/sup 2/), and their time complexities may also be as large as O(n/sup 2/) and O(n/sup 3/). We then present our own distributed algorithm that outperforms the existing algorithms. This algorithm has an approximation factor of at most 8, O(n) time complexity and O(n log n) message complexity. By establishing the /spl Omega/(n log n) lower bound on the message complexity of any distributed algorithm for nontrivial CDS, our algorithm is thus message-optimal.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/infcom.2002.1019411

Cites

3 of 3 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 3 references

Cited by

See all 628

Metadata

Authors
Wan, P.-J., Alzoubi, K. M., & Frieder, O.
Venue
Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies
Publisher
IEEE
Published
2003-06-25
Volume
3
Pages
1597-1604
OpenAlex
W2120170057
Cited by
628
References
3
FWCI
18.66
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: Distributed construction of connected dominating set in wireless ad hoc networks. https://app.cochat.ai/papers/10.1109/infcom.2002.1019411
The paper
Wan, P.-J., Alzoubi, K. M., & Frieder, O. (2003). Distributed construction of connected dominating set in wireless ad hoc networks. Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies. https://doi.org/10.1109/infcom.2002.1019411

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.