CN104135743B - Resource allocation methods based on buffer control in a kind of LTE-A cellular network - Google Patents
Resource allocation methods based on buffer control in a kind of LTE-A cellular network Download PDFInfo
- Publication number
- CN104135743B CN104135743B CN201410330741.6A CN201410330741A CN104135743B CN 104135743 B CN104135743 B CN 104135743B CN 201410330741 A CN201410330741 A CN 201410330741A CN 104135743 B CN104135743 B CN 104135743B
- Authority
- CN
- China
- Prior art keywords
- resource block
- user
- access
- subframe
- relaying
- 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
Abstract
The invention discloses the resource allocation methods based on buffer control in a kind of LTE A cellular networks, the time-varying difference of backhaul and access link channel is utilized, it will be during each semi-persistent scheduling, estimate the resource block number of backhaul subframe predistribution, when the volume of transmitted data of backhaul link is more than the data transmission of access link, extra transmission data is stored in the caching of relay, so that being read during semi-persistent scheduling later；During the extra transmission data is this scheduling, data that are being received in backhaul subframe and can not being forwarded in access subframe are relayed；User and throughput of system performance are improved, while for the historical performance difference of macro user and trunk subscriber, the adaptive fairness improved between them.Therefore, this patent can be by improving the application of buffer queue the fairness and throughput performance in different service stations.Meanwhile the price of buffer memory device is relatively low, convenient for being applied in real system.
Description
Technical field
The invention belongs to wireless communication technology fields, are related to the relaying technique of one of LTE key technologies, have studied trunk network
System resource allocation (Resource Allocation) design method in network.
Background technology
In recent years, 3G technology is quite ripe, and 3G network coverage area is just growing, but with new wireless communication
Business continue to bring out and continuous rising of the people to QoS requirement, and 5GHz frequency spectrums below are almost by whole
It occupies, new specific resource can not be configured to wireless communication, thus show phenomenon still getting worse in short supply radio resource day.This
One phenomenon promotes research of the people to Next-Generation Wireless Communication Systems, currently, for next generation network research also gradually at
Ripe, some areas LTE technologies have also carried out relevant test job, relay one of the key technology as LTE, small for improving
The marginal user performance in area, the coverage area for improving High Data Rate realize green communications, expand cell coverage area, mitigate base
Operating pressure, the interim deployment of realization for standing etc. etc. have outstanding contributions, meanwhile, the construction cost and power consumption phase of relaying
It is also more much lower than base station, and have many flexibilities.
After introducing relaying, the interference scene in cell is more complicated, and the resource allocation problem faced is more intractable, and
Whether the distribution of resource rationally will have a direct impact on the improvement of system performance again.The resource allocation problem of relay system is solved, is closed
The allocation strategy of reason necessarily takes into account fairness and validity.Namely consider the compromise of suitable fairness and validity.In
Include local fairness and global fair after the fairness in system, local fairness reflects different in same service station
Fairness between user, global fair reflect the justice that the fairness i.e. user between the user in different service stations is serviced
Property, meanwhile, validity is intended to improve the accumulative handling capacity of each sector.
Although thering is pertinent literature to expand research to LTE relay system resource allocations at present, there is different drawbacks.Its
In simplest scheme assume that the Resource Allocation Formulas of Type I relay systems, it is assumed that backhaul and access subframe difference service station
Identical frequency band is occupied, and assumes that backhaul subframe number is fixed, on this basis according only to activating user in different service stations
Number determine the different occupied number of resource blocks in service station.It will be apparent that the mode of this fixed backhaul subframe, lacks very big
Flexibility, and be easy to cause the waste of resource, while resource allocation policy fails the fairness and effectively in view of system
Property.Existing subproblem is improved on the basis of said program one, we term it schemes two, it is considered
Influence of the aggregated throughput of cell for resource allocation, but still fail to solve fixed backhaul subframe and do not consider justice
Drawback caused by property.Scheme three is for Utilizing Resource Pattern (FDM, TDM) different in backhaul subframe, while respectively with justice
Property or target of the validity as distribution, article gives the limit of reaching the standard grade of resource allocation when taking into account fairness and validity, literary
Chapter, which belongs to, inspires property, does not provide the compromise of effective fairness and validity.The four backhaul subframe side based on TDM of scheme
Formula maximizes the handling capacity of worst user.For taking into account the algorithm of fairness and validity, typical scenario we be denoted as scheme
Five.Author can optimize two above target simultaneously by logarithmic utility function in this scenario, however due to semi-static every time
The independence of scheduling leads to not the long-term fairness of guarantee system, and the same before no caching with most of researchs herein
It puts, it is assumed that backhaul rate is equal to access rate, and to prevent relay data congestion, still, such equality constraint can make
Channel quality is poor in backhaul link or access link so that the link becomes the bottleneck that trunk subscriber handling capacity improves.
Invention content
In view of the foregoing drawbacks or insufficient, the present invention provides the resources based on buffer control in a kind of LTE-A cellular network
Distribution method.
To achieve the above objectives, the technical scheme is that：
Include the following steps：
1) total resources block number mesh in a radio frames in lte-a system, is obtained to be Ω, the set S of service station s, service
The set K of the user of the s that stands accessess, service station s is serviced in Cellular Networks the user k handling capacity in access subframe
2), when carrying out data transmission, during each semi-persistent scheduling, the resource block of estimation backhaul subframe predistribution
NumberWhen the volume of transmitted data of backhaul link is more than the data transmission of access link, during extra transmission data is stored in
In end caches, so that being read during semi-persistent scheduling later；During the extra transmission data is this scheduling,
Relay data that are being received in backhaul subframe and can not being forwarded in access subframe；
3), the resource block number pre-allocated according to backhaul subframeDistribute remaining resource block
3.1), basisObtain optimization aim, i.e. utility function U：
Wherein,Refer to belonging to handling capacities of the user k of service station s in accessing subframe when using PF scheduling；Indicate the resource block number that service station s is distributed in access subframe；|Ks| indicate the number of service station s institutes service user；Indicate handling capacities of the service station s in access subframe on unit resource block；GsIndicate PF scheduling compared to caused by RR scheduling
Additional gain；
3.2), combined according to the utility function U maximum utility function max (U) obtained and formula (3), formula (4) and formula (5)
Solve ωa,2、With
Wherein, ωa,2Indicate macro station occupied resource block number in access subframe,It is that relaying s is accessing subframe
Interior consumed resource block,To relay the resource block that s is consumed in backhaul subframe,Indicate relaying s backhaul subframes
The handling capacity of each resource block of each user,Indicate handling up for each resource block of each user of service station s access subframes
Amount,The access subframe consumed in reading cache data for relaying s；
3.3) ω, is solved according to Lagrangian method multiplier methoda,2、With：
Wherein, | K | number of users total in the sector is indicated, for base station, ηsValue be 1, for relayingL is：
3.4), according to the performance difference of different base station and the history average throughput of relaying, adaptively base station is distributed
Resource block ωa,2, relaying s distribution resource blockIt is modified；
4) basisωa,2、AndWithFinal resource block allocation result is：
Wherein, ωaThe resource block consumed in access subframe by final base station；Finally to relay s in access subframe
Interior consumed resource block；Finally to relay the resource block that s is consumed in backhaul subframe.
The step 2) obtains the occupied resource block of data volume of the extra transmission of backhaul linkDetailed process is：
2.1), when the resource block number of backhaul subframe predistribution isWhen, obtain the data of the extra transmission of backhaul link
Measure Δ I+, and the transmitted data amount Δ I of access link loss is obtained simultaneously-；Then Δ I is obtained+With Δ I-Ratio ξs：
2.2) formula (6), (7) and (8), is substituted into formula (11), then defines ξsEqual to formula (11) left expression formula and right expression
Formula, as follows：
According toWith ξsProportional relation, definitionExpression formula be：
In above formula,It indicates in ξsWhen obtaining maximum value, the maximum value of memory buffers data volume；ξmaxIndicate ξsMost
Big value.
The step 3.4 specifically includes：
A), when the average throughput of macro user is less than relaying n, when user's average throughput of n ∈ S, relaying n reads caching
Data, and consume resourceAccess-in resource, in conjunction with equation (6) to update ωa,2；
B), when the average throughput of macro user is more than relaying m, when the average throughput of the user of m ∈ S, relaying m reads slow
Deposit data,On the basis of consume resource againAccess-in resource so thatIt is modified to
A steps specifically include in the step 3.4：
When the average throughput of macro user is less than the user's average throughput for the relaying that ID is n, reading cache data is simultaneously
And it consumesA access-in resource block,Value is following formula：
In formula,Data cached the consumed access-in resource block number mesh of n is relayed to read, | K0| for base station service
The number of user；
When the average throughput of macro user is more than the user's average throughput for the relaying that ID is n,Value is 0.
B step specifically includes in the step 3.4：
When the average throughput for meeting macro user is more than the user's average throughput for the relaying that ID is m, caching number is read
According to and consumeA access-in resource block,Value be following formula：
When the average throughput for meeting macro user is less than the user's average throughput for the relaying that ID is m,Value
It is 0.
Compared with the prior art, beneficial effects of the present invention are：
The present invention provides the resource allocation methods based on buffer control in a kind of LTE-A cellular network, are carried out in data
When transmission, extra transmission data is subjected to caching process, takes full advantage of the time-varying difference of backhaul and access link channel, is promoted
User and throughput of system performance, while for the historical performance difference of macro user and trunk subscriber, adaptive improvement he
Between fairness.Therefore, this patent can be by improving the application of buffer queue the fairness in different service stations
And throughput performance.Meanwhile the price of buffer memory device is relatively low, convenient for being applied in real system.
Description of the drawings
Fig. 1 is the flow chart of the TSA algorithms of the present invention；
Fig. 2 is interference scene illustraton of model of the present invention, wherein (a) is backhaul link transmission, is (b) that access link transmits；
Fig. 3 is the resource allocator model figure of the present invention；
Fig. 4 is parameter ξ in the present inventionsVariation range scatter chart；
Fig. 5 is the flow chart of the method for determination in the domains L in algorithm steps 2 in the present invention；
Fig. 6 is the topological diagram of simulating scenes of the present invention；
Fig. 7 is the simulation curve of the average throughput ratio of macro user and trunk subscriber in any one sector of the invention
Figure；
Fig. 8 is the distribution of the measurement factor of the average throughput of user in different service stations in any one sector of the invention
Curve；
Fig. 9 is the distribution curve of the aggregated throughput of different sectors of the present invention；
Figure 10 is the distribution curve of all user throughputs in cell of the present invention.
Specific implementation mode
The present invention is described in detail below in conjunction with the accompanying drawings.
As shown in Figure 1, the present invention provides the resource allocation methods based on buffer control in a kind of LTE-A cellular network,
Include the following steps：
1) total resources block number mesh in a radio frames in lte-a system, is obtained to be Ω, the set S of service station s, service
The set K of the user of the s that stands accessess, service station s is serviced in Cellular Networks the user k handling capacity in access subframeSuch as Fig. 2
It is shown, wherein (a) is backhaul link transmission interference scene model, is (b) access link transmission interference model of place.
2), when carrying out data transmission, during each semi-persistent scheduling, the resource block of estimation backhaul subframe predistribution
NumberWhen the volume of transmitted data of backhaul link is more than the data transmission of access link, during extra transmission data is stored in
In end caches, so that being read during semi-persistent scheduling later；During the extra transmission data is this scheduling,
Relay data that are being received in backhaul subframe and can not being forwarded in access subframe；As shown in figure 3, Fig. 3 is resource point
With model.
Obtain the occupied resource block of data volume of the extra transmission of backhaul linkDetailed process is：
2.1), when the resource block number of backhaul subframe predistribution isWhen, obtain the data of the extra transmission of backhaul link
Measure Δ I+, and the transmitted data amount Δ I of access link loss is obtained simultaneously-；Then Δ I is obtained+With Δ I-Ratio ξs：
2.2) formula (6), (7) and (8), is substituted into formula (11), then defines ξsEqual to formula (11) left expression formula and right expression
Formula, as follows：
According toWith ξsProportional relation, definitionExpression formula be：
In above formula,It indicates in ξsWhen obtaining maximum value, the maximum value of memory buffers data volume；ξmaxIndicate ξsMost
Big value.In the present invention, as shown in figure 5, by the measurement for system integration project platform, the live network ring in simulation is obtained
ξ under bordersMaximum value be ξmax=2.5.
3), the resource block number pre-allocated according to backhaul subframeDistribute remaining resource block
3.1), basisObtain optimization aim, i.e. utility function U：
Wherein,Refer to belonging to handling capacities of the user k of service station s in accessing subframe when using PF scheduling；Indicate the resource block number that service station s is distributed in access subframe；|Ks| indicate the number of service station s institutes service user；Indicate handling capacities of the service station s in access subframe on unit resource block；GsIndicate PF scheduling compared to caused by RR scheduling
Additional gain；
3.2), combined according to the utility function U maximum utility function max (U) obtained and formula (3), formula (4) and formula (5)
Solve ωa,2、With
Wherein, ωa,2Indicate macro station occupied resource block number in access subframe,It is that relaying s is accessing subframe
Interior consumed resource block,To relay the resource block that s is consumed in backhaul subframe,Indicate relaying s backhaul subframes
The handling capacity of each resource block of each user,Indicate handling up for each resource block of each user of service station s access subframes
Amount,The access subframe consumed in reading cache data for relaying s；
3.3) ω, is solved according to Lagrangian method multiplier methoda,2、With：
Wherein, | K | number of users total in the sector is indicated, for base station, ηsValue be 1, and for relayingDomain L is as shown in Figure 4：
3.4), according to the performance difference of different base station and the history average throughput of relaying, adaptively base station is distributed
Resource block ωa,2, relaying s distribution resource blockIt is modified, specifically includes：
A), when the average throughput of macro user is less than user's average throughput of relaying n (n ∈ S), relaying n reads slow
Deposit data, and consume resourceAccess-in resource, in conjunction with equation (6) to update ωa,2；
Specifically, when the average throughput of macro user is less than the user's average throughput for the relaying that ID is n, caching is read
It data and consumesA access-in resource block,Value is following formula：
In formula,Data cached the consumed access-in resource block number mesh of n is relayed to read, | K0| for base station service
The number of user；
When the average throughput of macro user is more than the user's average throughput for the relaying that ID is n,Value is 0.
B), when the average throughput of macro user is more than the average throughput of the user of relaying m (m ∈ S), relaying m is read
It is data cached,On the basis of consume resource againAccess-in resource so thatIt is modified to
When the average throughput for meeting macro user is more than the user's average throughput for the relaying that ID is m, caching number is read
According to and consumeA access-in resource block,Value be following formula：
When the average throughput for meeting macro user is less than the user's average throughput for the relaying that ID is m,Value
It is 0.
4) basisωa,2、AndWithFinal resource block allocation result is：
Wherein, ωaThe resource block consumed in access subframe by final base station；Finally to relay s in access subframe
Interior consumed resource block；Finally to relay the resource block that s is consumed in backhaul subframe.
Finally provide simulated environment and simulation result and analysis：
Cell topology as shown in FIG. 6, it is fair that Fig. 7 --- Figure 10 provides system under different resource allocation algorithm respectively
The comparison of property and throughput performance, comparison algorithm includes distribution method (the Fixed Backhaul- of fixed backhaul number of subframes
Subframes Algorithm, FBA), take into account scheme (the Generalized Proportional of fairness and validity
Fairness,GPF)。
Simulation analysis is as follows：Macro user and trunk subscriber throughput performance ratio in any one sector are considered first
CDF curves (such as Fig. 7), simulation result show the TSA algorithms mentioned in this patent from 1 closer to this shows and GPF and FBA algorithms
It compares, TSA algorithms can be good at improving the fairness between macro user and trunk subscriber, and TSA algorithms are calculated compared to FBA in motion
Method improvement is the most apparent, is since FBA algorithms do not consider the fairness between macro user and trunk subscriber；
Secondly, the fairness between different service stations is considered to be weighed with the following factor：
Factor I is more fair closer to 1 explanation, and Fig. 8 gives the comparison of the global fair of three kinds of schemes, simulation result
Illustrate that TSA algorithms have compared to the global fair of GPF algorithms slightly to decline, but combines Fig. 9 it is found that the handling capacity of TSA algorithms has
It is obviously improved, this is because the scheme of this motion can significantly improve handling capacity, and can from second and third of algorithm step
It is to improve as far as possible for global fair to go out this motion.In Fig. 9, the sector of TSA algorithms ratio GPF algorithms and FBA algorithms is tired
Meter handling capacity is obviously improved.Figure 10 depicts the distribution curve of user throughput under different schemes, in the algorithm proposed
The handling capacity of user can be improved.Specifically, FBA algorithms, proposed algorithm handling capacity more preferably user institute accounting are compared
Example is less than 10%, this is because FBA algorithms do not consider fairness so that and there are certain customers can obtain more resources, this
So that most of user throughput is relatively low.
Claims (4)
1. the resource allocation methods based on buffer control in a kind of LTE-A cellular network, which is characterized in that include the following steps：
1), total resources block number mesh is Ω in a radio frames in acquisition lte-a system, the set S of service station s, service station s connect
The set K of the user entereds, service station s is serviced in Cellular Networks the user k handling capacity in access subframe
2), when carrying out data transmission, during each semi-persistent scheduling, the resource block number of estimation backhaul subframe predistributionWhen the volume of transmitted data of backhaul link is more than the data transmission of access link, extra transmission data is stored in relaying
In the caching of end, so that being read during semi-persistent scheduling later；During the extra transmission data is this scheduling, in
After backhaul subframe receive and the data that can not forward in access subframe；
3), the resource block number pre-allocated according to backhaul subframeDistribute remaining resource block
3.1), basisObtain optimization aim, i.e. utility function U：
Wherein,Refer to belonging to handling capacities of the user k of service station s in accessing subframe when using PF scheduling；Table
Show the resource block number that service station s is distributed in access subframe；|Ks| indicate the number of service station s institutes service user；Table
Show handling capacities of the service station s in access subframe on unit resource block；GsIndicate that PF scheduling is additional compared to caused by RR scheduling
Gain；
3.2) it, is solved according to the utility function U maximum utility function max (U) obtained and formula (3), formula (4) and formula (5) joint
ωa,2、With
Wherein, ωa,2Indicate macro station occupied resource block number in access subframe,Institute in subframe is being accessed for relaying s
The resource block of consumption,To relay the resource block that s is consumed in backhaul subframe,Indicate each of relaying s backhaul subframes
The handling capacity of each resource block of user,Indicate the handling capacity of each resource block of each user of service station s access subframes,The access subframe consumed in reading cache data for relaying s；
3.3) ω, is solved according to Lagrangian method multiplier methoda,2、With：
Wherein, | K | indicate number of users total in sector,To relay the number of sub frames that s is consumed in backhaul link, for base station, ηs
Value be 1, for relayingL is：
3.4), according to the performance difference of different base station and the history average throughput of relaying, adaptively to the money of base station distribution
Source block ωa,2, relaying s distribution resource blockIt is modified；It specifically includes：
A), when the average throughput of macro user is less than relaying n, when user's average throughput of n ∈ S, relaying n reads caching number
According to, and consume resourceAccess-in resource,To relay the access subframe that n is consumed in reading cache data, in conjunction with etc.
Formula (6) is to update ωa,2；
B), when the average throughput of macro user is more than relaying m, when the average throughput of the user of m ∈ S, relaying m reads caching number
According to,On the basis of consume resource againAccess-in resource so thatIt is modified to For in
After the resource block that m is consumed in access subframe；
4) basisAndWithFinal resource block allocation result is：
Wherein, ωaThe resource block consumed in access subframe by final base station；Finally to relay s institutes in access subframe
The resource block of consumption；Finally to relay the resource block that s is consumed in backhaul subframe.
2. the resource allocation methods based on buffer control, feature exist in LTE-A cellular network according to claim 1
In,Refer to when carrying out data transmission, during each semi-persistent scheduling, the resource block number of estimation backhaul subframe predistribution,
The step 2) obtains the occupied resource block of data volume of the extra transmission of backhaul linkDetailed process is：
2.1), when the resource block number of backhaul subframe predistribution isWhen, obtain the data volume Δ of the extra transmission of backhaul link
I+, and the transmitted data amount Δ I of access link loss is obtained simultaneously_；Then Δ I is obtained+With Δ I_Ratio ξs：
2.2) formula (6), (7) and (8), is substituted into formula (11), then defines ξsEqual to formula (11) left expression formula and right expression formula, such as
Shown in lower：
Wherein, G0It is that macro station PF scheduling dispatches caused additional gain compared to RR,Indicate each use of macro station s access subframes
The handling capacity of each resource block in family；
According toWith ξsProportional relation, definitionExpression formula be：
In above formula,It indicates in ξsWhen obtaining maximum value, the maximum value of memory buffers data volume；ξmaxIndicate ξsMaximum take
Value.
3. the resource allocation methods based on buffer control, feature exist in LTE-A cellular network according to claim 1
In a) step specifically includes in the step 3.4)：
When the average throughput of macro user is less than the user's average throughput for the relaying that ID is n, reading cache data and disappear
ConsumptionA access-in resource block,Value is following formula：
In formula,Data cached the consumed access-in resource block number mesh of n is relayed to read, | K0| for the user of base station service
Number；|Kn| indicate the number of users in the n of sector；Refer to when carrying out data transmission, in each semi-persistent scheduling phase
Between, the resource block number of estimation backhaul subframe predistribution, subscript " l " here represents relay station l；
When the average throughput of macro user is more than the user's average throughput for the relaying that ID is n,Value is 0.
4. the resource allocation methods based on buffer control, feature exist in LTE-A cellular network according to claim 1
In b) step specifically includes in the step 3.4)：
When the average throughput for meeting macro user is more than the user's average throughput for the relaying that ID is m, reading cache data is simultaneously
And it consumesA access-in resource block,Value be following formula：
It refer to the resource block for relaying m and being consumed in access subframe；To read relaying, n is data cached consumed connects
Enter resource block number；When the average throughput for meeting macro user is less than the user's average throughput for the relaying that ID is m,
Value be 0.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410330741.6A CN104135743B (en) | 2014-07-11 | 2014-07-11 | Resource allocation methods based on buffer control in a kind of LTE-A cellular network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410330741.6A CN104135743B (en) | 2014-07-11 | 2014-07-11 | Resource allocation methods based on buffer control in a kind of LTE-A cellular network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104135743A CN104135743A (en) | 2014-11-05 |
| CN104135743B true CN104135743B (en) | 2018-07-17 |
Family
ID=51808250
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410330741.6A Active CN104135743B (en) | 2014-07-11 | 2014-07-11 | Resource allocation methods based on buffer control in a kind of LTE-A cellular network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104135743B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107113745B (en) * | 2014-12-11 | 2020-09-08 | 意大利电信股份公司 | Method for managing data transmission power in a mobile cellular network |
| CN104540235B (en) * | 2015-01-23 | 2018-01-30 | 哈尔滨工业大学 | TD LTE public network Cluster Multimedia business uplink scheduling methods |
| US20160338032A1 (en) * | 2015-05-11 | 2016-11-17 | Qualcomm Incorporated | Resource allocation and message identification of control signals in cellular systems |
| CN110351011B (en) * | 2018-04-04 | 2022-02-18 | 华为技术有限公司 | Resource allocation method, related device and system |
| CN111901206A (en) * | 2020-08-28 | 2020-11-06 | 杭州安恒信息技术股份有限公司 | Network card testing method, device and related equipment |
| CN114339660B (en) * | 2021-12-02 | 2023-08-18 | 北京理工大学 | Unmanned aerial vehicle cluster random access method |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101977101A (en) * | 2010-10-25 | 2011-02-16 | 电子科技大学 | R-PDCCH (Packet Dedicated Control Channel) channel design structure of a Type I relay in LTE (Long Term Evolution)-A |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2011038529A1 (en) * | 2009-09-29 | 2011-04-07 | 上海贝尔股份有限公司 | Scheduling method and scheduler |
-
2014
- 2014-07-11 CN CN201410330741.6A patent/CN104135743B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101977101A (en) * | 2010-10-25 | 2011-02-16 | 电子科技大学 | R-PDCCH (Packet Dedicated Control Channel) channel design structure of a Type I relay in LTE (Long Term Evolution)-A |
Non-Patent Citations (2)
| Title |
|---|
| Backhaul Resource Allocation in LTE-AdvancedRelaying Systems;Su Yi，Ming Lei;《2012 IEEE Wireless Communications and Networking Conference: MAC and Cross-Layer Design》;IEEE;20121231;第1207-1211页 * |
| Self-Organizing Relays:Dimensioning, Self-Optimization, and Learning;Richard Combes等;《IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT》;IEEE;20121231;第9卷(第4期);第487-499页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104135743A (en) | 2014-11-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104135743B (en) | Resource allocation methods based on buffer control in a kind of LTE-A cellular network | |
| Liu et al. | Economically optimal MS association for multimedia content delivery in cache-enabled heterogeneous cloud radio access networks | |
| Zhang et al. | Incomplete CSI based resource optimization in SWIPT enabled heterogeneous networks: A non-cooperative game theoretic approach | |
| Yang et al. | Graph coloring based resource sharing (GCRS) scheme for D2D communications underlaying full-duplex cellular networks | |
| CN103781118B (en) | Integrated processes is distributed with resource based on multiple services heterogeneous wireless network Access Control | |
| CN108811069A (en) | A kind of Poewr control method of the full duplex non-orthogonal multiple access system based on efficiency | |
| CN106912079A (en) | Federated user accesses selection and resource allocation methods in one kind caching heterogeneous network | |
| CN103687023B (en) | Optimization Radio Resource method based on time delay differentiated service and proportionality rate constraint | |
| CN103856996B (en) | A kind of joint Power control and connection control method | |
| Liu et al. | Deep reinforcement learning based dynamic resource allocation in 5G ultra-dense networks | |
| CN104244264B (en) | Device, method and user equipment in wireless communication system | |
| Al-Abiad et al. | Energy-efficient resource allocation for federated learning in noma-enabled and relay-assisted internet of things networks | |
| CN108848521B (en) | Cellular heterogeneous network joint user association, content caching and resource allocation method based on base station cooperation | |
| CN104770004B (en) | A kind of communication system and method | |
| CN106792764B (en) | Wireless base station planning method for power distribution terminal communication access network | |
| CN110381161A (en) | Based on the resource regulating method of game theory in electric power Internet of things system | |
| CN106792995A (en) | The user access method of content low time delay transmission is ensured in a kind of following 5G networks | |
| CN108430104A (en) | A kind of method and its system of optimized for energy efficiency and resource allocation | |
| CN108521640A (en) | A kind of content distribution method in cellular network | |
| CN103906258B (en) | Double-bounce balance distributed scheduling method based on relay cache in relay enhanced cellular system | |
| CN103338453B (en) | A kind of dynamic spectrum access method for hierarchical wireless network network and system | |
| CN102946611B (en) | Multidimensional resource allocation method in dense WLAN (wireless local area network) based on tabu search | |
| CN108965034B (en) | Method for associating user to network under ultra-dense deployment of small cell base station | |
| Li et al. | A distributed ADMM approach with decomposition-coordination for mobile data offloading | |
| CN106304307B (en) | A kind of resource allocation methods under heterogeneous network converged |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |