1,902 research outputs found
Organic Design of Massively Distributed Systems: A Complex Networks Perspective
The vision of Organic Computing addresses challenges that arise in the design
of future information systems that are comprised of numerous, heterogeneous,
resource-constrained and error-prone components or devices. Here, the notion
organic particularly highlights the idea that, in order to be manageable, such
systems should exhibit self-organization, self-adaptation and self-healing
characteristics similar to those of biological systems. In recent years, the
principles underlying many of the interesting characteristics of natural
systems have been investigated from the perspective of complex systems science,
particularly using the conceptual framework of statistical physics and
statistical mechanics. In this article, we review some of the interesting
relations between statistical physics and networked systems and discuss
applications in the engineering of organic networked computing systems with
predictable, quantifiable and controllable self-* properties.Comment: 17 pages, 14 figures, preprint of submission to Informatik-Spektrum
published by Springe
Resilient Learning-Based Control for Synchronization of Passive Multi-Agent Systems under Attack
In this paper, we show synchronization for a group of output passive agents
that communicate with each other according to an underlying communication graph
to achieve a common goal. We propose a distributed event-triggered control
framework that will guarantee synchronization and considerably decrease the
required communication load on the band-limited network. We define a general
Byzantine attack on the event-triggered multi-agent network system and
characterize its negative effects on synchronization. The Byzantine agents are
capable of intelligently falsifying their data and manipulating the underlying
communication graph by altering their respective control feedback weights. We
introduce a decentralized detection framework and analyze its steady-state and
transient performances. We propose a way of identifying individual Byzantine
neighbors and a learning-based method of estimating the attack parameters.
Lastly, we propose learning-based control approaches to mitigate the negative
effects of the adversarial attack
Self-Synchronization in Duty-cycled Internet of Things (IoT) Applications
In recent years, the networks of low-power devices have gained popularity.
Typically these devices are wireless and interact to form large networks such
as the Machine to Machine (M2M) networks, Internet of Things (IoT), Wearable
Computing, and Wireless Sensor Networks. The collaboration among these devices
is a key to achieving the full potential of these networks. A major problem in
this field is to guarantee robust communication between elements while keeping
the whole network energy efficient. In this paper, we introduce an extended and
improved emergent broadcast slot (EBS) scheme, which facilitates collaboration
for robust communication and is energy efficient. In the EBS, nodes
communication unit remains in sleeping mode and are awake just to communicate.
The EBS scheme is fully decentralized, that is, nodes coordinate their wake-up
window in partially overlapped manner within each duty-cycle to avoid message
collisions. We show the theoretical convergence behavior of the scheme, which
is confirmed through real test-bed experimentation.Comment: 12 Pages, 11 Figures, Journa
Renormalization group theory for percolation in time-varying networks
Motivated by multi-hop communication in unreliable wireless networks, we
present a percolation theory for time-varying networks. We develop a
renormalization group theory for a prototypical network on a regular grid,
where individual links switch stochastically between active and inactive
states. The question whether a given source node can communicate with a
destination node along paths of active links is equivalent to a percolation
problem. Our theory maps the temporal existence of multi-hop paths on an
effective two-state Markov process. We show analytically how this Markov
process converges towards a memory-less Bernoulli process as the hop distance
between source and destination node increases. Our work extends classical
percolation theory to the dynamic case and elucidates temporal correlations of
message losses. Quantification of temporal correlations has implications for
the design of wireless communication and control protocols, e.g. in
cyber-physical systems such as self-organized swarms of drones or smart traffic
networks.Comment: 8 pages, 3 figure
- …