CN1184835C - Down data scheduling method for wireless grouping data transmission system - Google Patents
Down data scheduling method for wireless grouping data transmission system Download PDFInfo
- Publication number
- CN1184835C CN1184835C CN 02110592 CN02110592A CN1184835C CN 1184835 C CN1184835 C CN 1184835C CN 02110592 CN02110592 CN 02110592 CN 02110592 A CN02110592 A CN 02110592A CN 1184835 C CN1184835 C CN 1184835C
- Authority
- CN
- China
- Prior art keywords
- user
- business demand
- priority valve
- base station
- service quality
- 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
Images
Abstract
The present invention relates to a down data dispatching method for a wireless grouping data transmission system. The present invention is characterized in that the down data dispatching method for a wireless grouping data transmission system comprises the following steps: a, M users in a subzone is divided into K sets by a dispatcher in a base station according to the sequence of the weighted values of the business need QoS; b, the base station circularly serves the users in the subzone according to a certain principle. First, the base station serves the users in the set with highest business need QoS and carries out data transmission to the users in the set according to the largest C/I principle. After the data transmission of all the users in the set is finished, the base station serves the users in the set with higher business need QoS until the data transmission of the users in the set with the lowest business need QoS is finished. Then the base station circularly serves the users in the subzone according to the principle. The present invention determines the prior weighted value of the business need QoS according to the comprehensive priority requirements of service data rate, transmission time delay, bit error rate, etc. of the users. Then the present invention carries out dispatching according to the business need QoS, transmits the business data of the users, and improves the business transmission efficiency.
Description
Technical field
The present invention relates to the downlink data dispatching method of wireless packet data transmission system.
Background technology
In the wireless packet data transmission system, Physical Downlink Shared Channel is used to transmit grouped data, and each user in the sub-district divides with time-division, sign indicating number or the two mode that combines is shared the Physical Downlink Shared Channel resource.Need the user in the sub-district be dispatched, reasonably arrange each user's transmission time and assigned code resource.
Existing method has two kinds, and a kind of is maximum C/I (carrier/interface ratio), and another kind is RR (RoundRobin).In the dispatching method of maximum C/I, user's priority sorts by the C/I value that the user receives Common Pilot Channel, and C/I is just higher than high User Priority.Scheduler can require to transfer data to continuously the UE with the highest C/I value and finish up to all transfer of data of this UE, dispatches another travelling carriage of time high C/I value then again, or the data of retransfer scheduling higher priority.In the dispatching method of RR, all non-NULL source formations must be served before retransmitting the user, unless thereby next frame user's service that can not continue as present frame have only the source formation of a non-NULL.As can be seen, maximum C/I method has been sacrificed fair (or sharing) (fairness), but has reached maximum system capacity, because wireless data frame that might be all uses all for a good user of channel condition.And the RR method has been sacrificed power system capacity, but can fair shared resource (frame).But these two kinds of methods are not dispatched according to the business demand QoS (service quality) of user (UE), might cause and can't transmit data to the high user of business demand QoS priority on time.
Summary of the invention
The objective of the invention is in order to overcome the shortcoming of existing wireless packet data transmission, and a kind of new downlink data dispatching method that is applicable to the wireless packet data transmission system that provides, this method can be according to user's QoS of survice require the rational management user, make the high user priority transmission data of QoS of survice priority, therefore can ensure the user priority transmission data that the QoS of survice priority is high.
In order to realize purpose of the present invention, the technical measures that the present invention adopts are: the downlink data dispatching method of wireless packet data transmission system, be characterized in, and may further comprise the steps:
Scheduler in a, the base station is divided into K set with the user of the M in the sub-district in proper order according to the height of its business demand QoS weights;
B, base station are according to the user of each set in certain dispatching principle Cyclic Service sub-district, and this principle is the user in the set that at first service business demand QoS is the highest, and the user in this set is carried out transfer of data according to the principle of max carrier to interference C/I; By the time all users in this set are transmitted after data finish, again to the service of the user in QoS the high set of business demand, up to the user's end of transmission in the minimum set of business demand QoS; And then according to this principle Cyclic Service community user.
The downlink data dispatching method of above-mentioned wireless packet data transmission system, wherein, the priority valve of the business demand QoS of described user UE is determined according to the comprehensive priority request of data rate, propagation delay time and the bit error rate parameter of UE business; The used weights of the size of comprehensive priority valve and each parameter are relevant, and the weights that each parameter adopts then are provided with by scheduler balance different business demand.
The downlink data dispatching method of above-mentioned wireless packet data transmission system, wherein, in the described b step, in any once scheduling circulation, if do not have customer requirements to carry out transfer of data in the set of a certain business demand QoS priority valve, then base station dispatcher directly goes to the lower set of next business demand QoS priority valve according to the order of sequence, the user in should being gathered by base station services.
The downlink data dispatching method of above-mentioned wireless packet data transmission system, it is characterized in that, in the described b step, if the base station is when belonging to user in the set low in the service business demand QoS priority valve ordering and serve, be higher than customer requirements Data transmission in the low set of ordering as the service business demand QoS priority valve that belongs to another set and this service business demand QoS priority valve by the ordering of business demand QoS priority valve, then interrupt user's data transmission in the low set of business demand QoS priority valve the base station, scheduler goes to and has served the user who requires service in the high set of business demand QoS priority valve, press the height order of current business demand QoS priority valve again, by the user in the high set of base station elder generation service business demand QoS priority valve, and then the user in the low set of service business demand QoS priority valve, until the user data transmission in the minimum set of business demand QoS priority valve is finished, finish the once service of scheduling circulation; User in the Cyclic Service sub-district is dispatched according to this principle again in the base station next time.
5, the downlink data dispatching method of wireless packet data transmission system according to claim 1, it is characterized in that, in the described b step, in any once scheduling circulation, during user in the current set of base station services, its service business demand of user QoS priority valve in another set is higher than customer requirements Data transmission in the current set by business demand QoS priority valve ordering, the user in the current set of service is continued in the base station, to the user's end of transmission in the minimum set of business demand QoS priority valve, base station dispatcher is circulation scheduling next time again again in this scheduling circulation.
Because the present invention has adopted above technical scheme, require to determine the priority valve of the business demand QoS of this UE according to the comprehensive priority of user's traffic data rate, propagation delay time and bit error rate etc., dispatch according to the business demand QoS priority valve of UE then.
Description of drawings
Concrete outcome of the present invention is further specified by following embodiment and accompanying drawing thereof.
Fig. 1 is the priority valve schematic diagram of business demand QoS of the present invention.
Fig. 2 is the schematic diagram that the present invention is divided into the user according to the priority valve of customer service demand QoS K set.
Fig. 3 is the priority valve schematic diagram of customer service demand QoS in one embodiment of the present of invention.
Embodiment
See also accompanying drawing.
Method of the present invention can ensure the user priority transmission data that business demand QoS priority valve is high, and this is by realizing business demand QoS priority valve ordering acquisition priority.
As shown in Figure 1, business demand QoS can be reflected as the comprehensive priority requirement of each parameter such as data rate, propagation delay time and bit error rate of QoS of survice requirement.Represent with functional expression:
P
QoS＝F(rate，delay，...，ber
P
QoSBe the priority valve of the normalized business demand QoS of UE, these weights are functions of each parameter such as data rate, propagation delay time and bit error rate of QoS of survice requirement.
Ask for an interview Fig. 2.Scheduler in the base station is divided into K set with the user of the M in the sub-district in proper order according to the height of its business demand QoS priority valve, as in k the set N being arranged
kIndividual user then satisfies formula
The base station is according to the user in certain this sub-district of principle Cyclic Service.At first be the user in the highest set of service business demand QoS priority valve, the user in this set is carried out transfer of data according to the principle of maximum C/I.By the time all users in this set are transmitted after data finish, again to the user's service in time high set of business demand QoS priority valve, up to the user's end of transmission in the minimum set of business demand QoS priority valve.And then according to this principle Cyclic Service community user.
When the Cyclic Service sub-district:
If do not have customer requirements to carry out transfer of data in the set of a certain business demand QoS priority valve, then put down in writing scheduler and directly go to the lower set of next business demand QoS priority valve according to the order of sequence, the user in should gathering by base station services.
If during the user in the lower set of service business demand QoS priority valve, the higher customer requirements Data transmission of business demand QoS priority valve is arranged, at this moment two kinds of processing methods is arranged.First kind is the user's data transmission of interrupting in the low set of business demand QoS priority valve, then to the higher set of business demand QoS priority valve, served the user who requires service, and then the height order of pressing current business demand QoS priority valve, user in the high set of elder generation's service business demand QoS priority valve, and then the user in the low set of service business demand QoS priority valve, until the user data transmission in the minimum set of business demand QoS priority valve is finished.And then according to this principle Cyclic Service community user.That is to say that the user that the priority valve of business demand QoS is high has absolute dispatching priority.Second method is the user who continues in the current set of service, this method is: during as if the user in the lower set of service business demand QoS priority valve, the higher customer requirements Data transmission of business demand QoS priority valve is arranged, can continue to serve the user in the current set, up to the user's end of transmission in the minimum set of business demand QoS priority valve, circulate again again.
For example, professional 1 pair of error rate requires very high, but general to delay requirement, and professional 2 pairs of error rates require lower, but very high to delay requirement, the time delay that is allowed is very low.If the dispatching method that system adopted is thought preferential professional 1 the carrying out that guarantee, the weights of the error rate can be provided with higher, be provided with the weights of time delay correspondence lower, like this, the influence of the outstanding error rate is bigger, the priority valve (just according to the isoparametric comprehensive priority request of data rate, propagation delay time and the bit error rate of business) of feasible professional 1 business demand QoS is higher, and the priority valve of professional 2 business demand QoS is lower.So just can embody the difference of the priority valve of two kinds of business.
Further specify feature of the present invention for an embodiment below.Fig. 3 is the priority valve schematic diagram of the present invention according to customer service demand service quality.A certain user's QoS of survice demand comprises Rate (digit rate), Delay (time delay) and BER (bit error rate), shown in function formula: P
Qos=F (rate, delay ..., ber.Wherein each subservice QoS demand has its desired value and corresponding weights separately, weights as
Wi,
WjWith
Wh(i, j, h are used to distinguish the desired weights of different subservice QoS).Before user's data reached base station dispatcher, the priority valve of user's QoS of survice demand can be expressed as subservice QoS demand weighted sum and normalization, as:
P
QoS＝P
Rale×w
i+P
Delay×w
j+P
BER×w
h
After user data arrived scheduler in the base station, base station dispatcher was divided into K set with the user of the M in the sub-district in proper order according to the height of its business demand QoS priority valve, and k (1≤k≤K) has N in gathering
kIndividual user satisfies
Supposing has
N1The priority valve of set is minimum, N
kThe priority valve of set is the highest.Then, the base station is according to the user in certain principle Cyclic Service sub-district.At first be the user in the highest set of service business demand QoS priority valve, i.e. N
kSet is carried out transfer of data to the user in this set according to the principle of maximum C/I.That is to say that in this set, the first user of scheduling C/I maximum dispatches next user of C/I then, dispatches the user of C/I minimum at last.By the time to N
kAll users in the set are transmitted after data finish, again to the user's service in time high set of business demand QoS priority valve, up to minimum set is N to business demand QoS priority valve
1User's end of transmission in the set.And then according to this principle Cyclic Service community user.
If the set of a certain business demand QoS priority valve, for example N
fDo not have customer requirements to carry out transfer of data in the set, then directly go to the lower set of next business demand QoS priority valve according to the order of sequence; N for example again
g(g=f-1) in the set,, be somebody's turn to do the user under the data in the set by base station services if in this set user data is arranged.
If for example in the lower set of service business demand QoS priority valve
NpDuring user in the set, the higher customer requirements Data transmission of business demand QoS priority valve is arranged, this user data belongs to
Nq(among the p＜q), suppose only has the business demand QoS priority valve of a set to be higher than at this moment in set
NpSet.At this moment two kinds of processing methods are arranged.First method is to interrupt the low set of business demand QoS priority valve
NpUser's data transmission in the set, then to the higher set of business demand QoS priority valve
NqServed the user who requires service in the set, and then the height order of pressing current business demand QoS priority valve, user in the highest set of elder generation's service business demand QoS priority valve, and then the user in the lower set of service business demand QoS priority valve, until to the minimum set of business demand QoS priority valve
N1User data transmission in the set finishes.And then according to this principle Cyclic Service community user.That is to say that the user that the priority valve of business demand QoS is high has absolute dispatching priority.Second method is the user who continues in the current set of service
NpSet is up to the minimum set of business demand QoS priority valve
N1User's end of transmission in the set, circulation again again.
Claims (5)
1, the downlink data dispatching method of wireless packet data transmission system is characterized in that, may further comprise the steps:
Scheduler in a, the base station is divided into K set with the user of the M in the sub-district in proper order according to the height of its business demand service quality weights;
B, base station are according to the user of each set in certain dispatching principle Cyclic Service sub-district, and this principle is the user in the set that at first service business demand service quality is the highest, and the user in this set is carried out transfer of data according to the principle of max carrier to interference; By the time all users in this set are transmitted after data finish, again to the user's service in time high set of business demand service quality, up to the user's end of transmission in the minimum set of business demand service quality; And then according to this principle Cyclic Service community user.
2, the downlink data dispatching method of wireless packet data transmission system according to claim 1, it is characterized in that the priority valve of described user's business demand service quality is determined according to the comprehensive priority request of data rate, propagation delay time and the bit error rate parameter of customer service; The used weights of the size of comprehensive priority valve and each parameter are relevant, and the weights that each parameter adopts then are provided with by scheduler balance different business demand.
3, the downlink data dispatching method of wireless packet data transmission system according to claim 1, it is characterized in that, in the described b step, in any once scheduling circulation, if do not have customer requirements to carry out transfer of data in the set of a certain business demand service quality priority valve, then base station dispatcher directly goes to the lower set of next business demand service quality priority valve according to the order of sequence, the user in should being gathered by base station services.
4, the downlink data dispatching method of wireless packet data transmission system according to claim 1, it is characterized in that, in the described b step, if the base station is when belonging to user in the set low in the service business demand service quality priority valve ordering and serve, be higher than customer requirements Data transmission in the low set of ordering as the service business demand service quality priority valve that belongs to another set and this service business demand service quality priority valve by the ordering of business demand service quality priority valve, then interrupt user's data transmission in the low set of business demand service quality priority valve the base station, scheduler goes to and has served the user who requires service in the high set of business demand service quality priority valve, press the height order of current business demand service quality priority valve again, by the user in the high set of base station elder generation service business demand service quality priority valve, and then the user in the low set of service business demand service quality priority valve, until the user data transmission in the minimum set of business demand service quality priority valve is finished, finish the once service of scheduling circulation; User in the Cyclic Service sub-district is dispatched according to this principle again in the base station next time.
5, the downlink data dispatching method of wireless packet data transmission system according to claim 1, it is characterized in that, in the described b step, in any once scheduling circulation, during user in the current set of base station services, its service business demand service quality priority valve of user in another set is higher than customer requirements Data transmission in the current set by business demand service quality priority valve ordering, the user in the current set of service is continued in the base station, to the user's end of transmission in the minimum set of business demand service quality priority valve, base station dispatcher is circulation scheduling next time again again in this scheduling circulation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 02110592 CN1184835C (en) | 2002-01-21 | 2002-01-21 | Down data scheduling method for wireless grouping data transmission system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 02110592 CN1184835C (en) | 2002-01-21 | 2002-01-21 | Down data scheduling method for wireless grouping data transmission system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1434643A CN1434643A (en) | 2003-08-06 |
| CN1184835C true CN1184835C (en) | 2005-01-12 |
Family
ID=27628200
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 02110592 Expired - Fee Related CN1184835C (en) | 2002-01-21 | 2002-01-21 | Down data scheduling method for wireless grouping data transmission system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1184835C (en) |
Families Citing this family (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1298139C (en) * | 2003-08-15 | 2007-01-31 | 中兴通讯股份有限公司 | Multi-stage dispatch method for supporting multi-port multi-business |
| CN100369524C (en) * | 2004-08-10 | 2008-02-13 | 大唐移动通信设备有限公司 | CDMA system up-bag dispatching method |
| CN100370746C (en) * | 2004-10-10 | 2008-02-20 | 华为技术有限公司 | Scheduling method of mobile data service |
| CN100454892C (en) * | 2005-03-17 | 2009-01-21 | 中兴通讯股份有限公司 | Schedling method of packet system |
| CN100459751C (en) * | 2006-07-07 | 2009-02-04 | 华为技术有限公司 | Uplink dispatch method controlled by base station |
| CN101374284B (en) * | 2007-08-20 | 2011-12-07 | 中兴通讯股份有限公司 | Method for distributing bandwidth for relaying station by base station |
| CN101494908B (en) * | 2008-01-25 | 2012-06-27 | 电信科学技术研究院 | Method for scheduling customer equipment data and packet scheduling device |
| CN101795496B (en) * | 2009-10-27 | 2012-10-10 | 清华大学 | Dispatching method and system of multi-BS (base station) multi-user network |
| WO2011154761A1 (en) * | 2010-06-10 | 2011-12-15 | Huawei Technologies Co. Ltd. | Method for transfer of downlinik data in a wireless communication system |
| CN102595486A (en) * | 2012-03-01 | 2012-07-18 | 东南大学 | Multi-service scheduling method in ultra high-speed WLAN (wireless local area network) |
| CN105873128B (en) * | 2016-05-31 | 2019-05-14 | 杭州电子科技大学 | A kind of LTE fairness dispatching method based on delay sensitive |
-
2002
- 2002-01-21 CN CN 02110592 patent/CN1184835C/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| CN1434643A (en) | 2003-08-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1074879C (en) | Method of dynamically allocating time slots on a packet data communications channel | |
| CN1135799C (en) | Link-efficiency based scheduling in radio data communications systems | |
| CN1184835C (en) | Down data scheduling method for wireless grouping data transmission system | |
| CN1596527A (en) | Packet transmission scheduling method and base station device | |
| CN102083221A (en) | Resource scheduling method and device based on HSDPA (high speed downlink packet access) | |
| CN1593044A (en) | Method and system for congestion avoidance in packet switching devices | |
| CN101730236A (en) | Resource scheduling method and system, base station and terminal therefor | |
| CN1852512A (en) | Code resource distribution method of high speed physical downward sharing channel | |
| CN106954232A (en) | A kind of resource allocation methods of time delay optimization | |
| CN106341895A (en) | Resource scheduling method and resource scheduling system for uplink services in power wireless private network | |
| CN1256850C (en) | Short message scheduling management method in wireless mobile network | |
| CN1551539A (en) | Forward channel schedule algorithm for HDR system | |
| CN104602355B (en) | mixed service dispatching method in LTE system | |
| CN1925460A (en) | Group dispatching and channel distributing method for HSDPA system | |
| CN101572596B (en) | Method and device for confirming and dispatching priority of non-ensured bit rate service | |
| CN1643874A (en) | Scheduling using quantum and deficit values | |
| CN1767672A (en) | Dynamically arranging of transmission scheduler algorithms | |
| CN1497890A (en) | Method for processing service in mobile communication system | |
| CN102056317B (en) | Dispatching method for high-speed downlink packet access | |
| CN1798446A (en) | Method for transferring short signaling through Mac-ePDU | |
| CN107087309A (en) | Many base station system proportional fair dispatching methods under user QoS fixed rate constraint | |
| CN1867171A (en) | Method for improving dedicated channel wireless resource utilization ratio | |
| CN101252516B (en) | Method for realizing high speed downlink grouping traffic | |
| CN1455531A (en) | Communication method for performing all-tier protocol stack processing by base station side | |
| CN1852147A (en) | Method for realizing statistics of business throughput rate and system therefor |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| 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: 20050112 Termination date: 20200121 |