SearcharxivSearch

arXiv · 1912.07479

Cyber Physical Systems (CPS) Surveillance Using An Epidemic Model

Abstract

Vast investments have recently been made worldwide in developing the Cyber-Physical System (CPS) technology with the expectations of improving economical and societal structures. However, great care must be paid to the CPS' complexity, the impact of emerging IoT (Internet of Things) protocols on the CPS infrastructure as well as the impact of information dissemination by these protocols on the safety of these infrastructures. This paper addresses the issue of CPS safety by proposing and evaluating the performance of a CPS management framework and the analysis of the dynamics of the underlining IoT network in the cyber-space. The main contributions of this paper are in threefold. Firstly, a new CPS framework is proposed; that: 1) builds around a layered architecture to compartmentalise the CPS functionalities into different modules for efficiency and scalability and 2) uses an inner feedback loop for the efficient management of CPS infrastructure. Secondly, building upon this framework, a novel diffusion model that uses the epidemic (interference) sets to produce accurate diffusion patterns across the CPS IoT subsystem is proposed. Finally, the proposed diffusion model is numerically analysed to show how it can be used to achieve efficient CPS surveillance in order to trigger reconfiguration to re-optimise the CPS when it is under stress. in IoT settings. The numerical analysis of the diffusion model shows that interference propagates in pairwise disjoint sets, with IoT nodes migrating from "susceptible" to "attacked" statuses and finally reaching the "removed" state at a predictable time. Deployment considerations on some of the current social and public networks are also onsidered

Explore related subjects

Keep this discovery

BibTeXRIS

Bagula Antoine, Tuyishimire Emmanuel, Ajayi Olasupo. 2019-12-16. Cyber Physical Systems (CPS) Surveillance Using An Epidemic Model. https://arxiv.org/abs/1912.07479

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Online Treasure Hunt in Vertex-Permuted Dynamic Rings

We study the problem of treasure hunt by a group of $k \geq 1$ agents in vertex-permuted dynamic rings (VP). In this model, the $n$ vertices remain on a ring but are permuted at each time step. We first show that treasure hunt is impossible for any $k \leq n-3$ agents, if there are no restrictions on the sequence of permutations used in the dynamic ring. We then study the $VP(\delta)$ setting, in which for every pair $i, j$ of vertices, the edge $(i, j)$ is guaranteed to appear within $\delta$ steps. We show that the class $VP(\delta)$ is feasible only for $\delta \geq \left\lceil \frac{n-1}{2}\right\rceil$. For the one-agent case, we show a tight bound of $\Theta(\delta n)$ on the worst-case search time as well as competitive ratio of any online algorithm for treasure hunt, provided $\delta \geq 2n$. We then give an optimal algorithm for $k$ agents, thereby showing that $k$ agents can obtain a speedup of $k$ on the worst-case search time. Finally, in the R-VP setting, in which in every step, the vertices are arranged as a ring according to a random permutation, we show that treasure hunt takes expected $\Theta(n)$ steps against an oblivious adversary and $\Theta(n \log n)$ steps against an adaptive adversary.

cs.DC

The Computing Channel: How Modulation Programs the Airwaves

Distributed computing and distributed artificial intelligence require frequent exchanges of intermediate results, although many applications need only an aggregate rather than messages from individual devices. Conventional systems recover each message before computing the aggregate, whereas over-the-air computation (OAC) exploits simultaneous transmission to obtain it directly. However, dominant OAC implementations rely on analog signaling, creating a mismatch with finite-precision data and digital communication procedures. This article presents digital function-oriented communication, in which finite-alphabet symbol representations and receiver decisions are jointly designed so that multiple-access superposition encodes the desired function without recovering individual inputs. We introduce its computational-constellation principle, main design approaches, extensions, and implementation challenges. Federated edge learning illustrates how the framework can reduce user-dependent data-bearing resources while operating directly on quantized model updates.

cs.DC

Can AI Remediate Backend Failures Safely? GuardedAct with Blast-Radius-Aware Sandboxing

Large Language Models (LLMs) have shown promising capabilities in generating remediation actions for microservice failures. However, directly executing AI-generated repair actions in production risks cascading collateral damage. We propose GuardedAct, a sandbox-first remediation framework that interposes a blast-radius-aware verification layer between the LLM action generator and the production environment. GuardedAct operates in four phases: (1) ingesting a diagnosis report together with the live system topology and recent telemetry, (2) prompting an LLM to produce a ranked list of candidate remediation actions, (3) simulating each action in a lightweight digital-twin sandbox that estimates the blast radius and assigns a risk label, and (4) enforcing a rollback-confidence gate that auto-executes only low-risk actions while escalating high-risk ones for human review. We evaluate GuardedAct on five fault scenarios injected into the DeathStarBench social-network application. Experimental results show that GuardedAct achieves an overall recovery rate of 87.4% while reducing collateral damage by 79.7% relative to direct LLM execution (from 25.6% to 5.2%), at the cost of a modest sandbox-induced increase in mean time to recovery (approximately 8 s). Ablation studies confirm that each component contributes meaningfully to the safety-speed trade-off.

cs.DC