CN101674656B - Dispatching method of wireless communication user - Google Patents
Dispatching method of wireless communication user Download PDFInfo
- Publication number
- CN101674656B CN101674656B CN200910308541XA CN200910308541A CN101674656B CN 101674656 B CN101674656 B CN 101674656B CN 200910308541X A CN200910308541X A CN 200910308541XA CN 200910308541 A CN200910308541 A CN 200910308541A CN 101674656 B CN101674656 B CN 101674656B
- Authority
- CN
- China
- Prior art keywords
- user
- base station
- orthogonality
- buffering area
- vector
- 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
Classifications
-
- Y02B60/50—
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention relates to a dispatching method of a wireless communication user, belonging to the technical field of wireless communication. The dispatching method comprises the following steps: carrying out improvement to an SUS method, and simultaneously combining an analytic hierarchy method. The dispatching method has low complexity, can be finished by addition and multiplication, avoids the operation of involution, division and logarithm and reduces the time complexity and the requirements to hardware; the flow rate is limited according to capacity of a buffer zone of a base station, not only the purpose of controlling congestion can be achieved, but also the suppression is not excessive to the user, and the buffer zone of the base station can be fully utilized under the premise that the base station has no congestion; the characteristic vector used by the analytic hierarchy method is opened, new characteristic vector can be added according to the needs, and the time complexity is almost not increased; and by different classification to congestion condition, the dispatching method can be convenient to determine whether the system focuses on throughput or stability and fairness while considering the throughput, stability and fairness.
Description
Technical field
What the present invention relates to is a kind of method of wireless communication technology field, specifically is a kind of dispatching method of wireless communication user.
Background technology
According to the demand of the third generation mobile communication system (4G), system should be able to provide higher data rate.Therefore, study the down channel that multiple-input and multiple-output (MIMO) technology is applied to the base station, with expectation on the basis of existing technology, consider realizability, to the stability of system, fairness and time complexity improve.The stability of a system is meant in any transmission instantaneous, and the base station is because of the restriction of factors such as throughput, and the data that have little time to send, and can not exceed the capacity of base station buffering area; Fairness is meant the different demands according to each user, reasonably confirms to send to each user's data amount.
Under the prerequisite of hypothesis base station known channel state information, be the characteristics of the high channel capacity of realizing mimo channel, the technology that extensively adopts at present is the close-to zero beam forming precoding technique.Yet, to down channel, adopt close-to zero beam forming technology, the number of users that important prerequisite is a down channel can not surpass the number of transmit antennas of base station.And under normal conditions, the number of users of down channel is much larger than number of transmit antennas, and therefore, the base station is necessary to make user's selection, and promptly instantaneous in any one transmission, the number of users of base station services is smaller or equal to number of transmit antennas.The usefulness that the base station is chosen can receive the base station per family and send to their data, and the base station is not chosen the user to send at this instantaneously will to can not get any Useful Information, obviously, total the received data of user that the transmission information of current system is exactly the base station to be chosen.It is exactly that each sends the received data sum of choosing instantaneous base station of user that thereby the throughput of system in a period of time arranged.Transmission gross power in the base station is under the prerequisite of definite value, and there are maximum or approaching maximum throughput in system.Therefore, the user's of base station selected down channel foundation is that will to guarantee to send data that the user that chooses instantaneous base station receives at each maximum or near maximum.If with the method for global optimization, promptly the method for exhaustion can make system reach maximum throughput, is user's set of N but this method requires from number of users, selects to be less than or equal to the user that number of transmit antennas is M, need make C at least
N MInferior relatively judgement, so time complexity is higher.
Through existing literature search is found; People such as Andrea Goldsmith and Taesang Yoo delivered the document that is entitled as " On theoptimality of multiantenna broadcast scheduling using zero-forcing beamforming (using the multi-antenna broadcast system call optimization that close-to zero beam is shaped) " in 2006 on IEEE Journalon Selected Areas in Communications (ieee communication field periodical); This article has proposed SUS (semi-orthogonal user selection) strategy as a kind of local optimization methods; Promptly when several users' channel vector in twos between angle during all less than a certain in advance given threshold value, just can think that they are semi-perpendicular.Satisfy the user combination of above-mentioned condition from all, select make system that maximum arranged or near that group of maximum throughput as this service object.Use semi-orthogonal user selection strategy, be actually with greedy method and remove to approach total optimization through local optimum.But the amount of calculation of this method is bigger; And this method has only been considered the throughput maximization of system; And do not consider the stability of whole system; Be the capacity that total length of data packets can not surpass the base station buffering area in the buffering area of base station, also do not consider the factors such as urgent degree to demand for services the fairness of each user's service and user.
Find through retrieval again; People such as Harish Viswanathan have delivered the document that is entitled as " Rate scheduling in multipleantenna downlink wireless systems (rate scheduling of descending multiaerial system) " in 2005 on IEEE Transactions onCommunications (ieee communication field periodical); This article has been considered throughput of system and stability; The method that has proposed to ask
is noted the method into QR by abridging.Wherein: the implication of
is to its speed R weighting and summation, the maximum of wherein getting and being worth with the long q of the formation of each downlink user in the buffering area of base station.But the amount of calculation of this method is bigger, and computing is more loaded down with trivial details time-consuming; In the buffering area of base station, during the capacity of total length of data packets buffering area, possibly cause certain throughput of system loss much smaller than the base station; Do not consider throughput and stability factor in addition.
Summary of the invention
The objective of the invention is to deficiency, propose a kind of dispatching method of wireless communication user to prior art.The present invention improves the SUS method, has combined analytic hierarchy process (AHP) simultaneously, is carrying out the user when dispatching, and has considered some level analytical characteristics vectors, when taking into account throughput of system and stability, fairness, has reduced the scheduling complexity.
The present invention realizes through following technical scheme:
It is following to the present invention includes step:
The first step is divided into different congestion situations with the ratio a of the capacity of base station buffering area with the base station buffering area by total length of data packets in the buffering area of base station and handles, and obtains the total formation length of current buffering area, thereby confirms the congestion situation under the current buffering area;
Described different congestion situation is meant does not have congestion situation, comparison congestion situation and congestion situation very, wherein: when a>=20%, for there not being congestion situation; When 20%＜a≤60%, be congestion situations relatively; When a＞60%, be congestion situation very.
Second step, choose the step analysis characteristic vector, obtain the characteristic weighing vector under the different congestion situations;
Described step analysis characteristic vector comprises; The queue length of the mould value of self-defined weight, channel vector, interchannel orthogonality and base station buffering area.
Described self-defined weight refers to that the formation COS long, that the user is accepting of user's channel condition, base station buffering area is that can accept the delay of its service and the required service of this user be a large amount of or long-term continuation of short-term burst for general text transmission or the multimedia service of big data quantity, user.
Described channel orthogonality comprises current channel orthogonality and preceding several times channel orthogonality, wherein: the user who has just selected when current channel orthogonality refers to alternative user and last iteration, the orthogonality of promptly just having added the user that feasible user concentrates to; The user who selects when preceding several times channel orthogonality refers to alternative user and preceding several times iteration, promptly feasible user concentrate all users' except that just adding orthogonality.
The queue length of described base station buffering area is the length that has little time to issue each alternative user's data bag of directly bringing the base station buffer stores into.
The mould value of described channel vector is directly to adopt downlink user to feed back to the channel vector mould value of base station.
In the 3rd step,, and then obtain the step analysis characteristic vector that alternative user concentrates each user respectively by each user's in alternative user's set channel vector h;
If: it is CM (k, 1) that alternative user concentrates the self-defined weight of user k, and the mould value of the channel vector of user k is CM (k, 2); The current channel orthogonality of user k is CM (k, 3), and the preceding several times channel orthogonality of user k is CM (k, 4), and the queue length of the base station buffering area of user k is CM (k, 5), and then formula is respectively:
CM(k，1)＝X
k
CM(k，2)＝‖h
k‖
CM(k，5)＝q(k)
Wherein: X
kBe to user k predetermined weights, h
kBe the channel vector of user k, h
LastuserBe the channel vector that last user has just added the user that feasible user concentrates when selecting to, tes is feasible user's collection, and q (k) is the queue length of the base station buffering area of the user k that obtains;
The 4th step, each user's chromatographic analysis characteristic vector and the characteristic weighing vector under the current cache situation are carried out weighted sum, the user that the weighted sum value is maximum inserts and has selected for use the family to concentrate;
In the 5th step, from alternative user's set, remove the user of the arbitrary user's concentrated orthogonality, to simplify alternative user's set greater than given threshold value with selecting the family for use;
In the 6th step, if selected for use amount less than number of transmit antennas, and alternative number of users got back to for the 3rd step greater than 0, proceeded next user and selected; Otherwise, adopt water-filling method that the user who chooses is carried out power division, send data.
Compared with prior art, the invention has the beneficial effects as follows: complexity is low, and only addition, multiplication can be accomplished, and have avoided power, division and logarithm operation, has reduced time complexity and to the requirement of hardware; Capacity according to the base station buffering area comes limited flow, can either reach the purpose of congested control, is unlikely to again the user is suppressed excessively, can not have the buffering area that makes full use of the base station under the congested prerequisite in the base station; The used characteristic vector of analytic hierarchy process (AHP) is open, can increase new characteristic vector as required and increases time complexity hardly; Through the difference classification to congestion situation, when taking into account throughput, stability and fairness, can determine native system more to stress throughput easily still is stability and fairness.
Description of drawings
Fig. 1 adopts present embodiment method, SUS method and QR method different user to be made the contrast sketch map of used CPU time in when scheduling respectively.
Embodiment
Below in conjunction with accompanying drawing method of the present invention is described in detail, present embodiment provided detailed execution mode and concrete operating process, but protection scope of the present invention is not limited to following embodiment being to implement under the prerequisite with technical scheme of the present invention.
The concrete steps of present embodiment are following:
The first step is divided into different congestion situations with the ratio a of the capacity of base station buffering area with the base station buffering area by total length of data packets in the buffering area of base station and handles, and obtains the total formation length of current buffering area, thereby confirms the congestion situation under the current buffering area;
Described different congestion situation is meant does not have congestion situation, comparison congestion situation and congestion situation very; Wherein: when a>=20%; For there not being congestion situation; The capacity of total length of data packets buffering area much smaller than the base station in the buffering area of base station can not take place congestedly in the short time, this moment, system's subject matter that should solve was throughput; When 20%＜a≤60%, be congestion situations relatively, the total length of data packets in the buffering area of base station is underfill base station buffering area also, and system should take into account throughput and stability and fairness; When a＞60%, be congestion situation very, total length of data packets promptly possibly take place congestedly near the capacity of base station buffering area in the buffering area of base station, and the subject matter that this moment, system should solve is stability and fairness.
Second step, choose the step analysis characteristic vector, obtain the characteristic weighing vector under the different congestion situations;
Described step analysis characteristic vector comprises; The queue length of the mould value of self-defined weight, channel vector, interchannel orthogonality and base station buffering area.
Described self-defined weight refers to that the formation COS long, that the user is accepting of user's channel condition, base station buffering area is that can accept the delay of its service and the required service of this user be a large amount of or long-term continuation of short-term burst for general text transmission or the multimedia service of big data quantity, user.
Described channel orthogonality comprises current channel orthogonality and preceding several times channel orthogonality, wherein: the user who has just selected when current channel orthogonality refers to alternative user and last iteration, the orthogonality of promptly just having added the user that feasible user concentrates to; The user who selects when preceding several times channel orthogonality refers to alternative user and preceding several times iteration, promptly feasible user concentrate all users' except that just adding orthogonality.
The queue length of described base station buffering area is the length that has little time to issue each alternative user's data bag of directly bringing the base station buffer stores into.
The mould value of described channel vector is directly to adopt downlink user to feed back to the channel vector mould value of base station.
Do not have congestion situation, the subject matter that system should solve is throughput, so the mould value of channel vector and interchannel orthogonality are more important than the queue length of self-defined weight and base station buffering area; Congestion situations relatively, system should take into account throughput and stability and fairness, so the mould value of channel vector and interchannel orthogonality are obviously more important than self-defined weight, and more important slightly than the queue length of base station buffering area; Congestion situation very, the subject matter that this moment, system should solve is stability and fairness, so the queue length of base station buffering area is more important strongly than self-defined weight, and obviously more important than the mould value and the interchannel orthogonality of channel vector.
Each user's importance is identical in this instance, also is that their self-defined weight equates.Obtain not having the characteristic weighing vector under the congestion situation to be ω
1=(19961)
T, relatively the characteristic weighing vector under the stopping state is ω
2=(14642)
T, very the vector of the characteristic weighing under the stopping state is ω
3=(14648)
T
In the 3rd step, obtain each user's in alternative user's set channel vector h, and then obtain the step analysis characteristic vector that alternative user concentrates each user respectively;
If: it is CM (k, 1) that alternative user concentrates the self-defined weight of user k, and the mould value of the channel vector of user k is CM (k, 2); The current channel orthogonality of user k is CM (k, 3), and the preceding several times channel orthogonality of user k is CM (k, 4), and the queue length of the base station buffering area of user k is CM (k, 5), and then formula is respectively:
CM(k，1)＝X
k
CM(k，2)＝‖h
k‖
CM(k，5)＝q(k)
Wherein: X
kBe to user k predetermined weights, h
kBe the channel vector of user k, h
LastuserBe the channel vector that last user has just added the user that feasible user concentrates when selecting to, tes is feasible user's collection, and q (k) is the queue length of the base station buffering area of the user k that obtains;
The 4th step collected each user's chromatographic analysis characteristic vector and the characteristic weighing vector under the current cache situation carries out weighted sum with alternative user, and the user that the weighted sum value is maximum inserts and selected for use the family concentrated;
As comparing under the congestion situation, it is CM (k, 1) * 1+CM (k, 2) * 9+CM (k, 3) * 9+CM (k, 4) * 6+CM (k, 5) * 1 that alternative user concentrates the chromatographic analysis characteristic vector of user k and the weighted sum value of characteristic weighing vector.
In the 5th step, from alternative user's set, remove the user of the arbitrary user's concentrated orthogonality, to simplify alternative user's set greater than given threshold value with selecting the family for use;
Threshold value in the present embodiment is 0.6.
In the 6th step, if selected for use amount less than number of transmit antennas, and alternative number of users got back to for the 3rd step greater than 0, proceeded next user and selected; Otherwise, adopt water-filling method that the user who chooses is carried out power division, send data.
Use the computer of Intel Duo double-core CPU, 2G internal memory; Use present embodiment method, SUS method and QR method that wireless communication user is dispatched respectively; It is as shown in Figure 1 to carry out the required CPU time of 30 iteration; As can be seen from the figure, corresponding to different numbers of users, the time complexity of present embodiment method is far below SUS method and QR method; And with the increase of number of users, gap is more obvious.When number of users was 50, the time that the present embodiment method is made user's dispatching office and needed was merely 1/3 of QR method.Therefore, compare with existing user scheduling method, the present embodiment method with introducing littler processing delay, very helps real-time processing under the advantage with low time complexity.
The present embodiment complexity is low, and only addition, multiplication can be accomplished, and have avoided power, division and logarithm operation, has reduced time complexity and to the requirement of hardware; Capacity according to the base station buffering area comes limited flow, can either reach the purpose of congested control, is unlikely to again the user is suppressed excessively, can not have the buffering area that makes full use of the base station under the congested prerequisite in the base station; The used characteristic vector of analytic hierarchy process (AHP) is open, can increase new characteristic vector as required and increases time complexity hardly; Through the difference classification to congestion situation, can determine dispatching method more to stress throughput easily still is stability and fairness.
Claims (4)
1. the dispatching method of a wireless communication user is characterized in that, comprises that step is following:
The first step is divided into different congestion situations with the ratio a of the capacity of base station buffering area with the base station buffering area by total length of data packets in the buffering area of base station and handles, and obtains the total formation length of current buffering area, thereby confirms the congestion situation under the current buffering area;
Second step, choose the step analysis characteristic vector, obtain the characteristic weighing vector under the different congestion situations;
In the 3rd step,, and then obtain the step analysis characteristic vector that alternative user concentrates each user respectively by each user's in alternative user's set channel vector h;
The 4th step, each user's step analysis characteristic vector and the characteristic weighing vector under the current cache situation are carried out weighted sum, the user that the weighted sum value is maximum inserts and has selected for use the family to concentrate;
In the 5th step, from alternative user's set, remove the user of the arbitrary user's concentrated orthogonality, to simplify alternative user's set greater than given threshold value with selecting the family for use;
In the 6th step, if selected for use amount less than number of transmit antennas, and alternative number of users gets back to the first step greater than 0, proceeds next user and selects; Otherwise, adopt water-filling method that the user who chooses is carried out power division, send data.
2. the dispatching method of wireless communication user according to claim 1 is characterized in that, the different congestion situations described in the first step are meant does not have congestion situation, comparison congestion situation and congestion situation very, wherein: when a≤20%, for there not being congestion situation; When 20%＜a≤60%, be congestion situations relatively; When a＞60%, be congestion situation very.
3. the dispatching method of wireless communication user according to claim 1 is characterized in that, the step analysis characteristic vector described in second step comprises; The queue length of the mould value of self-defined weight, channel vector, interchannel orthogonality and base station buffering area, wherein: described self-defined weight refers to that the formation COS long, that the user is accepting of user's channel condition, base station buffering area is that can accept the delay of its service and the required service of this user be a large amount of or long-term continuation of short-term burst for general text transmission or the multimedia service of big data quantity, user; Described interchannel orthogonality comprises: current interchannel orthogonality and preceding several times interchannel orthogonality; Wherein: the user who has just selected when current interchannel orthogonality refers to alternative user and last iteration, the orthogonality of promptly just having added the user that feasible user concentrates to; The user who selects when preceding several times interchannel orthogonality refers to alternative user and preceding several times iteration, promptly feasible user concentrate all users' except that just adding orthogonality; The queue length of described base station buffering area is the length that has little time to issue each alternative user's data bag of directly bringing the base station buffer stores into; The mould value of described channel vector is directly to adopt downlink user to feed back to the channel vector mould value of base station.
4. the dispatching method of wireless communication user according to claim 1 is characterized in that, the described threshold value in the 5th step is 0.6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200910308541XA CN101674656B (en) | 2009-10-21 | 2009-10-21 | Dispatching method of wireless communication user |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200910308541XA CN101674656B (en) | 2009-10-21 | 2009-10-21 | Dispatching method of wireless communication user |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101674656A CN101674656A (en) | 2010-03-17 |
| CN101674656B true CN101674656B (en) | 2012-01-04 |
Family
ID=42021572
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200910308541XA Expired - Fee Related CN101674656B (en) | 2009-10-21 | 2009-10-21 | Dispatching method of wireless communication user |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101674656B (en) |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101431770A (en) * | 2008-12-04 | 2009-05-13 | 上海交通大学 | Control method used for base station congestion of radio communication system up link |
-
2009
- 2009-10-21 CN CN200910308541XA patent/CN101674656B/en not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101431770A (en) * | 2008-12-04 | 2009-05-13 | 上海交通大学 | Control method used for base station congestion of radio communication system up link |
Non-Patent Citations (4)
| Title |
|---|
| Atilla Eryilmaz等.Fair Resource Allocation in Wireless Networks using Queue-length-based Scheduling and Congestion Control.《INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE》.2005,全文. * |
| JP特开2007-274549A 2007.10.18 |
| Taesang Yoo等.On the Optimality of Multiantenna Broadcast Scheduling Using Zero-Forcing Beamforming.《IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS》.2006,第24卷(第3期),全文. * |
| 杨大毛等.基于层次分析法的多用户调度算法.《上海交通大学学报》.2009,第43卷(第12期),全文. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101674656A (en) | 2010-03-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101083516B (en) | Systems and methods for wireless communication | |
| CN107682135A (en) | A kind of network slice adaptive virtual resource allocation method based on NOMA | |
| CN102668653B (en) | The method and apparatus of the transmitting power for user scheduling and in supervisory communications | |
| CN100589474C (en) | Cross-layer scheduling method in OFDM multi-antenna system | |
| CN101873159A (en) | Multi-input multi-output downlink transmission control method and device | |
| CN103986558B (en) | Adaptive cooperation transmission method in a kind of cellular mobile communication D2D systems | |
| CN107547130A (en) | Beam domain light wireless communication method and system | |
| CN103384174A (en) | Method based on cooperation of multiple users and multiple antennas for optimizing spectrum sensing detection probability | |
| CN102185683B (en) | Signal-to-leakage-and-noise ratio (SLNR) rule statistic-based MIMO (Multiple Input Multiple Output) multi-user downlink transmission method | |
| CN104039004A (en) | Method for heterogeneous user pilot frequency power optimal distribution in large-scale multi-input multi-output system | |
| CN102088789B (en) | Channel information feedback adaptive transmission and bandwidth allocation method used in wireless communication | |
| CN1826819B (en) | System, and associated method, for scheduling weighted transmissions from multiple antennas | |
| CN101472298B (en) | User scheduling method and apparatus for TDD multi-input multi-output down emission system | |
| CN101834650A (en) | Multiuser MIMO (multiple-input multiple-output) downlink transmitting and dispatching method | |
| CN101511125A (en) | Discrete velocity layer-striding power distribution method suitable for distributed antenna system | |
| CN104780565B (en) | A kind of fair cooperating relay system of selection | |
| Li et al. | On the optimality of downlink OFDMA MIMO systems | |
| CN101383650B (en) | Multi-service multi-antenna broadcast channel scheduling method based on fuzzy satisfactory degree | |
| CN101674656B (en) | Dispatching method of wireless communication user | |
| CN110212957B (en) | Signal-to-leakage-and-noise-ratio-based MU-MIMO system user scheduling method | |
| CN101854235A (en) | User selection method and device in multi-input multi-output system | |
| CN103220110A (en) | Wireless resource allocation method of OFDMA (Orthogonal Frequency Division Multiple Access) system under high-speed scene | |
| CN101420745B (en) | Channel quality indication regulation method for SDMA schema conversion | |
| CN101102123B (en) | Mixing service RAKE receiving device based on broadband CDMA system and its method | |
| CN107801251A (en) | Three-dimensional multiple-input and multiple-output descending multi-user Transmission system dispatching method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| 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 |
Granted publication date: 20120104 Termination date: 20141021 |
|
| EXPY | Termination of patent right or utility model |