Evidence map›Paper›PMID 34577415›Full record

ArticleSensors (Basel, Switzerland)2021

Eventual Convergence of the Reputation-Based Algorithm in IoT Sensor Networks.

Jacek Lebiedź, Piotr Cofta, Cezary Orłowski

Abstract read
In one paragraph

Article in Sensors (Basel, Switzerland), 2021. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Jacek LebiedźFaculty of ETI, Gdansk University of Technology, 80-233 Gdańsk, Poland.ORCID 0000-0003-4231-0579
Piotr CoftaInstitute of Management and Finance, WSB University in Gdansk, 80-266 Gdańsk, Poland.
Cezary OrłowskiInstitute of Management and Finance, WSB University in Gdansk, 80-266 Gdańsk, Poland.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Uncertainty in dense heterogeneous IoT sensor networks can be decreased by applying reputation-inspired algorithms, such as the EWMA (Exponentially Weighted Moving Average) algorithm, which is widely used in social networks. Despite its popularity, the eventual convergence of this algorithm for the purpose of IoT networks has not been widely studied, and results of simulations are often taken in lieu of the more rigorous proof. Therefore the question remains, whether under stable conditions, in realistic situations found in IoT networks, this algorithm indeed converges. This paper demonstrates proof of the eventual convergence of the EWMA algorithm. The proof consists of two steps: it models the sensor network as the UOG (Uniform Opinion Graph) that enables the analytical approach to the problem, and then offers the mathematical proof of eventual convergence, using formalizations identified in the previous step. The paper demonstrates that the EWMA algorithm converges under all realistic conditions.

Indexed as

eventual convergenceEWMA algorithmsIoT sensor networksproof of convergence

Identifiers

PMID34577415
PMCPMC8472450

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.