Guarding Networks Through Heterogeneous Mobile Guards
Waseem Abbas, Sajal Bhatia, Xenofon Koutsoukos

TL;DR
This paper explores securing multi-agent networks against infinite intruder attacks using mobile heterogeneous guards, employing graph theory to optimize guard deployment and movement strategies for eternal security.
Contribution
It introduces a novel approach using heterogeneous mobile guards and graph decomposition to solve the eternal security problem in multi-agent systems.
Findings
Graph decomposition into clusters enables effective guard deployment.
Heterogeneous guards with different ranges improve security coverage.
The proposed method ensures continuous protection against infinite attacks.
Abstract
In this article, the issue of guarding multi-agent systems against a sequence of intruder attacks through mobile heterogeneous guards (guards with different ranges) is discussed. The article makes use of graph theoretic abstractions of such systems in which agents are the nodes of a graph and edges represent interconnections between agents. Guards represent specialized mobile agents on specific nodes with capabilities to successfully detect and respond to an attack within their guarding range. Using this abstraction, the article addresses the problem in the context of eternal security problem in graphs. Eternal security refers to securing all the nodes in a graph against an infinite sequence of intruder attacks by a certain minimum number of guards. This paper makes use of heterogeneous guards and addresses all the components of the eternal security problem including the number of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplexity and Algorithms in Graphs · Optimization and Search Problems · Mobile Ad Hoc Networks
