CN106954274A - LTE equity dispatching methods based on rear evaluation mechanism - Google Patents
LTE equity dispatching methods based on rear evaluation mechanism Download PDFInfo
- Publication number
- CN106954274A CN106954274A CN201710074979.0A CN201710074979A CN106954274A CN 106954274 A CN106954274 A CN 106954274A CN 201710074979 A CN201710074979 A CN 201710074979A CN 106954274 A CN106954274 A CN 106954274A
- Authority
- CN
- China
- Prior art keywords
- user
- lte
- priority
- evaluation mechanism
- calculate
- 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
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L5/00—Arrangements affording multiple use of the transmission path
- H04L5/003—Arrangements for allocating sub-channels of the transmission path
- H04L5/0058—Allocation criteria
- H04L5/0071—Allocation based on fairness other than the proportional kind
-
- 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/50—Allocation or scheduling criteria for wireless resources
- H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
- H04W72/566—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient
Landscapes
- Engineering & Computer Science (AREA)
- Signal Processing (AREA)
- Computer Networks & Wireless Communication (AREA)
- Quality & Reliability (AREA)
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a kind of LTE equity dispatching methods based on rear evaluation mechanism, comprise the following steps：Handling capacity is adjusted, and priority initialization, scene is assessed, and is suffered from hunger to track and dispatch and is implemented.The present invention after setting by assessing threshold value, each user in cell can be automatically tracked in speed not in the same time to change, and the scheduling times of each user are counted in real time, real-time mark is carried out to the user in " suffering from hunger " state, by way of user is suffered from hunger in preemptive schedule, the service quality that lifting business is carried out as much as possible, ensures client perception.
Description
Technical field
The present invention relates to a kind of dispatching method of LTE system, especially a kind of LTE equity dispatchings based on rear evaluation mechanism
Method.
Background technology
LTE is improved using a variety of key technologies such as OFDM, SC-FDMA and MIMO and is enhanced 3G air interface technologies,
Higher transmission rate, lower time delay and more preferable QoS (Quality of Service, service quality) are provided the user,
And it is how preferably to use dispatching algorithm to lift handling capacity more topmost.It is current according to its for different users
Channel indicate, many factors such as service quality and dispatch state carry out RB (Resource Block, Resource Block) distribution, with to the greatest extent
It can guarantee that the resource distributed every time is not wasted, lifting user perceives.Constrained by frequency spectrum resource finiteness, LTE resource
Dispatching algorithm seems most important, and it determines the order and available transmission rate of packet transmission.
And current dispatching method, such as RR (Round Robin, polling dispatching), (Proportion Fair, ratio is public by PF
It is flat) and SJF (Short Job First, shortest job first) etc. merely emphasize throughput of system or fairness, do not have
How consideration realizes equilibrium therebetween.In addition, almost existing all dispatching methods are all to optimize certain moment in isolation
Scheduling, interacting between successively being dispatched without the same user of consideration, so that the jumping characteristic of user can be caused to perceive, lacks
Ride comfort.
The content of the invention
The goal of the invention of the present invention is the scheduling in order to overcome dispatching method of the prior art to optimize certain moment in isolation,
That causes that the jumping characteristic of user perceives is not enough there is provided a kind of smooth, can either ensure that throughput of system can take into account use again
The LTE equity dispatching methods based on rear evaluation mechanism of family fairness.
To achieve these goals, the present invention uses following technical scheme：
A kind of LTE equity dispatching methods based on rear evaluation mechanism, it is characterized in that, including N number of user u1, u2..., uN；Bag
Include following steps：
(1-1) handling capacity is adjusted；
(1-2) priority is initialized；
(1-3) scene is assessed；
(1-4) suffers from hunger tracking；
(1-5) scheduling is implemented.
The present invention is for the current N number of user { u for participating in scheduling1, u2..., uN, dynamically calculate and adjust its priority,
Different scheduling strategies are adaptive selected according to the variable quantity and scheduling times of handling capacity.
The present invention is a kind of smooth, can either ensure that throughput of system can take into account being commented based on after for user fairness again
Estimate LTE equity dispatching methods PFLSA (the Post-evaluation based and Fairness guaranteed of mechanism
LTE Scheduling Algorithm), by assessing threshold value after setting, dynamic adjusts the tune of user under the conditions of different channels
Spend priority.Real-time tracking is carried out to the user in " suffering from hunger " state simultaneously, to prevent that it from suffering by way of forcing scheduling
Starve, and then take into account throughput of system and fairness simultaneously.
The LTE equity dispatching methods based on rear evaluation mechanism of the present invention, can automatically track each user in cell and exist
Speed change in the same time, is not set dynamically and assesses threshold, and the scheduling times of each user are counted in real time, by robbing
The mode for first dispatching the user that suffers from hunger lifts the service quality of business development to ensure client perception as much as possible.
Preferably, step (1-1) is comprised the following specific steps that：
(2-1) sets each user uiThe bit error rate beUtilize formula
Calculate each user ui'sWherein, ui∈{u1, u2..., uN,Represent and the bit error rateIn related
Between variable；
(2-2) sets each user uiSignal to noise ratio beUtilize formulaMeter
Calculate each user uiUser throughput under unit bandwidth
(2-3) sets each user uiUse band it is a width ofUtilize formulaCalculate each user
uiHandling capacity
Preferably, the step (1-2) includes following detailed step：
(3-1) utilizes formulaComputational mathematics desired value
(3-2) utilizes formulaCalculate each user uiIn the initial schedule priority of t
Preferably, step (1-3) includes following detailed step：
Set each user uiIn the handling capacity at t-1 momentDynamic evaluation threshold value is set as d and β；
Meeting Casel conditionsWhen, to each user uiCalculate the dispatching priority after updating
Level
Meeting Case2 conditionsWhen, to each user uiCalculate the scheduling after updating
Priority
Meeting Case3 conditionsWhen, weighted factor γ is set, to each user uiCalculate more
Dispatching priority after new
Preferably, step (1-4) includes following detailed step：
(5-1) sets each user uiLock-on counter be δi, threshold value of suffering from hunger is set as ε, and ε ＞ 1 are passed for each
The user of scheduling is had neither part nor lot in defeated time interval TTI, makes lock-on counter δiIncrease by 1；
(5-2) is collected and is met condition δj>=ε user { uj, uj+1..., uj+k, update its priorityZ ∈ (j, j+k), wherein, max () represents max function.
Preferably, step (1-5) comprises the following steps：
In t, according toDispatching priority by each user { u1, u2..., uNFeeding LTE schedulers adjusted
Degree.
Preferably, the parameter δiReset when scheduler starts.
Preferably, γ ＞ 0.5, α ＜ β.
The present invention has the advantages that：Take into account throughput of system with scheduling fairness, can dynamically according to
Family handling capacity situation of change assesses dispatching priority, and carries out real-time tracking to the user in " suffering from hunger " state, by forcing
The mode of scheduling prevents that it from suffering from hunger, and is conducive to the service quality that lifting business is carried out to ensure client perception.
Fig. 1 is a kind of flow chart of the present invention；
Fig. 2 is the present invention and RR, PF and SJF a kind of throughput of system comparison diagram；
Fig. 3 is the present invention and RR, PF and SJF a kind of packet loss comparison diagram；
Fig. 4 is the present invention and RR, PF and SJF a kind of scheduling fairness comparison diagram.
Embodiment
The present invention will be further described with reference to the accompanying drawings and detailed description.
Embodiment as shown in Figure 1 is a kind of LTE equity dispatching methods based on rear evaluation mechanism, is comprised the following steps：
Handling capacity is adjusted, and priority initialization, scene is assessed, and is suffered from hunger to track and dispatch and is implemented.
Step 1：Handling capacity is adjusted；
Step 1-1：Set each user uiThe bit error rate beUtilize formula
Calculate each user ui'sWherein, ui∈{u1, u2..., uN,Represent and the bit error rateIn related
Between variable；
Step 1-2：Set each user uiSignal to noise ratio beUtilize formulaCalculate
Each user uiUser throughput under unit bandwidth
Step 1-3：Set each user uiUse band it is a width ofUtilize formulaCalculate each user
uiHandling capacity
Step 2：Priority is initialized；
Step 2-1：Utilize formulaComputational mathematics desired value
Step 2-2：Utilize formulaCalculate each user uiIn the initial schedule priority of t
Step 3：Scene is assessed；
Set each user uiIn the handling capacity at t-1 momentDynamic evaluation threshold value is set as α and β, α ＜ β；
Meeting Case1 conditionsWhen, to each user uiCalculate the dispatching priority after updating
Level
Meeting Case2 conditionsWhen, to each user uiCalculate the scheduling after updating
Priority
Meeting Case3 conditionsWhen, weighted factor γ is set, to each user uiCalculate more
Dispatching priority after new Wherein, γ ＞ 0.5；
Step 4：Suffer from hunger tracking；
Step 4-1：Set each user uiLock-on counter be δi, threshold value of suffering from hunger is set as ε, ε ＞ 1, for each
The user of scheduling is had neither part nor lot in Transmission Time Interval TTI, makes lock-on counter δiIncrease by 1；Parameter δiIt is clear when scheduler starts
Zero；
Step 4-2：Collection meets condition δj>=ε user { uj, uj+1..., uj+k, update its priorityZ ∈ (j, j+k), wherein, max () represents max function；
Step 5：Scheduling is implemented：
In t, according toDispatching priority by each user { u1, u2..., uNFeeding LTE schedulers adjusted
Degree.
The present invention is specifically described by taking N=5 as an example below, representative basis data are as shown in table 1~2.
The LTE equity dispatching methods based on rear evaluation mechanism of this example description, including handling capacity are adjusted, and priority is initial
Change, scene is assessed, the step such as tracking and scheduling implementation of suffering from hunger.
Step 1：Handling capacity is adjusted；
Step 1-1：Calculate
Step 1-2：Calculate
Step 1-3：Calculate handling capacity
Step 2：Priority is initialized；
Step 2-1：Computational mathematics desired value
Step 2-2：Calculate each user ui∈{u1, u2..., uNIn the initial schedule priority of t
Step 3：Scene is assessed；
User { u2, u4, u5Case1 is met, calculate the dispatching priority after updating
User { u3Case2 is met, calculate the dispatching priority after updating
{u1User meets Case3, calculates the dispatching priority after updating
Step 4：Suffer from hunger tracking；
Satisfaction is suffered from hunger condition δj>=ε user is { u5, update its priority z∈
(j, j+k)={ 0.37 }；
Step 5：Scheduling is implemented：Final priority after t, renewal
It is scheduled by this priority feeding LTE schedulers, dispatching sequence is followed successively by { u1, u5, u3, u2, u4}。
The methods such as PFLSA methods and RR, PF and SJF by the present invention have carried out simulation comparison, and scheduling number of users is from 10
It is stepped up to 30, the LTE system handling capacity of gained, the packet loss and method fairness occurred in scheduling process is joined respectively
As shown in accompanying drawing 2~4.
What Fig. 2 was represented is：Because the basis that the PFLSA methods of the present invention calculate dispatching priority is user throughput, because
This emulation handling capacity PFLSA is higher than RR and PF, and with the increase for participating in dispatching number of users, throughput of system also increases therewith
Plus.SJF adheres to SJF, on the premise of certain user, and its handling capacity exceeds PFLSA, but with working length and use
The increase of amount amount, its handling capacity starts reduction
What Fig. 3 was represented is：The present invention PFLSA methods packet loss then with it is neck and neck in PF, and due to SJF all the time with
Shortest job first does not consider user's state in which environment as dispatching criterion, therefore its packet loss is always positioned at a high position, RR
Each user is taken into account in line with fair principle, packet loss is minimum.With the increase of number of users, packet loss is in increase.
What Fig. 4 was represented is：The PFLSA methods of the present invention have taken into account poor throughput while high throughput users are considered
The fairness of user, therefore, its fairness are placed in the middle.RR fairness is highest in all methods, and this is determined by its criterion
, and SJF according to do not consider fairness, its fairness is minimum.But PF and SJF are same as, with the increase of scheduling user, institute
The fairness for having algorithm is gradually reduced.
Wherein, the table 1~2 referred in embodiment is as follows respectively：
Table 1
| Sequence number | Project | Data |
| 1 | TTI(ms) | 1 |
| 2 | System bandwidth (MHz) | 20 |
| 3 | RB sums (individual) | 80 |
| 4 | Each RB resource occupation bandwidth BsRB(kHz) | 180 |
| 5 | Assess threshold value α | 0.3 |
| 6 | Assess threshold value | 0.5 |
| 7 | Weighted factor γ | 0.7 |
| 8 | Threshold value of suffering from hunger ε | 5 |
Table 2
It should be understood that the present embodiment is only illustrative of the invention and is not intended to limit the scope of the invention.In addition, it is to be understood that
Read after the content of the invention lectured, those skilled in the art can make various changes or modifications to the present invention, these etc.
Valency form equally falls within the application appended claims limited range.
Claims (8)
1. a kind of LTE equity dispatching methods based on rear evaluation mechanism, it is characterized in that, including N number of user u1, u2..., uN；Including
Following steps：
(1-1) handling capacity is adjusted；
(1-2) priority is initialized；
(1-3) scene is assessed；
(1-4) suffers from hunger tracking；
(1-5) scheduling is implemented.
2. the LTE equity dispatching methods according to claim 1 based on rear evaluation mechanism, it is characterized in that, step (1-1) bag
Include following specific steps：
(2-1) sets each user uiThe bit error rate beUtilize formula Calculate
Each user ui'sWherein, ui∈{u1, u2..., uN,Represent and the bit error rateRelated middle anaplasia
Amount；
(2-2) sets each user uiSignal to noise ratio beUtilize formulaCalculate every
Individual user uiUser throughput under unit bandwidth
(2-3) sets each user uiUse band it is a width ofUtilize formulaCalculate each user ui's
Handling capacity
3. the LTE equity dispatching methods according to claim 1 based on rear evaluation mechanism, it is characterized in that, the step (1-
2) following detailed step is included：
(3-1) utilizes formulaComputational mathematics desired value
(3-2) utilizes formulaCalculate each user uiIn the initial schedule priority of t
4. the LTE equity dispatching methods according to claim 1 based on rear evaluation mechanism, it is characterized in that, step (1-3) bag
Include following detailed step：
Set each user uiIn the handling capacity at t-1 momentDynamic evaluation threshold value is set as α and β；
Meeting Casel conditionsWhen, to each user uiCalculate the dispatching priority after updating
Meeting Case2 conditionsWhen, to each user uiCalculate the dispatching priority after updating
Level
Meeting Case3 conditionsWhen, weighted factor γ is set, to each user uiCalculate after updating
Dispatching priority
5. the LTE equity dispatching methods according to claim 1 based on rear evaluation mechanism, it is characterized in that, step (1-4) bag
Include following detailed step：
(5-1) sets each user uiLock-on counter be δi, threshold value of suffering from hunger is set as ε, ε ＞ 1, during for each transmission
Between have neither part nor lot in the user of scheduling in the TTI of interval, make lock-on counter δjIncrease by 1；
(5-2) is collected and is met condition δj>=ε user { uj, uj+1..., uj+k, update its priorityZ ∈ (j, j+k), wherein, max () represents max function.
6. the LTE equity dispatching methods according to claim 1 based on rear evaluation mechanism, it is characterized in that, step (1-5) bag
Include following steps：
In t, according toDispatching priority by each user { u1, u2..., uNFeeding LTE schedulers be scheduled.
7. the LTE equity dispatching methods according to claim 5 based on rear evaluation mechanism, it is characterized in that, the parameter δi
Scheduler is reset when starting.
8. the LTE equity dispatching methods according to claim 4 based on rear evaluation mechanism, it is characterized in that, γ ＞ 0.5, α ＜
β。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710074979.0A CN106954274B (en) | 2017-02-10 | 2017-02-10 | LTE equity dispatching method based on rear evaluation mechanism |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710074979.0A CN106954274B (en) | 2017-02-10 | 2017-02-10 | LTE equity dispatching method based on rear evaluation mechanism |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106954274A true CN106954274A (en) | 2017-07-14 |
| CN106954274B CN106954274B (en) | 2019-07-16 |
Family
ID=59465783
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710074979.0A Active CN106954274B (en) | 2017-02-10 | 2017-02-10 | LTE equity dispatching method based on rear evaluation mechanism |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106954274B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020181436A1 (en) * | 2001-04-02 | 2002-12-05 | Jens Mueckenheim | Method and system for UMTS packet transmission scheduling on uplink channels |
| CN103929822A (en) * | 2014-05-13 | 2014-07-16 | 武汉邮电科学研究院 | LTE proportional fair scheduling method |
| CN105873226A (en) * | 2016-03-28 | 2016-08-17 | 华信咨询设计研究院有限公司 | LTE (Long Term Evolution) fair scheduling method with priority of throughput |
| CN105873128A (en) * | 2016-05-31 | 2016-08-17 | 杭州电子科技大学 | LTE fairness scheduling method based on time delay sensitivity |
| CN106060952A (en) * | 2016-06-07 | 2016-10-26 | 华信咨询设计研究院有限公司 | LTE (Long Term Evolution) scheduling method based on load adaptation |
-
2017
- 2017-02-10 CN CN201710074979.0A patent/CN106954274B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020181436A1 (en) * | 2001-04-02 | 2002-12-05 | Jens Mueckenheim | Method and system for UMTS packet transmission scheduling on uplink channels |
| CN103929822A (en) * | 2014-05-13 | 2014-07-16 | 武汉邮电科学研究院 | LTE proportional fair scheduling method |
| CN105873226A (en) * | 2016-03-28 | 2016-08-17 | 华信咨询设计研究院有限公司 | LTE (Long Term Evolution) fair scheduling method with priority of throughput |
| CN105873128A (en) * | 2016-05-31 | 2016-08-17 | 杭州电子科技大学 | LTE fairness scheduling method based on time delay sensitivity |
| CN106060952A (en) * | 2016-06-07 | 2016-10-26 | 华信咨询设计研究院有限公司 | LTE (Long Term Evolution) scheduling method based on load adaptation |
Non-Patent Citations (1)
| Title |
|---|
| 肖清华: "吞吐量优先的LTE公平性调度算法", 《邮电设计技术》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106954274B (en) | 2019-07-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102869106B (en) | PDCCH self-adapting regulation methods and device | |
| Zhou et al. | Low complexity cross-layer design with packet dependent scheduling for heterogeneous traffic in multiuser OFDM systems | |
| CN106954232B (en) | Time delay optimized resource allocation method | |
| CN103260258A (en) | Resource distribution and resource reuse combination method in cellular terminal device-to-device (D2D) system | |
| CN103096485B (en) | A kind of method of multi-user's multiple-input, multiple-output frequency selection scheduling in LTE system | |
| CN102137496A (en) | Method and device for joint dispatching of PUSCH (physical uplink shared channel) resources and PHICH (physical hybrid automatic repeat request indicator channel) resources | |
| CN101686196A (en) | Service scheduling method and service scheduling device | |
| CN103596285A (en) | Wireless resource scheduling method, wireless resource scheduler and system thereof | |
| CN103826312A (en) | Improved LTE (Long Term Evolution) scheduling method based on exponential rule | |
| CN101212782A (en) | High-speed uplink packet access scheduling method and system | |
| CN109561504A (en) | A kind of resource multiplexing method of URLLC and eMBB based on deeply study | |
| CN107872892A (en) | A kind of wireless resource allocation methods and device | |
| CN109195176A (en) | The self-adapting dispatching method and system of multi-service fusion in a kind of Home eNodeB | |
| CN100512055C (en) | Mixed service resource distributing method for OFDM system | |
| CN105120482B (en) | A kind of time delay priority scheduling method based on resource utilization | |
| CN107846266A (en) | Running time-frequency resource dispatching space division method and apparatus | |
| CN103442446A (en) | Dynamic and semi-static combined dispatching method in LTE system | |
| CN104955154A (en) | LTE (long term evolution) uplink proportion fair resource scheduling method based on user business volume satisfaction degree | |
| CN103929822A (en) | LTE proportional fair scheduling method | |
| CN102724763A (en) | Time domain group scheduling method on basis of two-dimensional priority level | |
| CN103533628B (en) | A kind of downlink power distributing method | |
| CN100440871C (en) | Packet scheduling method and device for wireless communication system | |
| CN104066197B (en) | A kind of real time scheduling of traffic method of low packet loss ratio in TD LTE | |
| CN107105505B (en) | Multi-service dynamic dispatching method based on QCI | |
| CN105873226B (en) | The preferential LTE equity dispatching method of handling capacity |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |