Elements of Hyperstructure Theory in UWSN Design and Data Aggregation

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26220%2F19%3APU132218" target="_blank" >RIV/00216305:26220/19:PU132218 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/00216224:14560/19:00109781

Výsledek na webu

<a href="https://www.mdpi.com/2073-8994/11/6/734" target="_blank" >https://www.mdpi.com/2073-8994/11/6/734</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.3390/sym11060734" target="_blank" >10.3390/sym11060734</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Elements of Hyperstructure Theory in UWSN Design and Data Aggregation

Popis výsledku v původním jazyce

In our paper we discuss how elements of algebraic hyperstructure theory can be used in the context of underwater wireless sensor networks (UWSN). We present a mathematical model which makes use of the fact that when deploying nodes or operating the network we, from the mathematical point of view, regard an operation (or a hyperoperation) and a binary relation. In this part of the paper we relate our context to already existing topics of the algebraic hyperstructure theory such as quasi-order hypergroups, $EL$-hyperstructures, or ordered hyperstructures. Furthermore, we make use of the theory of quasi-automata (or rather, semiautomata) to relate the process of UWSN data aggregation to the existing algebraic theory of quasi-automata and their hyperstructure generalization. We show that the process of data aggregation can be seen as an automaton, or rather its hyperstructure generalization, with states representing stages of the data aggregation process of cluster protocols and describing available/used memory capacity of the network.

Název v anglickém jazyce

Elements of Hyperstructure Theory in UWSN Design and Data Aggregation

Popis výsledku anglicky

In our paper we discuss how elements of algebraic hyperstructure theory can be used in the context of underwater wireless sensor networks (UWSN). We present a mathematical model which makes use of the fact that when deploying nodes or operating the network we, from the mathematical point of view, regard an operation (or a hyperoperation) and a binary relation. In this part of the paper we relate our context to already existing topics of the algebraic hyperstructure theory such as quasi-order hypergroups, $EL$-hyperstructures, or ordered hyperstructures. Furthermore, we make use of the theory of quasi-automata (or rather, semiautomata) to relate the process of UWSN data aggregation to the existing algebraic theory of quasi-automata and their hyperstructure generalization. We show that the process of data aggregation can be seen as an automaton, or rather its hyperstructure generalization, with states representing stages of the data aggregation process of cluster protocols and describing available/used memory capacity of the network.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10102 - Applied mathematics

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2019

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Symmetry

ISSN

2073-8994

e-ISSN

—

Svazek periodika

11

Číslo periodika v rámci svazku

6

Stát vydavatele periodika

CH - Švýcarská konfederace

Počet stran výsledku

16

Strana od-do

1-16

Kód UT WoS článku

000475703000009

EID výsledku v databázi Scopus

2-s2.0-85068032323