CN101646240B - Relay enhancement type cellular system and cross-layer avarice proportional fairness dispatching method thereof - Google Patents

Abstract

The invention discloses a relay enhancement type cellular system and a cross-layer avarice proportional fairness dispatching method thereof. The relay enhancement type system comprises m single-antenna transceivers and p single-antenna two-way relays, and one single-antenna transceiver in the m single-antenna transceivers is used as a base station and comprises a queue buffer and a dispatcher. the cross-layer avarice proportional fairness dispatching method comprises the following steps: firstly, using avarice proportional fairness dispatching to completely and determining occupied resources of users; and secondly, under the consideration of a system network layer, distributing the radio resources again according to the basic requirements of different kinds of service of the users. The relay enhancement type system effectively avoids system source waste caused by a multi-user dispatching algorithm of the traditional relay enhancement type cellular system because different service requirements are not considered, and reduces the stability of system communication. Compared with the prior relay communication system, the relay enhancement type cellular system realizes a higher system resource utilization ratio.

Description

Relaying enhanced honeycomb system and cross-layer avarice proportional fairness dispatching method thereof

Technical field

The present invention relates to a kind of multi-user wireless communication system that is applied to, relate in particular to a kind ofly, belong to wireless communication field based on relaying enhanced honeycomb system cross-layer avarice proportional fairness dispatching algorithm.

Background technology

Research shows; The waste of the power resource that can reduce path loss effectively and caused based on the wireless communication network architecture of relaying; Improve the availability of frequency spectrum; And the multi-hop of self-organizing ad hoc net capable of using is communicated with the survivability ability that thought improves network; So network configuration and cooperation frequency multiplexing technique based on relaying have obtained broad research and concern, and when the formulation of standards such as next-generation mobile communications, WLAN and broadband wireless network, have all considered how to introduce the problem of relaying collaborative process.Multi-subscriber dispatching strategy through designing in the novel relaying enhanced honeycomb system can effectively improve systematic function.

The relaying enhanced honeycomb system has improved the user communication quality of cell edge area and hot zones by the relaying subsidiary communications, has enlarged the sub-district area coverage, has increased the system spectral resources utilance simultaneously, has promoted the cellular communication system overall performance.Yet because the increase of via node, traditional sub-district multi-subscriber dispatching and resource allocation algorithm are no longer suitable, and novel Algorithm design becomes the key issue of relaying enhanced honeycomb system research.

Usage factor of system resource in wireless communication system and message volume are to weigh the important indicator of systematic function; Different with conventional cellular systems, the relaying enhanced honeycomb system needs reasonably to distribute the system resource of first sub-slots and second sub-slots, for each user in the system; The resource allocation of these two sub-slots is interactional; Therefore be difficult to find optimum algorithm, in order to seek the algorithm of suboptimum, common relaying strengthens the dispatching algorithm of cellular system two sub-slots is independently considered; The scheduling strategy of two sub-slots of promptly artificial hypothesis is independent of each other; Thereby the multi-subscriber dispatching algorithm of this system can be regarded the multi-subscriber dispatching of following two time slots stack of conventional cellular systems as, thereby the multi-subscriber dispatching algorithm that can use in the existing conventional cellular systems is generalized to the relaying enhanced honeycomb system, then; Because the people has ignored influencing each other of two sub-timeslot scheduling strategies; And be the basic demand of the different business that loads of different user, making that Radio Resource is wasted in the system, resource utilization ratio is lower; Also possibly make system's practical communication traffic carrying capacity descend because can't satisfy business demand simultaneously, packet loss and packet delay increase.

In sum; Still there is certain defective in prior art to improving resource utilization ratio, the availability of frequency spectrum and assurance system communication quality of service; Be maximization system and speed; The optimization system wireless resource utility efficiency improves the system communication quality of service simultaneously, and it is significant how in the relaying enhanced honeycomb system, to design a kind of layer multi-subscriber dispatching algorithm of striding efficiently.

Summary of the invention

Technical problem: to the shortcoming of prior art; The invention provides and a kind ofly can significantly improve the system spectrum utilance, keep the multi-subscriber dispatching fairness and improve the system communication quality of service based on relaying enhanced honeycomb system and cross-layer avarice proportional fairness dispatching method thereof.

Technical scheme: relaying enhanced honeycomb system of the present invention; Comprise m single antenna transceiver and p the two-way relaying of single antenna; A single antenna transceiver in m single antenna transceiver is set to the base station; The single antenna transceiver is communicated by letter with user's double bounce through the two-way relaying of single antenna or is communicated by letter with the direct jumping of user, and wherein m and p are natural number, it is characterized in that the transceiver that serves as the base station also comprises formation buffer and packet scheduler; The formation buffer is connected with packet scheduler is two-way, and the output termination of packet scheduler is served as the input of modulator of the transceiver of base station.

The cross-layer avarice proportional fairness dispatching method of described relaying enhanced honeycomb system is characterized in that comprising the steps:

Step 1: the initialization of scheduling for the first time in the sub-slots 2

Initialization current time one is jumped the transmission rate r of user k and double bounce user i respectively _k(t)=0, $r_i^{\left(2\right)}\left(t\right)=0$ And the sub-carrier set C that occupies _k=Φ, C _i=Φ, wherein k ∈ U ₁, i ∈ U ₂, subscript 2 expression double bounce users' second jump link, and t representes current time, and Φ representes empty set, U ₁User's collection, U are jumped in expression one ₂Expression double bounce user collects down together;

Step 2: the first sub-distribution of subcarrier

(1) adopt all subcarrier n last to jump the transmission rate r of user k and double bounce user i _{K, n}(t), r _{I, n} ⁽²⁾(t), select to have

Peaked user k ^*, wherein n ∈ 1,2 ..., N} is a sub-carrier indices number, and N is a sub-carrier number, and n, N are natural number,

Represent a jumping user k and double bounce user i respectively at preceding t average transmission rate constantly, down together;

(2) all subcarrier n are distributed to the described user k of step (1) ^*, upgrade the transmission rate r of this user simultaneously at current time _K*(t) and take sub-carrier set

$r_{k*}\left(t\right)\←r_{k*}\left(t\right)+r_{k^{*},n}\left(t\right),$ $C_{k^{*}}\←C_{k^{*}}+\left\{n\right\},$ Wherein ← the expression assignment, The described user k of expression step (1) ^*Transmission rate on subcarrier, down together;

(3) as the described user k of step (1) ^*∈ U ₁, then upgrade this user cache queue length and do $Q_{k^{*}}\left(t\right)\←Q_{k^{*}}\left(t\right)-\frac{r_{k^{*},n}\left(t\right)\·T_0}{F};$ As the described user k of step (1) ^*∈ U ₂, the length of buffer queue that then upgrades in the affiliated relay station of this user does $Q_{k^{*}}^{\mathrm{Relay}}\left(t\right)\←Q_{k^{*}}^{\mathrm{Relay}}\left(t\right)-\frac{r_{k^{*}}^{\left(2\right)}\left(t\right)\·T_0}{F},$ Wherein F representes BTS service formation buffer storage length, T ₀Represent a time slot scheduling,

The described user k of expression step (1) ^*Transmission rate;

(4) but upgrade the dispatched users collection

As the described user k of the step that is scheduled (1) ^*Length of buffer queue $Q_{k^{*}}\left(t\right)\≤0$ Or the length of buffer queue in the relay station under this user $Q_{k^{*}}^{\mathrm{Relay}}\left(t\right)\≤0,$ Remove but then this user is concentrated from dispatched users, i.e. U ₁← U ₁-{ k ^*Or U ₂← U ₂-{ k ^*;

Step 3: upgrade a jumping user k and double bounce user i at preceding t+1 average transmission rate

k ∈ { 1 constantly; 2;, K};

Step 4: the initialization of scheduling for the second time in the sub-slots 2

Initialization can be by the sub-carrier set A of sub-distribution again _δ=Φ and affiliated user thereof collect δ=Φ;

Step 5: based on step (4) but the dispatched users set pair user after update system classification obtains the sub-carrier set that can be redistributed simultaneously

Instantly one constantly is that t+1 one jumps or double bounce user k constantly, and i satisfies r _k(t+1)>=max{ α _k, β _kOr $r_i^{\left(2\right)}(t+1)\≥\mathrm{Max}\{{\mathrm{\α}}_{i,2},{\mathrm{\β}}_{i,2}\},$ δ ← δ+{ k}, A then _δ← A _δ+ C _kOr δ ← δ+{ i}, A _δ← A _δ+ C _i, wherein max{} is a maximization operator clips, and min{} is for minimizing operator, and α, β represent to guarantee that user's packet loss retrains and the lower bound of the transmission rate of packet delay constraint, down together;

Step 6: reschedule step 5 described can by once more the scheduling subcarrier

(a) when all can by once more the scheduling subcarrier n ' ∈ A _δSatisfy r _k(t+1)-r _{K, n '}(t+1)>=max{ α _k, β _kOr $r_i^{\left(2\right)}(t+1)-r_{i,n^{\′}}^{\left(2\right)}(t+1)\≥\mathrm{Max}\{{\mathrm{\α}}_{i,2},{\mathrm{\β}}_{i,2}\},$ Then said can being rescheduled by the subcarrier of scheduling once more;

(b) confirm to have in the described subcarrier that can be rescheduled of step a

Peaked user j ^*, j ∈ δ wherein ^c, δ ^cFor not satisfying business demand constraint user collection, r _{J, n '}(t+1), r _{J, n '} ⁽²⁾(t+1) be respectively and do not satisfy among the business demand constraint user j one and jump the transmission rate on the described subcarrier that can be rescheduled of step a with two jumping users,

For not satisfying business demand constraint user j at preceding t+1 average transmission rate constantly, down together;

(c) can be given the described user j of step b by the subcarrier allocation of scheduling once more with step a is described ^*, upgrade this user's transmission rate and the sub-carrier set of being occupied simultaneously: $r_{j^{*}}(t+1)\←r_{j^{*}}(t+1)+r_{j^{*},n^{\′}}(t+1)$ Or $r_{j^{*}}^{\left(2\right)}(t+1)\←r_{j^{*}}^{\left(2\right)}(t+1)+r_{j^{*},n^{\′}}^{\left(2\right)}(t+1),$ $C_{j^{*}}\←C_{j^{*}}+\left\{n^{\′}\right\},$ Upgrade the transmission rate of original subscriber m and the sub-carrier set of being occupied: r simultaneously _m(t+1) ← r _m(t+1)-r _{M, n '}(t+1) or $r_m^{\left(2\right)}(t+1)\←r_m^{\left(2\right)}(t+1)-r_{m,n^{\′}}^{\left(2\right)}(t+1),$ C _m(t+1) ← C _m(t+1)-{ n ' }, m ∈ δ;

(d) step of updating a is described can be by the sub-carrier set of dispatching once more, i.e. A _δ← A _δ-{ n ' };

(e) when $r_{j^{*}}(t+1)\≥\mathrm{Max}\{{\mathrm{\α}}_{j^{*}},{\mathrm{\β}}_{j^{*}}\}$ Or $r_{j^{*}}^{\left(2\right)}(t+1)\≥\mathrm{Max}\{{\mathrm{\α}}_{j,2},{\mathrm{\β}}_{j,2}\},$ The described user j of step b then ^*Never satisfy business demand constraint user and concentrate and remove, be i.e. δ ^c(t+1) ← δ ^c(t+1)-{ j ^*;

(f) as the described user j of step b ^*Be the double bounce user, then upgrade two of the affiliated relaying of this user and jump link capacities $R_{l,2}(t+1)\←R_{l,2}(t+1)+r_{j^{*},n^{\′}}^{\left(2\right)}(t+1),$ The described user j of step b ^*Belong to relaying l area under one's jurisdiction;

Step 7: after twice scheduling; Upgrade a jumping user k and double bounce user i next moment t+2 average transmission rate

k ∈ { 1 constantly again; 2;, K};

Step 8: repeating step 1 to step 7 is accomplished the scheduling of sub-slots 1.

Beneficial effect: the present invention proposes a kind of based on layer multi-subscriber dispatching algorithm of striding under the relaying enhanced honeycomb system.Whole scheduling of resource is accomplished in two steps.At first, system realizes the avarice proportional fairness scheduling of resource that the auxiliary double bounce of relaying is communicated by letter according to physical layer information, accomplishes distributing the first time of system resource.Secondly,, take all factors into consideration the demand of the different business that different user loaded in the system, system resource is carried out the second time distribute, improve performances such as resource utilization ratio as far as possible when guaranteeing to satisfy each traffic in order to improve the system communication quality of service.Along with the increase of number of users, the capacity of system constantly promotes.This is because cross-layer scheduling has made full use of multi-user diversity gain.But when the system user number rises, multi-user's increases that gain, thereby also rising thereupon of system's " and capacity ".Compare with proportional fairness dispatch with greedy scheduling in the common relaying enhanced honeycomb system; The novel cross-layer scheduling algorithm that the present invention proposes has promoted the multiple services transmission performance of system greatly; Have only a spot of user can't satisfy the requirement of its business to packet delay, nearly all usefulness satisfies its professional packet loss requirement per family simultaneously.This is because cross-layer scheduling has been taken all factors into consideration the communication constraint and the physical layer performance of system multi-user different business, in the time of maximization system " and capacity ", has satisfied the communication constraint of multi-user's different business as far as possible.Comprehensively can reach a conclusion, the novel cross-layer scheduling algorithm that the present invention proposes, in having loaded multiple services relaying enhanced honeycomb system, its performance is superior to common greediness scheduling and proportional fairness dispatch.

Description of drawings

Fig. 1 is relaying enhanced honeycomb system figure of the present invention

Fig. 2 is a cross-layer scheduling machine structural representation of the present invention.

Fig. 3 is that communication system of the present invention is formed structural representation.

Fig. 4 is in the relaying enhanced system under the different multi-subscriber dispatching algorithms, the simulation curve that system's " and capacity " performance of relaying enhanced honeycomb system cross-layer scheduling changes with number of users.

Fig. 5 is in the relaying enhanced system under the different multi-subscriber dispatching algorithms, the packet delay performance simulation curve of relaying enhanced honeycomb system cross-layer scheduling.

Fig. 6 is in the relaying enhanced system under the different multi-subscriber dispatching algorithms, the packet loss performance simulation curve of relaying enhanced honeycomb system cross-layer scheduling.

Embodiment

Be elaborated below in conjunction with the technical scheme of accompanying drawing to invention:

Like Fig. 1, Fig. 2, shown in Figure 3; Communication system architecture comprise a plurality of single antenna transceivers (be transmitter also be receiver; One of them is as the base station; Remaining is as the user) and the two-way relaying of a plurality of single antenna; Each transceiver is all served as the base station by an OFDM (OFDM) modulator, an ofdm demodulator transceiver also comprises a plurality of user cache formations and packet scheduler, and relaying is made up of the buffer queue of an OFDM modulator, ofdm demodulator and the different user different business of having jurisdiction over, and this relaying is that forward relay is amplified in half-duplex.This multi-user comm adopts the mode of OFDMA as access mode; The full range band of this system is divided into the N number of sub-carrier; In different time slots, system selects according to joint route and the proportional fairness dispatch criterion is divided into two sub-set (subchannel), subcarrier 1 with N (N is a natural number) number of sub-carrier;, N _{1, τ}Be assigned to the double bounce user, subcarrier N _{1, τ}..., N is assigned to one and jumps user's (wherein the τ in the subscript representes timeslot number, when τ=1st, representes sub-slots 1, τ=2 expression sub-slots 2).

Embodiments of the invention disclose a complete communication resource scheduling process and have been divided into two parts, at first, and taking into account system physical layer index only; In double bounce communication, use avarice proportional fairness multi-subscriber dispatching strategy as system in the multi-user accomplish scheduling of resource; Secondly, the different business requirement of different user is carried out two times scheduling with system resource in the coupling system; Guaranteeing to satisfy optimization system resource utilization under the prerequisite of each traffic basic demand, the dispatching criterion of this method is following:

$\mathrm{\π}:\underset{\left\{d\left(t\right)\right\}}{\max }\underset{\mathrm{\τ}=1}{\overset{2}{\mathrm{\Σ}}}\underset{k\∈U_1}{\mathrm{\Σ}}{\log }_2(1+\frac{\underset{n=1}{\overset{N}{\mathrm{\Σ}}}{r}_{k,n}\left(t\right)\·d_{k,n,\mathrm{\τ}}\left(t\right)}{(t_c-1)\stackrel{\‾}{R_k\left(t\right)}})$

$+\underset{i\&Element;{\mathrm{<figure-callout\; id="2"\; label="U"\; filenames="H2009100342224E00022.png"\; state="\{\{state\}\}">U</figure-callout>}}_2}{\mathrm{\&Sigma;}}{\log }_2(1+\frac{\min \{\underset{n=1}{\overset{N}{\mathrm{\&Sigma;}}}{r}_{i,n}^{\left(1\right)}\left(t\right)\&CenterDot;d_{i,n,1}\left(t\right),\underset{n=1}{\overset{N}{\mathrm{\&Sigma;}}}{r}_{i,n}^{\left(2\right)}\left(t\right)\&CenterDot;d_{i,n,2}\left(t\right)\}}{(t_c-1)\stackrel{\&OverBar;}{R_i\left(t\right)}})$

Constraints is:

(1) $\underset{k=1}{\overset{K}{\mathrm{\&Sigma;}}}{d}_{k,n,\mathrm{\&tau;}}\left(t\right)=1,$ d _k，n(t)＝{0，1}， $\&ForAll;\mathrm{\&tau;}\&Element;\left\{\mathrm{1,2}\right\}$

(2) $r_k\left(t\right)\&le;\frac{Q_k\left(t\right)\&CenterDot;\mathrm{<figure-callout\; id="0"\; label="F\; T"\; filenames="H2009100342224E00032.png"\; state="\{\{state\}\}">F</figure-callout>}}{T_{}},$ $\&ForAll;k\&Element;U_1$

$r_i^{\left(1\right)}\left(t\right)\&le;\frac{Q_i^{\mathrm{bs}}\left(t\right)\&CenterDot;F}{{\mathrm{<figure-callout\; id="0"\; label="T"\; filenames="H2009100342224E00032.png"\; state="\{\{state\}\}">T</figure-callout>}}_0},$ $r_i^{\left(2\right)}\left(t\right)\&le;\frac{Q_i^{\mathrm{relay}}\left(t\right)\&CenterDot;F}{{\mathrm{<figure-callout\; id="0"\; label="T"\; filenames="H2009100342224E00032.png"\; state="\{\{state\}\}">T</figure-callout>}}_0},$ $\&ForAll;i\&Element;{\mathrm{<figure-callout\; id="2"\; label="U"\; filenames="H2009100342224E00022.png"\; state="\{\{state\}\}">U</figure-callout>}}_2$

(3)r _k(t)≥max{α _k，β _k}， $\&ForAll;k\&Element;U_1$

$r_j^{\mathrm{Relay}}\left(t\right)\&GreaterEqual;\mathrm{Max}\{\underset{i\&Element;S_j}{\mathrm{\&Sigma;}}{\mathrm{\&alpha;}}_{i,1},\underset{i\&Element;S_j}{\mathrm{\&Sigma;}}{\mathrm{\&beta;}}_{t,1}\},$ $\&ForAll;j\&Element;B_{\mathrm{Relay}}$ (B _RelayExpression via node collection)

$r_i^{\left(2\right)}\left(t\right)\&GreaterEqual;\max \{{\mathrm{\&alpha;}}_{i,2},{\mathrm{\&beta;}}_{i,2}\},$ $\&ForAll;i\&Element;{\mathrm{<figure-callout\; id="2"\; label="U"\; filenames="H2009100342224E00022.png"\; state="\{\{state\}\}">U</figure-callout>}}_2$

In the above-mentioned dispatching criterion, N is a sub-carrier number, and K is a number of users, U ₁User's collection, U are jumped in expression one ₂Expression double bounce user collection, k represent that one jumps user index number, and i representes double bounce user index number, n ∈ 1,2 ..., N} is a sub-carrier indices number, { 1,2} is the time slot call number to τ ∈.r _{K, n}(t), r _{I, n}(t) the expression t moment, user k and the transmission rate of user i on subcarrier n. expression user k and user i are at preceding t average transmission rate constantly.d _{K, n, τ}(t) characterized t constantly, whether subcarrier n has distributed to user k at time slot τ.Q _k(t), Q _i(t) length of buffer queue of expression user k and user i, F representes system base-station service queue buffer storage length, T ₀Represent a time slot scheduling, t _cThe time of expression experience.α, β are respectively the lower bound of the transmission rate r (t) that guarantees constraint of user's packet loss and packet delay constraint.S _jUser's collection of expression relaying j subsidiary communications.The max{}-maximization operator clips, min{}-minimizes operator, ∑ ()-summation operation.Down together.

The concrete steps of this method are following:

Step 1: accomplish the initialization of scheduling (promptly only considering the avarice proportional fairness dispatching of physical layer) for the first time in the sub-slots 2: for all user k ∈ U ₁, i ∈ U ₂, transmission rate r constantly is somebody's turn to do in initialization _k(t)=0, $r_i^{\left(2\right)}\left(t\right)=0,$ And the sub-carrier set C that each user occupied _k=Φ, G _i=Φ.(wherein subscript (2) expression double bounce user's second jump link, Φ representes empty set.)

Step 2: in order to optimize the resource utilization ratio in the scheduling for the first time, adopt avarice proportional fairness multi-subscriber dispatching strategy, accomplish first sub-distribution to system subcarrier.

For all subcarrier n=1: N, carry out following round-robin scheduling:

(1) calculates each user's transmission rate { r under this subcarrier n _{K, n}(t), r _{I, n} ⁽²⁾(t) }, k ∈ U ₁, i ∈ U ₂, select to have

Peaked user k ^*

(2) give user k with this subcarrier allocation ^*, upgrade the transmission rate r of this user simultaneously at moment t _K*(t) and take sub-carrier set

$r_{k*}\left(t\right)\&LeftArrow;r_{k*}\left(t\right)+r_{k^{*},n}\left(t\right),$ $C_{k^{*}}\&LeftArrow;C_{k^{*}}+\left\{n\right\}.$

(3) if k ^*∈ U ₁, upgrade this user cache queue length and do $Q_{k^{*}}\left(t\right)\&LeftArrow;Q_{k^{*}}\left(t\right)-\frac{r_{k^{*},n}\left(t\right)\&CenterDot;T_0}{F};$ If k ^*∈ U ₂, the length of buffer queue that upgrades in the affiliated relay station of this user does $Q_{k^{*}}^{\mathrm{Relay}}\left(t\right)\&LeftArrow;Q_{k^{*}}^{\mathrm{Relay}}\left(t\right)-\frac{r_{k^{*}}^{\left(2\right)}\left(t\right)\&CenterDot;T_0}{F}.$

(4) based on the constraints in this scheduling result and the dispatching criterion (2), but the dispatched users collection of update system:

If the scheduled user is k ^*Length of buffer queue $Q_{k^{*}}\left(t\right)\&le;0$ Or $Q_{k^{*}}^{\mathrm{Relay}}\left(t\right)\&le;0,$ Remove but then this user is concentrated from dispatched users, i.e. U ₁← U ₁-{ k ^*Or U ₂← U ₂-{ k ^*.

Step 3: upgrade a jumping user k and double bounce user i at preceding t+1 average transmission rate

k ∈ { 1 constantly; 2;, K};

Step 4: the initialization of scheduling for the second time in the sub-slots 2 (being the system resource that different business that different user loads requires to carry out dispatches again): initialization can be by the sub-carrier set A of sub-distribution again _δ=Φ, and affiliated user collects δ=Φ.

Step 5: according to the first time scheduling result user is classified, obtain the sub-carrier set that can be redistributed simultaneously:

With user classification, and obtain the sub-carrier resources that can redistribute according to the constraints that satisfies dispatching criterion (3): if one jump or double bounce user k, i satisfies r _k(t)>=max{ α _k, β _kOr $r_i^{\left(2\right)}\left(t\right)\&GreaterEqual;\mathrm{Max}\{{\mathrm{\&alpha;}}_{i,2},{\mathrm{\&beta;}}_{i,2}\},$ δ ← δ+{ k}, A then _δ← A _δ+ C _k, or δ ← δ+{ i}, A _δ← A _δ+ C _i

Step 6: reschedule step 5 described can by once more the scheduling subcarrier

(a) when all can by once more the scheduling subcarrier n ' ∈ A _δSatisfy r _k(t+1)-r _{K, n '}(t+1)>=max{ α _k, β _kOr $r_i^{\left(2\right)}(t+1)-r_{i,n^{\&prime;}}^{\left(2\right)}(t+1)\&GreaterEqual;\mathrm{Max}\{{\mathrm{\&alpha;}}_{i,2},{\mathrm{\&beta;}}_{i,2}\},$ Then said can being rescheduled by the subcarrier of scheduling once more;

(b) confirm to have in the described subcarrier that can be rescheduled of step a

Peaked user j ^*, j ∈ δ wherein ^c, δ ^cFor not satisfying business demand constraint user collection, r _{J, n '}(t+1), r _{J, n '} ⁽²⁾(t+1) be respectively and do not satisfy among the business demand constraint user j one and jump the transmission rate on the described subcarrier that can be rescheduled of step a with two jumping users,

For not satisfying business demand constraint user j at preceding t+1 average transmission rate constantly, down together;

(c) can be given the described user j of step b by the subcarrier allocation of scheduling once more with step a is described ^*, upgrade this user's transmission rate and the sub-carrier set of being occupied simultaneously: $r_{j^{*}}(t+1)\&LeftArrow;r_{j^{*}}(t+1)+r_{j^{*},n^{\&prime;}}(t+1)$ Or $r_{j^{*}}^{\left(2\right)}(t+1)\&LeftArrow;r_{j^{*}}^{\left(2\right)}(t+1)+r_{j^{*},n^{\&prime;}}^{\left(2\right)}(t+1),$ $C_{j^{*}}\&LeftArrow;C_{j^{*}}+\left\{n^{\&prime;}\right\},$ Upgrade the transmission rate of original subscriber m and the sub-carrier set of being occupied: r simultaneously _m(t+1) ← r _m(t+1)-r _{M, n '}(t+1) or $r_m^{\left(2\right)}(t+1)\&LeftArrow;r_m^{\left(2\right)}(t+1)-r_{m,n^{\&prime;}}^{\left(2\right)}(t+1),$ C _m(t+1) ← C _m(t+1)-{ n ' }, m ∈ δ;

(d) step of updating a is described can be by the sub-carrier set of dispatching once more, i.e. A _δ← A _δ-{ n ' };

(e) when $r_{j^{*}}(t+1)\&GreaterEqual;\mathrm{Max}\{{\mathrm{\&alpha;}}_{j^{*}},{\mathrm{\&beta;}}_{j^{*}}\}$ Or $r_{j^{*}}^{\left(2\right)}(t+1)\&GreaterEqual;\mathrm{Max}\{{\mathrm{\&alpha;}}_{j,2},{\mathrm{\&beta;}}_{j,2}\},$ The described user j of step b then ^*Never satisfy business demand constraint user and concentrate and remove, be i.e. δ ^c(t+1) ← δ ^c(t+1)-{ j ^*;

(f) as the described user j of step b ^*Be the double bounce user, then upgrade two of the affiliated relaying of this user and jump link capacities $R_{l,2}(t+1)\&LeftArrow;R_{l,2}(t+1)+r_{j^{*},n^{\&prime;}}^{\left(2\right)}(t+1),$ The described user j of step b ^*Belong to relaying l area under one's jurisdiction;

Step 7: after twice scheduling; Upgrade a jumping user k and double bounce user i next moment t+2 average transmission rate k ∈ { 1 constantly again; 2;, K}

Step 8: the scheduling of sub-slots 1, jump link capacity maximization criterion based on satisfying double bounce user second, accomplish first of the affiliated via node of these nodes and jump scheduling of resource.

According to the defeated speed { R of each relaying second jump set that obtains _{L, 2}And the relaying under the dispatching criterion constraints (3) constraint (t) }, the scheduling sub-carriers collection, and upgrade residue available subcarrier collection.Need to satisfy after accomplishing scheduling:

$\&ForAll;l\&Element;B_{\mathrm{Relay}}$ (B _RelayExpression via node collection), R _{L, 1}(t)>=R _{L, 2}(t)

$r_l^{\mathrm{Relay}}\left(t\right)\&GreaterEqual;\mathrm{Max}\{\underset{i\&Element;S_i}{\mathrm{\&Sigma;}}{\mathrm{\&alpha;}}_{i,1},\underset{i\&Element;S_i}{\mathrm{\&Sigma;}}{\mathrm{\&beta;}}_{i,1}\},$ $\&ForAll;l\&Element;B_{\mathrm{Relay}}$ (S _lUser's collection of expression relaying l subsidiary communications)

Step 9: utilize the residue subcarrier, accomplish one and jump the subcarrier scheduling of user, need satisfy the constraint of these users' different business demand simultaneously at sub-slots 1:

(g) scheduling for the first time: based on the proportional fairness dispatch algorithm steps of constraints in the dispatching criterion (1) (2);

(h) scheduling for the second time: subcarrier is redistributed in the requirement based on each user's loaded with traffic demand.

Fig. 4 has provided system's " and capacity " performance of cross-layer scheduling in the relaying enhanced honeycomb system, compares with proportional fairness dispatch with common greediness scheduling, and the novel cross-layer scheduling algorithm that the present invention proposes can improve system's " and capacity ".This be because, the cross-layer scheduling algorithm that is proposed is united different business Performance Constraints and the system's " and capacity " that has considered system multi-user, under the Performance Constraints that has as far as possible satisfied user's different business, maximization system " and capacity ".And greedy scheduling and proportional fairness dispatch are not considered the Performance Constraints of multiple business, make that each user's in the system business can't correct transmission, have influenced system's " and capacity ".Simultaneously, along with the increase of number of users, the capacity of system constantly promotes.This is because cross-layer scheduling has made full use of multi-user diversity gain.But when the system user number rises, multi-user's increases that gain, thereby also rising thereupon of system's " and capacity ".

Fig. 5～Fig. 6 has provided the packet delay and the packet loss performance of cross-layer scheduling in the relaying enhanced honeycomb system.Compare with proportional fairness dispatch with common greediness scheduling; The novel cross-layer scheduling algorithm that the present invention proposes has promoted the multiple services transmission performance of system greatly; Have only a spot of user can't satisfy the requirement of its business to packet delay, nearly all usefulness satisfies its professional packet loss requirement per family simultaneously.This is because cross-layer scheduling has been taken all factors into consideration the Performance Constraints and the physical layer performance of system multi-user different business, in the time of maximization system " and capacity ", has satisfied the Performance Constraints of multi-user's different business as far as possible.

Comprehensive above simulation result can be reached a conclusion, the novel cross-layer scheduling algorithm that is proposed, and in having loaded multiple services relaying enhanced honeycomb system, its performance is superior to greedy scheduling and proportional fairness dispatch.

Claims (3)

1. relaying enhanced honeycomb system; Comprise m single antenna transceiver and p the two-way relaying of single antenna; A single antenna transceiver in m single antenna transceiver is set to the base station; The single antenna transceiver is communicated by letter with user's double bounce through the two-way relaying of single antenna or is communicated by letter with the direct jumping of user, and wherein m and p are natural number, it is characterized in that the transceiver that serves as the base station also comprises formation buffer and packet scheduler; The formation buffer is connected with packet scheduler is two-way, and the output termination of packet scheduler is served as the input of modulator of the transceiver of base station.

2. relaying enhanced honeycomb system according to claim 1 is characterized in that the two-way relaying of said single antenna is that forward relay is amplified in half-duplex.

3. the cross-layer avarice proportional fairness dispatching method based on the described relaying enhanced honeycomb system of claim 1 is characterized in that comprising the steps:

Step 1: the initialization of scheduling for the first time in the sub-slots 2

Initialization current time one is jumped the transmission rate r of user k and double bounce user i respectively _k(t)=0,

And the sub-carrier set C that occupies _k=Φ, C _i=Φ, wherein k ∈ U ₁, i ∈ U ₂, subscript 2 expression double bounce users' second jump link, and t representes current time, and Φ representes empty set, U ₁User's collection, U are jumped in expression one ₂Expression double bounce user collection, down together;

Step 2: the first sub-distribution of subcarrier

(1) adopt all subcarrier n last to jump the transmission rate r of user k and double bounce user i _{K, n}(t),

Selection has

Peaked user k ^*, wherein n ∈ 1,2 ..., N} is a sub-carrier indices number, and N is a sub-carrier number, and n, N are natural number,

Represent a jumping user k and double bounce user i respectively at preceding t average transmission rate constantly, down together;

(2) all subcarrier n are distributed to the described user k of step (1) ^*, upgrade the transmission rate of this user simultaneously at current time

And take sub-carrier set

Wherein ← the expression assignment,

The described user k of expression step (1) ^*Transmission rate on subcarrier, down together;

(3) as the described user k of step (1) ^*∈ U ₁, then upgrade this user cache queue length and do

As the described user k of step (1) ^*∈ U ₂, the length of buffer queue that then upgrades in the affiliated relay station of this user does

Wherein F representes BTS service formation buffer storage length, T ₀Represent a time slot scheduling, The described user k of expression step (1) ^*Transmission rate;

(4) but upgrade the dispatched users collection

As the described user k of the step that is scheduled (1) ^*Length of buffer queue

Or the length of buffer queue in the relay station under this user

Remove but then this user is concentrated from dispatched users, i.e. U ₁← U ₁-{ k ^*Or U ₂← U ₂-{ k ^*;

Step 3: upgrade a jumping user k and double bounce user i at preceding t+1 average transmission rate

k ∈ { 1 constantly; 2;, K};

Step 4: the initialization of scheduling for the second time in the sub-slots 2

Initialization can be by the sub-carrier set A of sub-distribution again _δ=Φ and affiliated user thereof collect δ=Φ;

Step 5: based on step (4) but the dispatched users set pair user after update system classification obtains the sub-carrier set that can be redistributed simultaneously

Instantly one constantly is that t+1 one jumps or double bounce user k constantly, and i satisfies r _k(t+1)>=max{ α _k, β _kOr

δ ← δ+{ k}, A then _δ← A _δ+ C _kOr δ ← δ+{ i}, A _δ← A _δ+ C _i,

Wherein max{} is a maximization operator clips, and α, β represent to guarantee that user's packet loss retrains and the lower bound of the transmission rate of packet delay constraint, down together;

Step 6: rescheduling the described subcarrier that can be redistributed of step 5 can be by the subcarrier of dispatching once more

(a) when all can by once more the scheduling subcarrier n ' ∈ A _δSatisfy r _k(t+1)-r _{K, n '}(t+1)>=max{ α _k, β _kOr Then said can being rescheduled by the subcarrier of scheduling once more;

(b) confirm to have in the described subcarrier that can be rescheduled of step a

Peaked user j ^*, j ∈ δ wherein ^c, δ ^cFor not satisfying business demand constraint user collection, r _{J, n '}(t+1),

Be respectively and do not satisfy a jumping and the transmission rate of two jumping users on the described subcarrier that can be rescheduled of step a among the business demand constraint user j, For not satisfying business demand constraint user j at preceding t+1 average transmission rate constantly, down together;

(c) can be given the described user j of step b by the subcarrier allocation of scheduling once more with step a is described ^*, upgrade this user's transmission rate and the sub-carrier set of being occupied simultaneously:

Or

Upgrade the transmission rate of original subscriber m and the sub-carrier set of being occupied: r simultaneously _m(t+1) ← r _m(t+1)-r _{M, n '}(t+1) or

C _m(t+1) ← C _m(t+1)-{ n ' }, m ∈ δ;

(d) step of updating a is described can be by the sub-carrier set of dispatching once more, i.e. A _δ← A _δ-{ n ' };

(e) when Or

The described user j of step b then ^*Never satisfy business demand constraint user and concentrate and remove, be i.e. δ ^c(t+1) ← δ ^c(t+1)-{ j ^*;

(f) as the described user j of step b ^*Be the double bounce user, then upgrade two of the affiliated relaying of this user and jump link capacities The described user j of step b ^*Belong to relaying l area under one's jurisdiction;

Step 7: after twice scheduling; Upgrade a jumping user k and double bounce user i next moment t+2 average transmission rate

k ∈ { 1 constantly again; 2;, K};

Step 8: repeating step 1 to step 7 is accomplished the scheduling of sub-slots 1.

Images