CN114757084A - Dynamic beam hopping method of broadband satellite communication system - Google Patents
Dynamic beam hopping method of broadband satellite communication system Download PDFInfo
- Publication number
- CN114757084A CN114757084A CN202210365485.9A CN202210365485A CN114757084A CN 114757084 A CN114757084 A CN 114757084A CN 202210365485 A CN202210365485 A CN 202210365485A CN 114757084 A CN114757084 A CN 114757084A
- Authority
- CN
- China
- Prior art keywords
- pop
- particle
- steps
- following
- iteration
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 45
- 238000004891 communication Methods 0.000 title claims abstract description 24
- 239000002245 particle Substances 0.000 claims abstract description 71
- 238000004364 calculation method Methods 0.000 claims description 7
- 238000010187 selection method Methods 0.000 claims description 3
- 230000003044 adaptive effect Effects 0.000 abstract description 4
- 238000013461 design Methods 0.000 abstract description 2
- 230000000694 effects Effects 0.000 abstract description 2
- 238000005457 optimization Methods 0.000 description 7
- 238000010586 diagram Methods 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000001186 cumulative effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000002068 genetic effect Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
- 238000013468 resource allocation Methods 0.000 description 1
- 238000001228 spectrum Methods 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/20—Design optimisation, verification or simulation
- G06F30/25—Design optimisation, verification or simulation using particle-based methods
-
- 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)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Computer Hardware Design (AREA)
- Evolutionary Computation (AREA)
- Geometry (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Radio Relay Systems (AREA)
Abstract
The invention provides a dynamic beam hopping method of a broadband satellite communication system, which adopts an ANW-PSO algorithm to complete the dynamic beam distribution process in the broadband satellite communication system. A nonlinear inertial weight selection strategy, an adaptive random exploration strategy and a roulette strategy for generating an effective solution are added. The roulette strategy is added in the algorithm, the nonlinear weight is used for adjusting the particle speed, and the particle self-adaptive random learning mechanism is used, so that when the high-dimensional problem of beam hopping pattern design is processed, the local optimal solution can be rapidly skipped, a better solution effect is obtained, and better convergence is kept.
Description
Technical Field
The invention relates to the technical field of wireless communication, and provides an Adaptive Non-linear Weighted (ANW) -PSO (Adaptive beam hopping) method based on a Particle Swarm Optimization (PSO) algorithm, which is suitable for solving the problem of dynamic beam hopping in a broadband satellite communication system.
Background
With the development of broadband satellite communication systems, it is becoming increasingly important to achieve broader coverage with fewer transmitters due to the high cost of transmitters for multi-beam satellites. The broadband satellite communication system adopting the beam hopping technology can meet the service requirement of a user by utilizing the limited beam to the maximum extent under the condition of limited capacity, provides the service covered as required, improves the frequency spectrum utilization efficiency and reduces the waste of resources.
As the number of users in a terrestrial cell with different priority and traffic demands continues to grow, the resource requirements of the terrestrial cell will eventually exceed the capacity limitations of the communication satellite. By adopting the beam hopping technology, the broadband satellite communication system fully utilizes the flexibility of beam hopping, and measures the result of the beam hopping by adopting the Quality of Service (QoS) of the ground cell, thereby meeting the communication requirement of the ground cell as much as possible.
Document 3 "Alberti X, Ce Brian J M, Bianco AD, et al. system capacity optimization in time and frequency for multi-beam multi-media Systems [ C ]// Advanced Satellite multi-media Systems Conference & the Signal Processing for Space Communications workshop. ieee, 2010" proposes a closed solution that can solve the problem of beam hopping using convex optimization, thereby improving the computation speed while solving this high-dimensional problem. But this ideal case without considering co-channel interference is not suitable for practical engineering.
In summary, under the background that the number of satellite transmitters is limited, when heuristic methods such as the traditional PSO algorithm and the GA algorithm are used to process the high-dimensional problem of beam hopping, a long time is required or even the optimal beam hopping result cannot be converged, and the practical problems of invalid drag-solution cumulative computation speed and computation resource consumption exist. The traditional convex optimization method cannot solve the actual engineering problem in the presence of co-channel interference.
Disclosure of Invention
In order to overcome the defects of the prior art, the invention provides a dynamic beam hopping method of a broadband satellite communication system. The invention adopts ANW-PSO algorithm to complete the dynamic beam distribution process in the broadband satellite communication system. Unlike traditional heuristic algorithms, the ANW-PSO algorithm incorporates a nonlinear inertial weight selection strategy, an adaptive random exploration strategy, and a roulette strategy to generate an effective solution. The invention provides a dynamic beam hopping method of a broadband communication satellite. The method adopts an ANW-PSO algorithm on the wave beam hopping.
The technical scheme adopted by the invention for solving the technical problem comprises the following steps:
step 1: determining input parameters of an ANW-PSO algorithm: the number of particles POP in the solution space, the dimension L of each particle, the value range 1, 2, the number of iteration times I, the maximum inertia weight w, the effective dimension limit epsilon of the particle, and the value range L of each particle are determined according to the number of the particles POP, the iteration times I and the maximum inertia weight wmaxMinimum inertial weight wminMaximum speed limit vmaxMinimum speed limit vmin;
And 2, step: initialization: the iteration number i is 1, and the global optimal QoS is fgbestGlobal optimum QoS contrast value of 0Optimal QoS contrast value of particle popOptimal position pbest of particle pop pop0, in iteration 1, particle pop velocity vpop,1=(vpop,1,1,...,vpop,1,l,…,vpop,1,L) Random assignment, where velocity v is in dimension lpop,1,lThe assignment method comprises the following steps:
vpop,1,l=vmax+rand()*(vmax-vmin)
in iteration 1, according to vmaxAnd vminFor the velocity v in the dimension l of the particle poppop,1,lAnd (4) limiting, wherein the limiting method comprises the following steps:
and step 3: entering a loop, and directly entering the step 4 when the iteration number I is less than or equal to I, or directly entering the step 16;
and 4, step 4: judging whether i is 1, if i is greater than 1, entering the step 5, otherwise, turning to the step 7;
and 5: in the ith iteration, the non-linear weight w is carried outiSelecting, wherein the selection method comprises the following steps:
step 6: in the ith iteration, the velocity v of the particle pop is carried out pop,iThe updating method comprises the following steps:
wherein c is1And c2Is a learning constant, with reference to the parameter settings in the classical PSO algorithm, c1And c2Are all set to 1.8. pbrand()Is to solvePosition of a random particle in space, xpop,i-1Is the position of the particle pop in the last iteration, pbestpopIs the optimal position of the particle pop and gbest is the globally optimal particle position. Velocity vpop,iAfter update, according to vmaxAnd vminFor the velocity v in the dimension l of the particlepop,i,lAnd (4) limiting, wherein the limiting method comprises the following steps:
and 7: using the current globally optimal QoSfgbestUpdating the optimal satisfaction control valueThe updating method comprises the following steps:
and 8: in the ith iteration, the position x of the particle pop is determinedpop,iResetting is carried out, and the resetting method comprises the following steps:
xpop,i=0
and step 9: in the ith iteration, the velocity v according to the particle poppop,iCalculating the probability p of roulettepop,i=(ppop,i,1,...,ppop,i,l,…,ppop,i,L)
The probability calculation method of the dimension l comprises the following steps:
step 10: in the ith iteration, the particle pop position x is updatedpop,iArranging the probabilities of the dimensions in reverse order by l _ indexiAnd the dimension value l _ index of the front epsiloniThe (1: epsilon) is set to be 1, and the updating method comprises the following steps:
{xpop,i,l_1=1|l_1∈l_indexi(1:ε),l_indexi=arg{sort(ppop,i,′descend′)}}
step 11: in the ith iteration, the QoS value f of the particle pop is calculatedpop,iThe calculation method comprises the following steps:
where N represents the number of terrestrial cells served by the broadband communications satellite system, each dimension of the particle represents each cell of the terrestrial, The QoS values representing the ground cells n are all numbers between 0 and 1, and the larger the QoS value is, the higher the priority of the cell is, so that the QoS value is determined according to the actual situation of the ground cell;
step 12: in the ith iteration, ifUpdating the optimal position pbest of the particle poppopAnd an optimal QoS contrast valueThe updating method comprises the following steps:
pbestpop=xpp,i
step 13: by usingUpdate of the maximum value of fgbestAnd updating the global optimal position gbest, wherein the setting method comprises the following steps:
gbest=xpop,i
step 15: increasing iteration times, adding 1 to i, and returning to the step 3;
step 16: outputting a final wave beam hopping result: and gbest.
In the input parameters of the ANW-PSO algorithm in the step 1, the POP setting range of the number of the particles is as follows: 100-500, the dimension L of the particles is equal to the number N of the ground cells, L is equal to N, and the iteration number I is within a range: 200 to 1000, maximum inertial weight wmax0.8, minimum inertial weight wminMaximum speed limit v of 0.4max6, minimum speed limit vmin-6, the particle effective dimension constraint ∈ is equal to the number K of multibeam satellite emitters, ∈ ═ K;
the ANW-PSO algorithm has the beneficial effects that the optimization performance of the ANW-PSO algorithm is obviously higher than that of the traditional heuristic algorithm, and because a roulette strategy is added in the algorithm, the nonlinear weight is used for adjusting the particle speed, and a particle self-adaptive random learning mechanism is adopted, when the high-dimensional problem of beam hopping pattern design is processed, a local optimal solution can be rapidly skipped, a better solving effect is obtained, and meanwhile, better convergence is kept.
Drawings
Fig. 1 is a schematic diagram of a beam hopping model in a broadband satellite communication system.
Fig. 2 is a schematic diagram illustrating a dynamic beam hopping process in a broadband satellite communication system.
FIG. 3 is a diagram illustrating performance comparison between ANW-PSO and other heuristic algorithms.
FIG. 4 is a schematic diagram of the convergence comparison between ANW-PSO and other heuristic algorithms.
Detailed Description
The invention is further illustrated by the following examples in conjunction with the drawings.
The invention provides a dynamic beam hopping method of a broadband communication satellite, which takes a ground cell N-49 in a satellite scene as an example, and provides a method for performing dynamic beam hopping by adopting an ANW-PSO algorithm. A beam hopping model in a broadband satellite communication system is shown in fig. 1, a dynamic beam hopping process is shown in fig. 2, and the specific implementation is as follows:
step 1: determining input parameters of an ANW-PSO algorithm: the number of particles in the solution space POP is 400, the dimension L of each particle is 49, the particle effective dimension limit epsilon is 4, the number of iterations I is 500, and the maximum inertia weight wmax0.8, minimum inertial weight wminMaximum speed limit v of 0.4max6, minimum speed limit vmin=-6。
Step 2: initialization: the iteration number i is 1, and the QoSf is globally optimalgbestGlobal optimum QoS contrast value of 0 Optimal QoS contrast value for particle popOptimal position pbest of particle pop pop0, initial velocity v of particle pop at randompop,1=(vpop,1,1,vpop,1,2,…,vpop,1,L) The initial speed assignment method of the dimension l comprises the following steps:
vpop,1,l=vmax+rand()*(vmax-vmin)
further, v is limited according to the particle velocitymaxAnd vminThe speed of each dimension of the particles is limited, and the limiting method comprises the following steps:
wherein v ispop,i,lIs the velocity of the particle pop in dimension l in the ith iteration.
And 3, step 3: and (4) entering a loop, executing the following operation steps when the iteration number I is less than or equal to I, and otherwise, directly entering the step 16.
And 4, step 4: and judging whether i is equal to 1, if i is greater than 1, entering the step 5, and otherwise, turning to the step 7.
And 5: in thatThe non-linear weight w performed in the ith iterationiSelecting, wherein the selection method comprises the following steps:
step 6: in the ith iteration, the velocity v of the particle pop is carried outpop,iThe updating method comprises the following steps:
wherein c is1And c2Is a learning constant, with reference to the parameter settings in the classical PSO algorithm, c1And c2Are all set to 1.8. pbrand()Is the position of a random particle in solution space, xpop,i-1Is the position of the particle pop in the last iteration, pbestpopIs the optimal position of the particle pop and gbest is the globally optimal particle position. As in step 2, speed limitation is performed after the speed update.
And 7: using the current globally optimal QoSf gbestUpdating the optimal satisfaction control valueThe updating method comprises the following steps:
and 8: in the ith iteration, the position x of the particle pop is determinedpop,iResetting is carried out, and the resetting method comprises the following steps:
xpop,i=0
and step 9: in the ith iteration, the velocity v according to the particle poppop,iCalculating the probability p of roulettepop,i=(ppop,i,1,ppop,i,2,…,ppop,i,L),
The probability calculation method of the dimension l comprises the following steps:
step 10: in the ith iteration, the particle pop position x is updatedpop,iThe probabilities of all dimensions are arranged in a reverse order, the dimension value of the front epsilon is set to be 1, and the updating method comprises the following steps:
{xpop,i,l_1=1|l_1∈l_indexi(1:ε),l_indexi=arg{sort(ppop,i,′descend′)}}
step 11: in the ith iteration, the QoS value f of the particle pop is calculatedpop,iThe calculation method comprises the following steps:
where N represents the number of terrestrial cells served by the broadband communications satellite system and each dimension of the particle represents each cell on the ground.Representing the QoS of the ground cell n, and the QoS values of 49 ground cells are all random numbers between 0 and 1.
Step 12: in the ith iteration, ifUpdating the optimal position pbest of the particle poppopAnd an optimal QoS contrast valueThe updating method comprises the following steps:
pbestpop=xpp,i
step 13: by usingUpdate of the maximum value of fgbestAnd updating the global optimal position gbest, wherein the setting method comprises the following steps:
step 15: and (3) increasing the iteration times: and i is i +1, and the step 3 is returned.
Step 16: outputting a final wave beam hopping result: and gbest.
Fig. 3 is a comparison result of dynamic beam hopping performance based on the ANW-PSO algorithm and other heuristic algorithms, and fig. 4 is a comparison result of particle convergence of the ANW-PSO algorithm and other heuristic algorithms. It can be seen that the optimization performance of the ANW-PSO algorithm is obviously higher than that of the traditional heuristic algorithm, and meanwhile, better convergence is kept when the high-dimensional problem is processed.
Claims (2)
1. A dynamic beam hopping method of a broadband satellite communication system is characterized by comprising the following steps:
step 1: determining input parameters of an ANW-PSO algorithm: the number of particles POP in the solution space, the dimension L of each particle, the value range 1, 2, the L, the effective dimension limit epsilon of the particles, the iteration number I and the maximum inertia weight wmaxMinimum inertial weight wminMaximum speed limit vmaxMinimum speed limit vmin;
Step 2: initialization: the iteration number i is 1, and the global optimal QoS is fgbestGlobal optimum QoS contrast value of 0Optimal QoS contrast value of particle popOf particle popOptimal position pbestpop0, in iteration 1, particle pop velocity vpop,1=(vpop,1,1,...,vpop,1,l,…,vpop,1,L) Random assignment, where velocity v is in dimension lpop,1,lThe assignment method comprises the following steps:
vpop,1,l=vmax+rand()*(vmax-vmin)
in iteration 1, according to vmaxAnd vminFor the velocity v in the dimension l of the particle poppop,1,lAnd (4) limiting, wherein the limiting method comprises the following steps:
And 3, step 3: entering a loop, and directly entering the step 4 when the iteration number I is less than or equal to I, or directly entering the step 16;
and 4, step 4: judging whether i is 1, if i is greater than 1, entering the step 5, otherwise, turning to the step 7;
and 5: in the ith iteration, the non-linear weight w is carried outiSelecting, wherein the selection method comprises the following steps:
step 6: in the ith iteration, the velocity v of the particle pop is carried outpop,iThe updating method comprises the following steps:
wherein c is1And c2Is a learning constant, with reference to the parameter settings in the classical PSO algorithm, c1And c2Are all set as 1.8 pbrand()Is the position of a random particle in solution space, xpop,i-1Is the position of the particle pop in the last iteration, pbestpopIs the optimal position of the particle pop, and gbest is the globally optimal particleA location; velocity vpop,iAfter update, according to vmaxAnd vminFor the velocity v in the dimension l of the particlepop,i,lAnd (4) limiting, wherein the limiting method comprises the following steps:
and 7: using the current globally optimal QoSfgbestUpdating the optimal satisfaction control valueThe updating method comprises the following steps:
and 8: in the ith iteration, the position x of the particle pop is determinedpop,iResetting is carried out, and the resetting method comprises the following steps:
xpop,i=0
and step 9: in the ith iteration, the velocity v according to the particle poppop,iCalculating the probability p of roulettepop,i=(ppop,i,1,...,ppop,i,l,…,ppop,i,L)
The probability calculation method of the dimension l comprises the following steps:
step 10: in the ith iteration, the particle pop position x is updated pop,iArranging the probabilities of the dimensions in reverse order by l _ indexiAnd the dimension value l _ index of the front epsiloniThe (1: epsilon) is set to be 1, and the updating method comprises the following steps:
{xpop,i,l_1=1|l_1∈l_indexi(1:ε),l_indexi=arg{sort(ppop,i,′descend′)}}
step 11: in the ith iteration, the QoS value of the particle pop is calculatedfpop,iThe calculation method comprises the following steps:
where N represents the number of terrestrial cells served by the broadband communications satellite system, each dimension of the particle represents each terrestrial cell,the QoS values representing the ground cells n are all numbers between 0 and 1, and the higher the QoS value is, the higher the priority of the cell is, so that the QoS value is determined according to the actual situation of the ground cell;
step 12: in the ith iteration, ifUpdating the optimal position pbest of the particle poppopAnd an optimal QoS contrast valueThe updating method comprises the following steps:
pbestpop=xpp,i
step 13: by usingUpdate of the maximum value of fgbestAnd updating the global optimal position gbest, wherein the setting method comprises the following steps:
gbest=xpop,i
step 15: increasing iteration times, adding 1 to i, and returning to the step 3;
step 16: outputting a final wave beam hopping result: and gbest.
2. The dynamic beam hopping method for a broadband satellite communication system according to claim 1, wherein:
in the input parameters of the ANW-PSO algorithm in the step 1, the POP setting range of the number of the particles is as follows: 100-500, the dimension L of the particles is equal to the number N of the ground cells, L is equal to N, and the iteration number I is within a range: 200 to 1000, maximum inertial weight w max0.8, minimum inertial weight wmin0.4, maximum speed limit vmax6, minimum speed limit vmin-6, the particle effective dimension constraint, epsilon, is equal to the number of multi-beam satellite emitters, K.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202210365485.9A CN114757084B (en) | 2022-04-07 | 2022-04-07 | Dynamic wave beam hopping method for broadband satellite communication system |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202210365485.9A CN114757084B (en) | 2022-04-07 | 2022-04-07 | Dynamic wave beam hopping method for broadband satellite communication system |
Publications (2)
Publication Number | Publication Date |
---|---|
CN114757084A true CN114757084A (en) | 2022-07-15 |
CN114757084B CN114757084B (en) | 2024-03-05 |
Family
ID=82328570
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202210365485.9A Active CN114757084B (en) | 2022-04-07 | 2022-04-07 | Dynamic wave beam hopping method for broadband satellite communication system |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN114757084B (en) |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2018072351A1 (en) * | 2016-10-20 | 2018-04-26 | 北京工业大学 | Method for optimizing support vector machine on basis of particle swarm optimization algorithm |
CN113222096A (en) * | 2021-04-30 | 2021-08-06 | 桂林理工大学 | Improved particle swarm algorithm for cloud computing task scheduling |
CN114285456A (en) * | 2021-12-21 | 2022-04-05 | 西安电子科技大学 | Low-earth-orbit satellite communication system-oriented beam hopping communication method and satellite load equipment |
-
2022
- 2022-04-07 CN CN202210365485.9A patent/CN114757084B/en active Active
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2018072351A1 (en) * | 2016-10-20 | 2018-04-26 | 北京工业大学 | Method for optimizing support vector machine on basis of particle swarm optimization algorithm |
CN113222096A (en) * | 2021-04-30 | 2021-08-06 | 桂林理工大学 | Improved particle swarm algorithm for cloud computing task scheduling |
CN114285456A (en) * | 2021-12-21 | 2022-04-05 | 西安电子科技大学 | Low-earth-orbit satellite communication system-oriented beam hopping communication method and satellite load equipment |
Non-Patent Citations (1)
Title |
---|
康岚兰;董文永;田降森;: "一种自适应柯西变异的反向学习粒子群优化算法", 计算机科学, no. 10, 15 October 2015 (2015-10-15) * |
Also Published As
Publication number | Publication date |
---|---|
CN114757084B (en) | 2024-03-05 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Lin et al. | Dynamic beam pattern and bandwidth allocation based on multi-agent deep reinforcement learning for beam hopping satellite systems | |
CN114499629B (en) | Dynamic allocation method for jumping beam satellite system resources based on deep reinforcement learning | |
CN113644964B (en) | Multi-dimensional resource joint allocation method of multi-beam satellite same-frequency networking system | |
Hu et al. | Deep reinforcement learning‐based beam Hopping algorithm in multibeam satellite systems | |
CN111200459B (en) | Channel allocation and power control method for uplink multi-beam satellite | |
CN112134614A (en) | Downlink carrier resource allocation method and system for multi-beam communication satellite | |
CN109756874B (en) | Ultra-dense millimeter wave D2D communication interference management method | |
CN114389678A (en) | Multi-beam satellite resource allocation method based on decision performance evaluation | |
CN110856259A (en) | Resource allocation and offloading method for adaptive data block size in mobile edge computing environment | |
CN114071528A (en) | Service demand prediction-based multi-beam satellite beam resource adaptation method | |
CN105554780A (en) | Massive MIMO multi-cell cooperative beam distribution method under millimeter wave | |
CN114866133B (en) | Calculation unloading method for satellite cloud edge cooperative calculation | |
Zhang et al. | A network-flows-based satellite handover strategy for LEO satellite networks | |
Zhang et al. | An online power allocation algorithm based on deep reinforcement learning in multibeam satellite systems | |
CN110536321B (en) | Optimization method for balancing energy efficiency and spectral efficiency in 5G IOT communication | |
Xu et al. | Joint beam-hopping scheduling and coverage control in multibeam satellite systems | |
CN114599099A (en) | 5G satellite-ground link multi-beam dynamic power distribution method based on reinforcement learning | |
CN109089307B (en) | Energy-collecting wireless relay network throughput maximization method based on asynchronous dominant actor critic algorithm | |
Huang et al. | Sequential dynamic resource allocation in multi-beam satellite systems: A learning-based optimization method | |
CN114757084A (en) | Dynamic beam hopping method of broadband satellite communication system | |
Leng et al. | User-level scheduling and resource allocation for multi-beam satellite systems with full frequency reuse | |
Shibata et al. | Two-step dynamic cell optimization algorithm for HAPS mobile communications | |
CN114785402B (en) | Low-interference high-flux satellite dynamic beam hopping method | |
Song et al. | Joint computing, caching and communication resource allocation in the satellite-terrestrial integrated network with UE cooperation | |
Yuan et al. | Joint Multi-Ground-User Edge Caching Resource Allocation for Cache-Enabled High-Low-Altitude-Platforms Integrated Network |
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 |