CN101247148A - Method, system and base station for implementing power control - Google Patents

Abstract

The present invention discloses a method, a system and a base station for realizing the power control basing on the combined grouping scheduling and power distributing of the Worldwide Interoperability for Microwave Access (WiMAX) system. The plan comprises the following procedures: obtaining a speed dispatching priority satisfying the average transmission rate request of each user and the time delay dispatching priority satisfying the waiting time of the data package by the base station according to the channel gain measured by each subscriber board; obtaining the transmitting priority according to the obtained speed dispatching priority and time delay dispatching priority, scheduling the subscriber according to the transmitting priority level and taking the transmitting power corresponding to the least speed dispatching priority as the transmitting power of the scheduled subscriber. The invention combines the grouping scheduling with power distributing under the precondition that the average data transmitting speed and time delay request of each business flow are guaranteed to minimize the transmitting power of the base station in the statistical average meaning and reduce the interference to other subscriber and the subdistrict; meanwhile, the short-term property is considered while the long-term performance of the service is guaranteed. The invention has higher construction value.

Description

A kind of method, system and base station of realizing power control

Technical field

The present invention relates to the wireless communication system power control techniques, especially refer to a kind of based on micro-wave access global inter communication (WiMAX, Worldwide Interoperability for Microwave Access) the associating packet scheduling of system and power division (JSPA, Joint Scheduling and Power Allocation) realize method, system and the base station of power control.

Background technology

Along with the content of exchange of information is more and more abundanter, people also require more and more higher to the quality of exchange of information, the original requirement that can not satisfy people based on the mobile communication of speech gradually, therefore the development of mobile communication system must be on the basis that guarantees voice service, provide and transmit picture, file, receiving and dispatching mail, surf the web, multimedia services such as movies on demand, and satisfy the business of user to the demand of high-speed data.In order to provide on the existing network basis more at a high speed and more advanced wireless data communication service, the various enhancement techniques that are used for RFDC have appearred.

At present, the WiMAX technology more and more is subjected to the attention of industry with characteristics such as its transmission rate height, long transmission distance.The WiMAX system mainly contains two kinds of network factors, subscriber board (SS, Subscriber Station) and base station (BS, Base Station).The key technology that RRM in the WiMAX system adopts mainly contains Adaptive Modulation and Coding (AMC, Adaptive Modulation and Coding), retransmit (ARQ, Automatic Repeat Request), packet scheduling and power control etc. automatically.

Wherein, power is controlled in the resource allocation of wireless communication system and occupies an important position.The target of power control is: reduce the interference to other users when providing acceptable service quality for each user.The Poewr control method of optimizing can make power system capacity increase greatly, thereby improves the system spectrum utilance.

At present, power control method commonly used is to utilize the characteristic of channel variation, the gain that scheduling and power division are brought in the consideration multi-user system, the assurance user minimum average B configuration message transmission rate of proposition, the packet scheduling scheme of minimization system average transmitting power.This scheme scheduling channel condition in each dispatching cycle is better relatively, the user that required transmitted power is less relatively, and determine the data rate that the user can reach according to the power of distributing to this user, guarantee that user's average data transfer rate requires to be met.

This scheme can fully guarantee user's long-term behaviour (long-term performance), and promptly in one long period, user's average data transfer rate can be met well.But user's satisfaction not only is to be weighed by user's long-term behaviour, and the user also has short-term performance (short-term performance) demand simultaneously.This scheme is poor slightly for some scheduling channel conditions, the user that required transmitted power is relatively large, cause the certain user in one period considerable time, to can not get serving probably being user's short-term performance to be not being met, thereby reduced user's satisfaction generally.

Another simple motion is, reaching under the condition of certain bit error rate, and it is target CINR value greater than a certain threshold value that receiving terminal requires to receive signal interference ratio (CINR) value.Receiving terminal is added a side-play amount according to the difference between target CINR value and the current reception CINR value, produces a power adjustment commands and it is fed back to transmitting terminal, and transmitting terminal is adjusted order according to this and regulated transmitting power or modulation coding mode.Described side-play amount is specifically determined by business men.The performance that improves system by power distributing technique is only adopted in this motion.

From the scheme of existing power control, be to adopt packet scheduling independently, or power distributing technique realize control, can not improve the performance of system well.

Summary of the invention

In view of this, the embodiment of the invention provides a kind of method of uniting packet scheduling and power division, can reduce the interference to other users and sub-district, improves user's short-term performance, thereby improves the performance of system well.

The embodiment of the invention provides a kind of system that unites packet scheduling and power division, can reduce the interference to other users and sub-district, improves user's short-term performance, thereby improves the performance of system well.

The embodiment of the invention provides a kind of base station, can unite and adopt packet scheduling and power division that power is controlled.

The technical scheme of the embodiment of the invention specifically is achieved in that

A kind of method that realizes power control, this method may further comprise the steps:

The base station is according to the channel gain that each subscriber board measures, and obtains rate scheduling priority that the average transmission rate that satisfies each user requires and the time delay dispatching priority that satisfies the packet stand-by period;

According to described rate scheduling priority and time delay dispatching priority, obtain transmission priority, and according to described transmission priority scheduling user, and so that the hour the most corresponding transmitted power of rate scheduling priority as scheduled user's transmitted power.

A kind of system that realizes power control, described system comprises: subscriber board and base station, wherein,

Described subscriber board is used for the measured channel gain;

Described base station is used for according to described channel gain, obtains the rate scheduling priority that the average transmission rate that satisfies each user requires and obtains the time delay dispatching priority that satisfies the packet stand-by period; According to described rate scheduling priority and time delay dispatching priority, obtain transmission priority, and according to described transmission priority scheduling user, and so that the hour the most corresponding transmitted power of rate scheduling priority as scheduled user's transmitted power.

A kind of base station, described base station comprises: channel gain acquisition module, rate scheduling priority acquisition module, time delay dispatching priority acquisition module, transmission priority acquisition module and scheduler module, wherein,

Described channel gain acquisition module is used to obtain described channel gain;

Described rate scheduling priority acquisition module is used for according to described channel gain, obtains the rate scheduling priority that the average transmission rate that satisfies each user requires;

Described time delay dispatching priority acquisition module is used for according to described channel gain, obtains the time delay dispatching priority that satisfies the packet stand-by period;

Described transmission priority acquisition module is used for obtaining transmission priority according to described rate scheduling priority and time delay dispatching priority;

Described scheduler module is used for according to described transmission priority scheduling user, and so that the hour the most corresponding transmitted power of rate scheduling priority as scheduled user's transmitted power.

As seen from the above technical solution, the present invention combines packet scheduling with power division, by to the taking all factors into consideration of factors such as the transmitted power of channel status, distribution and packet time delay, realizes power control.The present invention is guaranteeing that the system average transmitting power of making has reached minimum under the prerequisite that user's average data transfer rate requires; Simultaneously,, give high more dispatching priority, satisfied user's short-term performance, improved user's satisfaction for long more packet of stand-by period.

The associating packet scheduling that the embodiment of the invention proposes and the power control scheme of power distribution algorithm, under the prerequisite of average data transfer rate that guarantees each Business Stream and delay requirement, packet scheduling is combined with power division, make the transmitting power of base station under the statistical average meaning reach minimum, reduced interference, also improved user's short-term performance other users and sub-district.

Description of drawings

Fig. 1 is the flow chart of the inventive method;

Fig. 2 is the composition frame chart of system of the present invention.

Embodiment

For making embodiment of the invention technical scheme and advantage clearer, below with reference to the accompanying drawing preferred embodiment that develops simultaneously, the present invention is described in more detail.

To send the highest user of priority in order finding, to make the average transmitting power minimum of system under the prerequisite that average data transfer rate and time-delay each user can meet the demands.The present invention adopts the mathematical optimization model shown in formula (1)～(4):

$\underset{Q,p}{\min }\underset{k=1}{\overset{K}{\mathrm{\Σ}}}E(P\left(\stackrel{\→}{g}\right)\·1_{\{Q\left(\stackrel{\→}{g}\right)=k\}})---\left(1\right)$

Wherein, $\stackrel{\→}{g}=\{g_{i1},g_{i2},\·\·\·g_{\mathrm{iK}}\}$ Be channel gain vector, g _IkBe the channel gain between user k and the base station i.Be without loss of generality, can omit subscript i, promptly be expressed as $\stackrel{\→}{g}=\{g_1,g_2,\·\·\·g_K\};$

P () represents power distribution strategies, and $0\≤p\left(\stackrel{\→}{g}\right)\≤P_{\max },$ P _MaxMaximum transmission power for system.If user k is scheduled, the power of distributing to this user k simultaneously is

Then the accessible data rate of user k is $c_k\left(p\right)=f_k^{-1}\left(g_{k}p\right);$

f _k(c) for user k reaches data rate c required signal-to-noise ratio, be the increasing function of c, and f _k(0)=0.At given channel gain g _kUnder the condition, reaching the required minimum transmit power of data rate c is f _k(c)/g _k

$0\≤p\left(\stackrel{\→}{g}\right)\≤P_{\max }---\left(2\right)$

Formula (2) has represented to distribute to the power of this user k

Can not be greater than the maximum transmission power of system.

$E(c_k\left(p\right)\·1_{\{Q\left(\stackrel{\→}{g}\right)=k\}})\≥C_k---\left(3\right)$

Formula (3) has been represented each user's data transmission rate defeated speed that can not be below the average reportedly.

Wherein, C _kBe the mean data rate requirement of user k, $1_A=\left\{\begin{array}{cc}1& \mathrm{ifAoccurs}\\ 0& \mathrm{else}\end{array}\right..$

$d_k\left(t\right)<D_k^{\max }---\left(4\right)$

Wherein, d _k(t) be the stand-by period of user k formation head of the queue packet; D _k ^MaxBe the maximum delay that preset user k can bear, formula (4) has represented that the stand-by period of user k formation head of the queue packet should satisfy the maximum delay that can bear less than user k, surpasses D for the stand-by period _k ^MaxPacket can be dropped usually.

Fig. 1 is the flow chart of the inventive method, and K user arranged in the supposing the system, and system adopts the TDM mode promptly to send data only for a user dispatching cycle; Simultaneously for convenience of description, only consider single cell conditions, suppose that the base station is positioned at center of housing estate, adopt the omnidirectional antenna structure.As shown in Figure 1, the inventive method may further comprise the steps:

Step 100: the base station is according to the channel gain that each subscriber board measures, and obtains the rate scheduling priority that the average transmission rate that satisfies each user requires.

Before this step, this method also comprises: each SS in the BS coverage measures channel gain between self and BS in each dispatching cycle, and the channel gain that measures is fed back to BS.The measurement of channel gain and feedback method specific implementation belong to technology as well known to those skilled in the art, and irrelevant with the inventive method, can repeat no more here referring to related protocol.

Suppose $P(Q,p)=\underset{k=1}{\overset{K}{\mathrm{\&Sigma;}}}E(p\left(\stackrel{\&RightArrow;}{g}\right)\&CenterDot;1_{\{Q\left(\stackrel{\&RightArrow;}{g}\right)=k\}}),$ Packet scheduling and power distribution strategies { Q, the average transmitting power of system during p} are used in expression.Wherein, $Q\left(\stackrel{\&RightArrow;}{g}\right)=k,Q\left(\stackrel{\&RightArrow;}{g}\right)\&Element;\{\mathrm{1,2}\&CenterDot;\&CenterDot;\&CenterDot;K,\mathrm{Null}\},$ Q is a scheduling strategy; If $Q\left(\stackrel{\&RightArrow;}{g}\right)=k,k=\mathrm{1,2}\&CenterDot;\&CenterDot;\&CenterDot;K,$ Show that user k is scheduled in the current dispatching cycle; If $Q\left(\stackrel{\&RightArrow;}{g}\right)=\mathrm{Null},$ The channel condition that shows all users is all poor, and current dispatching cycle does not transmit data for Any user.

Take all factors into consideration formula (the 1)～formula (3) in the above-mentioned Mathematical Modeling, it is as follows to use Lagrange (Lagrange) multiplier method can get formula (5):

$L\left(\stackrel{\&RightArrow;}{\mathrm{\&lambda;}}\right)=\underset{k=1}{\overset{K}{\mathrm{\&Sigma;}}}E(p\left(\stackrel{\&RightArrow;}{g}\right)\&CenterDot;1_{\{Q\left(\stackrel{\&RightArrow;}{g}\right)=k\}})-\underset{k=1}{\overset{K}{\mathrm{\&Sigma;}}}{\mathrm{\&lambda;}}_k(E(c_k\left(p\right)\&CenterDot;1_{\{Q\left(\stackrel{\&RightArrow;}{g}\right)=k\}})-C_k)$

$=E(\underset{k=1}{\overset{K}{\mathrm{\&Sigma;}}}(p\left(\stackrel{\&RightArrow;}{g}\right)-{\mathrm{\&lambda;}}_k{c}_k\left(p\right))\&CenterDot;1_{\{Q\left(\stackrel{\&RightArrow;}{g}\right)=k\}})+\underset{k=1}{\overset{K}{\mathrm{\&Sigma;}}}{\mathrm{\&lambda;}}_k{C}_k---\left(5\right)$

Wherein, suppose: $l_k(\stackrel{\&RightArrow;}{\mathrm{\&lambda;}},\stackrel{\&RightArrow;}{g},p)=p\left(\stackrel{\&RightArrow;}{g}\right)-{\mathrm{\&lambda;}}_{k}c\left(p\right)---\left(6\right)$

${p_k}^{*}\left(\stackrel{\&RightArrow;}{\mathrm{\&lambda;}}\right)=\underset{0\&le;p\left(\stackrel{\&RightArrow;}{g}\right)\&le;P_{\max }}{\arg \min }{l}_k(\stackrel{\&RightArrow;}{\mathrm{\&lambda;}},\stackrel{\&RightArrow;}{g},p)---\left(7\right)$

${l_k}^{*}(\stackrel{\&RightArrow;}{\mathrm{\&lambda;}},\stackrel{\&RightArrow;}{g})=l_k(\stackrel{\&RightArrow;}{\mathrm{\&lambda;}},\stackrel{\&RightArrow;}{g},{p_k}^{*}(\stackrel{\&RightArrow;}{\mathrm{\&lambda;}},\stackrel{\&RightArrow;}{g}))---\left(8\right)$

Obviously, $l_k(\stackrel{\&RightArrow;}{\mathrm{\&lambda;}},\stackrel{\&RightArrow;}{g},0)=0,$ Therefore, ${l_k}^{*}(\stackrel{\&RightArrow;}{\mathrm{\&lambda;}},\stackrel{\&RightArrow;}{g})\&le;0.$

If there is the rate scheduling priority factor

Make:

$E(c_k\left(p^{*}\right)\&CenterDot;1_{\{Q^{*}\left(\stackrel{\&RightArrow;}{g}\right)=k\}})=C_k---\left(9\right)$

Wherein, $Q^{*}\left(\stackrel{\&RightArrow;}{g}\right)=\underset{k}{\arg \min }{l_k}^{*}({\stackrel{\&RightArrow;}{\mathrm{\&lambda;}}}^{*},\stackrel{\&RightArrow;}{g})---\left(10\right)$

So, { Q ^*, p ^*It is an optimal solution of formula (1)～(3).

If f _k(c) be the increasing function of c, and f _k(0)=0, above-mentioned conclusion will all be set up.According to formula (9), the optimal scheduling scheme has minimum for choosing in all activated user's set

The user and for its transmission data, promptly ${l_k}^{*}({\stackrel{\&RightArrow;}{\mathrm{\&lambda;}}}^{*},\stackrel{\&RightArrow;}{g})\&le;{\min }_j{l_j}^{*}({\stackrel{\&RightArrow;}{\mathrm{\&lambda;}}}^{*},\stackrel{\&RightArrow;}{g}).$

In this step, will

Regard the rate scheduling priority of distributing as user k as, the user that rate scheduling priority is the highest is $Q^{*}\left(\stackrel{\&RightArrow;}{g}\right)=\underset{k}{\arg \max }\{-{l_k}^{*}({\stackrel{\&RightArrow;}{\mathrm{\&lambda;}}}^{*},\stackrel{\&RightArrow;}{g})\}.$

In order to obtain rate scheduling priority Need obtain the rate scheduling priority factor

Owing to require the rate scheduling priority factor Choose and make formula (9) to set up, therefore, the rate scheduling priority factor

With

Probability distribution be related.In real system,

Probability distribution can't know in advance, therefore, can only be to the rate scheduling priority factor

Estimate, find the rate scheduling priority factor

Make for all k, have $E(c_k\left(p\right)\&CenterDot;1_{\{Q\left(\stackrel{\&RightArrow;}{g}\right)=k\}})=C_k.$

By above analysis as can be known, rate scheduling priority factor λ _k ^*It is equation $g\left({\mathrm{\&lambda;}}_k\right)=E(c_k\left(p\right)\&CenterDot;1_{\{Q\left(\stackrel{\&RightArrow;}{g}\right)=k\}})-C_k=0$ Root, the method for obtaining this equation root is a lot, here to adopt the stochastic approximation method to ask for rate scheduling priority factor λ _k ^*For example is simply introduced, derivation can be with reference to pertinent literature in detail.

Rate scheduling priority factor λ _k ^*The available formula of acquisition (11) shown in alternative manner obtain:

${\mathrm{\&lambda;}}_k^{i+1}={\mathrm{\&lambda;}}_k^i+{\mathrm{\&alpha;}}^i(C_k-E(c_k\left(p\right)\&CenterDot;1_{\{Q\left(\stackrel{\&RightArrow;}{g}\right)=k\}}))---\left(11\right)$

Suitably choose iteration step length α ⁱ, such as iteration step length α ⁱ=0.001, λ ⁱ _kWith convergence with probability 1 in rate scheduling priority factor λ _k ^*In the formula (11) $E(c_k\left(p\right)\&CenterDot;1_{\{Q\left(\stackrel{\&RightArrow;}{g}\right)=k\}})$ Can adopt formula (12) to obtain:

Wherein, i represents described base station i;

Be the mean data rate of user k, β is a weight coefficient, chooses according to actual needs, supposes to wish the current accessible data rate c of user k _k(p) mean data rate of statistics and before this user k, to the mean data rate of active user k to influence proportion identical, then desirable weight coefficient β=1/2.

With formula (12) substitution formula (11), it is as follows to get formula (13):

${\mathrm{\&lambda;}}_k^{i+1}={\mathrm{\&lambda;}}_k^i+{\mathrm{\&alpha;}}^i(C_k-{\stackrel{\&OverBar;}{R}}_k^i)---\left(13\right)$

Wherein, λ _k ⁰The expression initial value is taken as 0.

Step 101: the base station obtains the time delay dispatching priority that satisfies the packet stand-by period.Time delay dispatching priority PRI_wait _k(t) with packet stand-by period d _k(t) cost function shown in the available formula of relation (14) is represented:

$\mathrm{PRI}+{\mathrm{wait}}_k\left(t\right)=\left\{\begin{array}{cc}{\mathrm{m\&alpha;}}^{\&prime;}\&CenterDot;e^{-(D_k^{\max }-d_k\left(t\right))/{\mathrm{\&alpha;}}^{\&prime;}}& d_k\left(t\right)\&le;D_k^{\max }\\ 0& d_k\left(t\right)>D_k^{\max }\end{array}---\left(14\right)\right.$

Wherein, m is positive constant, and α ' is the average latency of packet.Based on the characteristic of streaming media service, for surpassing valid expiration date D _k ^MaxFlow media data packet, take packet loss to handle usually, so (14) can be write as shown in Equation (15):

$\mathrm{PRI}\_{\mathrm{wait}}_k\left(t\right)={\mathrm{m\&alpha;}}^{\&prime;}\&CenterDot;e^{-(D_k^{\max }-d_k\left(t\right))/{\mathrm{\&alpha;}}^{\&prime;}},d_k\left(t\right)\&le;D_k^{\max }---\left(15\right)$

Step 102: rate scheduling priority and time delay dispatching priority according to obtaining, obtain transmission priority, according to sending the priority scheduling user, and so that the hour the most corresponding transmitted power of rate scheduling priority as scheduled user's transmitted power.

In this step, each user's transmission priority P RI _k(t) be about rate scheduling priority

With head of the queue packet stand-by period d _k(t) function, as shown in Equation (16):

${\mathrm{PRI}}_k\left(t\right)=F\{-{l_k}^{*}(\stackrel{\&RightArrow;}{\mathrm{\&lambda;}},\stackrel{\&RightArrow;}{g}),d_k\left(t\right)\}---\left(16\right)$

Wherein, F{} represent about

And d _k(t) function.

Send in the process of priority definite each user, when user's rate scheduling priority

When size is identical or close, send pri function

According to individual queue head of the queue packet stand-by period d _k(t) the transmission priority P RI of differentiation different user _k(t), promptly send priority P RI _k(t) in rate scheduling priority

Variation tendency when identical is for sending priority about d _k(t) function, as shown in Equation (17):

$\frac{\&PartialD;{\mathrm{PRI}}_k\left(t\right)}{\&PartialD;(-{l_k}^{*}(\stackrel{\&RightArrow;}{\mathrm{\&lambda;}},\stackrel{\&RightArrow;}{g}))}=a\&CenterDot;\mathrm{PRI}\_\mathrm{wai}{t}_k\left(t\right)---\left(17\right)$

Wherein, a represents and d _k(t) incoherent function part.

In like manner, at each head of the queue packet stand-by period d _kWhen (t) identical or close, send priority P RI _k(t) variation tendency is for sending priority about rate scheduling priority

Function, as shown in Equation (18):

$\frac{{\&PartialD;\mathrm{PRI}}_k\left(t\right)}{\&PartialD;d_k\left(t\right)}=-b\&CenterDot;{l_k}^{*}(\stackrel{\&RightArrow;}{\mathrm{\&lambda;}},\stackrel{\&RightArrow;}{g})---\left(18\right)$

Wherein, b represents and rate scheduling priority

Incoherent function part.

Comprehensively (17) and (18) two formulas can obtain the transmission priority P RI of individual queue in each channel resource unit _k(t) as shown in Equation (19):

${\mathrm{PRI}}_k\left(t\right)=-{\mathrm{\&theta;}}_1\&CenterDot;{l_k}^{*}(\stackrel{\&RightArrow;}{\mathrm{\&lambda;}},\stackrel{\&RightArrow;}{g})\&CenterDot;\mathrm{PRI}\_{\mathrm{wait}}_k\left(t\right)+{\mathrm{\&theta;}}_0---\left(19\right)$

Wherein, θ ₀And θ ₁Be constant, suppose θ=θ ₁M α ⁱ=1, θ ₀=0, with formula (19) substitution (15), can get that each user sends priority P RI in the actual engineering _k(t) as shown in Equation (20):

${\mathrm{PRI}}_k\left(t\right)={-\mathrm{\&theta;}}_1\&CenterDot;l_k^{*}(\stackrel{\&RightArrow;}{\mathrm{\&lambda;}},\stackrel{\&RightArrow;}{g})\&CenterDot;{\mathrm{m\&alpha;}}^{\&prime;}\&CenterDot;e^{-(D_k^{\max }-d_k\left(t\right))/{\mathrm{\&alpha;}}^{\&prime;}}+{\mathrm{\&theta;}}_0$

$=-\mathrm{\&theta;}\&CenterDot;l_k^{*}(\stackrel{\&RightArrow;}{\mathrm{\&lambda;}},\stackrel{\&RightArrow;}{g})\&CenterDot;e^{-(D_k^{\max }-d_k\left(t\right))/{\mathrm{\&alpha;}}^{\&prime;}}+{\mathrm{\&theta;}}_0---\left(20\right)$

$=-l_k^{*}(\stackrel{\&RightArrow;}{\mathrm{\&lambda;}},\stackrel{\&RightArrow;}{g})\&CenterDot;e^{-(D_k^{\max }-d_k\left(t\right))/{\mathrm{\&alpha;}}^{\&prime;}}$

According to the calculating of formula (20), to sending priority P RI _k(t) maximum user k sends data, wherein user k _MaxShown in formula (21):

$k_{\max }=\arg \underset{k}{\max }\left\{{\mathrm{PRI}}_k\left(t\right)\right\},\&ForAll;k=\mathrm{1,2},\&CenterDot;\&CenterDot;\&CenterDot;K---\left(21\right)$

Wherein, K is the system user number.

Further, transmitted power adopts formula (7) to determine, is about to make the transmitted power of the hour the most corresponding transmitted power of rate scheduling priority as the scheduled user.

From the technical scheme of the embodiment of the invention as seen, the technical scheme of the embodiment of the invention is under the prerequisite of average data transfer rate that guarantees each Business Stream and delay requirement, packet scheduling is combined with power division, make the transmitting power of base station under the statistical average meaning reach minimum, reduced interference other users and sub-district; Simultaneously, when guaranteeing professional long-term behaviour, take into account the short-term performance, had higher construction value.

At said method, the embodiment of the invention also provides a kind of system that unites packet scheduling and power division, and as shown in Figure 2, Fig. 2 is the composition frame chart of system of the present invention, and this system comprises: base station and subscriber board, wherein,

Described subscriber board is used for the measured channel gain;

Described base station is used for according to described channel gain, obtains the rate scheduling priority that the average transmission rate that satisfies each user requires and obtains the time delay dispatching priority that satisfies the packet stand-by period; According to described rate scheduling priority and time delay dispatching priority, obtain transmission priority, according to described transmission priority scheduling user, and so that the hour the most corresponding transmitted power of rate scheduling priority as scheduled user's transmitted power.

Base station of the present invention comprises at least: channel gain acquisition module, rate scheduling priority acquisition module, time delay dispatching priority acquisition module, transmission priority acquisition module and scheduler module, wherein,

Described channel gain acquisition module is used to obtain described channel gain;

Described rate scheduling priority acquisition module is used for according to described channel gain, obtains the rate scheduling priority that the average transmission rate that satisfies each user requires;

Described time delay dispatching priority acquisition module is used for according to described channel gain, obtains the time delay dispatching priority that satisfies the packet stand-by period;

Described transmission priority acquisition module is used for obtaining transmission priority according to described rate scheduling priority and time delay dispatching priority;

Described scheduler module is used for according to described transmission priority scheduling user, and so that the hour the most corresponding transmitted power of rate scheduling priority as scheduled user's transmitted power.

The above is preferred embodiment of the present invention only, is not to be used to limit protection scope of the present invention, all any modifications of being made within the spirit and principles in the present invention, is equal to replacement, improvement etc., all should be included within protection scope of the present invention.

Claims (12)

1. a method that realizes power control is characterized in that, said method comprising the steps of:

The channel gain that the base station is measured according to each subscriber board obtains rate scheduling priority that the average transmission rate that satisfies each user requires and the time delay dispatching priority that satisfies the packet stand-by period;

According to described rate scheduling priority and time delay dispatching priority, obtain transmission priority, according to described transmission priority scheduling user, and so that the hour the most corresponding transmitted power of rate scheduling priority as scheduled user's transmitted power.

2. method according to claim 1 is characterized in that, the described method of obtaining the rate scheduling priority that the average transmission rate that satisfies each user requires is:

Obtain the rate scheduling priority factor

, make for all user k have $E(c_k\left(p\right)\&CenterDot;1_{\{Q\left(\stackrel{\&RightArrow;}{g}\right)=k\}})=C_k,$ Wherein $Q^{*}\left(\stackrel{\&RightArrow;}{g}\right)=\underset{k}{\arg \min }{l_k}^{*}({\stackrel{\&RightArrow;}{\mathrm{\&lambda;}}}^{*},\stackrel{\&RightArrow;}{g})$ , the highest user of expression rate scheduling priority; C _kMean data rate requirement for user k; c _k(p) be the accessible data rate of user k;

According to described rate scheduling priority factor

, by ${l_k}^{*}(\stackrel{\&RightArrow;}{\mathrm{\&lambda;}},\stackrel{\&RightArrow;}{g})=l_k(\stackrel{\&RightArrow;}{\mathrm{\&lambda;}},\stackrel{\&RightArrow;}{g},{p_k}^{*}(\stackrel{\&RightArrow;}{\mathrm{\&lambda;}},\stackrel{\&RightArrow;}{g}))$ The computation rate dispatching priority, wherein ${p_k}^{*}(\stackrel{\&RightArrow;}{\mathrm{\&lambda;}},\stackrel{\&RightArrow;}{g})=\underset{0\&le;p\left(\stackrel{\&RightArrow;}{g}\right)\&le;P_{\max }}{\arg \min }{l}_k(\stackrel{\&RightArrow;}{\mathrm{\&lambda;}},\stackrel{\&RightArrow;}{g},p)$ , be transmitted power; $\stackrel{\&RightArrow;}{g}=\{g_{i1},g_{i2},\&CenterDot;\&CenterDot;\&CenterDot;g_{\mathrm{iK}}\}$ Vector for described channel gain.

3. method according to claim 2 is characterized in that, the described rate scheduling priority factor that obtains

Method be: accounting equation $g\left({\mathrm{\&lambda;}}_k\right)E(c_k\left(p\right)\&CenterDot;1_{\{Q\left(\stackrel{\&RightArrow;}{g}\right)=k\}})-C_k=0$ Root.

4. method according to claim 3 is characterized in that, in the described equation $E(c_k\left(p\right)\&CenterDot;1_{\{Q\left(\stackrel{\&RightArrow;}{g}\right)=k\}})$ Acquisition methods be: calculate

, wherein

Mean data rate for user k; β is a weight coefficient, 0＜β＜1; I represents described base station.

5. method according to claim 1 is characterized in that, the described method of obtaining the time delay dispatching priority that satisfies the packet stand-by period is:

$d_k\left(t\right)\&le;D_k^{\max }$ The time, the time delay dispatching priority $\mathrm{PRI}\_{\mathrm{wait}}_k\left(t\right)={\mathrm{m\&alpha;}}^{\&prime;}\&CenterDot;e^{-(D_k^{\max }-d_k\left(t\right))/{\mathrm{\&alpha;}}^{\&prime;}},$ Wherein, m is positive constant; α ' is the average latency of packet; d _k(t) be the stand-by period of user k formation head of the queue packet; D _k ^MaxThe maximum delay that can bear for preset user k.

6. method according to claim 5 is characterized in that, the described method that sends priority of obtaining is:

Send priority ${\mathrm{PRI}}_k\left(t\right)=-{\mathrm{\&theta;}}_1\&CenterDot;{l_k}^{*}(\stackrel{\&RightArrow;}{\mathrm{\&lambda;}},\stackrel{\&RightArrow;}{g})\&CenterDot;\mathrm{PRI}\_{\mathrm{wait}}_k\left(t\right)+{\mathrm{\&theta;}}_0,$ Wherein, θ ₀And θ ₁Be constant; PRI_wait _k(t) be Delay Priority;

Be rate scheduling priority.

7. method according to claim 6 is characterized in that, if described θ ₁M α '=1, described θ ₀=0, then described transmission priority is ${\mathrm{PRI}}_k\left(t\right)=-l_k^{*}(\stackrel{\&RightArrow;}{\mathrm{\&lambda;}},\stackrel{\&RightArrow;}{g})\&CenterDot;e^{-(D_k^{\max }-d_k\left(t\right))/{\mathrm{\&alpha;}}^{\&prime;}}.$

8. method according to claim 1 is characterized in that, the method for described scheduling is: to the user k of described transmission priority maximum _MaxSend data;

Wherein $k_{\max }=\arg \underset{k}{\max }\left\{{\mathrm{PRI}}_k\left(t\right)\right\}$ $\&ForAll;k=\mathrm{1,2},\&CenterDot;\&CenterDot;\&CenterDot;K,$ K is the system user number.

9. method according to claim 8 is characterized in that, the transmitted power of described transmission data is:

Transmitted power ${p_k}^{*}(\stackrel{\&RightArrow;}{\mathrm{\&lambda;}},\stackrel{\&RightArrow;}{g})=\underset{0\&le;p\left(\stackrel{\&RightArrow;}{g}\right)\&le;P_{\max }}{\arg \min }{l}_k(\stackrel{\&RightArrow;}{\mathrm{\&lambda;}},\stackrel{\&RightArrow;}{g},p)$ , wherein, P _MaxMaximum transmission power for system; $\stackrel{\&RightArrow;}{g}=\{g_{i1},g_{i2},\&CenterDot;\&CenterDot;\&CenterDot;g_{\mathrm{iK}}\}$ Be the vector of described channel gain, $l_k(\stackrel{\&RightArrow;}{\mathrm{\&lambda;}},\stackrel{\&RightArrow;}{g},p)=p\left(\stackrel{\&RightArrow;}{g}\right)-{\mathrm{\&lambda;}}_{k}c\left(p\right).$

10. system that realizes power control is characterized in that described system comprises: subscriber board and base station, wherein,

Described subscriber board is used for the measured channel gain;

Described base station is used for according to described channel gain, obtains rate scheduling priority that the average transmission rate that satisfies each user requires and the time delay dispatching priority that satisfies the packet stand-by period; According to described rate scheduling priority and time delay dispatching priority, obtain transmission priority, according to described transmission priority scheduling user, and so that the hour the most corresponding transmitted power of rate scheduling priority as scheduled user's transmitted power.

11. system according to claim 10 is characterized in that, described base station comprises: channel gain acquisition module, rate scheduling priority acquisition module, time delay dispatching priority acquisition module, transmission priority acquisition module and scheduler module, wherein,

Described channel gain acquisition module is used to obtain described channel gain;

Described rate scheduling priority acquisition module is used for according to described channel gain, obtains the rate scheduling priority that the average transmission rate that satisfies each user requires;

Described time delay dispatching priority acquisition module is used for according to described channel gain, obtains the time delay dispatching priority that satisfies the packet stand-by period;

Described transmission priority acquisition module is used for obtaining transmission priority according to described rate scheduling priority and time delay dispatching priority;

Described scheduler module is used for according to described transmission priority scheduling user, and so that the hour the most corresponding transmitted power of rate scheduling priority as scheduled user's transmitted power.

12. a base station is characterized in that, described base station comprises: channel gain acquisition module, rate scheduling priority acquisition module, time delay dispatching priority acquisition module, transmission priority acquisition module and scheduler module, wherein,

Described channel gain acquisition module is used to obtain described channel gain;

Described rate scheduling priority acquisition module is used for according to described channel gain, obtains the rate scheduling priority that the average transmission rate that satisfies each user requires;

Described time delay dispatching priority acquisition module is used for according to described channel gain, obtains the time delay dispatching priority that satisfies the packet stand-by period;

Described transmission priority acquisition module is used for obtaining transmission priority according to described rate scheduling priority and time delay dispatching priority;

Described scheduler module is used for according to described transmission priority scheduling user, and so that the hour the most corresponding transmitted power of rate scheduling priority as scheduled user's transmitted power.

Images