CN106507366A - The repeater satellite space-time frequency domain resource dynamic dispatching method of facing multiple users - Google Patents
The repeater satellite space-time frequency domain resource dynamic dispatching method of facing multiple users Download PDFInfo
- Publication number
- CN106507366A CN106507366A CN201611048732.3A CN201611048732A CN106507366A CN 106507366 A CN106507366 A CN 106507366A CN 201611048732 A CN201611048732 A CN 201611048732A CN 106507366 A CN106507366 A CN 106507366A
- Authority
- CN
- China
- Prior art keywords
- time
- customer traffic
- frequency source
- source block
- customer
- 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
Classifications
-
- 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/02—Resource partitioning among network components, e.g. reuse partitioning
- H04W16/10—Dynamic resource partitioning
-
- 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
- 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/0446—Resources in time domain, e.g. slots or frames
-
- 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/0453—Resources in frequency domain, e.g. a carrier in FDMA
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
Abstract
The invention discloses a kind of repeater satellite space-time frequency domain resource dynamic dispatching method of facing multiple users, comprises the steps of：First, each road customer traffic is received；2nd, to calculating weighted value respectively per customer traffic all the way；3rd, distribute time/frequency source block according to weighted value for each customer traffic.The present invention has considered the factors such as task priority, delay requirement, packet loss, handling capacity and application time priority, on Space-time domain distributes rational satellite resource for multi-user.For repeater satellite keyholed back plate center, be conducive to the availability of frequency spectrum and the network throughput for lifting repeater satellite resource；From user perspective, the service quality of user's different business is advantageously ensured that, user's request is met.
Description
Technical field
The invention belongs to repeater satellite communication multiple access technology, solves dynamic of the multi-user using repeater satellite resource
Scheduling problem.The present invention considers the impact such as throughput of system, task priority, subscriber signal quality, task delay requirement
Factor, proposes a kind of repeater satellite space-time frequency domain resource dynamic dispatching model of facing multiple users.The technological innovation ground is being
A kind of improved relay satellite resource allocation method is found between system handling capacity and multi-user's fairness, repeater satellite resource can be lifted
The availability of frequency spectrum and network throughput.
Technical background
In communication relay satellite system, space-time frequency domain resource scheduling is a very important research contents, to improving
QoS of customer plays vital effect.From the angle at repeater satellite keyholed back plate center, need to improve relaying as much as possible
The utilization rate of satellite communication resource and network throughput, from the angle of user, it is ensured that the service of the various different business of user
Quality, meets the demand of user.Research with regard to dispatching algorithm is being carried out always, different according to the target that scheduling is realized, is had several
Common algorithm is planted,
1) PF algorithms
PF algorithms have considered system throughput on the basis of max carrier to interference (MAX, C/I) and poll (RR) algorithm
Amount and the index of fairness.The ratio of momentary rate and Mean Speed as measuring standard, is not only allowed for user by the algorithm
Current signal quality, it are compromises between total handling capacity and each user throughput, due to not accounting for time delay
With the impact of priority factors, so the algorithm is only applicable to non-real-time service.Expression formula is：
Wherein
Mean Speeds of the customer traffic i at time slot n that estimates, ε be scalable of the value between 0 to 1 because
Son.
By formula (2) as can be seen that the shared proportion in Mean Speed of the momentary rate of user is ε, ε is less, instantaneous speed
Impact of the rate to Mean Speed is less, namely fairness is higher, otherwise then fairness is poorer.In actual applications, can be with root
According to dynamic regulation ε is needed, it is allowed to meet demand for services.
2) M-LWDF algorithms
M-LWDF algorithms have considered Delay Factor on the basis of PF algorithms, are allowed to suitable for quicker to time delay
The real time business of sense, so that ensure the qos requirement of different business.Expression formula is
Wherein
DHOL,iFor the first packet time delay of customer traffic i, τiFor the time delay thresholding of customer traffic i, δiFor customer traffic i
First packet time delay exceed time delay thresholding maximum packet loss, be a constant.By formula (5) as can be seen that M-LWDF algorithms be
On the basis of PF algorithms, α is with the addition ofiAnd DHOL,iTwo weight factors, due to αiIt is only related with a type of service constant,
So main by DHOL,iEmbody the priority of real time business.When the first packet time delay of customer traffic is bigger, due to closer to when
Prolong threshold value, then the probability which is dropped is bigger, so the priority of packet is also higher, it is ensured that the real-time of business will
Ask.
3) EXP algorithms
EXP algorithms are the dispatching algorithms proposed for polymorphic type business, it is adaptable to the traffic scheduling of different task priority.
The algorithm increased an index weight factor on the basis of PF algorithms, relative to the relatively low business of priority, quickly can carry
The scheduling probability of high high-priority service.Expression formula is：
Wherein
NrtThe number of reaLtime user data stream is represented, its co-expression implication is identical with M-LWDF.For without priority
The non-real-time service of restriction, αiValue level off to 0, and the business for urgency level higher (such as military mission), αiDHOL,i's
Value is consistently greater than 0, so the increased index weight factor is the priority in order to improve traffic scheduling.Under equal conditions, high
The dispatcher of priority service can be consistently greater than low priority traffice, but when high-priority service is continuous within a period of time
When obtaining resource, overall metric can be caused to decline, at this moment low priority traffice will have an opportunity acquisition bandwidth resources, it is ensured that
Certain fairness.
Additionally, the feature linearly lifted as time delay increases different from priority in M-LWDF algorithms, right in EXP algorithms
The process of task priority adopts exponential form, priority exponentially to increase, it is ensured that hot job can be dispatched first
Chance.
With multi-user, multitask, the continuous development of multi-service type trunking traffic, above-mentioned algorithm can not meet use
The quality of service requirement at family.As scheduling needs the factor of consideration a lot, it is used as impact multi-user's communication relay satellite system
One of key factor of performance, with very big researching value.
Content of the invention
With needing to use repeater satellite in increasing wireless communications application, domestic repeater satellite communication resources are increasingly
Anxiety, causes satellite resource to be difficult to for multi-user using easy generation time conflict, PRI conflict during repeater satellite resource
The problem of allotment, the goal of the invention of the present invention are that the repeater satellite space-time frequency domain resource dynamic for providing a kind of facing multiple users is adjusted
Degree method, can further improve frequency spectrum resource utilization rate, drop on the premise of multi-user's polymorphic type service access demand is ensured
Low use cost, increases user capacity, lifts economic benefit.
The goal of the invention of the present invention is achieved through the following technical solutions：
A kind of repeater satellite space-time frequency domain resource dynamic dispatching method of facing multiple users, comprises the steps of：
First, each road customer traffic is received；
2nd, to calculating weighted value respectively per customer traffic all the way；
3rd, distribute time/frequency source block according to weighted value for each customer traffic；
The weighted value ωi(k, n) is：
Wherein
k：Time/frequency source block；
n：Time slot；
Average delays of the customer traffic i at time slot n；
τi：The time delay thresholding of customer traffic i；
plrreq,i：The maximum packet loss of customer traffic i；
plract,i：The actual packet loss more than time delay thresholding of customer traffic i.
ri(k,n)：Message transmission rate of time/frequency source block k of customer traffic i at time slot n；
Mean Speeds of the customer traffic i at time slot n
σ：The regulatory factor of control packet loss；
U(DHOL,i)：Customer trafficiTask priority utility function
a：Control priority improves the regulatory factor of speed.
Further, after each road customer traffic is received, constraints judgement is carried out to customer traffic first,
The constraints is：
(1) time/frequency source block can only distribute to a customer traffic.
(2) customer traffics can have multiple time/frequency source blocks, but during total time/frequency source block is no more than caching
Customer traffic to be passed；
(3) the power sum for distributing to the time/frequency source block of all customer data stream is total no more than the transmitting of repeater satellite
Power；
(4) fair sex index levels off to 1 as far as possible；
(5) meet the qos requirement of user as far as possible.
Further, comprised the steps of for each customer traffic distribution time/frequency source block according to weighted value：
A the weighted value of each customer traffic is ranked up by () by size；
B () checks whether time/frequency source block distributes, such as available free time/frequency source block, by idle time/frequency source block
Distribute to weighted value and come customer traffic above；Otherwise (d) is executed；
C () checks whether the customer traffic for obtaining time/frequency source block has enough time/frequency source blocks to carry out relay transmission,
If any, then customer traffic is deleted from waiting list, execute (b)；Otherwise (b) is executed directly；
D () determines each customer traffic relay transmission Resource Allocation Formula.
The technical essential for having three below main in the present invention.
(1) spatial domain, time-domain and frequency-domain multi dimensional resource dynamic realtime scheduling mechanism.The present invention is by modeling non-linear broadband money
Source dynamic scheduling problem, carries out combined dispatching to multi-user on spatial domain, time domain and frequency domain.In actual applications, will necessarily frequently
Rate bandwidth, a dispatching cycle is used as a time/frequency source block (RB), and on same RB carries out sky using different repeater satellites
Divide multiplexing, all repeater satellites are carried out with the overall planning of the overall situation, the handling capacity and the availability of frequency spectrum of system is improved as far as possible.
(2) QoS (QoS) pledge system.Repeater satellite communication is required to support polymorphic type media business
Transmission, and for a variety of types of service, corresponding QoS guarantee to be provided.For example, for voice, video etc. in real time
Business, scheduling need to consider that delay sensitive is required；For non-real-time services such as data class, what scheduling needed to consider packet can
Lean on property transmission requirement.This patent on the basis of multiuser proportion fair scheduling has considered Delay Factor, has been allowed to be applied to
To time delay than more sensitive real time business, so as to ensure the qos requirement of different business.
(3) priority, fairness and effectiveness take into account mechanism.Add two letters with regard to packet loss and task priority
Number weight factor, and respectively have a regulation parameter, parameter can be adjusted according to the demand of different business so that scheduling is more
Tool motility.Fairness refers to that each user is obtained in that the dispatcher meeting of equality, and effectiveness refers to the spectrum utilization of system
Rate should reach maximum as much as possible.Fairness and the relation that effectiveness is mutual restriction, when subscriber channel condition is poor, if protect
Card fairness, then will necessarily lose effectiveness, in terms of should considering the two during scheduling.For priorities of task such as military missions
The higher resource request for utilization of level, the dispatching algorithm proposed using this patent, can fast lifting its dispatch weight, lift which and dispatch
Priority.
Beneficial effects of the present invention are：
(1) multi-user's application repeater satellite resource provides scientific and reasonable dispatching method, solves multi-user using relaying
Time conflict, PRI conflict is caused to cause satellite resource to be difficult to the problem that allocates during satellite resource.
(2) by modeling non-linear broadband resource dynamic scheduling problem, scheduling of resource complexity under many factors of influence is solved
The too high problem for being difficult to quantum chemical method.Logical resource dynamic dispatching side is defended based on the Space-time domain of priority using invention
Method, on the premise of multi-user's polymorphic type transmission services qos requirement is ensured can improve frequency spectrum resource utilization rate, reduce using
Cost, increases user capacity, lifts economic benefit.
(3) a kind of dynamic realtime dispatching method of the multi dimensional resource based on spatial domain, time domain and frequency domain is proposed, can basis
Different business and the demand of application scenarios, with regard to packet loss and two function weights of task priority in modification this patent model
Regulation parameter, improves the motility of repeater satellite scheduling of resource.
Description of the drawings
Fig. 1 is relay satellite system resource multi-subscriber dispatching schematic diagram；
Fig. 2 is that the flow process of the repeater satellite space-time frequency domain resource dynamic dispatching method of facing multiple users in embodiment is illustrated
Figure；
Fig. 3 is the relation of task priority utility function value and a in embodiment.
Specific embodiment
The present invention is described in further detail with reference to the accompanying drawings and examples.
As shown in figure 1, different business enters satellite resource scheduler, the unified allocation of resources of repeater satellite, scheduler is waited to press
According to dispatching algorithm, time/frequency source block (RB) is distributed to different business.
The present embodiment improves traditional dispatching algorithm being optimized for simple target, proposes a kind of in user task
Logical resource dynamic dispatching method defended by the space-time frequency domain relaying for prolonging facing multiple users under the premise of requirement is ensured.The method facing multiple users
Using repeater satellite resource application scenarios, propose improved based on the right of the upper running time-frequency resource of each Spatial Dimension (different relay satellites)
Task priority and the DPLS algorithms sensitive more than the packet loss of time delay thresholding.The method combines the maximum of maximize handling capacity
Preferential (the M- of carrier/interface ratio (MAX, C/I) algorithm, poll (RR) algorithm with multi-user's equity dispatching as target, weight limit time delay
LWDF) the scheduling thought of algorithm and preferential (EDF) dispatching algorithm that expires earliest, having considered task priority, time delay will
Ask, packet loss, the handling capacity and application time factor such as successively, distribute rational satellite resource for multi-user on Space-time domain.
For repeater satellite keyholed back plate center, be conducive to the availability of frequency spectrum and the network throughput for lifting repeater satellite resource；From user
Angle, advantageously ensures that the service quality of user's different business, meets user's request.
As shown in Fig. 2 the present embodiment facing multiple users space-time frequency domain relaying defend logical resource dynamic dispatching method include with
Lower step：
First, scheduler receives each road customer traffic.
For the dynamic dispatching of broadband resource, the non-linear rule for seeking optimal solution under multiple constraintss can be modeled as
The problem of drawing, typically with maximum system throughput as target, constraints mainly includes：
(1) RB can only distribute to a customer traffic.
(2) customer traffics can have multiple RB, but total resources are no more than the data to be transferred amount in caching.
(3) total emission power of the power sum no more than repeater satellite of all user resources blocks is distributed to.
(4) ensure the fairness of resource allocation, make fair sex index level off to 1 as far as possible.
(5) meet the qos requirement of user as far as possible, including handling capacity, time delay, packet loss etc..
Customer traffic number in hypothesis system is N, and total resources set of blocks is Κ, and customer traffic i is in n dispatching cycle
The resource set of blocks that place is assigned to isThe a width of △ f of band shared by one Resource Block, in communication relay satellite system, mesh
Scalar functions can be expressed as
Constraints can be expressed as
In formula (2), the implication of partial expression is as follows：
ri(n)：Message transmission rates of the customer traffic i at time slot n；
Qi(n)：Data to be transferred amounts of the customer traffic i at time slot n；
Tslot：The length of one dispatching cycle；
Pi(k,n)：The transmission power distributed at time slot n by the Resource Block k of customer traffic i；
Ptotal：Repeater satellite total emission power；
IJain：Jain justice sex index, it is higher that its value is closer to 1 explanation fairness.
ri：Data rates of the customer traffic i within a period of time；
Q：The QoS of user, will meet the requirement for being not less than standard value.
The target of scheduling is desirable to search out optimal solution by above-mentioned nonlinear equation, systematic function is reached most preferably.But
It is due to needing the factor of consideration all extremely complex, in actual applications it is difficult to try to achieve optimal solution, so by problem is simple
Change, it is that comparison is effective and feasible to be scheduled using the method for suboptimum.
2nd, to calculating weighted value respectively per customer traffic all the way.
Affect the factor of packet scheduling a lot, including type of service, signal quality, queue length, time delay, task priority
Deng, and between each factor, there is certain association, so in dispatching algorithm, it is considered to shared by which factor and each factor
Proportion how to distribute, determine the overall performance of system.The present embodiment considers the relation that influences each other between each factor,
To guarantee that the time delay of real time business and packet loss are dispatched and reduced to the high-priority services such as military mission first, increase system total
Body handling capacity is target, and the weighted value computing formula of design is as follows：
Wherein：
Partial expression implication in formula (9), (10) is as follows：
plrreq,i：The maximum packet loss of customer traffic i, is a constant, is defined as not according to different types of service
With value.
plract,i：The actual packet loss more than time delay thresholding of customer traffic i.
σ：The regulatory factor of control packet loss, different types of service can define different σ parameters.For reliability will
Seek the business that comparison is high, σ values can obtain more dispatcher meetings with relatively large by improving priority, so as to reduce due to
Exceed the packet loss that time delay thresholding causes.
U(DHOL,i)：Task priority utility function with regard to customer traffic i.Using the weight factor of exponential form, when
When priority is higher, utility function gradually increases, namely scheduling probability is stepped up, and it is relevant with a which lifts speed.
a：Control priority improves the regulatory factor of speed, and for controlling the speed of priority raising, Fig. 3 depicts task
Priority utility function value and the relation of a, as seen from the figure, with being continuously increased for a, the lifting speed of utility function value
More and more faster.For different types of service and different time delays are interval, different a values can be adopted, to meet various fields
The demand of scape.
Can be seen by (9), (10), the present embodiment adds two function weights with regard to packet loss and task priority
The factor, and respectively have a regulation parameter, parameter can be adjusted according to the demand of different business so that scheduling is more flexibly
Property, corresponding cost is the lifting of algorithm complex.
3rd, distribute time/frequency source block according to weighted value for each customer traffic, specifically comprise the steps of：
A the weighted value of each customer traffic is ranked up by () by size；
B () checks whether time/frequency source block distributes, such as available free time/frequency source block, by idle time/frequency source block
Distribute to weighted value and come customer traffic above；Otherwise (d) is executed；
C () checks whether the customer traffic for obtaining time/frequency source block has enough time/frequency source blocks to carry out relay transmission,
If any, then customer traffic is deleted from waiting list, execute (b)；Otherwise (b) is executed directly；
D () determines each customer traffic relay transmission Resource Allocation Formula.
It is understood that for those of ordinary skills, with technology according to the present invention scheme and its can send out
Bright design in addition equivalent or change, and all these changes or replace the guarantor that should all belong to appended claims of the invention
Shield scope.
Claims (3)
1. a kind of repeater satellite space-time frequency domain resource dynamic dispatching method of facing multiple users, comprises the steps of：
First, each road customer traffic is received；
2nd, to calculating weighted value respectively per customer traffic all the way；
3rd, distribute time/frequency source block according to weighted value for each customer traffic；
The weighted value ωi(k, n) is：
Wherein
k：Time/frequency source block；
n：Time slot；
Average delays of the customer traffic i at time slot n；
τi：The time delay thresholding of customer traffic i；
plrreq,i：The maximum packet loss of customer traffic i；
plract,i：The actual packet loss more than time delay thresholding of customer traffic i；
ri(k,n)：Message transmission rate of time/frequency source block k of customer traffic i at time slot n；
Mean Speeds of the customer traffic i at time slot n；
σ：The regulatory factor of control packet loss；
U(DHOL,i)：The task priority utility function of customer traffic i；
a：Control priority improves the regulatory factor of speed.
2. the repeater satellite space-time frequency domain resource dynamic dispatching method of a kind of facing multiple users according to claim 1, its
It is characterised by after each road customer traffic is received, first carry out constraints judgement to customer traffic, the constraints is：
(1) time/frequency source block can only distribute to a customer traffic.
(2) customer traffics can have multiple time/frequency source blocks, but total time/frequency source block is no more than waiting in caching
Pass customer traffic；
(3) the transmitting total work of the power sum no more than repeater satellite of the time/frequency source block of all customer data stream is distributed to
Rate；
(4) fair sex index levels off to 1 as far as possible；
(5) meet the qos requirement of user as far as possible.
3. the repeater satellite space-time frequency domain resource dynamic dispatching method of a kind of facing multiple users according to claim 1, its
It is characterised by according to weighted value being that each customer traffic distribution time/frequency source block is comprised the steps of：
A the weighted value of each customer traffic is ranked up by () by size；
B () checks whether time/frequency source block distributes, such as available free time/frequency source block, and idle time/frequency source block is distributed
Customer traffic above is come to weighted value；Otherwise (d) is executed；
C () checks whether the customer traffic for obtaining time/frequency source block has enough time/frequency source blocks to carry out relay transmission, if any,
Then customer traffic is deleted from waiting list, is executed (b)；Otherwise (b) is executed directly；
D () determines each customer traffic relay transmission Resource Allocation Formula.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611048732.3A CN106507366B (en) | 2016-11-25 | 2016-11-25 | The repeater satellite sky time-frequency domain resources dynamic dispatching method of facing multiple users |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611048732.3A CN106507366B (en) | 2016-11-25 | 2016-11-25 | The repeater satellite sky time-frequency domain resources dynamic dispatching method of facing multiple users |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106507366A true CN106507366A (en) | 2017-03-15 |
| CN106507366B CN106507366B (en) | 2019-11-05 |
Family
ID=58328596
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611048732.3A Active CN106507366B (en) | 2016-11-25 | 2016-11-25 | The repeater satellite sky time-frequency domain resources dynamic dispatching method of facing multiple users |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106507366B (en) |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108832993A (en) * | 2018-06-22 | 2018-11-16 | 西安电子科技大学 | Online relay satellite system communication resource allocation method towards hybrid task |
| CN109005595A (en) * | 2018-06-29 | 2018-12-14 | 西南电子技术研究所（中国电子科技集团公司第十研究所） | The method of adaptively selected multichannel self-organizing network time frequency block |
| CN109257303A (en) * | 2018-10-31 | 2019-01-22 | 京信通信系统（中国）有限公司 | QoS queue dispatching method, device and satellite communication system |
| CN109936619A (en) * | 2019-01-18 | 2019-06-25 | 中国科学院空间应用工程与技术中心 | A kind of Information Network framework, method and readable storage medium storing program for executing calculated based on mist |
| CN111294109A (en) * | 2020-02-07 | 2020-06-16 | 军事科学院系统工程研究院网络信息研究所 | Satellite communication channel resource allocation method |
| CN111600643A (en) * | 2020-04-09 | 2020-08-28 | 中国电子科技集团公司电子科学研究院 | Satellite communication resource scheduling method and device storage medium |
| CN111641450A (en) * | 2020-06-02 | 2020-09-08 | 西安电子科技大学 | Satellite-ground integrated network communication and cache resource joint scheduling method |
| CN112243200A (en) * | 2020-10-08 | 2021-01-19 | 军事科学院系统工程研究院网络信息研究所 | Satellite communication multi-user concurrent access anti-collision method based on ideal point |
| CN114157336A (en) * | 2021-11-01 | 2022-03-08 | 中国空间技术研究院 | Dynamic elastic satellite beam scheduling method |
| CN114389678A (en) * | 2022-01-12 | 2022-04-22 | 北京邮电大学 | Multi-beam satellite resource allocation method based on decision performance evaluation |
| CN116055021A (en) * | 2023-03-31 | 2023-05-02 | 之江实验室 | Multi-user flexible Ethernet small particle time slot allocation method and device |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1984392A (en) * | 2006-04-27 | 2007-06-20 | 华为技术有限公司 | Method and base-station for detecting notify channel load |
| CN103079273A (en) * | 2012-11-19 | 2013-05-01 | 南京邮电大学 | Resource management method suitable for multilayer satellite system |
| CN103249159A (en) * | 2013-05-28 | 2013-08-14 | 东南大学 | Radio resource distribution method in multi-beam satellite mobile communication system |
| CN104184514A (en) * | 2014-08-29 | 2014-12-03 | 大连大学 | Bandwidth allocation method used for satellite network |
| CN105657843A (en) * | 2016-01-27 | 2016-06-08 | 中国人民解放军国防科学技术大学 | Outbound resource scheduling method and device of outbound capacity restricted asymmetric satellite channel |
| US9467977B2 (en) * | 2012-03-19 | 2016-10-11 | Electronics And Telecommunications Research Institute | Apparatus and method for allocating resource in communication system |
-
2016
- 2016-11-25 CN CN201611048732.3A patent/CN106507366B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1984392A (en) * | 2006-04-27 | 2007-06-20 | 华为技术有限公司 | Method and base-station for detecting notify channel load |
| US9467977B2 (en) * | 2012-03-19 | 2016-10-11 | Electronics And Telecommunications Research Institute | Apparatus and method for allocating resource in communication system |
| CN103079273A (en) * | 2012-11-19 | 2013-05-01 | 南京邮电大学 | Resource management method suitable for multilayer satellite system |
| CN103249159A (en) * | 2013-05-28 | 2013-08-14 | 东南大学 | Radio resource distribution method in multi-beam satellite mobile communication system |
| CN104184514A (en) * | 2014-08-29 | 2014-12-03 | 大连大学 | Bandwidth allocation method used for satellite network |
| CN105657843A (en) * | 2016-01-27 | 2016-06-08 | 中国人民解放军国防科学技术大学 | Outbound resource scheduling method and device of outbound capacity restricted asymmetric satellite channel |
Cited By (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108832993B (en) * | 2018-06-22 | 2020-09-18 | 西安电子科技大学 | Hybrid task-oriented online relay satellite system communication resource allocation method |
| CN108832993A (en) * | 2018-06-22 | 2018-11-16 | 西安电子科技大学 | Online relay satellite system communication resource allocation method towards hybrid task |
| CN109005595A (en) * | 2018-06-29 | 2018-12-14 | 西南电子技术研究所（中国电子科技集团公司第十研究所） | The method of adaptively selected multichannel self-organizing network time frequency block |
| CN109005595B (en) * | 2018-06-29 | 2022-08-30 | 西南电子技术研究所（中国电子科技集团公司第十研究所） | Method for self-adaptively selecting multi-channel self-organizing network time frequency block |
| CN109257303A (en) * | 2018-10-31 | 2019-01-22 | 京信通信系统（中国）有限公司 | QoS queue dispatching method, device and satellite communication system |
| CN109257303B (en) * | 2018-10-31 | 2021-12-28 | 京信网络系统股份有限公司 | QoS queue scheduling method and device and satellite communication system |
| CN109936619A (en) * | 2019-01-18 | 2019-06-25 | 中国科学院空间应用工程与技术中心 | A kind of Information Network framework, method and readable storage medium storing program for executing calculated based on mist |
| CN111294109B (en) * | 2020-02-07 | 2021-01-15 | 军事科学院系统工程研究院网络信息研究所 | Satellite communication channel resource allocation method |
| CN111294109A (en) * | 2020-02-07 | 2020-06-16 | 军事科学院系统工程研究院网络信息研究所 | Satellite communication channel resource allocation method |
| CN111600643A (en) * | 2020-04-09 | 2020-08-28 | 中国电子科技集团公司电子科学研究院 | Satellite communication resource scheduling method and device storage medium |
| CN111641450A (en) * | 2020-06-02 | 2020-09-08 | 西安电子科技大学 | Satellite-ground integrated network communication and cache resource joint scheduling method |
| CN112243200A (en) * | 2020-10-08 | 2021-01-19 | 军事科学院系统工程研究院网络信息研究所 | Satellite communication multi-user concurrent access anti-collision method based on ideal point |
| CN114157336A (en) * | 2021-11-01 | 2022-03-08 | 中国空间技术研究院 | Dynamic elastic satellite beam scheduling method |
| CN114389678A (en) * | 2022-01-12 | 2022-04-22 | 北京邮电大学 | Multi-beam satellite resource allocation method based on decision performance evaluation |
| CN114389678B (en) * | 2022-01-12 | 2022-11-01 | 北京邮电大学 | Multi-beam satellite resource allocation method based on decision performance evaluation |
| CN116055021A (en) * | 2023-03-31 | 2023-05-02 | 之江实验室 | Multi-user flexible Ethernet small particle time slot allocation method and device |
| CN116055021B (en) * | 2023-03-31 | 2023-06-23 | 之江实验室 | Multi-user flexible Ethernet small particle time slot allocation method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106507366B (en) | 2019-11-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106507366A (en) | The repeater satellite space-time frequency domain resource dynamic dispatching method of facing multiple users | |
| CN107682135A (en) | A kind of network slice adaptive virtual resource allocation method based on NOMA | |
| CN106793133B (en) | Scheduling method for guaranteeing multi-service QoS in electric power wireless communication system | |
| CN103596224B (en) | Resource regulating method based on multistage-mapping under a kind of high-speed mobile environment | |
| CN104301933B (en) | A kind of method for being used for computation bandwidth and distribution bandwidth in wireless self-networking | |
| CN102111819B (en) | Delay-tolerant network | |
| CN101801000A (en) | Secondary user access method for maximization of capacity of dynamic spectrum sharing system | |
| CN103079273A (en) | Resource management method suitable for multilayer satellite system | |
| CN101286949A (en) | Wireless Mesh network MAC layer resource scheduling policy based on IEEE802.16d standard | |
| CN109618375B (en) | UAV ad hoc network time slot scheduling method based on service priority and channel interruption probability | |
| Xiao et al. | Dynamic allocation of 5G transport network slice bandwidth based on LSTM traffic prediction | |
| CN101841916A (en) | Downlink multiuser scheduling method, device and base station | |
| CN103929819A (en) | Cognitive radio network slave user combination price-fixing and resource distributing method | |
| CN106028463A (en) | Satellite-borne dynamic spectrum resource scheduling method based on service rate control | |
| CN106954232A (en) | A kind of resource allocation methods of time delay optimization | |
| CN104093209B (en) | A kind of dynamic cognitive network resource distribution method | |
| Zhan et al. | Fair resource allocation based on user satisfaction in multi-olt virtual passive optical network | |
| Liu et al. | Scheduling in multichannel wireless networks with flow-level dynamics | |
| CN107659940B (en) | Multi-priority multi-channel media access control method based on channel perception | |
| CN101841915A (en) | Method for scheduling and distributing resources in communication system and scheduler | |
| CN108965168A (en) | A kind of car networking based on utility function is dominant resource fairness distribution optimization method | |
| CN101541042A (en) | Downlink dispatching method for WiMAX system | |
| CN101848494A (en) | Dispatching method of real-time business and device thereof | |
| CN1968529B (en) | Cross-layer scheduling method for OFDM system | |
| Wang et al. | Increasing opportunistic gain in small cells through energy-aware user cooperation |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | 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 |