Resilient Self-Organizing Networks in Multi-Agent Systems via Approximate Random k-Regular Graphs | IEEE Conference Publication | IEEE Xplore
Scheduled Maintenance: On Monday, 30 June, IEEE Xplore will undergo scheduled maintenance from 1:00-2:00 PM ET (1800-1900 UTC).
On Tuesday, 1 July, IEEE Xplore will undergo scheduled maintenance from 1:00-5:00 PM ET (1800-2200 UTC).
During these times, there may be intermittent impact on performance. We apologize for any inconvenience.

Resilient Self-Organizing Networks in Multi-Agent Systems via Approximate Random k-Regular Graphs


Abstract:

This paper addresses the problem of making a network of cooperative agents more resilient against disconnections due to link or node failure, or DoS cyber-attacks. We pro...Show More

Abstract:

This paper addresses the problem of making a network of cooperative agents more resilient against disconnections due to link or node failure, or DoS cyber-attacks. We propose a distributed protocol to let the network self-organize and maintain an approximate random k-regular graph topology, which has interesting robustness properties. The proposed method can be applied in a scenario where the agents communicate over an internet protocol, limited to two-hop interactions, and can log-in and log-out according to the framework of open multi- agent systems. We provide a preliminary characterization of the self-organization protocol, and a numerical validation with a comparison with the state-of-art.
Date of Conference: 06-09 December 2022
Date Added to IEEE Xplore: 10 January 2023
ISBN Information:

ISSN Information:

Conference Location: Cancun, Mexico

Contact IEEE to Subscribe

References

References is not available for this document.