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

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

Kalman filter estimation of the number of competing terminals in an IEEE 802.11 network

Bianchi, G., Tinnirello, I. · 2003 · IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428)

Abstract

Throughput performance of the IEEE 802.11 distributed coordination function (DCF) is very sensitive to the number n of competing stations. The contribute of this paper is threefold. First, we show that n can be expressed as function of the collision probability encountered on the channel; hence, it can be estimated based on run-time measurements. Second, we show that the estimation of n, based on exponential smoothing of the measured collision probability (specifically, an ARMA filter), results to be a biased estimation, with poor performance in terms of accuracy/tracking trade-offs. Third, we propose a methodology to estimate n, based on an extended Kalman filter coupled with a change detection mechanism. This approach shows both high accuracy as well as prompt reactivity to changes in the network occupancy status. Numerical results show that, although devised in the assumption of saturated terminals, our proposed approach results effective also in non-saturated conditions, and specifically in tracking the average number of competing terminals.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Integrity signals

Registry

Crossref · 10.1109/infcom.2003.1208922

Cites

9 of 9 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.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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 464

Metadata

Authors
Bianchi, G., & Tinnirello, I.
Venue
IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428)
Publisher
IEEE
Published
2003
Pages
844-852 vol.2
OpenAlex
W2128952907
Cited by
464
References
9
FWCI
13.87
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

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.