Achieving robust average consensus over lossy wireless networks

Francesco Acciani (Corresponding Author), Antonie Arij Stoorvogel (Corresponding Author), Geert Heijenk (Corresponding Author), Paolo Frasca (Corresponding Author)

Research output: Contribution to journalArticleAcademicpeer-review

1 Citation (Scopus)
3 Downloads (Pure)

Abstract

Average consensus over unreliable wireless networks can be impaired by losses. In this paper we study a novel method to compensate for the lost information, when packet collisions cause transmitter-based random failures. This compensation makes the network converge to the average of the initial states of the network, by modifying the links’ weights to accommodate for the topology changes due to packet losses. Additionally, a gain is used to increase the convergence speed, and an analysis of the stability of the network is performed, leading to a criterion to choose such gain to guarantee network stability. For the implementation of the compensation method, we propose a new distributed algorithm, which uses both synchronous and asynchronous mechanisms to achieve consensus and to deal with uncertainty in packet delivery. The theoretical results are then confirmed by simulations.

Original languageEnglish
Article number8276639
Pages (from-to)127-137
Number of pages11
JournalIEEE transactions on control of network systems
Volume6
Issue number1
DOIs
Publication statusPublished - 1 Mar 2019

Fingerprint

Wireless Networks
Wireless networks
Packet loss
Parallel algorithms
Transmitters
Topology
Convergence Speed
Packet Loss
Distributed Algorithms
Transmitter
Collision
Choose
Converge
Uncertainty
Compensation and Redress
Simulation

Keywords

  • Convergence
  • Distributed algorithms
  • Mathematical model
  • Network topology
  • Packet loss
  • Topology

Cite this

@article{6d29c32d64134d6bbc229bc9ab6c852d,
title = "Achieving robust average consensus over lossy wireless networks",
abstract = "Average consensus over unreliable wireless networks can be impaired by losses. In this paper we study a novel method to compensate for the lost information, when packet collisions cause transmitter-based random failures. This compensation makes the network converge to the average of the initial states of the network, by modifying the links’ weights to accommodate for the topology changes due to packet losses. Additionally, a gain is used to increase the convergence speed, and an analysis of the stability of the network is performed, leading to a criterion to choose such gain to guarantee network stability. For the implementation of the compensation method, we propose a new distributed algorithm, which uses both synchronous and asynchronous mechanisms to achieve consensus and to deal with uncertainty in packet delivery. The theoretical results are then confirmed by simulations.",
keywords = "Convergence, Distributed algorithms, Mathematical model, Network topology, Packet loss, Topology",
author = "Francesco Acciani and Stoorvogel, {Antonie Arij} and Geert Heijenk and Paolo Frasca",
year = "2019",
month = "3",
day = "1",
doi = "10.1109/TCNS.2018.2800407",
language = "English",
volume = "6",
pages = "127--137",
journal = "IEEE transactions on control of network systems",
issn = "2325-5870",
publisher = "IEEE CONTROL SYSTEMS SOCIETY",
number = "1",

}

Achieving robust average consensus over lossy wireless networks. / Acciani, Francesco (Corresponding Author); Stoorvogel, Antonie Arij (Corresponding Author); Heijenk, Geert (Corresponding Author); Frasca, Paolo (Corresponding Author).

In: IEEE transactions on control of network systems, Vol. 6, No. 1, 8276639, 01.03.2019, p. 127-137.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - Achieving robust average consensus over lossy wireless networks

AU - Acciani, Francesco

AU - Stoorvogel, Antonie Arij

AU - Heijenk, Geert

AU - Frasca, Paolo

PY - 2019/3/1

Y1 - 2019/3/1

N2 - Average consensus over unreliable wireless networks can be impaired by losses. In this paper we study a novel method to compensate for the lost information, when packet collisions cause transmitter-based random failures. This compensation makes the network converge to the average of the initial states of the network, by modifying the links’ weights to accommodate for the topology changes due to packet losses. Additionally, a gain is used to increase the convergence speed, and an analysis of the stability of the network is performed, leading to a criterion to choose such gain to guarantee network stability. For the implementation of the compensation method, we propose a new distributed algorithm, which uses both synchronous and asynchronous mechanisms to achieve consensus and to deal with uncertainty in packet delivery. The theoretical results are then confirmed by simulations.

AB - Average consensus over unreliable wireless networks can be impaired by losses. In this paper we study a novel method to compensate for the lost information, when packet collisions cause transmitter-based random failures. This compensation makes the network converge to the average of the initial states of the network, by modifying the links’ weights to accommodate for the topology changes due to packet losses. Additionally, a gain is used to increase the convergence speed, and an analysis of the stability of the network is performed, leading to a criterion to choose such gain to guarantee network stability. For the implementation of the compensation method, we propose a new distributed algorithm, which uses both synchronous and asynchronous mechanisms to achieve consensus and to deal with uncertainty in packet delivery. The theoretical results are then confirmed by simulations.

KW - Convergence

KW - Distributed algorithms

KW - Mathematical model

KW - Network topology

KW - Packet loss

KW - Topology

UR - http://www.scopus.com/inward/record.url?scp=85041425377&partnerID=8YFLogxK

U2 - 10.1109/TCNS.2018.2800407

DO - 10.1109/TCNS.2018.2800407

M3 - Article

VL - 6

SP - 127

EP - 137

JO - IEEE transactions on control of network systems

JF - IEEE transactions on control of network systems

SN - 2325-5870

IS - 1

M1 - 8276639

ER -