SearcharxivSearch

arXiv subjects

Sonja Stuedli

Publications and source records attributed to Sonja Stuedli.

2 recordsLinked to original sources

Analysis of Attack via Grounding and Countermeasures in Discrete-Time Consensus Networks

We investigate the disruption of discrete-time consensus problems via grounding. Loosely speaking, grounding a network occurs if the state of one agent no longer responds to inputs from other agents and/or changes its dynamics. Then, the agent becomes a leader or a so called stubborn agent. The disruption of the agent can be caused by internal faults, safety protocols or externally due to a malicious attack. In this paper we investigate how the grounding affects the eigenratio of expander graph families that usually exhibit good scaling properties with increasing network size. It is shown that the algebraic connectivity and eigenratio of the network will decrease due to the grounding causing the performance and scalability of the network to deteriorate, even to the point of losing consensusability. We then present countermeasures to such interruptions both in a passive and active manner. Our findings are supported by numerical simulations given within the paper.

eess.SY

Nonhomogeneous Place-Dependent Markov Chains, Unsynchronised AIMD, and Network Utility Maximization

We present a solution of a class of network utility maximization (NUM) problems using minimal communication. The constraints of the problem are inspired less by TCP-like congestion control but by problems in the area of internet of things and related areas in which the need arises to bring the behavior of a large group of agents to a social optimum. The approach uses only intermittent feedback, no inter-agent communication, and no common clock. The proposed algorithm is a combination of the classical AIMD algorithm in conjunction with a simple probabilistic rule for the agents to respond to a capacity signal. This leads to a nonhomogeneous Markov chain and we show almost sure convergence of this chain to the social optimum.

math.OC