CN111865398B - Satellite-ground transmission method under large-scale LEO satellite deployment - Google Patents
Satellite-ground transmission method under large-scale LEO satellite deployment Download PDFInfo
- Publication number
- CN111865398B CN111865398B CN202010622893.9A CN202010622893A CN111865398B CN 111865398 B CN111865398 B CN 111865398B CN 202010622893 A CN202010622893 A CN 202010622893A CN 111865398 B CN111865398 B CN 111865398B
- Authority
- CN
- China
- Prior art keywords
- satellite
- ground
- channel
- sat
- node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/14—Relay systems
- H04B7/15—Active relay systems
- H04B7/185—Space-based or airborne stations; Stations for satellite systems
- H04B7/1851—Systems using a satellite or space-based relay
- H04B7/18513—Transmission in a satellite or space-based system
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/14—Relay systems
- H04B7/15—Active relay systems
- H04B7/185—Space-based or airborne stations; Stations for satellite systems
- H04B7/1851—Systems using a satellite or space-based relay
- H04B7/18519—Operations control, administration or maintenance
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
- H04W28/18—Negotiating wireless communication parameters
- H04W28/22—Negotiating communication rate
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0473—Wireless resource allocation based on the type of the allocated resource the resource being transmission power
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Astronomy & Astrophysics (AREA)
- Aviation & Aerospace Engineering (AREA)
- General Physics & Mathematics (AREA)
- Quality & Reliability (AREA)
- Radio Relay Systems (AREA)
Abstract
The invention provides a satellite-to-ground transmission method under large-scale LEO satellite deployment, which comprises an indefinite number of channel matching steps and a Lagrangian dual-based power optimization step, wherein the indefinite number of channel matching steps comprise: after the ground node is connected with the satellite, the channel resources in the satellite multiplexing the same frequency band section are distributed; the power optimization step based on the Lagrangian dual: and the maximization of the uplink transmission rate is realized by distributing and determining the uplink transmission power of different ground nodes by using a Lagrange duality method. The invention has the beneficial effects that: the method is mainly applied to the distribution of satellite-ground transmission resources in a low-orbit LEO satellite large-scale deployment scene, and the channel and power resources in the whole system are distributed by applying the resource distribution method provided by the invention, so that the uplink transmission performance of a satellite-ground network is greatly improved, and high-efficiency transmission is realized.
Description
Technical Field
The invention relates to the technical field of communication, in particular to a satellite-ground transmission method under large-scale LEO satellite deployment.
Background
In recent years, academic and industrial circles have started to research on Space-Sky-Terrestrial Integrated Information networks (SSTIINs), and one of the key points of SSTIINs is to implement global networking and real-time access by using a large number of LEO satellites to perform large-scale networking. Therefore, under large-scale LEO deployment, an efficient satellite-to-ground transmission method is crucial to playing the role of LEO satellites.
In the research on the relevant problems under large-scale deployment of LEO satellites, Sheng et al research the transformation and scheduling of multidimensional resources including transmission resources in a spatial information network. On this basis He et al studied the joint allocation of transmission and computation resources in spatial networks and proposed a combined allocation scheme. Jia et al propose a scheme for cooperative data downlink using inter-satellite links in LEO satellite networks to maximize downlink transmission throughput by using inter-satellite links. Huang et al studied if the data could be transferred from the ground IOT gateway via LEO satellite in an efficient and energy-saving manner, and proposed an online optimization scheme. Di et al propose a satellite-to-ground network architecture to integrate a low earth orbit satellite network and a ground network, and based thereon, a flexible exchange matching algorithm to achieve efficient data offloading.
On the study of the problems related to transmission resource allocation, Soleimani et al studied how to overcome performance loss by managing co-channel interference, establish an optimization problem and solve the optimization problem using d.c. planning. In a similar way, Khamidehi et al propose and solve the subchannel and power allocation problem in heterogeneous uplink Orthogonal Frequency Division Multiple Access (OFDMA) networks. Zhang et al have studied the problem of user association, channel allocation and power allocation in the downlink transmission of multi-cell multi-association OFDMA network, and have proposed an optimization scheme based on graph theory and Lagrangian dual theory. The application of the matching theory in resource allocation becomes more and more important, bayard et al introduces the application of the matching theory in wireless communication and proposes some commonly used matching algorithms, and solves the problems of user association and channel association by using the matching algorithms, thereby realizing the maximization of the total utility of users in the uplink OFDMA network. Zhang et al propose a distributed matching algorithm that considers the characteristics of primary and secondary users in a cognitive radio network and selects the best channel utilization to maximize the overall utility of the system by performing many-to-one matching.
The defects of the background art are as follows: in the prior art, researches on the transmission resource allocation problem under large-scale LEO deployment are few, most of the researches on the transmission resource allocation problem are only related problems of simply researching a ground network, but due to the particularity of the large-scale LEO deployment scene and the existence of objective conditions such as co-channel interference among satellites, models and methods of the ground network cannot be directly copied into LEO satellites, and therefore special researches need to be carried out on the conditions. Meanwhile, in the existing research on LEO satellite resource allocation, the joint scheduling and transformation of multidimensional resources are mainly focused, the detailed research is not carried out on the allocation problem of LEO satellite transmission resources, and the allocation method also has the problems of high complexity, low availability and the like. Therefore, research and development of an efficient transmission method under large-scale LEO deployment are particularly urgent.
Disclosure of Invention
The air-space-ground integrated information network is called as the main development direction of the next step of communication technology by virtue of the characteristics of global coverage and real-time access. In order to fully exert the advantages of the air-space-ground integrated information network, it is important to realize efficient transmission between satellites and the ground through a Low Earth Orbit (LEO) satellite. The method is mainly applied to the distribution of satellite-ground transmission resources in a low-orbit LEO satellite large-scale deployment scene, and the channel and power resources in the whole system are distributed by applying the resource distribution method provided by the invention, so that the uplink transmission performance of a satellite-ground network is greatly improved, and high-efficiency transmission is realized.
The invention provides a satellite-to-ground transmission method under large-scale LEO satellite deployment, which comprises an indefinite number of channel matching steps and a Lagrangian dual-based power optimization step,
the step of matching the indefinite number of channels: after the ground node is connected with the satellite, the channel resources in the satellite multiplexing the same frequency band section are distributed;
the power optimization step based on Lagrange dual comprises the following steps: and the maximization of the uplink transmission rate is realized by distributing and determining the uplink transmission power of different ground nodes by using a Lagrange duality method.
As a further improvement of the invention, in said step of channel matching of indefinite number, the utility function of the ground nodes is first defined, and the utility of each ground node served by satellite j on a subchannel can be expressed as:
it means that each ground node TNi presents its utility function for subchannel k according to its equivalent data rate;
accordingly, satellite SATjEach sub-channel of (a) also has a corresponding utility for a ground node, and channel k is for ground node TNiThe utility of (c) can be expressed as:
the form shown above as equation (10) is because each ground node has its lowest rate constraint RminIt must be ensured that if channel k is assigned to the ground node TNiThe minimum rate requirement must be met, so we quantize and represent the difference between the achievable rate and the minimum rate constraint asFor satellite SAT at the same timejThe sub-channel k must reduce the interference caused to other satellites as much as possible when allocating the sub-channel, so that the interference termAs denominator of utility;is a weighting factor so that interference terms to other satellites can play a role in the utility function.
As a further development of the invention, in the step of channel matching of said indefinite number h is usedi,j,kRepresenting ground node TNiAnd satellite node SATjThe link channel gain on subchannel k, the corresponding received signal drying ratio is:
wherein p isi,j,kIndicating TN on subchannel kiTo the SATjThe transmission power of the transmitter,indicating TN on subchannel kiTo the SATjTotal channel gain of Li,jRepresenting large scale fading, i.e. free space lossConsumption hi,j,kDue to shadow Rice fading, Gi(j),jIs TNiIs directed towards the SATjAntenna alignment gain in transmitting data, Gi'(j'),jIs TNi'Is directed towards the SATj'When transmitting data, for SATjThe resulting off-axis antenna gain; mixing TNi'To the SATj'Link and TNi'To the SATjThe angle of the link is shown asOff-axis antenna gain Gi'(j'),jOff-axis angle ofFunction of, N0Is the value of additive white Gaussian noise, yi,j,kRepresenting the matrix elements of the binary matrix Y.
As a further development of the invention, said step of indefinite number of channel matching comprises the steps of performing in sequence an initialization step, a ground request procedure step and a channel decision procedure step,
in the initialization step, belonging to SATjThe ground node set TN ∈ SATjSatellite node SATjThe channel set CH of (2); constructing a preference list GCLIST of a ground node TN and a preference list CLIST of a channel, and initializing an unmatched TN node set UNmatch and a channel matching relation C;
in the ground request process step, the ground node TN which has not satisfied the minimum matching number limitiPreferential update preference list GCLISTiIf all ground nodes meet the minimum matching number limit, all ground nodes sequentially send access requests to the highest-preference channel according to the preference list;
in the channel decision process step, if CHkAlready matched numberThen, executing the processing step, otherwise rejecting all requests;
in the treatment ofIn step (C) CHkCounting the number of ground nodes making requests in the iteration tCHkCLIST according to preference listkAfter the node, the TN with the highest preference degree is compared with CHkRemove from unmatched list UNmatch, establish match Ci,jThe remaining ground nodes are rejected as 1.
As a further improvement of the present invention, in the lagrangian dual-based power optimization step, a lagrangian function is represented by the following formula (11):
wherein, the lambda, the mu and the omega are Lagrangian multiplier vectors corresponding to constraints (4), (5) and (7) in the optimization problem, and a Lagrangian dual function is defined as
The corresponding dual problem can be expressed as:
s.t.λ,μ,ω>0 (13)
considering the irrelevancy among different sub-channels, the dual problem is decomposed into K × J independent sub-problems according to the number of satellites and the number of sub-channels, and then the dual problem is solved by iteration in sequence, and accordingly, the lagrangian function can be rewritten as:
wherein
According to the KKT condition by referring to pi,j,kTaking the partial derivative and making it equal to 0, TN can be obtainediThe optimum transmission power of (a) is:
wherein [ x ]]+=max(0,x);
To derive lagrange multipliers further, a secondary gradient method is used:
where t denotes the number of iterations, τλ(t),τμ(t),τω(t)Representing the iteration step at t iterations.
As a further improvement of the invention, LEO satellites using same frequency band segments are represented asThe number of ground nodes providing data access service for each satellite isThe band with bandwidth B is divided intoOrthogonal sub-channels, all sub-channels being multiplexed by the LEO satellite; the constraint (4) is:the constraint (5) is:the constraint (7) is:constraint (4) indicates that the maximum transmit power per TN cannot exceed Pmax(ii) a Constraint (5) indicates that the minimum rate per TN cannot be less than Rmin(ii) a I in constraint (7)thRepresents the maximum tolerable limit of inter-satellite interference, R accordinglyi,j,kThe change is to the following form:
the invention has the beneficial effects that: the method is mainly applied to the distribution of satellite-ground transmission resources in a low-orbit LEO satellite large-scale deployment scene, and the channel and power resources in the whole system are distributed by applying the resource distribution method provided by the invention, so that the uplink transmission performance of a satellite-ground network is greatly improved, and high-efficiency transmission is realized.
Drawings
FIG. 1 is a star-to-ground transmission architecture diagram;
FIG. 2 is a graph of total system rate/iteration count;
fig. 3 is a graph of number of serving ground nodes/iterations;
FIG. 4 is a system total rate/service radius graph;
fig. 5 is a system total rate/number of terrestrial end users graph.
Detailed Description
The invention discloses a satellite-ground transmission method under large-scale LEO satellite deployment, which is an optimization solution for realizing efficient uplink transmission of a satellite-ground network by using a matching algorithm, convex optimization and other related knowledge.
The invention mainly comprises two parts: establishment of optimization problems and specific optimization solution.
1. Firstly, an optimization problem which meets the requirement of an actual scene and takes the maximum satellite-ground uplink rate as an optimization target is established, and various constraint conditions are comprehensively considered.
2. In the aspect of realizing the specific optimization solution of the problem, an optimization algorithm (MLCA) combining Matching and Lagrangian dual combination is provided by using a Matching algorithm and relevant knowledge of convex optimization, and an optimization target is realized through the algorithm. The MLCA algorithm also mainly comprises two parts:
a. indefinite number of channel matching algorithms (indefinite number of channel matching steps)
b. Lagrange duality-based power optimization algorithm (Lagrange duality-based power optimization step)
First, the first part is introduced, the establishment of the optimization problem:
the invention mainly focuses on the satellite-ground resource allocation problem after the satellites and the ground nodes focus on under the large-scale LEO satellite deployment, namely the channel and power allocation problem after each ground node determines the satellite with data uploading connection. The present invention considers an OFDMA satellite-to-ground network, in which a large number of LEO satellites provide network access and data uplink transmission services for a large number of ground nodes (TNs), as shown in fig. 1. Assuming that the frequency band multiplexing scheme between the satellites and the connection between the satellite nodes are determined, that is, each ground node determines which satellite it is connected to, we need to allocate channel resources in the satellites multiplexing the same frequency band segment, and determine uplink transmission power of different nodes through allocation to maximize the uplink transmission rate of the whole system. LEO satellites using same frequency band segments are represented asThe number of ground nodes providing data access service for each satellite isAltitude, velocity and velocity of each satellite due to pre-determinism of each satellite's orbitThe location information is known to all ground nodes and for convenience we use a quasi-static method to divide a time slot into time slots. In each time slot, the channel conditions between the position of each satellite and the satellite nodes are considered to be constant and we consider that the LEO satellite already knows all the channel state information of the ground nodes.
We consider the band with bandwidth B divided intoOrthogonal subchannels, all of which are multiplexed by the LEO satellite. Due to the motion of LEO satellites in real scenes, we consider that all frequency bands have been doppler shift compensated. For the purpose of more convenient representation of the resource allocation of the satellite nodes in the following, we introduce a binary matrix Y, where the matrix elements Yi,j,kWith 1 indicating that subchannel k of satellite j is assigned to the TN it servesiWhere i (j) denotes the ground node i served by the satellite j, for the sake of simplicity we will consider i to denote i (j) hereinafter, except where noted specifically to avoid confusion. Considering the particularity of the satellite-to-ground transmission, we consider that the conditions affecting the channel are mainly large-scale fading and shadow-ray fading, with hi,j,kDenotes TNiAnd SATjThe link channel gain on subchannel k, corresponding to the receive-to-interference-noise-radio (SINR), is:
wherein p isi,j,kIndicating TN on subchannel kiTo the SATjThe transmission power of the radio frequency (c),indicating TN on subchannel kiTo the SATjTotal channel gain of Li,jRepresenting large scale fading, i.e. free space loss, hi,j,kDue to shadow Rice fading, Gi(j),jIs TNiTowards the antennaSATjAntenna alignment gain in transmitting data, Gi'(j'),jIs TNi'Is directed towards the SATj'When transmitting data, to SATjResulting in off-axis antenna gain. We will TNi'To the SATj'Link and TNi'To the SATjThe angle of the link is shown asOff-axis antenna gain Gi'(j'),jOff-axis angle ofThe specific value of the function of (a) is referred to ITU-R.S.1428, the gain of the off-axis antenna is related to the off-axis angle, and for the size of the off-axis gain of the antenna, a proposal is specially issued by the International telecommunication Union ITU, the off-axis gain of the ground-to-satellite transmission antenna under different off-axis angles is listed in the proposal, the name of the proposal is ITU-R.S.1428, and the off-axis gain of the ground-to-satellite transmission antenna is obtained by referring to the proposal after the off-axis angle of the ground-to-satellite transmission is determined. N is a radical of0Is the value of additive white Gaussian noise.
Accordingly, we have established an optimization problem with the goal of maximizing the total system rate of a multi-satellite node-multi-terrestrial node system, as follows:
wherein constraint (3) ensures that a subchannel for a satellite is allocated to at most one TN; constraint (4) indicates that the maximum transmit power per TN cannot exceed Pmax(ii) a Constraint (5) indicates that the minimum rate per TN cannot be less than Rmin(ii) a Constraint (6) is a binary value of the channel allocation variable.
Because the original optimization problem is a mixed integer nonlinear programming problem, and because the existence of binary variable Y and an interference term in a rate formula, the original problem is also a highly non-convex problem, the global optimal solution of the problem is difficult to obtain. Meanwhile, although factors such as off-axis antenna gain and the like influencing inter-satellite interference are considered, inter-satellite interference under large-scale LEO deployment is unavoidable, and when the interference is too large, the whole system becomes meaningless. We therefore consider introducing an upper interference bound as a new constraint to the optimization problem:
wherein IthRepresents the maximum tolerable limit of inter-satellite interference, R accordinglyi,j,kThe changes are in the form:
considering the complexity of the optimization problem, we choose to adopt a suboptimal method to divide the original problem into two sub-problems, firstly perform sub-channel allocation, then perform power allocation on the basis, and accordingly propose an MLCA algorithm to achieve the optimization goal.
In order to solve the optimization problem proposed by the invention, the invention proposes an MLCA algorithm, which mainly comprises two parts of channel matching and power allocation. The following describes a specific implementation of the MLCA algorithm.
Since the channel allocation variable of the optimization problem is a binary variable, the channel allocation variable can be modeled into a matching problem, and an infinite number of many-to-one matching algorithms are firstly proposed. It should be noted that for an uplink system, no matter which terrestrial node the satellite assigns its subchannel to, the interference received at the satellite from other satellites is fixed, so we decompose it into J independent sub-problems and solve them in turn, depending on the number of satellites J. In the following we assume the assignment of sub-channels to satellite j.
For the matching algorithm, first we define the utility function of the ground nodes, and the utility of each ground node served by satellite j on the subchannel can be expressed as:
it means that each terrestrial node TNi proposes its utility function for subchannel k according to its equivalent data rate, since each node wants to obtain a higher data rate.
Accordingly, each subchannel of satellite j also has a corresponding utility for terrestrial nodes, and the utility of channel k for terrestrial node i can be expressed as:
the form shown above as equation (10) is because each ground node has its lowest rate constraint RminIt must be ensured that if channel k is assigned to ground node i, its minimum rate requirement must be met, so we quantify the difference between the representation of the achievable rate and the minimum rate constraint and represent it as the differenceAt the same time, for subchannel k of satellite j, it is necessary to allocate subchannels as much as possibleTo reduce interference caused to other satellites, so that the interference term is reducedAs denominator of utility;is a weighting factor so that interference terms to other satellites can play a role in the utility function.
After determining the allocation of subchannels, the power allocation scheme needs to be optimized to coordinate the interference and improve the overall throughput of the uplink-to-satellite network. We solve the power allocation problem by using the lagrangian dual approach. The lagrange function is shown in the following equation (11):
wherein, λ, μ, ω are lagrangian multiplier vectors corresponding to constraints (4), (5), (7) in the original optimization problem, and binary boundary constraint (3) has been solved in subchannel allocation. Thus the Lagrangian dual function is defined as
The corresponding dual problem can be expressed as:
s.t.λ,μ,ω>0 (13)
considering the irrelevancy among different sub-channels, the dual problem is decomposed into K multiplied by J independent sub-problems according to the number of satellites and the number of sub-channels, and then the dual problem is sequentially solved in an iteration mode. Accordingly, the lagrange function can be rewritten as:
wherein
According to the KKT (Karush-Kuhn-Tucker) conditions, by referring to pi,j,kBy taking the partial derivatives and making them equal to 0, we can obtain TNiThe optimum transmission power of (a) is:
wherein [ x ]]+=max(0,x)。
To derive lagrange multipliers further, we use a secondary gradient method:
where t denotes the number of iterations, τλ(t),τμ(t),τω(t)Representing the iteration step at t iterations.
Therefore, the method provided by the invention realizes the efficient transmission between the satellite and the ground.
In order to show the effect of the technical means, simulation verification is carried out on the technical scheme. Consider a spectrum-shared satellite-to-terrestrial transmission system that includes J-4 LEO satellites and I-200 TNs. The altitude of the satellite is set to 1000Km, all the satellites operate in the Ka band and the total bandwidth is 400MHz, and in this scenario we set the number of subchannels to 80. Small scale fading over the Ka band is modeled as shadowing rice fading and sets the degree of fading to medium fading, while we also consider the free space loss model in the satellite-to-ground transmission. Furthermore, considering the particularity of the satellite transmission, we choose to use the off-axis antenna gain proposed above. Specific simulation parameters are shown below in table 1, except where specifically mentioned:
table 1: simulation parameter table
In a real communication scenario, in order to fully utilize the communication window of the satellite, only the terrestrial node with better channel condition is sometimes allowed to access the satellite, and the terrestrial node with worse channel condition is denied access. Therefore, under the condition of not considering the minimum rate constraint of the ground node, the Channel and Power allocation can adopt a Lagrangian dual method for Joint optimization, which is called as a Joint Power and Channel optimization Algorithm (WJPCA) Without minimum rate constraint. Fig. 2 shows the convergence of our proposed MLCA Algorithm, we choose the WJPCA Algorithm and the CRPA (Channel Random and Power Average Algorithm) Algorithm as two reference algorithms. From fig. 2, it can be seen that the MLCA algorithm has a good convergence, and the MLCA algorithm has a good performance improvement compared to the CRPA algorithm. Since the MLCA algorithm includes the minimum rate constraint of the ground node, it is necessary to maximize the total rate of the system under the condition of ensuring the minimum rate constraint of the node, so the total rate of convergence is lower than that of the WJPCA algorithm, because the WJPCA will distribute as much resources as possible to users with good channel conditions, which inevitably leads to an increase in the total system rate.
Of course, fig. 2 does not mean that the MLCA algorithm proposed by the present invention has a poor performance, and although it has a relatively low system rate, it guarantees the minimum rate requirements of more ground nodes, and has a good performance in terms of the number of successfully accessed ground nodes. This can be seen in figure 3, which is the same process as figure 2.
Changes in the regional extent of satellite service also affect overall system throughput. In fig. 4, we compare the system throughput under different radius conditions, we set the satellite number to be 4, the ground node number to be 200, and the subchannel number to be 50, and simulate the system performance under the range of radius varying from 30Km to 100 Km.
As can be seen from fig. 4, the change in the service radius affects the overall system rate, and as the radius gradually increases, the overall system rate gradually decreases. It is well understood that as the distance increases, the overall channel condition becomes worse and worse. The off-axis angle will become larger and the corresponding off-axis gain will decrease, and although the interference will be reduced to some extent, the overall system velocity will tend to be downward. This is mainly due to the relatively high altitude of the satellite, which we can conclude from the pythagorean theorem that when the ground service radius is not particularly large, the distance between the LEO satellite and the ground nodes is not very large, and the off-axis angle is not very large. Because the off-axis gain is related to the off-axis angle, when the off-axis angle is in a smaller range, the change of the off-axis angle does not cause great change of the off-axis gain, and accordingly co-channel interference is not great. As the distance increases, the overall channel fading will vary more dramatically than the off-axis gain, resulting in overall performance continuing downward.
Finally, we analyzed the system performance for different ground node numbers, and we selected Particle Swarm Optimization (PSO) and CRPA as the control simulation algorithms, as shown in fig. 5.
From fig. 5, it can be seen that the total system rate of all three algorithms shows a decreasing trend as the number of ground nodes increases, because four independent satellite systems are considered in the model, and each satellite shares the same frequency band, so when the ground nodes transmit data to one satellite, the ground nodes cause co-channel interference to other satellites. Since an uplink system is considered in this case, each ground node has its maximum transmit power, and the maximum powers are equal in magnitude. Therefore, when the number of ground nodes is not particularly large, the overall rate increases with the number of ground nodes, but when the number of ground nodes increases to a certain extent, the influence of power decreases significantly, and the overall system rate is more influenced by channel variation. The more the number of ground nodes, the more ground nodes that need to guarantee the minimum rate requirement, the more and more resources will be transferred from the node with better channel condition to the node with worse channel condition, the rate of the node with better condition will be correspondingly reduced, and the rate of the node with worse condition will be increased. Its effect on the overall rate of the system is also relatively large. This ensures that all ground nodes accessing the satellite meet the minimum rate constraint, but eventually the overall rate will be reduced. From fig. 5 we can also see that the proposed MLCA algorithm has a better performance improvement in the total system rate than the other two algorithms.
The invention relates to a satellite-to-ground transmission method under large-scale LEO satellite deployment, in particular to an MLCA algorithm for realizing the maximization of the overall throughput of a system, which is established under the framework provided by the invention and is used for solving the provided optimization problem. Under the consideration of various constraints such as power, speed and interference limitation in a communication scene, by combining the two algorithms, an efficient transmission scheme between a multi-satellite node and a multi-ground node is obtained, and the advantages of the scheme provided by the invention in the aspects of throughput, access quantity and the like are obtained through simulation verification.
The foregoing is a more detailed description of the invention in connection with specific preferred embodiments and it is not intended that the invention be limited to these specific details. For those skilled in the art to which the invention pertains, several simple deductions or substitutions can be made without departing from the spirit of the invention, and all shall be considered as belonging to the protection scope of the invention.
Claims (4)
1. A satellite-to-ground transmission method under large-scale LEO satellite deployment is characterized by comprising an indefinite number of channel matching steps and a Lagrangian dual-based power optimization step,
the step of matching the indefinite number of channels: after the ground node is connected with the satellite, the channel resources in the satellite multiplexing the same frequency band section are distributed;
the power optimization step based on the Lagrangian dual: the maximization of the uplink transmission rate is realized by distributing and determining the uplink transmission power of different ground nodes by using a Lagrange duality method;
in the step of channel matching of the indefinite number, a utility function of the ground nodes is first defined, and the utility of each ground node served by satellite j on a subchannel can be expressed as:
it means that each ground node TNi presents its utility function for the subchannel k according to its equivalent data rate, where Ri,j,kRepresenting ground node TNiAnd satellite node SATjThe transmission rate on subchannel k;
accordingly, each subchannel of satellite j also has a corresponding utility for terrestrial nodes, and the utility of channel k for terrestrial node i can be expressed as:
the form shown above as equation (10) is because each ground node has its lowest rate constraint RminIt must be ensured that if channel k is assigned to the ground node TNiThe minimum rate requirement must be met, so we quantize and represent the difference between the achievable rate and the minimum rate constraint asFor satellite SAT at the same timejThe sub-channel k must reduce the interference caused to other satellites as much as possible when allocating the sub-channel, so that the interference termAs denominator of utility, wherein pi,j',kRepresenting ground node TNiAnd satellite node SATj'Transmission power on subchannel k, hi,j',kRepresenting ground node TNiAnd satellite node SATj'Link channel gain on subchannel k;is a weighting factor so that interference terms to other satellites can play a role in the utility function.
2. Method for satellite-to-ground transmission according to claim 1, characterized in that in said step of indefinite number of channel matching, h is usedi,j,kRepresenting ground node TNiAnd satellite node SATjLink channel gain on subchannel k, corresponding terrestrial node TNiAnd satellite node SATjThe satellite-to-ground transmission rate on subchannel k is:
wherein p isi,j,kIndicating TN on subchannel kiTo the SATjTransmit power of pi',j',kIndicating TN on subchannel ki'To the SATj'The transmission power of the transmitter,indicating TN on subchannel kiTo the SATjTotal channel gain of hi',j,kIndicating TN on subchannel ki'To the SATjTotal channel gain of Li,jRepresenting large-scale fading, i.e. free space loss, gi,j,kFor shadow rice fading, Gi(j),jIs TNiIs directed towards the SATjAntenna alignment gain in transmitting data, Gi'(j'),jIs TNi'Towards the SATj'When transmitting data, for SATjThe resulting off-axis antenna gain; mixing TNi'To the SATj'Link and TNi'To the SATjThe angle of the link is shown asOff-axis antenna gain Gi'(j'),jOff-axis angle ofFunction of, N0Is the value of additive white Gaussian noise, yi,j,kRepresents SATjWhether subchannel k is allocated to the ground node TN or noti,yi',j',kRepresents SATj'Whether subchannel k is allocated to the ground node TN or noti'。
3. The satellite-to-ground transmission method according to claim 2, wherein the varying number of channel matching steps comprises performing an initialization step, a ground request procedure step, and a channel decision procedure step in sequence,
in the initialization stepIn the middle, the structure belongs to the satellite SATjServing ground node set TN ∈ SATjSatellite node SATjThe channel set CH of (2); constructing a preference list GCLIST of a ground node TN and a preference list CLIST of a channel, and initializing an unmatched TN node set UNmatch and a channel matching relation C;
in the ground request process step, the ground node TN which has not satisfied the minimum matching number limitiPreferential update preference list GCLISTiIf all ground nodes meet the minimum matching number limit, all ground nodes sequentially send access requests to the highest-preference channel according to the preference list;
in the channel decision process step, if CHkAlready matched numberThen, executing the processing step, otherwise rejecting all requests;
4. The method according to claim 2, wherein in the lagrangian dual based power optimization step, the lagrangian function is given by the following equation (11):
wherein, the lambda, the mu and the omega are Lagrangian multiplier vectors corresponding to constraints (4), (5) and (7) in the optimization problem, and a Lagrangian dual function is defined as
The corresponding dual problem can be expressed as:
s.t.λ,μ,ω>0 (13)
considering the irrelevancy among different sub-channels, the dual problem is decomposed into K × J independent sub-problems according to the number of satellites and the number of sub-channels, and then the dual problem is solved by iteration in sequence, and accordingly, the lagrangian function can be rewritten as:
wherein
According to the KKT condition by referring to pi,j,kTaking the partial derivative and making it equal to 0, TN can be obtainediThe optimum transmission power of (a) is:
wherein [ x ]]+=max(0,x);
To derive lagrange multipliers further, a secondary gradient method is used:
where t denotes the number of iterations, τλ(t),τμ(t),τω(t)Representing the iteration step size of t iterations;
λi,jlagrange correlation operator, p, on constraint (4) representing ground node i and satellite jmaxRepresenting the maximum transmit power, mu, of the ground nodei,jLagrange correlation operator, μ, for constraint (5) representing the ground node i and the satellite jj,kLagrange correlation operator for constraint (7), R, representing satellite j and channel kminIndicates the lowest transmission rate, IthRepresenting the maximum limit, σ, of inter-satellite interference2Representing white Gaussian noise, IjRepresents the interference experienced by satellite j;
LEO satellites using same frequency band segments are represented asThe number of ground nodes providing data access service for each satellite isThe band with bandwidth B is divided intoOrthogonal sub-channels, all of which are multiplexed by the LEO satellite; the constraint (4) is:the constraint (5) is:the constraint (7) is:constraint (4) indicates that the maximum transmit power per TN cannot exceed Pmax(ii) a Constraint (5) indicates that the minimum rate per TN cannot be less than Rmin(ii) a I in constraint (7)thRepresents the maximum tolerable limit of inter-satellite interference, R accordinglyi,j,kThe changes are in the form:
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202010622893.9A CN111865398B (en) | 2020-07-01 | 2020-07-01 | Satellite-ground transmission method under large-scale LEO satellite deployment |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202010622893.9A CN111865398B (en) | 2020-07-01 | 2020-07-01 | Satellite-ground transmission method under large-scale LEO satellite deployment |
Publications (2)
Publication Number | Publication Date |
---|---|
CN111865398A CN111865398A (en) | 2020-10-30 |
CN111865398B true CN111865398B (en) | 2022-06-03 |
Family
ID=72989461
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202010622893.9A Active CN111865398B (en) | 2020-07-01 | 2020-07-01 | Satellite-ground transmission method under large-scale LEO satellite deployment |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN111865398B (en) |
Families Citing this family (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN112583453A (en) * | 2020-12-15 | 2021-03-30 | 天地信息网络研究院(安徽)有限公司 | Downlink NOMA power distribution method of multi-beam LEO satellite communication system |
CN112733357B (en) * | 2021-01-04 | 2024-01-23 | 西安建筑科技大学 | Heterogeneous space network data transmission task collaborative planning method |
CN113055075B (en) * | 2021-03-02 | 2022-04-12 | 中国电子科技集团公司第三十八研究所 | HAP deployment and resource allocation method in air-space-ground integrated network system |
CN115276755B (en) * | 2022-06-20 | 2023-05-02 | 哈尔滨工业大学(威海) | Inter-satellite link and power distribution method for satellite network communication |
CN115441927B (en) * | 2022-08-09 | 2023-09-22 | 北京交通大学 | Satellite constellation design method in space-earth integrated network |
CN115412156B (en) * | 2022-08-22 | 2023-07-14 | 北京鹏鹄物宇科技发展有限公司 | Urban monitoring-oriented satellite energy-carrying Internet of things resource optimal allocation method |
CN115801091A (en) * | 2022-10-11 | 2023-03-14 | 西安电子科技大学 | Large-scale constellation network resource scheduling method for satellite-ground cooperative computing |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN109862584A (en) * | 2018-12-30 | 2019-06-07 | 中国科学院软件研究所 | The multi-beam satellite system of power resource allocation method and application this method |
CN110972313A (en) * | 2019-12-05 | 2020-04-07 | 北京邮电大学 | Resource allocation method and system for air-space-ground integrated network |
Family Cites Families (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2001203527A (en) * | 1999-11-10 | 2001-07-27 | Sk Telecom Co Ltd | Smart antenna for imt-2000 code division multiplex wireless communication |
CN101795152B (en) * | 2010-01-15 | 2013-01-30 | 清华大学 | SC-OFDMA-based satellite mobile communication system for forward link |
CN103281112B (en) * | 2013-04-23 | 2016-02-10 | 清华大学 | The Signal transmissions optimization method of FDMA digital channelizing satellite communication system |
CN105429692B (en) * | 2015-11-03 | 2018-09-04 | 中国人民解放军理工大学 | For the combined optimization algorithm of frequency conversion satellite power and repeater gain shelves |
CN105846887B (en) * | 2016-04-21 | 2019-02-15 | 南京大学 | Bandwidth and power coordination distribution method in a kind of intersatellite communication link |
TWI608745B (en) * | 2016-08-05 | 2017-12-11 | 國立清華大學 | Method of power allocation and base station using the same |
CN108024370B (en) * | 2017-12-20 | 2022-10-04 | 哈尔滨工业大学 | Original resource and detected hole resource joint distribution method based on cognition |
CN109089321B (en) * | 2018-09-28 | 2020-06-23 | 西北工业大学 | Resource allocation method for double-frequency air access network |
CN110417496B (en) * | 2019-07-15 | 2021-12-17 | 重庆邮电大学 | Cognitive NOMA network stubborn resource allocation method based on energy efficiency |
CN110278024B (en) * | 2019-08-07 | 2020-07-24 | 清华大学 | System capacity optimization method and device for satellite communication constellation |
CN111065161B (en) * | 2019-11-22 | 2022-11-01 | 东南大学 | Low earth orbit satellite and gateway station link switching method based on multi-input multi-output technology |
-
2020
- 2020-07-01 CN CN202010622893.9A patent/CN111865398B/en active Active
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN109862584A (en) * | 2018-12-30 | 2019-06-07 | 中国科学院软件研究所 | The multi-beam satellite system of power resource allocation method and application this method |
CN110972313A (en) * | 2019-12-05 | 2020-04-07 | 北京邮电大学 | Resource allocation method and system for air-space-ground integrated network |
Also Published As
Publication number | Publication date |
---|---|
CN111865398A (en) | 2020-10-30 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN111865398B (en) | Satellite-ground transmission method under large-scale LEO satellite deployment | |
CN109413724B (en) | MEC-based task unloading and resource allocation scheme | |
Wu et al. | Delay-minimization nonorthogonal multiple access enabled multi-user mobile edge computation offloading | |
Hande et al. | Distributed uplink power control for optimal SIR assignment in cellular data networks | |
CN101784119B (en) | Distribution method of OFDMA (Orthogonal Frequency Division Multiple Access) distributed antenna network resources | |
CN107682935B (en) | Wireless self-return resource scheduling method based on system stability | |
Cui et al. | Latency optimization for hybrid GEO–LEO satellite-assisted IoT networks | |
CN112583566A (en) | Network resource allocation method based on air-space-ground integrated system | |
CN111555795A (en) | Network resource allocation method and device based on user grouping scheduling | |
Wang et al. | A flexible resource allocation algorithm in full bandwidth beam hopping satellite systems | |
Swetha et al. | Selective overlay mode operation for D2D communication in dense 5G cellular networks | |
CN116156421A (en) | Differentiated service transmission method based on double-layer satellite heterogeneous network | |
CN115801091A (en) | Large-scale constellation network resource scheduling method for satellite-ground cooperative computing | |
CN106851726A (en) | A kind of cross-layer resource allocation method based on minimum speed limit constraint | |
Zhang et al. | Exploiting collaborative computing to improve downlink sum rate in satellite integrated terrestrial networks | |
Yuan et al. | Joint beam direction control and radio resource allocation in dynamic multi-beam leo satellite networks | |
Leng et al. | User-level scheduling and resource allocation for multi-beam satellite systems with full frequency reuse | |
Fu et al. | Joint speed and bandwidth optimized strategy of UAV-assisted data collection in post-disaster areas | |
CN116566465A (en) | Multi-domain resource allocation method for avoiding low-orbit satellite interference based on beam hopping | |
CN109561435B (en) | Resource allocation method and server | |
CN115833886A (en) | Power control method of non-cellular large-scale MIMO system | |
Zhao et al. | Flexible Resource Management in High-Throughput Satellite Communication Systems: A Two-Stage Machine Learning Framework | |
CN107426735B (en) | A kind of smart grid communication bottom liner formula frequency spectrum access method | |
CN113014306A (en) | NGEO and GEO satellite spectrum sharing method based on interference control | |
CN110446217A (en) | A kind of distributed resource allocation method based on LAA cellular system |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |