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

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

Flooding for reliable multicast in multi-hop ad hoc networks

Open access
Ho, Christopher, Obraczka, Katia, Tsudik, Gene, Viswanath, Kumar · 1999 · Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications

Abstract

Ad HOC Networks are gaining popu1arit.yas a result of advances in smaller, more versatile and powerful mobile comput,ing devices.The dist,inguishing feat,ure of these networks is the universal mobility of all host.s.This requires re-engineering of basic nebwork services including reliable multicast, communication.This paper considers t,he special case of highly mobile fast,-moving ad hoc net.works and argues that, for such networks, t,raditional multicast approaches are not appropriat,e.Flooding is suggested as a possible alt,ernative for reliable multicast and simulation results are used t,o illust.rateit.seffects.The experimental results also demonstrate a rather interest,ing outcome that even flooding is insufficient.for reliable multicast in ad hoc networks when mobility is very high.Some alternative, more persistent variations of flooding are sketched out.1 Introduction Recent advances in portable computing devices and wireless communication technology have made it possible to stay connected anywhere; anytime.In the near future, users will be able to move freely and still have seamless, reliable and high-speed network connectivity.Portable computers and hand-held devices will do for dat,a communication what cellular phones are now doing for voice communication.Traditional net,work mobi1it.yfocused on roaming, which is characterized by hosts connecting to the fixedinfrastructure internet.at locations other than their well-known home net.work address.Hosts can connect direct,ly to the fixed infrastructure on a visited subnet

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.1145/313239.313291

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

Cited by

See all 290

Metadata

Authors
Ho, C., Obraczka, K., Tsudik, G., & Viswanath, K.
Venue
Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Publisher
ACM
Published
1999-08
Pages
64-71
OpenAlex
W2034396001
Cited by
290
References
3
FWCI
5.46
Type
conference paper
Language
en
Open access
gold

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.