Adaptive multibeam hopping in geo satellite networks with non-uniformly distributed ground users

Abstract

This paper designs a novel low-complexity user-cluster grouping algorithm for adaptive beam hopping in geostationary satellite networks equipped with multibeam phased-array antennas. Each beam serves a cluster of users, and the challenge is to design a beam-hopping pattern where no beams are simultaneously serving nearby user clusters. We develop a line search procedure to identify near-optimum groupings for heterogeneous traffic demands. We provide a necessary condition to determine the boundaries of the line search space. Our approach employs exclusion regions around critical user clusters in congested areas, iterates a sequential congestion-based grouping algorithm, and applies a group-member-swapping procedure. It provides max-min fairness for ground users. Extensive numerical studies have shown that our user grouping algorithm produces near-optimum beam-hopping schedules with low outage probability. It achieves an improvement of up to 13dB in the worst-case signal-to-interference and noise ratio, and doubles the zero-outage data rate, compared to benchmark approaches.