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

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.