Fair Network Division of Nano-satellite Swarms
Résumé
We address the problem of partitioning a network of nano-satellites to distribute fairly the network load under energy consumption constraints. The study takes place in a context where this swarm of nano-satellites orbits the Moon and works as, but not limited to, a distributed radio-telescope for low-frequency radio interferometry. During an interferometry mission, each nano-satellite collects observation data, then shares them with the other swarm members to compute a global image of space. However, the simultaneous transmission of large volumes of data can cause communication issues by overloading the radio channel, leading to potential packet loss. In this context, we investigate three division algorithms based on graph sampling techniques. We prove that random walk-based algorithms overall perform the best in terms of conservation of graph properties and fairness for group sizes down to 10% of the original graph.
Origine | Fichiers produits par l'(les) auteur(s) |
---|