CN114785402A - Low-interference high-flux satellite dynamic beam hopping method - Google Patents
Low-interference high-flux satellite dynamic beam hopping method Download PDFInfo
- Publication number
- CN114785402A CN114785402A CN202210365497.1A CN202210365497A CN114785402A CN 114785402 A CN114785402 A CN 114785402A CN 202210365497 A CN202210365497 A CN 202210365497A CN 114785402 A CN114785402 A CN 114785402A
- Authority
- CN
- China
- Prior art keywords
- cell
- interference
- satellite
- service
- cells
- 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 42
- 230000005540 biological transmission Effects 0.000 claims description 5
- 230000008569 process Effects 0.000 claims description 5
- 230000007717 exclusion Effects 0.000 claims description 3
- 150000007524 organic acids Chemical class 0.000 claims description 3
- ODKSFYDXXFIFQN-UHFFFAOYSA-M argininate Chemical compound [O-]C(=O)C(N)CCCNC(N)=N ODKSFYDXXFIFQN-UHFFFAOYSA-M 0.000 claims description 2
- 230000000903 blocking effect Effects 0.000 claims description 2
- 238000004891 communication Methods 0.000 abstract description 14
- 238000010586 diagram Methods 0.000 description 6
- 230000006870 function Effects 0.000 description 4
- 238000005457 optimization Methods 0.000 description 4
- 238000010009 beating Methods 0.000 description 3
- 230000003044 adaptive effect Effects 0.000 description 2
- 238000013468 resource allocation Methods 0.000 description 2
- 230000008859 change Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000002068 genetic effect Effects 0.000 description 1
- 238000000059 patterning Methods 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
- 230000004044 response Effects 0.000 description 1
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
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/24—Cell structures
- H04W16/28—Cell structures using beam steering
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)
- Radio Relay Systems (AREA)
Abstract
The invention provides a low-interference high-flux satellite dynamic beam hopping method, which adopts a GAP method to quickly solve the problem of dynamic beam hopping in a broadband satellite communication system, and can obtain a low-interference high-service satisfaction beam hopping pattern by fully utilizing the sparsity of the beam hopping pattern. The present invention maintains interference below the interference threshold. Meanwhile, the algorithm complexity is only related to the number of satellite transmitters and is not related to the number of ground service cells, and the operation time can be greatly shortened when the high-dimensional complex problem is processed. Therefore, the dynamic beam hopping method based on the GAP method is more suitable for solving the beam pattern design problem of the high-throughput satellite in the presence of inter-beam interference.
Description
Technical Field
The invention relates to the technical field of wireless communication, and provides a greedy adaptive tracking GAP (gap adaptive pursuit) method based on a greedy algorithm, which is suitable for solving the problem of dynamic beam hopping caused by interference between beams in an actual high-throughput satellite communication system.
Background
The high-flux beam hopping satellite system is a brand-new high-sensitivity system and has the advantages of high safety coefficient, high response speed, large communication capacity and the like. The high-throughput satellite beam hopping technology can perform resource allocation in four dimensions of space, time, frequency and power, and has excellent flexibility, resource utilization efficiency and the capability of adapting to dynamic changes of ground services.
One of the important factors restricting the communication capacity of the high-throughput beam hopping satellite system is Co-channel Interference (CCI), all beams of the high-throughput beam hopping satellite work simultaneously, and the beams using the same frequency band interfere with each other, so that the communication rate is reduced. When each beam in the high-throughput beam hopping satellite system uses the full frequency bandwidth, if the spot beam simultaneously serves two ground cells with similar distances in the same time slot, a serious CCI problem can be caused.
To sum up, when the beam hopping problem is processed by adopting heuristic methods such as the traditional PSO algorithm and the GA algorithm, a long time is required or even the optimal beam hopping result cannot be converged, and the traditional convex optimization method cannot solve the actual engineering problem in the presence of CCI.
Disclosure of Invention
In order to overcome the defects of the prior art, the invention provides a low-interference high-throughput satellite dynamic beam hopping method. The invention adopts the GAP method to quickly solve the problem of dynamic beam jump in the broadband satellite communication system. By fully utilizing the sparsity of the beam hopping pattern, a beam hopping pattern with low interference and high service satisfaction can be obtained. The invention provides a dynamic beam hopping method of a broadband communication satellite with low interference and high service satisfaction. The method adopts GAP method on the wave beam jump.
The technical scheme adopted by the invention for solving the technical problem comprises the following steps:
step 1: determining input parameters of the GAP method: satellite transmission power PTOLNumber of satellite transmitters K, threshold value of interference between satellite beams ITHN number of terrestrial cells, and f ═ f of service satisfaction of terrestrial cells1,…,fN]Inter-beam interference databaseRepresenting the interference caused to other cells n' when the terrestrial cell n gets satellite beam service;
step 2: initialization: the iteration number i is 1, and the global optimum satisfaction degree F0=0;
And step 3: the cells are sorted in descending order according to the service satisfaction degree f of each ground cell,
wherein, NsortRepresenting the ground number set after N ground cells are sequenced; wherein Sort () is a sorting function, 'descnd' denotes descending order, and arg () is an argument function;
and 4, step 4: entering a loop, executing the step 5 when the iteration times i are less than or equal to N, otherwise, directly entering the step 15;
and 5: in the ith iteration, a beam beating pattern X is initializediSet cell candidate set to 0The number k of beams providing service beams is 1;
wherein the beam patternRepresents the relationship between cell n and beam k ifDenotes that beam k serves cell n ifIndicating that beam k does not serve cell n;
step 6: entering an inner loop, executing the step 7 when the number K of the service beams is less than or equal to K, otherwise, directly entering the step 12;
And 8: setting a beam pattern XiIn (1)Consider beam k serving cellThe cell is in an active state illuminated by a beam, i.e. the beam serves the cell; if it isThe cell is considered to be not lighted by the beam and is in a blocking state, and the beam does not serve the cell;
According to a given interference threshold ITHAnd ground cellInterference caused to any other cell n' while obtaining beam serviceBy judging interferenceAnd interference threshold ITHIn order to find the relation between the interference threshold I and the measured interference levelTHServing cell interference ofFinally, the interference threshold value I exceeding is obtained by applying the independent variable function argTHServing cell forbidden zone set
Step 10: updating cell candidatesCollectionAggregating forbidden zones of service cellsFrom the candidate setThe acid-soluble organic acid is removed in the process,
step 11: increasing the number k of service beams plus 1;
step 12: in the ith iteration, the sum of the service satisfaction of the serving cells is calculated:
step 13: in the ith iteration, if Fi-1≥FiEnding the circulation, and entering step 15, otherwise, entering step 14;
step 14: increasing the iteration times, adding 1 to i, and returning to the step 4;
step 15: output beam beating pattern X ═ Xi-1。
The input parameter of the step 1 is satellite transmitting power 20 dbW-30 dbW, the number K of satellite transmitters is 3-10, and the number N of ground cells is 50-100; arbitrary ground cell n service satisfaction fn: 0 to 1, interference threshold ITHAnd satellite transmission powerRelated, setting-115 dbW to-100 dbW; interference caused to any other cell n' when any terrestrial cell n is served by a beam125dbW to 95dbW, and the interference to the self is expressed as
The invention has the advantages that the wave beam hopping method based on the GAP method can obtain higher service satisfaction degree and simultaneously keep the interference lower than the interference threshold value. Meanwhile, the algorithm adopts a greedy thought, so that the complexity of the algorithm is only related to the number of satellite transmitters and is not related to the number of ground service cells. Compared with the traditional heuristic algorithm, the method can greatly shorten the operation time when processing high-dimensional complex problems. Therefore, the dynamic beam hopping method based on the GAP method is more suitable for solving the beam pattern design problem when the high-throughput satellite has the inter-beam interference.
Drawings
Fig. 1 is a diagram illustrating a beam hopping model in a broadband satellite communication system.
Fig. 2 is a schematic diagram illustrating a low interference dynamic beam hopping process in a broadband satellite communication system.
Fig. 3 is a schematic diagram illustrating the comparison of the sum of cell service satisfaction based on the GAP method and other algorithms.
Fig. 4 is a schematic diagram of maximum inter-beam interference comparison based on the GAP method and other 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 as 60 in a satellite scene as an example, and provides a method for performing dynamic beam hopping by adopting a GAP (GAP) method. 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 the GAT method: satellite transmission power PTOL20dbW, 6 satellite transmitters, threshold I for inter-satellite-beam interferenceTH-113dbW, the number N of terrestrial cells being 60, and the service satisfaction f of terrestrial cells being f1,…,fN]Small, arbitrary groundSatisfaction f of region nnIs composed ofRandom number between, inter-beam interference databaseIndicating the interference caused to other cells n' when any terrestrial cell n is served by a satellite beam,is a random number between-125 dbW and-95 dbW, and the interference to the random number is expressed as
Step 2: initialization: the iteration number i is 1, and the global optimum satisfaction degree F0=0。
And step 3: arranging the cells in descending order according to the service satisfaction degree f of the ground cells
Wherein N issortRepresenting the sorted ground number set of the N ground cells.
And 4, step 4: and (5) entering a loop, executing the following operation steps when the iteration number i is less than or equal to N, and otherwise, directly entering the step 15.
And 5: in the ith iteration, a beam beat pattern X is initializediSetting a cell candidate set as 0The number k of beams providing the service beam is 1.
Wherein the beam patternRepresents the relationship between cell n and beam k ifDenotes that beam k serves cell n ifIndicating that beam k is not serving cell n.
And 6: and entering an inner loop, executing the following operation steps when the number K of the service beams is less than or equal to K, and otherwise, directly entering the step 12.
Step 10: updating cell candidate setsAggregating forbidden zones of service cellsFrom candidate setsThe acid-soluble organic acid is removed in the process,
step 11: the number k of service beams is increased to k + 1.
Step 12: in the ith iteration, the sum of the service satisfaction degrees of the selected cells is calculated:
step 13: in the ith iteration, if Fi-1≥FiThe loop is ended and step 15 is entered, otherwise step 14 is entered.
Step 14: and (3) increasing the iteration times: and returning to the step 4 when i is equal to i + 1.
Step 15: output beam beating pattern X ═ Xi-1。
Fig. 3 is a schematic diagram illustrating the comparison of the sum of cell service satisfaction based on the GAP method and other algorithms. Fig. 4 is a schematic diagram of maximum inter-beam interference comparison based on the GAP method and other algorithms. It can be seen that the beam hopping method based on the GAP method can obtain a higher service satisfaction compared to other methods, while maintaining interference below the interference threshold. Therefore, the dynamic beam hopping method based on the GAP method is more suitable for solving the problem of beam hopping of the high-throughput satellite in the presence of inter-beam interference.
Claims (2)
1. A low-interference high-throughput satellite dynamic beam hopping method is characterized by comprising the following steps:
step 1: determining input parameters of the GAP method: satellite transmission power PTOLNumber of satellite transmitters K, threshold value of interference between satellite beams ITHN number of terrestrial cells, and f ═ f of service satisfaction of terrestrial cells1,…,fN]Inter-beam interference databaseMeaning that when terrestrial cell n gets satellite beam service,interference caused to other cells n';
step 2: initialization: the iteration number i is 1, and the global optimum satisfaction degree F0=0;
And step 3: the cells are sorted in descending order according to the service satisfaction degree f of each ground cell,
wherein, NsortRepresenting the ground number set after N ground cells are sequenced; wherein Sort () is a sorting function, 'descnd' denotes descending order, and arg () is an argument function;
and 4, step 4: entering a loop, executing the step 5 when the iteration times i are less than or equal to N, otherwise, directly entering the step 15;
and 5: in the ith iteration, a beam beat pattern X is initializediSetting a cell candidate set as 0The number k of beams providing the service beam is 1;
wherein the beam pattern Represents the relationship between cell n and beam k ifDenotes that beam k serves cell n ifIndicating that beam k does not serve cell n;
step 6: entering an inner loop, executing the step 7 when the number K of the service beams is less than or equal to K, or directly entering the step 12;
And 8: setting a Beam Pattern XiInConsider beam k serving cellThe cell is in an active state illuminated by a beam, i.e. the beam serves the cell; if it isThe cell is considered to be not lighted by the beam and is in a blocking state, and the beam does not serve the cell;
According to a given interference threshold ITHAnd ground cellInterference caused to any other cell n' while obtaining beam serviceBy judging interferenceAnd interference threshold ITHIn order to find the relation between the interference threshold I and the measured interference levelTHServing cell interferenceFinally, the interference threshold value I exceeding is obtained by applying the independent variable function argTHServing cell forbidden zone set
Step 10: updating cell candidate setsAggregating forbidden zones of service cellsFrom candidate setsThe acid-soluble organic acid is removed in the process,
step 11: increasing the number k of service beams plus 1;
step 12: in the ith iteration, the sum of the service satisfaction of the serving cells is calculated:
step 13: in the ith iteration, if Fi-1≥FiEnding the circulation, and entering step 15, otherwise, entering step 14;
step 14: increasing the iteration times, adding 1 to i, and returning to the step 4;
step 15: output beam hopping pattern X ═ Xi-1。
2. The low-interference high-throughput satellite dynamic beam hopping method as set forth in claim 1, wherein:
the input parameter of the step 1 is satellite transmitting power20 dbW-30 dbW, the number K of satellite transmitters is 3-10, and the number N of ground cells is 50-100; arbitrary ground cell n service satisfaction fn: 0 to 1, interference threshold ITHAnd satellite transmission powerRelated, setting-115 dbW to-100 dbW; interference caused to any other cell n' when any terrestrial cell n is served by a beam125-125 dbW to 95-95 dbW, the interference to itself is expressed as
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202210365497.1A CN114785402B (en) | 2022-04-07 | 2022-04-07 | Low-interference high-flux satellite dynamic beam hopping method |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202210365497.1A CN114785402B (en) | 2022-04-07 | 2022-04-07 | Low-interference high-flux satellite dynamic beam hopping method |
Publications (2)
Publication Number | Publication Date |
---|---|
CN114785402A true CN114785402A (en) | 2022-07-22 |
CN114785402B CN114785402B (en) | 2024-02-27 |
Family
ID=82426743
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202210365497.1A Active CN114785402B (en) | 2022-04-07 | 2022-04-07 | Low-interference high-flux satellite dynamic beam hopping method |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN114785402B (en) |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP2632061A1 (en) * | 2012-02-27 | 2013-08-28 | Agence Spatiale Européenne | A method and a system of providing multi-beam coverage of a region of interest in multi-beam satellite communication. |
CN109450498A (en) * | 2018-11-05 | 2019-03-08 | 南京邮电大学 | A kind of high throughput satellite communication system beam-hopping method |
CN110996394A (en) * | 2019-12-12 | 2020-04-10 | 南京邮电大学 | Satellite communication system resource scheduling method combining beam hopping and precoding |
CN113692051A (en) * | 2021-07-23 | 2021-11-23 | 西安空间无线电技术研究所 | Cross-wave-bit resource allocation method for beam-hopping satellite |
CN113709880A (en) * | 2021-08-23 | 2021-11-26 | 中国人民解放军陆军工程大学 | Service self-adaptive satellite beam hopping system resource allocation method |
-
2022
- 2022-04-07 CN CN202210365497.1A patent/CN114785402B/en active Active
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP2632061A1 (en) * | 2012-02-27 | 2013-08-28 | Agence Spatiale Européenne | A method and a system of providing multi-beam coverage of a region of interest in multi-beam satellite communication. |
CN109450498A (en) * | 2018-11-05 | 2019-03-08 | 南京邮电大学 | A kind of high throughput satellite communication system beam-hopping method |
CN110996394A (en) * | 2019-12-12 | 2020-04-10 | 南京邮电大学 | Satellite communication system resource scheduling method combining beam hopping and precoding |
CN113692051A (en) * | 2021-07-23 | 2021-11-23 | 西安空间无线电技术研究所 | Cross-wave-bit resource allocation method for beam-hopping satellite |
CN113709880A (en) * | 2021-08-23 | 2021-11-26 | 中国人民解放军陆军工程大学 | Service self-adaptive satellite beam hopping system resource allocation method |
Non-Patent Citations (2)
Title |
---|
JINGYU TANG: "Resource Allocation for LEO Beam-Hopping Satellites in a Spectrum Sharing Scenario", IEEE ACCESS ( VOLUME: 9) * |
唐宇;李广侠;边东明;胡婧;: "卫星跳波束资源分配综述", 移动通信, no. 05 * |
Also Published As
Publication number | Publication date |
---|---|
CN114785402B (en) | 2024-02-27 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN110620611B (en) | Cooperative spectrum sensing method based on GEO and LEO double-layer satellite network | |
CN105554780B (en) | Massive MIMO multi-cell cooperating beam allocation method under millimeter wave | |
CN111245485A (en) | Airborne millimeter wave communication beam forming and position deployment method | |
CN109450570B (en) | Multi-feed-source satellite spectrum sensing method based on angle reciprocity | |
CN1151690C (en) | Wireless resource allocation method | |
Zhao et al. | MADRL-based 3D deployment and user association of cooperative mmWave aerial base stations for capacity enhancement | |
CN111262617A (en) | Spectrum sensing method based on cooperation of multiple low-orbit satellites | |
CN114785402A (en) | Low-interference high-flux satellite dynamic beam hopping method | |
Xueyuan et al. | Optimization of digital multi-beamforming for space-based ADS-B using distributed cooperative coevolution with an adaptive grouping strategy | |
CN109725335A (en) | More star formation of the digital multiple beam methods in satellite navigation system | |
Deng et al. | Resource allocation of multibeam communication satellite systems in sparse networks | |
Shibata et al. | Two-step dynamic cell optimization algorithm for HAPS mobile communications | |
Leng et al. | User-level scheduling and resource allocation for multi-beam satellite systems with full frequency reuse | |
Hu et al. | Dynamic power allocation in high throughput satellite communications: A two-stage advanced heuristic learning approach | |
CN114599099A (en) | 5G satellite-ground link multi-beam dynamic power distribution method based on reinforcement learning | |
Ni et al. | The status quo and prospect of satellite network routing technology | |
CN114757084B (en) | Dynamic wave beam hopping method for broadband satellite communication system | |
Sun et al. | A hybrid optimization approach for suppressing sidelobe level and reducing transmission power in collaborative beamforming | |
CN114047492A (en) | Two-dimensional phased array radar search mode and tracking mode automatic switching scheme | |
Yao et al. | Load balanced user grouping scheme for multibeam multicast satellite communication | |
CN115102603B (en) | High-efficiency low-complexity broadband communication satellite global beam hopping method | |
Komarraju et al. | Reinforcement learning based power-optimal usage of beamforming antenna array for multi-way wireless communication in vehicular traffic environments | |
CN111787508A (en) | Radar communication integrated UAV network utility optimization method based on power control | |
CN114389656B (en) | Antenna selection and symbol-level precoding joint design method for ultra-large-scale MIMO | |
CN112566214B (en) | User clustering method, system, storage medium, computer device and application |
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 |