Maximizing Nanosatellite Throughput via Dynamic Scheduling and Distributed Ground Stations

Nanosatellites in Low Earth Orbit (LEO) are an attractive platform for commercial and scientific missions, but their downlink capacity is constrained by bandwidth and by low ground station duty cycles (often under 5%). These limitations are particularly acute in heterogeneous cooperative networks, where operators seek to maximize "good-put": the number of unique messages successfully delivered to the ground. In this paper, we present and evaluate three complementary algorithms for scheduling nanosatellite passes to maximize good-put under realistic traffic and link variability. First, a Cooperative Reception Algorithm uses Shapley value analysis from cooperative game theory to estimate each station's marginal contribution (considering signal quality, geography, and historical transmission patterns) and prioritize the most valuable upcoming satellite passes. Second, a pair-utility optimization algorithm refines these assignments through local, pairwise comparisons of reception probabilities between neighboring stations, correcting selection biases and adapting to changing link conditions. Third, a weighted bidding algorithm, inspired by the Helium reward model, assigns a price per message and allocates passes to maximize expected rewards in non-commercial networks such as SatNOGS and TinyGS. Simulation results show that all three approaches significantly outperform conventional scheduling strategies, with the Shapley-based method providing the largest gains in good-put. Collectively, these algorithms offer a practical toolkit to improve throughput, fairness, and resilience in next-generation nanosatellite communication systems.