CN106170154B - A kind of relay scheduling method and device - Google Patents
A kind of relay scheduling method and device Download PDFInfo
- Publication number
- CN106170154B CN106170154B CN201610676735.5A CN201610676735A CN106170154B CN 106170154 B CN106170154 B CN 106170154B CN 201610676735 A CN201610676735 A CN 201610676735A CN 106170154 B CN106170154 B CN 106170154B
- Authority
- CN
- China
- Prior art keywords
- user
- scheduling
- scheduled
- relay
- real time
- 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.)
- Expired - Fee Related
Links
Classifications
-
- 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/535—Allocation or scheduling criteria for wireless resources based on resource usage policies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/20—Control channels or signalling for resource management
- H04W72/23—Control channels or signalling for resource management in the downlink direction of a wireless link, i.e. towards a terminal
-
- 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
- H04W72/542—Allocation or scheduling criteria for wireless resources based on quality criteria using measured or perceived quality
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention relates to a kind of relay scheduling method and devices, belong to wireless communication technology field.The present invention collects the portfolio and QoS parameter of each user terminal channel quality indicator (CQI), radio bearer first, and the real time rate of each user is calculated according to the above- mentioned information being collected into；Then it is scheduled the selection of user according to the real time rate of each user, average throughput and user's scheduling interval, scheduling user is chosen according to user's scheduling interval on the basis of PF algorithm；Resource allocation finally is carried out to selected scheduling user, and is scheduled authorization to it, to realize the scheduling to user.The present invention has fully considered that the scheduled bring Delay Variation of Un subframe influences, the factor that user's scheduling time inter is chosen as scheduling user.Furthermore invention also contemplates that the influence of user's its online multiple R-Ue subscriber traffic variation if relay station, ensure that the fairness between trunk subscriber and other users, improve trunk subscriber performance.
Description
Technical field
The present invention relates to a kind of relay scheduling method and devices, belong to wireless communication technology field.
Background technique
Relaying technique causes more and more extensive attention, is considered as the key of B3G/4G as a kind of emerging technology
Technology in order to increase coverage area or provide hot spot service, is had become important in a wireless communication system using relaying technique
Technological means.As shown in Figure 1, relay node (RN, Relay Node) is wirelessly connected to the eNodeB of its ownership
Cell, after introducing RN, the backhaul link between eNodeB (Donor, DeNB) that RN belongs to it becomes Un interface.In Type1
In relaying, Un interface and Uu interface use identical carrier resource, to avoid generating interference, two chains between Un interface and Uu mouthfuls
Road is worked using time division way.The 19 kinds of Un subframe distribution sides configured by DeNB by high-level signaling are provided in 3GPP standard
Formula, as shown in table 1.
The conventional func of Resource Scheduler is to distribute user different physical resources, and eNodeB is responsible for pipe in LTE system
Manage the scheduling of resource of uplink downlink channel.Common dispatching algorithm is mainly by following three kinds.The first is Round Robin algorithm
(Round-Robin, RR), by each user of Round-Robin Algorithm round-robin scheduling, this is a kind of most fair algorithm, fully considers use
Service fairness between family, but the throughput ratio that may cause system is lower；Second is maximum rate dispatching algorithm (MAX
C/I), which is the sequential selection user according to carrier/interface ratio from big to small, and the user for making channel condition good is preferentially selected, should
Algorithm can maximum system throughput, but do not consider the service fairness between user；The third is that Proportional Fair is calculated
Method (Proportional Fair, PF), which updates the dispatching priority of user by the way of time sliding window, is a kind of
Take into account the dispatching algorithm of handling capacity and fairness.
Table 1
As shown in Fig. 2, RN node has the two different roles of eNodeB and UE, although PF algorithm energy takes into account handling capacity
And fairness, but after LTE system introduces relay station, if simply RN and the M-Ue relationship for regarding equality as used original
PF dispatching algorithm be scheduled, since relay station is only scheduled in Un subframe, this necessarily causes the delay of R-Ue user data；
And when R-Ue online user is more under relay station, RN and the M-Ue relationship for regarding equality as are simply still used into original PF tune
Degree algorithm is scheduled, and can also reduce the scheduled probability of relay station.
The patent application document of Publication No. CN103369699B discloses a kind of classification tune based on relay cellular system
Degree method, proposes the RE-PF algorithm suitable for graded dispatching, and this method is broadly divided into the original allocation and the two-stage dynamic of resource
Two steps of scheduling of resource.The patent application document of 103260247 A of Publication No. CN discloses a kind of dispatching method, relaying
Node and base station, relay node obtain equivalent CQI according to corresponding first CQI and the 2nd CQI of each scheduling resource units, into
And it determines target Equivalent CQI and is reported to base station；Base station is further according to directly being mentioned each scheduling resource units corresponding by base station
The target Equivalent CQI that three CQI and relay node report carries out scheduling of resource to the first UE and the 2nd UE.Publication No. CN
The patent application document of 104994543 A discloses a kind of random access overload controlling method, including descending scheduling algorithm: traversal
All radio bearers, summation obtain the total amount of data Dsum to be sent in node B cache area, are then normalized to obtain
Uplink scheduling parameter Pup, with rPForm is added in dispatching algorithm, and wherein r corresponds to each user's instantaneous transmission speed；Uplink tune
Degree algorithm: it sums to obtain total amount of data Dsum to be uploaded according to the BSR that user uploads, is then normalized to obtain down
Row scheduling parameter Pdown, with rPForm be added in dispatching algorithm.Relay scheduling method disclosed in above-mentioned file is not examined
Consider the multiple R-Ue user's bring portfolio variations of RN dispatching, and be only capable of in the scheduled bring Delay Variation of Un subframe,
The probability for causing relay station scheduled reduces, and affects relay station performance.
Summary of the invention
The object of the present invention is to provide a kind of relay scheduling method and devices, are seen with solving existing PF algorithm for RN and M-Ue
The relationship for making equality is scheduled the problem of probability for causing relay station scheduled reduces, influences relay station performance.
The present invention provides a kind of relay scheduling method to solve above-mentioned technical problem, which includes following step
It is rapid:
1) portfolio and QoS parameter of each user terminal channel quality indicator (CQI) of collection, radio bearer, and according to
The above- mentioned information being collected into calculate the real time rate of each user；
2) it is scheduled the selection of user according to the real time rate of each user, average throughput and user's scheduling interval, selects
It takes family real time rate and average throughput ratio and obtains the user of maximum value as scheduling user multiplied by user's scheduling interval；
3) resource allocation is carried out to scheduling user selected by step 2), and is scheduled authorization to it.
The step 2) also needs the online number for considering each user, i.e., by each user's when being scheduled user's selection
The factor that online number is chosen as scheduling user.
User is dispatched in the step 2)Selection principle it is as follows:
Wherein RjIt (t) is real time rate of the user j in t moment；For average throughput of the user j within the Δ t time；
τdelayFor user's scheduling time inter, if user is M-Ue, τdelay=1ms, if user is RN, when uplink scheduling, τdelayFor Un
Sub-frame of uplink interval, when descending scheduling, τdelayFor Un downlink subframe interval；Num is online user number, if user is M-Ue,
Num=1, if user is RN, Num is online R-Ue number.
The average throughputUpdate it is as follows:
Wherein TcFor time constant, time window size is indicated.
Information collection in step 1) is divided into uplink scheduling and descending scheduling, and for descending scheduling, user passes through uplink control
Channel reporting measurement public reference signal processed obtains down channel quality instruction, reports each user of acquisition of information to carry by base station
Portfolio, that is, QoS parameter；For uplink scheduling, user passes through uplink control channel for power headroom reporting (PHR) and buffering
State report is reported to base station, obtains up channel instruction by the sounding reference symbol that measurement Ue is sent by base station.
When being scheduled authorization, for descending scheduling, scheduled user is in the downlink data for receiving base station transmission
After need Xiang Qifa answer signal, for uplink scheduling, scheduled user receive base station transmission downlink data after need to
It sends out answer signal.
The present invention also provides a kind of relay scheduling device, which includes information collection module, scheduling judgement mould
Block and scheduling execution module,
The information collection module is used to collect the portfolio of each user terminal channel quality indicator (CQI), radio bearer
And QoS parameter, and calculate according to the above- mentioned information being collected into the real time rate of each user；
The scheduling decision module be used for according to the real time rate of each user, average throughput and user's scheduling interval into
The selection of row scheduling user, chooses user's real time rate and average throughput ratio multiplied by user's scheduling interval and obtains maximum value
User is as scheduling user；
The scheduling execution module is used to carry out resource allocation to selected scheduling user, and is scheduled and awards to it
Power.
The scheduling decision module also needs to consider the online quantity of each user when choosing and dispatching user, i.e., by each user's
The factor that online number is chosen as scheduling user.
The scheduling decision module chooses scheduling userPrinciple it is as follows:
Wherein RjIt (t) is real time rate of the user j in t moment；For average throughput of the user j within the Δ t time；
τdelayFor user's scheduling time inter, if user is M-Ue, τdelay=1ms, if user is RN, when uplink scheduling, τdelayFor Un
Sub-frame of uplink interval, when descending scheduling, τdelayFor Un downlink subframe interval；Num is online user number, if user is M-Ue,
Num=1, if user is RN, Num is online R-Ue number.
The average throughputIt updates as follows:
Wherein TcFor time constant, time window size is indicated.
The beneficial effects of the present invention are: the present invention collects each user terminal channel quality indicator (CQI), radio bearer first
Portfolio and QoS parameter, and calculate according to the above- mentioned information being collected into the real time rate of each user；Then according to each use
Real time rate, average throughput and user's scheduling interval at family are scheduled the selection of user, choose user's real time rate and put down
Equal handling capacity ratio is multiplied by family scheduling interval and obtains the user of maximum value as scheduling user；Finally selected scheduling is used
Family carries out resource allocation, and authorization is scheduled to it, to realize the scheduling to user.The present invention has fully considered Un subframe
Scheduled bring Delay Variation influences, and the factor that user's scheduling time inter is chosen as scheduling user also considers simultaneously
The multiple R-Ue user's bring portfolio variations of RN dispatching have been arrived, have made the online number of user when being scheduled user and choosing
Trunk subscriber and other users are embodied while guaranteeing delivery of user traffic amount to dispatch the key factor of user
Between fairness, improve trunk subscriber performance, and the present invention is easily achieved in engineering.
Detailed description of the invention
Fig. 1 is the connection schematic diagram of relay node RN；
Fig. 2 is the LTE system network architecture diagram comprising RN；
Fig. 3 is the flow chart of relay scheduling of the present invention；
Fig. 4 is uplink scheduling flow chart；
Fig. 5 is descending scheduling flow chart.
Specific embodiment
A specific embodiment of the invention is described further with reference to the accompanying drawing.
A kind of embodiment of relay scheduling method of the invention
The present invention considers time delay influence after introducing relay station, and a kind of relaying tune is provided on the basis of existing PF algorithm
Degree method, as shown in figure 3, channel quality instruction of this method by acquisition uplink and downlink channel, and according to uplink and downlink channel quality
Indicate the real time rate of determining user；Quilt is determined according to the real time rate of user, average throughput and user's scheduling time inter
The user of scheduling；The scheduled user of selection carries out resource allocation, realizes the scheduling authorization to it.The specific implementation of this method
Journey is as follows:
1. information is collected
Information collection is divided into uplink scheduling and descending scheduling.For descending scheduling, terminal side passes through (Physical
Uplink Control Channel, PUCCH) Physical Uplink Control Channel reporting measurement (Common Reference
Signal, CRS) public reference signal obtain habit channel quality instruction (Channel Quality Indicator, CQI) letter
The instruction of road quality, base station reports the portfolio and (Quality of Service, QoS) Service Quality of each terminal radio bearer
Measure parameter.For uplink scheduling, terminal side by PUCCH by (Power Headroom Repot, PHR) power headroom reporting (PHR) and
(Buffer Status Repot, BSR) buffer status reporting is reported to base station, while base station passes through measurement Ue transmission
(Sounding Reference Symbol, SRS) sounding reference symbol obtains uplink CQI.
2. scheduling judgement
Assuming that indicating to calculate user j in the real-time speed of t moment according to the channel quality of upstream or downstream for m-th of RB
Rate is Rj(t), judgement is scheduled according to average throughput and portfolio, determines scheduling user,
Wherein RjIt (t) is real time rate of the user j in t moment；For average throughput of the user j within the Δ t time；
τdelayFor user's scheduling time inter, if user is M-Ue, τdelay=1ms, if user is RN, when uplink scheduling, τdelayFor Un
Sub-frame of uplink interval, when descending scheduling, τdelayFor Un downlink subframe interval.
Average throughputReal-time update is needed, renewal process is as follows:
Wherein TcFor time constant, time window size is indicated.
3. scheduling executes
ENodeB adjudicates obtaining according to step 2 as a result, the user that selection is scheduled, distributes resource, pass through PDCCH channel
It is scheduled authorization.Uplink scheduling process is as shown in figure 4, user sends upstream data, eNodeB after receiving the authorization of eNodeB
ACK/NACK response is sent according to whether demodulation successfully passes PDCCH.Descending scheduling process is as shown in figure 5, user receives down
ACK/NACK response is sent by PUCCH after row data.
In order to further increase trunk subscriber performance, guarantee the fairness between trunk subscriber and other users, the present invention
Also contemplating trunk subscriber, multiple R-Ue subscriber traffic variation brings influence online, will be online when being scheduled judgement
For number of users as a factor, specific judgement formula is as follows:
Wherein RjIt (t) is real time rate of the user j in t moment；For average throughput of the user j within the Δ t time；
τdelayFor user's scheduling time inter, Num is online user number, if user is M-Ue, Num=1, if user is RN, Num
For online R-Ue number.
Example 1
It is illustrated by taking the descending scheduling of a certain specific LTE system as an example below, LTE system DeNB cell Un subframe
Initial configuration mode is that the station 0, RN online user number Num is 3, bandwidth 20MHz.Specific scheduling process is as follows:
1) terminal side obtains downlink CQI by CRS, and is reported by PUCCH, while base station reports each terminal (to use
Family) radio bearer portfolio and qos parameter, and according to downlink CQI calculate current time RB corresponding speed Rj(t)。
2) it is scheduled according to the real time rate of each terminal, average throughput, user's scheduling time inter and online number
User's judgement.
Assuming that being calculated according to formula (3), R for m-th of RBj(t) it is counted in t moment according to downlink CQI for user j
The corresponding rate of m-th of RB of gained is calculated, if user j is M-Ue, τdelay=1ms, Num=1, if RN, then τdelay=
10ms, Num=3.
It is worth maximum user as scheduling user selected by current timeThe RB is distributed into userCan similarly it divide
RB with all bandwidth.
3) eNodeB is adjudicated obtaining as a result, the user that selection is scheduled according to step 2)Resource is distributed, PDCCH is passed through
Channel is scheduled authorization, userIt receives and ACK/NACK response is sent by PUCCH after downlink data.
Example 2
It is illustrated by taking the uplink scheduling of a certain specific LTE system as an example below, LTE system DeNB cell Un subframe
Initial configuration mode is that the station 0, RN online user number Num is 3, and bandwidth 20MHz, detailed process is as follows for the uplink scheduling:
1) PHR and BSR are reported to base station by PUCCH by terminal side, while base station is obtained by the SRS that measurement Ue is sent
Uplink CQI.
2) it is scheduled according to the real time rate of each terminal, average throughput, user's scheduling time inter and online number
User's judgement.
Assuming that being calculated according to formula (3), R for m-th of RBj(t) it is counted in t moment according to uplink CQI for user j
The corresponding rate of m-th of RB of gained is calculated, if user j is M-Ue, τdelay=1ms, Num=1, if RN, then τdelay=
10ms, Num=3.The RB is then distributed into the maximum user of calculated result valueThe RB of all bandwidth can similarly be distributed.
3) eNodeB adjudicates obtaining as a result, the user that selection is scheduled, distributes resource, pass through PDCCH according to step 2)
Channel is scheduled authorization.User sends upstream data after receiving the authorization of eNodeB, and whether eNodeB successfully leads to according to demodulation
It crosses PDCCH and sends ACK/NACK response.
Simultaneously the present invention also provides a kind of relay scheduling device, which includes information collection module, scheduling judgement mould
Block and scheduling execution module, information collection module are used to collect the business of each user terminal channel quality indicator (CQI), radio bearer
Amount and QoS parameter, and calculate according to the above- mentioned information being collected into the real time rate of each user；Scheduling decision module is used for
It is scheduled the selection of user according to the real time rate of each user, average throughput and user's scheduling interval, it is real-time to choose user
Rate and average throughput ratio are used as multiplied by the user that user's scheduling interval obtains maximum value dispatches user；Dispatch execution module
For carrying out resource allocation to selected scheduling user, and authorization is scheduled to it.The specific embodiment of each module is
Book is illustrated in the embodiment of method.
After the present invention has fully considered that LTE system introduces RN, since RN is only scheduled in Un subframe, and had under RN multiple
R-Ue user will cause under trunk subscriber performance if regarding RN and M-Ue as relations on an equal basis using original PF dispatching algorithm
Drop, causes inequitable problem instead, proposes a kind of relay scheduling method and device.It is scheduled that the present invention considers Un subframe
Bring Delay Variation influences and the multiple R-Ue user's bring portfolio variations of RN dispatching, when being scheduled user's selection
Using scheduling interval and the online number of user as the key factor of scheduling user, if user is M-Ue, online user is macro
User itself, Num=1, if RN (relay station), online user number is the online R-Ue number below RN.The present invention is existing
Fully consider that scheduling time inter and the centering of online user's number after the influence of scheduling performance, ensure that relaying on the basis of RF algorithm
Fairness between user and other users improves trunk subscriber performance, and is easily achieved in engineering.
Claims (10)
1. a kind of relay scheduling method, which is characterized in that the dispatching method the following steps are included:
1) portfolio and QoS parameter of each user terminal channel quality indicator (CQI), radio bearer are collected, and according to collection
To above- mentioned information calculate the real time rate of each user；
2) it is scheduled the selection of user according to the real time rate of each user, average throughput and user's scheduling interval, chooses and uses
Family real time rate and average throughput ratio are used as multiplied by the user that user's scheduling interval obtains maximum value dispatches user；
3) resource allocation is carried out to scheduling user selected by step 2), and is scheduled authorization to it.
2. relay scheduling method according to claim 1, which is characterized in that the step 2) is being scheduled user's selection
When, also need the online number for considering each user, i.e., the factor chosen the online number of each user as scheduling user.
3. relay scheduling method according to claim 2, which is characterized in that dispatch user in the step 2)Selection
Principle is as follows:
Wherein RjIt (t) is real time rate of the user j in t moment；For average throughput of the user j within the Δ t time；τdelay
For user's scheduling time inter, if user is M-Ue, τdelay=1ms, if user is RN, when uplink scheduling, τdelayFor Un uplink
Sub-frame interval, when descending scheduling, τdelayFor Un downlink subframe interval；Num is online user number, if user is M-Ue, Num=
1, if user is RN, Num is online R-Ue number.
4. relay scheduling method according to claim 3, which is characterized in that the average throughputUpdate it is as follows:
Wherein TcFor time constant, time window size is indicated.
5. relay scheduling method according to claim 3, which is characterized in that the information collection in step 1) is divided into uplink tune
Degree and descending scheduling, for descending scheduling, user obtains downlink by uplink control channel reporting measurement public reference signal and believes
Quality instruction in road reports the portfolio i.e. QoS parameter of each user's carrying of acquisition of information by base station；For uplink scheduling,
Power headroom reporting (PHR) and buffer status reporting are reported to base station by uplink control channel by user, pass through measurement Ue hair by base station
The sounding reference symbol sent obtains up channel instruction.
6. relay scheduling method according to claim 3, which is characterized in that when being scheduled authorization, for downlink tune
Degree, scheduled user need Xiang Qifa answer signal after the downlink data for receiving base station transmission, for uplink scheduling, are adjusted
The user of degree needs Xiang Qifa answer signal after the downlink data for receiving base station transmission.
7. a kind of relay scheduling device, which is characterized in that the dispatching device includes information collection module, scheduling decision module and tune
Execution module is spent,
The information collection module is used to collect the portfolio kimonos of each user terminal channel quality indicator (CQI), radio bearer
It is engaged in mass parameter, and calculates according to the above- mentioned information being collected into the real time rate of each user；
The scheduling decision module according to the real time rate of each user, average throughput and user's scheduling interval for adjusting
The selection of user is spent, user's real time rate and average throughput ratio is chosen multiplied by user's scheduling interval and obtains the user of maximum value
As scheduling user；
The scheduling execution module is used to carry out resource allocation to selected scheduling user, and authorization is scheduled to it.
8. relay scheduling device according to claim 7, which is characterized in that the scheduling decision module is choosing scheduling use
Also need to consider the online quantity of each user, i.e., the factor chosen the online number of each user as scheduling user when family.
9. relay scheduling device according to claim 8, which is characterized in that the scheduling decision module chooses scheduling userPrinciple it is as follows:
Wherein RjIt (t) is real time rate of the user j in t moment；For average throughput of the user j within the Δ t time；τdelay
For user's scheduling time inter, if user is M-Ue, τdelay=1ms, if user is RN, when uplink scheduling, τdelayFor Un uplink
Sub-frame interval, when descending scheduling, τdelayFor Un downlink subframe interval；Num is online user number, if user is M-Ue, Num=
1, if user is RN, Num is online R-Ue number.
10. relay scheduling device according to claim 9, which is characterized in that the average throughputUpdate such as
Under:
Wherein TcFor time constant, time window size is indicated.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610676735.5A CN106170154B (en) | 2016-08-16 | 2016-08-16 | A kind of relay scheduling method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610676735.5A CN106170154B (en) | 2016-08-16 | 2016-08-16 | A kind of relay scheduling method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106170154A CN106170154A (en) | 2016-11-30 |
| CN106170154B true CN106170154B (en) | 2019-05-10 |
Family
ID=58065321
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610676735.5A Expired - Fee Related CN106170154B (en) | 2016-08-16 | 2016-08-16 | A kind of relay scheduling method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106170154B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110035449B (en) * | 2018-01-12 | 2021-06-22 | 华为技术有限公司 | Method and device for sending data volume report |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101651518A (en) * | 2009-05-22 | 2010-02-17 | 中山大学 | Method for fast packet scheduling of HSDPA system |
| CN102291842A (en) * | 2011-09-16 | 2011-12-21 | 湘潭大学 | Virtual MIMO pairing method taking user QoS into account |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8687576B2 (en) * | 2010-09-03 | 2014-04-01 | Telefonaktiebolaget Lm Ericsson (Publ) | Dynamic bandwidth allocation control in a multi-access radio communication system |
-
2016
- 2016-08-16 CN CN201610676735.5A patent/CN106170154B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101651518A (en) * | 2009-05-22 | 2010-02-17 | 中山大学 | Method for fast packet scheduling of HSDPA system |
| CN102291842A (en) * | 2011-09-16 | 2011-12-21 | 湘潭大学 | Virtual MIMO pairing method taking user QoS into account |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106170154A (en) | 2016-11-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1973497B (en) | Packet transmission control device and packet transmission control method | |
| CN101878622B (en) | Wireless telecommunication system including a base station, relay node and method for global fair scheduling | |
| Capozzi et al. | Downlink packet scheduling in LTE cellular networks: Key design issues and a survey | |
| CN101553007B (en) | Virtually centralized uplink scheduling | |
| Pokhariyal et al. | Performance of downlink frequency domain packet scheduling for the UTRAN long term evolution | |
| CN1853385B (en) | Method for scheduling uplink transmissions from user equipments by a base station determining a measure of a quality of service, and corresponding base station, user equipment and communication system | |
| CN102098746B (en) | Multi-cell resource allocation method introducing mobile resource reserve mechanism | |
| CN104837205B (en) | A kind of bus or train route communication downlink radio resource allocation algorithm | |
| CN101087160B (en) | A dispatching method and device for uplink enhanced priority | |
| CN102027794A (en) | Base station device and communication control method | |
| CN102340824B (en) | Multi-carrier high-speed data business scheduling method and device | |
| CN102067701A (en) | Base station device and method in mobile communication system | |
| CN102083221A (en) | Resource scheduling method and device based on HSDPA (high speed downlink packet access) | |
| CN102612093A (en) | Carrier-aggregation-based method for scheduling upstream cross-layer resources in LTE-Advanced system | |
| TW201126981A (en) | User equipment, base station, communication control method, and radio communication system | |
| CN102884856A (en) | Method and network entity for resource allocation in mobile radio communication networks | |
| CN103687025B (en) | Resource allocation method used for LTE system | |
| CN103442446B (en) | Dynamic and semi-static combined scheduling method in a kind of LTE system | |
| US20090017836A1 (en) | Capacity Scheduling Method and System | |
| CN102098792A (en) | Service quality-based resource round-robin scheduling method | |
| CN103906258B (en) | Double-bounce balance distributed scheduling method based on relay cache in relay enhanced cellular system | |
| CN104602355B (en) | mixed service dispatching method in LTE system | |
| WO2012147499A1 (en) | Base station in mobile communication system and resource allocation method | |
| CN105120482A (en) | Delay first scheduling method based on resource utilization ratio | |
| CN104066197A (en) | Real-time low-packet-loss service scheduling method in TD-LTE |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20190510 Termination date: 20200816 |