Enhancing Low Computational Complexity Heuristic Radio Resource Management Algorithm for Non-Uniform Traffic Demand in Satellite Communications

This project seeks to update a state-of-the-art heuristic radio resource management (H-RRM) algorithm to support diverse user traffic demands in satellite communication systems. Initially developed for time division multiplexing (TDM), the H-RRM algorithm offers a computationally efficient solution for resource allocation with near-optimal performance. Building on recent adaptations that expanded H-RRM compatibility to any multiplexing scheme, this project will further modify the algorithm to handle non-uniform resource assignments, essential for meeting varying user bandwidth requirements typical in modern GEO satellites. The project will define real-world traffic scenarios, benchmark the current H-RRM algorithm against Thales Alenia Space’s legacy tool, and select suitable algorithms for integration. The upgraded H-RRM algorithm will be tested across these scenarios to evaluate bandwidth efficiency, carrier-over-interference (C/I), and computational complexity. This work aims to provide a flexible, low-complexity RRM solution that enhances satellite resource utilization and adaptability to varied user demands.