Resilient and Robust Strategies for Swarming Ad-hoc Networks
Résumé
We investigate a set of methods aimed at enhancing the resilience and robustness of a mobile communication network, with a focus on a case involving a nanosatellite swarm network. The proposed method focuses on
graph division techniques, aiming to recover from impairments while preserving the primary function or mission of the mobile network. By examining the effects of exploration and random selection algorithms on network
robustness and resilience, our findings indicate that fair graph division consistently strengthens system robustness by reducing the number of packets to transmit, regardless of the algorithm employed. Additionally, our anal-
ysis highlights the superior performance of exploration algorithms, such as MIRW, in enhancing robustness and resilience.
Origine | Fichiers produits par l'(les) auteur(s) |
---|