Consensus in multi-agent systems over time-varying networks

Mahmoud, Magdi S.; Oyedeji, Mojeed O.

doi:10.1080/23335777.2020.1716270

Cited by 5 publications

(1 citation statement)

References 106 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The optimal solution of the convex optimization problem ( 44) is x = (T + wS) [56]. The communication between the sensor nodes is wireless and prone to channel noise and interference, leading to timevarying graph topological changes due to link losses [59]. The probability of link activation of the nodes is about 0.13 with a standard deviation of 0.18.…”

Section: B Real Datamentioning

confidence: 99%

Quantization Analysis and Robust Design for Distributed Graph Filters

Saad

Beferull-Lozano

Isufi

2022

IEEE Trans. Signal Process.

View full text Add to dashboard Cite

Distributed graph filters have recently found applications in wireless sensor networks (WSNs) to solve distributed tasks such as reaching consensus, signal denoising, and reconstruction. However, when implemented over WSNs, the graph filters should deal with network limited energy constraints as well as processing and communication capabilities. Quantization plays a fundamental role to improve the latter but its effects on distributed graph filtering are little understood. WSNs are also prone to random link losses due to noise and interference. In this instance, the filter output is affected by both the quantization error and the topological randomness error, which, if it is not properly accounted in the filter design phase, may lead to an accumulated error through the filtering iterations and significantly degrade the performance. In this paper, we analyze how quantization affects distributed graph filtering over both time-invariant and time-varying graphs. We bring insights on the quantization effects for the two most common graph filters: the finite impulse response (FIR) and autoregressive moving average (ARMA) graph filter. Besides providing a comprehensive analysis, we devise theoretical performance guarantees on the filter performance when the quantization stepsize is fixed or changes dynamically over the filtering iterations. For FIR filters, we show that a dynamic quantization stepsize leads to more reduction of the quantization noise than in the fixed-stepsize quantization. For ARMA graph filters, we show that decreasing the quantization stepsize over the iterations reduces the quantization noise to zero at the steady-state. In addition, we propose robust filter design strategies that minimize the quantization noise for both timeinvariant and time-varying networks. Numerical experiments on synthetic and two real data sets corroborate our findings and show the different trade-offs between quantization bits, filter order, and robustness to topological randomness.

show abstract

Section: B Real Datamentioning

confidence: 99%