All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Impact of an attack on a network executing distributed computing

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26220%2F16%3APU119237" target="_blank" >RIV/00216305:26220/16:PU119237 - isvavai.cz</a>

  • Result on the web

    <a href="https://www.scientificbulletin.upb.ro/rev_docs_arhiva/fulle8b_932467.pdf" target="_blank" >https://www.scientificbulletin.upb.ro/rev_docs_arhiva/fulle8b_932467.pdf</a>

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Impact of an attack on a network executing distributed computing

  • Original language description

    In this paper, we examine the effect of an attack on a network executing the In this paper, we examine the effect of an attack on a network executing the distributed algorithm average consensus. We assume that only one attack is committed during the process of reaching the convergence. We examine how intensively an attack affects features of the average consensus algorithm. We define two parameters: the number of additional iterations and the change of the final value. Then we examine how they are changing when the following parameters are being changed: the number of iteration during which an attack is committed, an attacker's internal value, the initial values, the range of the initial values. At the end, we examine how the position of the attacked element affects the impact of an attack on the network. Firstly, we perform experiments in an example network containing 24 densely placed elements and whose topology is randomly generated. We decide to apply TDMA as a method to share a transmission medium. Then we execute another experiment in which we examine how intensive an attack is when the size of a network changes. This paper is motivated by the publications where a potential failure of a node such as a dead node, a misbehaving node etc. significantly affects the whole computation process. In contrast to the previous works, we assume the presence of an attacker who is aware of the weaknesses of distributed computing.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/LO1401" target="_blank" >LO1401: Interdisciplinary Research of Wireless Technologies</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2016

  • Confidentiality

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

Data specific for result type

  • Name of the periodical

    UPB Scientific Bulletin, Series C: Electrical Engineering

  • ISSN

    1454-234X

  • e-ISSN

  • Volume of the periodical

    78

  • Issue of the periodical within the volume

    2

  • Country of publishing house

    RO - ROMANIA

  • Number of pages

    18

  • Pages from-to

    35-52

  • UT code for WoS article

    000388733300004

  • EID of the result in the Scopus database

    2-s2.0-84974823892