# Matching-Based Resource Allocation for Satellite-Ground Network
###### Abstract  
With the vigorous development of information and communication technology, mobile internet has undergone tremendous changes. How to achieve global coverage of the network has become the primary problem to be solved. GEO satellites and LEO satellites, as important components of the satellite-ground network, can offer service for hotspots or distant regions where ground-based base stations' coverage is limited. Therefore, we build a satellite-ground network model, which transforms the satellite-ground network resource allocation problem into a matching issue between GEO satellites, LEO satellites, and users. A GEO satellite provides data backhaul for users, and a LEO satellite provides data transmission services according to users' requests. It is important to consider the relationships between all entities and establish a distributed scheme, so we propose a three-sided cyclic matching algorithm. It is confirmed by a large number of simulation experiments that the method suggested in this research is better than the conventional algorithm in terms of average delay, satellite revenue, and number of users served. resource allocation; satellite-ground network; matching theory 20  
By overcoming the limitations of traditional schemes and game theory, matching games have become a potential scheme in network resource allocation [8; 9; 10; 11; 12]. There are classical matching schemes between two-party entities [11]. Paper [9] solved the connection problem between electric equipment and UAVs in the power Internet of Things scenario by using a two-sided matching algorithm. It is important to consider the relationships between all entities and establish a distributed scheme. In the satellite-ground network, three types of entities, GEO satellites, LEO satellites, and end users, need to be considered. The three categories of entities must frequently be decoupled by the two-sided matching algorithm, which results in a lack of preference data for different entities and a reduction in system efficiency. There is a three-sided matching scheme between triple entities, and the relationship problem between three entities (GEO satellites, LEO satellites, and end users) can be reformulated using three-sided matching with size and cycle preference list (TMSC) among the three entities matching game [13]. Finding a stable match with the highest cardinality among GEO satellites, LEO satellites, and end users is the objective of TMSC. As it is NP-complete to determine whether a stable match exists in the TMSC model [14], we transformed it into a restricted TMSC by adding some reasonable constraints. In this paper, we use the three-sided matching theory to solve the satellite-ground network resource allocation problem. Among them, GEO satellites provide users with data backhaul, and LEO satellites provide data transmission services according to users' requests. Therefore, we propose a three-sided cyclic matching algorithm. The benefits of our suggested solution include the following: (a) in this method, all three entities are considered simultaneously: GEO satellites, LEO satellites, and end users; (b) the distributed nature of matching algorithms makes it possible to effectively alter resource allocation in response to the constantly changing user demands and the time-varying nature of satellites. The main contributions of this paper are as follows:  
1. We propose a satellite-oriented resource allocation model, composed of GEO satellites, LEO satellites, and users. Then, we design a TMSC problem and create a matching issue with three sides including GEO satellites, LEO satellites, and users in which each agent creates a list of preferences by sorting those of the other agents;
2. It is NP-complete to determine whether a stable match exists in the TMSC model, and by adding some reasonable constraints, we transform it into a restricted TMSC problem. An algorithm is proposed to solve the above problems. It can find stable results;
3.