Eventual Convergence of the Reputation-Based Algorithm in IoT Sensor Networks - Publikacja - MOST Wiedzy

Wyszukiwarka

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

Abstrakt

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.

Cytowania

  • 1

    CrossRef

  • 0

    Web of Science

  • 2

    Scopus

Autorzy (3)

Cytuj jako

Słowa kluczowe

Informacje szczegółowe

Kategoria:
Publikacja w czasopiśmie
Typ:
artykuły w czasopismach
Opublikowano w:
SENSORS nr 21,
ISSN: 1424-8220
Język:
angielski
Rok wydania:
2021
Opis bibliograficzny:
Lebiedź J., Cofta P., Orłowski C.: Eventual Convergence of the Reputation-Based Algorithm in IoT Sensor Networks// SENSORS -Vol. 21,iss. 18 (2021), s.6211-
DOI:
Cyfrowy identyfikator dokumentu elektronicznego (otwiera się w nowej karcie) 10.3390/s21186211
Weryfikacja:
Politechnika Gdańska

wyświetlono 137 razy

Publikacje, które mogą cię zainteresować

Meta Tagi