CN102244933B - Multi-service OFDM (Orthogonal Frequency Division Multiplexing) cross-layer dynamic resource distribution method based on evidence theory - Google Patents

Abstract

The invention discloses a multi-service OFDM (Orthogonal Frequency Division Multiplexing) cross-layer dynamic resource distribution method based on an evidence theory in the technical field of wireless communication. The method comprises the following steps of: establishing target sets for dividing data packets according to the scheduling level; setting evaluation indexes; calculating to obtain elementary probability distribution function values through which the data packets under each evaluation index are divided to the target sets according to membership functions through which the data packets under each evaluation index are divided to the target sets; according to the D-S (Dempster-Shafer) evidence theory, carrying out fusion on the elementary probability distribution function value through which the data packets under each evaluation index are divided to the target sets, thus obtaining a fused elementary probability distribution function value; and according to the fused elementary probability distribution function value, determining the scheduling level of the data packets; and scheduling the data packets according to the scheduling level and the fused elementary probability distribution function value. The multi-service OFDM cross-layer dynamic resource distribution method can be used for overcoming the defects of lower precision, reliability and accuracy when the resource scheduling priority is discriminated according to a single evaluation index.

Description

Multi-service OFDM cross-layer dynamic resource allocation method based on evidence theory

Technical field

The invention belongs to wireless communication technology field, relate in particular to a kind of multi-service OFDM cross-layer dynamic resource allocation method based on evidence theory.

Background technology

Along with the development of radio multimedium business, wireless channel need to be supported more reliably, the communication of higher rate, and can guarantee multi-user's different business demand.OFDM (Orthogonal Frequency Division Multiplexing, OFDM) due to anti-ISI ability by force, frequency domain channel control ability and provide high performance physical layer link ability to receive much concern flexibly.How to make physical layer combine with upper-layer service demand and then optimized allocation of resources becomes the key factor that improves systematic function, therefore study in ofdm system multi-service cross-layer Dynamic Resource Allocation for Multimedia very urgent.In the multi-user resource of differentiated service distributes, traditional distribution method is resource regulating method (EDF method) and the resource regulating method based on rate fairness (PF method) based on delay requirement.Scheduling of resource throughput based on time delay is too low, and scheduling of resource time delay based on rate fairness is excessive, two kinds of methods all can not reach desirable distribution effects for the service-user of each feature request equalization of QoS (Quality of Service, service quality).Existing resource allocation methods is according to a certain evaluation index, to adjudicate the priority of packet mostly, defect of various degrees all at aspects such as accuracy, dependable with functions.

Summary of the invention

The object of the invention is to, a kind of multi-service OFDM cross-layer dynamic resource allocation method based on evidence theory is provided, by merging the evaluation index in QoS component, carry out the scheduling grade of decision data bag, overcome precision, reliability and the lower defect of accuracy when scheduling of resource priority is differentiated according to single evaluation index.

To achieve these goals, the technical scheme that the present invention proposes is that a kind of multi-service OFDM cross-layer dynamic resource allocation method based on evidence theory, is characterized in that described method comprises:

Step 1: according to scheduling grade, set up the goal set for dividing data bag;

Step 2: set evaluation index;

Step 3: be divided into the membership function of goal set according to packet under each evaluation index, calculate the basic probability assignment functional value that packet under each evaluation index is divided into goal set;

Step 4: according to D-S evidence theory, the basic probability assignment functional value that packet under each evaluation index is divided into goal set merges, and the packet after being merged is divided into the basic probability assignment functional value of goal set;

Step 5: be divided into the basic probability assignment functional value of goal set according to the packet after merging, the scheduling grade of specified data bag;

Step 6: the packet of packet according to scheduling grade and after merging is divided into the basic probability assignment functional value of goal set and dispatches.

Described step 1 is specifically according to order from high to low of scheduling grade, by packet be divided into anxious assemble close, fuzzy set and 3 goal sets of wait set.

Described setting evaluation index is specifically set time delay, rate fairness and packet loss as evaluation index.

Described step 3 specifically, according to packet under time delay, rate fairness and packet loss evaluation index be divided into anxious assemble close, the membership function of fuzzy set and wait set, calculate packet under time delay, rate fairness and packet loss evaluation index be divided into anxious assemble close, the basic probability assignment functional value of fuzzy set and wait set;

Wherein, under described time delay evaluation index packet be divided into anxious assemble close, the membership function of fuzzy set and wait set is:

$T\_{\mathrm{\μ}}_1\left(i\right)=\exp (-C_1*\mathrm{\π}*{\left(\frac{T\_\mathrm{delay}\left(i\right)-(T\_\max \left(s\left(i\right)\right)/2)}{2}\right)}^2)$

$T\_{\mathrm{\μ}}_2\left(i\right)=\exp (-C_2*\mathrm{\π}*{\left(\frac{T\_\mathrm{delay}\left(i\right)-T\_\max \left(s\left(i\right)\right)}{2}\right)}^2)$

T_μ ₃(i)＝exp(-C ₃*π*(T_delay(i)) ²)

In formula:

T_ μ ₁(i) for packet i under time delay evaluation index is divided into the anxious membership function closing of assembling;

T_ μ ₂(i) for packet i under time delay evaluation index, be divided into the membership function of fuzzy set;

T_ μ ₃(i) for packet i under time delay evaluation index is divided into the membership function of waiting for set;

C ₁, C ₂, C ₃for regulating the parameter of membership function;

π is circumference ratio;

T_delay (i) is the propagation delay time of packet i;

T_delay_max (s (i)) is the propagation delay time upper limit of business s under packet i;

Described according to packet under time delay evaluation index be divided into anxious assemble close, the membership function of fuzzy set and wait set, calculate packet under time delay evaluation index be divided into anxious assemble close, the computing formula of the basic probability assignment functional value of fuzzy set and wait set is:

$\mathrm{BPAF}\_T_1\left(i\right)=\frac{T\_{\mathrm{\μ}}_1\left(i\right)}{\underset{j=\mathrm{1,2,3}}{\mathrm{\Σ}}T\_{\mathrm{\μ}}_j\left(i\right)}$

$\mathrm{BPAF}\_T_2\left(i\right)=\frac{T\_{\mathrm{\μ}}_2\left(i\right)}{\underset{j=\mathrm{1,2,3}}{\mathrm{\Σ}}T\_{\mathrm{\μ}}_j\left(i\right)}$

$\mathrm{BPAF}\_T_3\left(i\right)=\frac{T\_{\mathrm{\μ}}_3\left(i\right)}{\underset{j=\mathrm{1,2,3}}{\mathrm{\Σ}}T\_{\mathrm{\μ}}_j\left(i\right)}$

In formula:

BPAF_T ₁(i) for packet i under time delay evaluation index is divided into the anxious basic probability assignment functional value closing of assembling;

BPAF_T ₂(i) for packet i under time delay evaluation index, be divided into the basic probability assignment functional value of fuzzy set;

BPAF_T ₃(i) for packet i under time delay evaluation index is divided into the basic probability assignment functional value of waiting for set;

Under described rate fairness evaluation index packet be divided into anxious assemble close, the membership function of fuzzy set and wait set is:

$R\_{\mathrm{\μ}}_1\left(i\right)=\frac{R\_\mathrm{total}\left(s\left(i\right)\right)-R\_\mathrm{aver}\left(s\left(i\right)\right)}{R\_\mathrm{total}\left(s\left(i\right)\right)}$

$R\_{\mathrm{\μ}}_2\left(i\right)=\frac{R\_\mathrm{aver}\left(s\left(i\right)\right)}{R\_\mathrm{total}\left(s\left(i\right)\right)}$

$R\_{\mathrm{\μ}}_3\left(i\right)=\left\{\begin{array}{cc}\frac{2R\_\mathrm{aver}\left(s\left(i\right)\right)}{R\_\mathrm{total}\left(s\left(i\right)\right)}& (0\≤R\_\mathrm{aver}\left(s\left(i\right)\right)\≤\frac{1}{2}R\_\mathrm{total}\left(s\left(i\right)\right))\\ \frac{2*R\_\mathrm{total}\left(s\left(i\right)\right)-2*R\_\mathrm{aver}\left(s\left(i\right)\right)}{R\_\mathrm{total}\left(s\left(i\right)\right)}& (\frac{1}{2}R\_\mathrm{total}\left(s\left(i\right)\right)\≤R\_\mathrm{aver}\left(s\left(i\right)\right)\≤1)\end{array}\right.$

In formula:

R_ μ ₁(i) for packet i under rate fairness evaluation index is divided into the anxious membership function closing of assembling;

R_ μ ₂(i) for packet i under rate fairness evaluation index, be divided into the membership function of fuzzy set;

R_ μ ₃(i) for packet i under rate fairness evaluation index is divided into the membership function of waiting for set;

R_aver (s (i)) is the average transmission rate of business s under i packet;

R_total (s (i)) is that the affiliated business s of i packet is in the speed sum of whole subchannel transmission;

Described according to packet under rate fairness evaluation index be divided into order anxious assemble close, the membership function of fuzzy set and wait set, calculate packet under rate fairness evaluation index be divided into anxious assemble close, the computing formula of the basic probability assignment functional value of fuzzy set and wait set is:

$\mathrm{BPAF}\_R_1\left(i\right)=\frac{R\_{\mathrm{\μ}}_1\left(i\right)}{\underset{j=\mathrm{1,2,3}}{\mathrm{\Σ}}R\_{\mathrm{\μ}}_j\left(i\right)}$

$\mathrm{BPAF}\_R_2\left(i\right)=\frac{R\_{\mathrm{\μ}}_2\left(i\right)}{\underset{j=\mathrm{1,2,3}}{\mathrm{\Σ}}R\_{\mathrm{\μ}}_j\left(i\right)}$

$\mathrm{BPAF}\_R_3\left(i\right)=\frac{R\_{\mathrm{\μ}}_3\left(i\right)}{\underset{j=\mathrm{1,2,3}}{\mathrm{\Σ}}R\_{\mathrm{\μ}}_3\left(i\right)}$

In formula:

BPAF_R ₁for packet i under rate fairness evaluation index is divided into the anxious basic probability assignment functional value closing of assembling;

BPAF_R ₂for packet i under rate fairness evaluation index is divided into the basic probability assignment functional value of fuzzy set;

BPAF_R ₃for packet i under rate fairness evaluation index is divided into the basic probability assignment functional value of waiting for set;

Under described packet loss evaluation index packet be divided into anxious assemble close, the membership function of fuzzy set and wait set is:

$L\_{\mathrm{\μ}}_1\left(i\right)=\exp (-C_4*\mathrm{\π}*{\left(\frac{(L\_\mathrm{loss}\left(s\left(i\right)\right)-(100*L\_\mathrm{loss}\_\max \left(s\left(i\right)\right))/2)}{2}\right)}^2)$

$L\_{\mathrm{\μ}}_2\left(i\right)=\exp (-C_5*\mathrm{\π}*{\frac{(L\_\mathrm{loss}\left(s\left(i\right)\right)-(100*L\_\mathrm{loss}\_\max \left(s\left(i\right)\right))}{2})}^2)$

L_μ ₃(i)＝exp(-C ₆*π*(L_loss(s(i))) ²)

In formula:

L_ μ ₁(i) for packet i under packet loss evaluation index is divided into the anxious membership function closing of assembling;

L_ μ ₂(i) for packet i under packet loss evaluation index, be divided into the membership function of fuzzy set;

L_ μ ₃(i) for packet i under packet loss evaluation index is divided into the membership function of waiting for set;

C ₄, C ₅, C ₆for regulating the parameter of membership function;

L_loss (s (i)) is the packet loss of business s before packet i sends under packet i;

L_loss_max (s (i)) is the packet loss upper limit of business s under packet i;

Described according to packet under packet loss evaluation index be divided into anxious assemble close, the membership function of fuzzy set and wait set, calculate packet under packet loss evaluation index be divided into anxious assemble close, the computing formula of the basic probability assignment functional value of fuzzy set and wait set is:

$\mathrm{BPAF}\_L_1\left(i\right)=\frac{L\_{\mathrm{\μ}}_1\left(i\right)}{\underset{j=\mathrm{1,2,3}}{\mathrm{\Σ}}L\_{\mathrm{\μ}}_j\left(i\right)}$

$\mathrm{BPAF}\_L_2\left(i\right)=\frac{L\_{\mathrm{\μ}}_2\left(i\right)}{\underset{j=\mathrm{1,2,3}}{\mathrm{\Σ}}L\_{\mathrm{\μ}}_j\left(i\right)}$

$\mathrm{BPAF}\_L_3\left(i\right)=\frac{L\_{\mathrm{\μ}}_3\left(i\right)}{\underset{j=\mathrm{1,2,3}}{\mathrm{\Σ}}L\_{\mathrm{\μ}}_j\left(i\right)}$

In formula:

BPAF_L ₁(i) for packet i under packet loss evaluation index is divided into the anxious basic probability assignment functional value closing of assembling;

BPAF_L ₂(i) for packet i under packet loss evaluation index, be divided into the basic probability assignment functional value of fuzzy set;

BPAF_L ₃(i) for packet i under packet loss evaluation index is divided into the basic probability assignment functional value of waiting for set.

In described step 4, the basic probability assignment functional value that packet under each evaluation index is divided into goal set merges, the basic probability assignment functional value that packet after being merged is divided into goal set specifically, by packet under time delay, rate fairness and packet loss evaluation index be divided into anxious assemble close, the basic probability assignment functional value of fuzzy set and wait set merges, packet after being merged be divided into anxious assemble close, the basic probability assignment functional value of fuzzy set and wait set, computing formula is:

$\mathrm{BPAF}\_{\mathrm{TRL}}_1\left(i\right)=\frac{\mathrm{BPAF}\_{\mathrm{TR}}_1\left(i\right)*\mathrm{BPAF}\_L_2\left(i\right)+\mathrm{BPAF}\_{\mathrm{TR}}_2\left(i\right)*\mathrm{BPAF}\_L_1\left(i\right)+\mathrm{BPAF}\_{\mathrm{TR}}_1\left(i\right)*\mathrm{BPAF}\_L_2\left(i\right)}{1-K\left(i\right)}$

$\mathrm{BPAF}\_{\mathrm{TRL}}_2\left(i\right)=\frac{\mathrm{BPAF}\_{\mathrm{TR}}_2\left(i\right)*\mathrm{BPAF}\_L_2\left(i\right)}{1-K\left(i\right)}$

$\mathrm{BPAF}\_{\mathrm{TRL}}_3\left(i\right)=\frac{\mathrm{BPAF}\_{\mathrm{TR}}_2\left(i\right)*\mathrm{BPAF}\_L_3\left(i\right)+\mathrm{BPAF}\_{\mathrm{TR}}_3\left(i\right)*\mathrm{BPAF}\_L_2\left(i\right)*\mathrm{BPAF}\_{\mathrm{TR}}_3\left(i\right)*\mathrm{BPAF}\_L_3\left(i\right)}{1-K\left(i\right)}$

In formula:

BPAF_TRL ₁(i) for packet i after merging is divided into the anxious basic probability assignment functional value closing of assembling;

BPAF_TRL ₂(i) for packet i after merging, be divided into the basic probability assignment functional value of fuzzy set;

BPAF_TRL ₃(i) for packet i after merging is divided into the basic probability assignment functional value of waiting for set;

BPAF_TR ₁(i) for packet i under time delay and two evaluation indexes of rate fairness being divided into the anxious basic probability assignment functional value after the basic probability assignment functional value closing merges of assembling;

BPAF_TR ₂(i) for packet i under time delay and two evaluation indexes of rate fairness being divided into the basic probability assignment functional value after the basic probability assignment functional value of fuzzy set merges;

BPAF_TR ₃(i) for packet i under time delay and two evaluation indexes of rate fairness being divided into the basic probability assignment functional value of waiting for after the basic probability assignment functional value of gathering merges;

K (i) is the inconsistent factor of packet i under time delay, rate fairness and three evaluation indexes of packet loss, and its computing formula is:

K(i)＝BPAF_TR ₁(i)*BPAF_L ₃(i)+BPAF_L ₃(i)*BPAF_TR ₁(i)。

Describedly packet i under time delay and two evaluation indexes of rate fairness be divided into anxious computing formula of assembling the basic probability assignment functional value after the basic probability assignment functional value closing merges be:

$\mathrm{BPAF}\_{\mathrm{TR}}_1\left(i\right)=\frac{\mathrm{BPAF}\_T_1\left(i\right)*\mathrm{BPAF}\_R_1\left(i\right)+\mathrm{BPAF}\_T_1\left(i\right)*\mathrm{BPAF}\_R_2\left(i\right)+\mathrm{BPAF}\_R_1\left(i\right)*\mathrm{BPAF}\_T_2\left(i\right)}{1-K_1\left(i\right)};$

The computing formula of the basic probability assignment functional value after the described basic probability assignment functional value that packet i under time delay and two evaluation indexes of rate fairness is divided into fuzzy set merges is:

$\mathrm{BPAF}\_{\mathrm{TR}}_2\left(i\right)=\frac{\mathrm{BPAF}\_T_2\left(i\right)*\mathrm{BPAF}\_R_2\left(i\right)}{1-K_1\left(i\right)};$

The described computing formula that packet i under time delay and two evaluation indexes of rate fairness is divided into the basic probability assignment functional value after the basic probability assignment functional value of waiting for set merges is:

$\mathrm{BPAF}\_{\mathrm{TR}}_3\left(i\right)=\frac{\mathrm{BPAF}\_T_3\left(i\right)*\mathrm{BPAF}\_R_3\left(i\right)+\mathrm{BPAF}\_T_2\left(i\right)*\mathrm{BPAF}\_R_3\left(i\right)+\mathrm{BPAF}\_R_2\left(i\right)*\mathrm{BPAF}\_T_3\left(i\right)}{1-K_1\left(i\right)};$

K ₁(i) be the inconsistent factor of packet i under time delay, two evaluation indexes of rate fairness, its computing formula is: K ₁(i)=BPAF_T ₁(i) * BPAF_R ₃(i)+BPAF_T ₃(i) * BPAF_R ₁(i).

Described step 6 is specifically: for the packet of different brackets, according to scheduling grade order from high to low, dispatch; For the packet of same grade, when the scheduling grade of packet is anxious timing, according to the packet after merging, be divided into and suddenly assemble the descending order of basic probability assignment functional value of closing and dispatch; When the scheduling grade of packet is while being fuzzy, the ascending order of basic probability assignment functional value that is divided into fuzzy set according to the packet after merging is dispatched; When the scheduling grade of packet, for waiting, bide one's time, the ascending order of basic probability assignment functional value that is divided into wait set according to the packet after merging is dispatched.

The present invention carrys out the scheduling grade of decision data bag by the evaluation index in fusion QoS component, overcome precision, reliability and the lower defect of accuracy when scheduling of resource priority is differentiated according to single evaluation index.

Accompanying drawing explanation

Fig. 1 is the multi-service OFDM cross-layer dynamic resource allocation method flow chart based on evidence theory;

When Fig. 2 is T_max under time delay evaluation index (s (i))=40ms packet i be divided into anxious assemble close, the membership function curve chart of fuzzy set and wait set;

When Fig. 3 is R_total under rate fairness evaluation index (s (i))=300bps packet i be divided into anxious assemble close, the membership function curve chart of fuzzy set and wait set;

Fig. 4 be L_max under packet loss evaluation index (s (i))=0.3 o'clock packet i be divided into anxious assemble close, the membership function curve chart of fuzzy set and wait set;

Fig. 5 is method provided by the invention and PF, EDF method mean transit delay correlation curve figure;

Fig. 6 is method provided by the invention and PF, EDF method average transmission rate correlation curve figure;

Fig. 7 is method provided by the invention and PF, EDF method packet loss correlation curve figure.

Embodiment

Below in conjunction with accompanying drawing, preferred embodiment is elaborated.Should be emphasized that, following explanation is only exemplary, rather than in order to limit the scope of the invention and to apply.

An optional packet i, under this packet, class of service is s, T_delay (i)=20ms, R_aver (s)=200bps, L_loss (s)=0.2, T_max (s)=40ms, R_total (s)=300bps, L_max (s)=0.3.

Fig. 1 is the multi-service OFDM cross-layer dynamic resource allocation method flow chart based on evidence theory.Shown in Fig. 1, method provided by the invention comprises following implementation step:

Step 1: according to scheduling grade, set up the goal set for dividing data bag.

In the present embodiment, according to order from high to low of scheduling grade, by packet be divided into anxious assemble close, fuzzy set and 3 goal sets of wait set.

Step 2: set evaluation index.

Consider the evaluation index in QoS component, choose time delay, rate fairness and packet loss as the evaluation index in the present embodiment.

Step 3: be divided into the membership function of goal set according to packet under each evaluation index, calculate the basic probability assignment functional value that packet under each evaluation index is divided into goal set.

According to step 1 and 2 definite goal set and evaluation indexes, according to packet under time delay, rate fairness and packet loss evaluation index be divided into anxious assemble close, the membership function of fuzzy set and wait set, calculate packet under time delay, rate fairness and packet loss evaluation index be divided into anxious assemble close, the basic probability assignment functional value of fuzzy set and wait set.

Wherein, under time delay evaluation index packet be divided into anxious assemble close, the membership function of fuzzy set and wait set is respectively:

$T\_{\mathrm{\μ}}_1\left(i\right)=\exp (-C_1*\mathrm{\π}*{\left(\frac{T\_\mathrm{delay}\left(i\right)-(T\_\max \left(s\left(i\right)\right)/2)}{2}\right)}^2)---\left(1\right)$

$T\_{\mathrm{\μ}}_2\left(i\right)=\exp (-C_2*\mathrm{\π}*{\left(\frac{T\_\mathrm{delay}\left(i\right)-T\_\max \left(s\left(i\right)\right)}{2}\right)}^2)---\left(2\right)$

T_μ ₃(i)＝exp(-C ₃*π*(T_delay(i)) ²) (3)

In formula:

T_ μ ₁(i) for packet i under time delay evaluation index is divided into the anxious membership function closing of assembling;

T_ μ ₂(i) for packet i under time delay evaluation index, be divided into the membership function of fuzzy set;

T_ μ ₃(i) for packet i under time delay evaluation index is divided into the membership function of waiting for set;

C ₁, C ₂, C ₃for regulating the parameter of membership function;

π is circumference ratio;

T_delay (i) is the propagation delay time of packet i;

T_delay_max (s (i)) is the propagation delay time upper limit of business s under packet i.

According to packet under time delay evaluation index be divided into anxious assemble close, the membership function of fuzzy set and wait set, calculate packet under time delay evaluation index be divided into anxious assemble close, the computing formula of the basic probability assignment functional value of fuzzy set and wait set is:

$\mathrm{BPAF}\_T_1\left(i\right)=\frac{T\_{\mathrm{\μ}}_1\left(i\right)}{\underset{j=\mathrm{1,2,3}}{\mathrm{\Σ}}T\_{\mathrm{\μ}}_j\left(i\right)}---\left(4\right)$

$\mathrm{BPAF}\_T_2\left(i\right)=\frac{T\_{\mathrm{\μ}}_2\left(i\right)}{\underset{j=\mathrm{1,2,3}}{\mathrm{\Σ}}T\_{\mathrm{\μ}}_j\left(i\right)}---\left(5\right)$

$\mathrm{BPAF}\_T_3\left(i\right)=\frac{T\_{\mathrm{\μ}}_3\left(i\right)}{\underset{j=\mathrm{1,2,3}}{\mathrm{\Σ}}T\_{\mathrm{\μ}}_j\left(i\right)}---\left(6\right)$

In formula:

BPAF_T ₁(i) for packet i under time delay evaluation index is divided into the anxious basic probability assignment functional value closing of assembling;

BPAF_T ₂(i) for packet i under time delay evaluation index, be divided into the basic probability assignment functional value of fuzzy set;

BPAF_T ₃(i) for packet i under time delay evaluation index is divided into the basic probability assignment functional value of waiting for set.

Under rate fairness evaluation index packet be divided into anxious assemble close, the membership function of fuzzy set and wait set is respectively:

$R\_{\mathrm{\μ}}_1\left(i\right)=\frac{R\_\mathrm{total}\left(s\left(i\right)\right)-R\_\mathrm{aver}\left(s\left(i\right)\right)}{R\_\mathrm{total}\left(s\left(i\right)\right)}---\left(7\right)$

$R\_{\mathrm{\μ}}_2\left(i\right)=\frac{R\_\mathrm{aver}\left(s\left(i\right)\right)}{R\_\mathrm{total}\left(s\left(i\right)\right)}---\left(8\right)$

$R\_{\mathrm{\μ}}_3\left(i\right)=\left\{\begin{array}{cc}\frac{2R\_\mathrm{aver}\left(s\left(i\right)\right)}{R\_\mathrm{total}\left(s\left(i\right)\right)}& (0\≤R\_\mathrm{aver}\left(s\left(i\right)\right)\≤\frac{1}{2}R\_\mathrm{total}\left(s\left(i\right)\right))\\ \frac{2*R\_\mathrm{total}\left(s\left(i\right)\right)-2*R\_\mathrm{aver}\left(s\left(i\right)\right)}{R\_\mathrm{total}\left(s\left(i\right)\right)}& (\frac{1}{2}R\_\mathrm{total}\left(s\left(i\right)\right)\≤R\_\mathrm{aver}\left(s\left(i\right)\right)\≤1)\end{array}\right.---\left(9\right)$

In formula:

R_ μ ₁(i) for packet i under rate fairness evaluation index is divided into the anxious membership function closing of assembling;

R_ μ ₂(i) for packet i under rate fairness evaluation index, be divided into the membership function of fuzzy set;

R_ μ ₃(i) for packet i under rate fairness evaluation index is divided into the membership function of waiting for set;

R_aver (s (i)) is the average transmission rate of business s under i packet;

R_total (s (i)) is that the affiliated business s of i packet is in the speed sum of whole subchannel transmission.

According to packet under rate fairness evaluation index be divided into anxious assemble close, the membership function of fuzzy set and wait set, calculate packet under rate fairness evaluation index be divided into anxious assemble close, the computing formula of the basic probability assignment functional value of fuzzy set and wait set is:

$\mathrm{BPAF}\_R_1\left(i\right)=\frac{R\_{\mathrm{\μ}}_1\left(i\right)}{\underset{j=\mathrm{1,2,3}}{\mathrm{\Σ}}R\_{\mathrm{\μ}}_j\left(i\right)}---\left(10\right)$

$\mathrm{BPAF}\_R_2\left(i\right)=\frac{R\_{\mathrm{\μ}}_2\left(i\right)}{\underset{j=\mathrm{1,2,3}}{\mathrm{\Σ}}R\_{\mathrm{\μ}}_j\left(i\right)}---\left(11\right)$

$\mathrm{BPAF}\_R_3\left(i\right)=\frac{R\_{\mathrm{\μ}}_3\left(i\right)}{\underset{j=\mathrm{1,2,3}}{\mathrm{\Σ}}R\_{\mathrm{\μ}}_3\left(i\right)}---\left(12\right)$

In formula:

BPAF_R ₁for packet i under rate fairness evaluation index is divided into the anxious basic probability assignment functional value closing of assembling;

BPAF_R ₂for packet i under rate fairness evaluation index is divided into the basic probability assignment functional value of fuzzy set;

BPAF_R ₃for packet i under rate fairness evaluation index is divided into the basic probability assignment functional value of waiting for set.

Under packet loss evaluation index packet be divided into anxious assemble close, fuzzy set and wait set membership function be:

$L\_{\mathrm{\μ}}_1\left(i\right)=\exp (-C_4*\mathrm{\π}*{\left(\frac{(L\_\mathrm{loss}\left(s\left(i\right)\right)-(100*L\_\mathrm{loss}\_\max \left(s\left(i\right)\right))/2)}{2}\right)}^2)---\left(13\right)$

$L\_{\mathrm{\μ}}_2\left(i\right)=\exp (-C_5*\mathrm{\π}*{\frac{(L\_\mathrm{loss}\left(s\left(i\right)\right)-(100*L\_\mathrm{loss}\_\max \left(s\left(i\right)\right))}{2})}^2)---\left(14\right)$

L_μ ₃(i)＝exp(-C ₆*π*(L_loss(s(i))) ²) (15)

In formula:

L_ μ ₁(i) for packet i under packet loss evaluation index is divided into the anxious membership function closing of assembling;

L_ μ ₂(i) for packet i under packet loss evaluation index, be divided into the membership function of fuzzy set;

L_ μ ₃(i) for packet i under packet loss evaluation index is divided into the membership function of waiting for set;

C ₄, C ₅, C ₆for regulating the parameter of membership function;

L_loss (s (i)) is the packet loss of business s before packet i sends under packet i;

L_loss_max (s (i)) is the packet loss upper limit of business s under packet i.

According to packet under packet loss evaluation index be divided into anxious assemble close, the membership function of fuzzy set and wait set, calculate packet under packet loss evaluation index be divided into anxious assemble close, the computing formula of the basic probability assignment functional value of fuzzy set and wait set is:

$\mathrm{BPAF}\_L_1\left(i\right)=\frac{L\_{\mathrm{\μ}}_1\left(i\right)}{\underset{j=\mathrm{1,2,3}}{\mathrm{\Σ}}L\_{\mathrm{\μ}}_j\left(i\right)}---\left(16\right)$

$\mathrm{BPAF}\_L_2\left(i\right)=\frac{L\_{\mathrm{\μ}}_2\left(i\right)}{\underset{j=\mathrm{1,2,3}}{\mathrm{\Σ}}L\_{\mathrm{\μ}}_j\left(i\right)}---\left(17\right)$

$\mathrm{BPAF}\_L_3\left(i\right)=\frac{L\_{\mathrm{\μ}}_3\left(i\right)}{\underset{j=\mathrm{1,2,3}}{\mathrm{\Σ}}L\_{\mathrm{\μ}}_j\left(i\right)}---\left(18\right)$

In formula:

BPAF_L ₁(i) for packet i under packet loss evaluation index is divided into the anxious basic probability assignment functional value closing of assembling;

BPAF_L ₂(i) for packet i under packet loss evaluation index, be divided into the basic probability assignment functional value of fuzzy set;

BPAF_L ₃(i) for packet i under packet loss evaluation index is divided into the basic probability assignment functional value of waiting for set.

In the present embodiment, first, respectively by T_max (s)=40ms substitution formula (1) (2) (3), obtain time delay membership function, as shown in Figure 2.By T_delay (i)=20ms, T_max (s)=40ms substitution formula (4) (5) (6), obtain packet under time delay evaluation index be divided into anxious assemble close, the basic probability assignment functional value BPAF_T of fuzzy set and wait set ₁(i)=0.9071, BPAF_T ₂(i)=0.0537, BPAF_T ₃(i)=0.0392.Under time delay evaluation index, judge that its scheduling grade is anxious tune.

Again R_total (s)=300bps substitution formula (7) (8) (9) is obtained to rate fairness membership function, as shown in Figure 3.By R_aver (s)=200bps, R_total (s)=300bps substitution formula (10) (11) (12) so that try to achieve packet under rate fairness evaluation index be divided into anxious assemble close, the basic probability assignment functional value BPAF_R of fuzzy set and wait set ₁(i)=0.1429, BPAF_R ₂(i)=0.2857, BPAF_R ₃(i)=0.5714.Under rate fairness evaluation index, judge that its scheduling grade is as waiting for.

Finally L_max (s)=0.3 substitution formula (13) (14) (15) is obtained to packet loss membership function, as shown in Figure 4.By L_loss (s)=0.2, L_max (s)=0.3 substitution formula (16) (17) (18) so that try to achieve packet under packet loss evaluation index be divided into anxious assemble close, the basic probability assignment functional value BPAF_T of fuzzy set and wait set ₁(i)=0.0209, BPAF_L ₂(i)=4.0583e-009, BPAF_T ₃(i)=0.9791.Under packet loss evaluation index, judge that its scheduling grade is as waiting for.

Step 4: according to D-S evidence theory, the basic probability assignment functional value that packet under each evaluation index is divided into goal set merges, and the packet after being merged is divided into goal set basic probability assignment functional value.

In the present embodiment, the basic probability assignment functional value that packet under each evaluation index is divided into goal set merges, packet after being merged is divided into goal set basic probability assignment functional value specifically: by packet under time delay, rate fairness and packet loss evaluation index be divided into anxious assemble close, the basic probability assignment functional value of fuzzy set and wait set merges, packet after being merged be divided into anxious assemble close, fuzzy set and wait set basic probability assignment functional value, computing formula is:

$\mathrm{BPAF}\_{\mathrm{TRL}}_1\left(i\right)=\frac{\mathrm{BPAF}\_{\mathrm{TR}}_1\left(i\right)*\mathrm{BPAF}\_L_2\left(i\right)+\mathrm{BPAF}\_{\mathrm{TR}}_2\left(i\right)*\mathrm{BPAF}\_L_1\left(i\right)+\mathrm{BPAF}\_{\mathrm{TR}}_1\left(i\right)*\mathrm{BPAF}\_L_2\left(i\right)}{1-K\left(i\right)}---\left(19\right)$

$\mathrm{BPAF}\_{\mathrm{TRL}}_2\left(i\right)=\frac{\mathrm{BPAF}\_{\mathrm{TR}}_2\left(i\right)*\mathrm{BPAF}\_L_2\left(i\right)}{1-K\left(i\right)}---\left(20\right)$

$\mathrm{BPAF}\_{\mathrm{TRL}}_3\left(i\right)=\frac{\mathrm{BPAF}\_{\mathrm{TR}}_2\left(i\right)*\mathrm{BPAF}\_L_3\left(i\right)+\mathrm{BPAF}\_{\mathrm{TR}}_3\left(i\right)*\mathrm{BPAF}\_L_2\left(i\right)*\mathrm{BPAF}\_{\mathrm{TR}}_3\left(i\right)*\mathrm{BPAF}\_L_3\left(i\right)}{1-K\left(i\right)}---\left(21\right)$

In formula:

BPAF_TRL ₁(i) for packet i after merging is divided into the anxious basic probability assignment functional value closing of assembling;

BPAF_TRL ₂(i) for packet i after merging, be divided into the basic probability assignment functional value of fuzzy set;

BPAF_TRL ₃(i) for packet i after merging is divided into the basic probability assignment functional value of waiting for set;

BPAF_TR ₁(i) for packet i under time delay and two evaluation indexes of rate fairness being divided into the anxious basic probability assignment functional value after the basic probability assignment functional value closing merges of assembling;

BPAF_TR ₂(i) for packet i under time delay and two evaluation indexes of rate fairness being divided into the basic probability assignment functional value after the basic probability assignment functional value of fuzzy set merges;

BPAF_TR ₃(i) for packet i under time delay and two evaluation indexes of rate fairness being divided into the basic probability assignment functional value of waiting for after the basic probability assignment functional value of gathering merges;

K (i) is the inconsistent factor of packet i under time delay, rate fairness and three evaluation indexes of packet loss, and its computing formula is:

K(i)＝BPAF_TR ₁(i)*BPAF_L ₃(i)+BPAF_L ₃(i)*BPAF_TR ₁(i)。

Packet i under time delay and two evaluation indexes of rate fairness is divided into anxious computing formula of assembling the basic probability assignment functional value after the basic probability assignment functional value closing merges is:

$\mathrm{BPAF}\_{\mathrm{TR}}_1\left(i\right)=\frac{\mathrm{BPAF}\_T_1\left(i\right)*\mathrm{BPAF}\_R_1\left(i\right)+\mathrm{BPAF}\_T_1\left(i\right)*\mathrm{BPAF}\_R_2\left(i\right)+\mathrm{BPAF}\_R_1\left(i\right)*\mathrm{BPAF}\_T_2\left(i\right)}{1-K_1\left(i\right)};$

The computing formula of the basic probability assignment functional value after the basic probability assignment functional value that packet i under time delay and two evaluation indexes of rate fairness is divided into fuzzy set merges is:

$\mathrm{BPAF}\_{\mathrm{TR}}_2\left(i\right)=\frac{\mathrm{BPAF}\_T_2\left(i\right)*\mathrm{BPAF}\_R_2\left(i\right)}{1-K_1\left(i\right)};$

Packet i under time delay and two evaluation indexes of rate fairness is divided into and waits for that the computing formula of the basic probability assignment functional value after the basic probability assignment functional value of gathering merges is:

$\mathrm{BPAF}\_{\mathrm{TR}}_3\left(i\right)=\frac{\mathrm{BPAF}\_T_3\left(i\right)*\mathrm{BPAF}\_R_3\left(i\right)+\mathrm{BPAF}\_T_2\left(i\right)*\mathrm{BPAF}\_R_3\left(i\right)+\mathrm{BPAF}\_R_2\left(i\right)*\mathrm{BPAF}\_T_3\left(i\right)}{1-K_1\left(i\right)};$

K ₁(i) be the inconsistent factor of packet i under time delay, two evaluation indexes of rate fairness, its computing formula is: K ₁(i)=BPAF_T ₁(i) * BPAF_R ₃(i)+BPAF_T ₃(i) * BPAF_R ₁(i).

In the present embodiment, packet under the time delay evaluation index calculating is above divided into anxious assembling to be closed, the basic probability assignment functional value of fuzzy set and wait set, under rate fairness evaluation index, packet is divided into suddenly and assembles and close, the basic probability assignment functional value of fuzzy set and wait set, under packet loss evaluation index, packet is divided into suddenly and assembles and close, the basic probability assignment functional value substitution formula (19) (20) (21) of fuzzy set and wait set, packet after being merged is divided into anxious assembling and closes, the basic probability assignment functional value of fuzzy set and wait set: BPAF_TRL ₁(i)=0.8935, BPAF_TRL ₂(i)=0.0765, BPAF_TRL ₃(i)=0.0380.

Step 5: be divided into the basic probability assignment functional value of goal set according to the packet after merging, the scheduling grade of specified data bag.

Packet after merging be divided into anxious assemble close, the scheduling grade of set that the basic probability assignment functional value of fuzzy set and wait set is large is as the scheduling grade of packet.

In the present embodiment, as following table:

	Anxious tune	Fuzzy	Wait for	Court verdict
					Time delay	0.9071	0.0537	0.0392	Anxious tune
Rate fairness	0.1429	0.2857	0.5714	Wait for
					Packet loss	0.0209	4.0583e-009	0.9791	Wait for
After fusion	0.8935	0.0765	0.0380	Anxious tune

Owing to merging rear packet, being divided into the anxious basic probability assignment functional value maximum of closing of assembling, is 0.8935, therefore will " suddenly adjust " the scheduling grade as packet.

Step 6: the packet of packet according to scheduling grade and after merging is divided into the basic probability assignment functional value of goal set and dispatches.

Specifically: for the packet of different brackets, according to scheduling grade order from high to low, dispatch; For the packet of same grade, when the scheduling grade of packet is anxious timing, according to the packet after merging, be divided into and suddenly assemble the descending order of basic probability assignment functional value of closing and dispatch; When the scheduling grade of packet is while being fuzzy, the ascending order of basic probability assignment functional value that is divided into fuzzy set according to the packet after merging is dispatched; When the scheduling grade of packet, for waiting, bide one's time, the ascending order of basic probability assignment functional value that is divided into wait set according to the packet after merging is dispatched.

As shown in the table: suppose to have 6 packets, according to their grade with after merging, be divided into anxious assemble close, the basic probability assignment functional value of fuzzy set and wait set, determine that its dispatching sequence is 2,1,6,5,3,4.

Sequence number	Anxious tune	Fuzzy	Wait for	Court verdict
					1	0.528	0.419	0.053	Anxious tune
2	0.894	0.077	0.038	Anxious tune
					3	0.190	0.127	0.683	Wait for
4	0.054	0.014	0.932	Wait for
					5	0.120	0.806	0.074	Fuzzy
6	0.134	0.720	0.146	Fuzzy

Fig. 5, Fig. 6 and Fig. 7 are respectively method provided by the invention and PF, EDF method mean transit delay, average transmission rate and packet loss correlation curve figure, by Fig. 5, Fig. 6 and Fig. 7, be not difficult to find out, method provided by the invention has overcome precision, reliability and the lower defect of accuracy when scheduling of resource priority is differentiated according to single evaluation index.

The above; be only the present invention's embodiment preferably, but protection scope of the present invention is not limited to this, is anyly familiar with in technical scope that those skilled in the art disclose in the present invention; the variation that can expect easily or replacement, within all should being encompassed in protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion with the protection range of claim.

Claims (4)

1. the multi-service OFDM cross-layer dynamic resource allocation method based on evidence theory, is characterized in that described method comprises:

Step 1: according to scheduling grade, set up the goal set for dividing data bag, specifically according to scheduling grade order from high to low, by packet be divided into anxious assemble close, fuzzy set and 3 goal sets of wait set;

Step 2: set evaluation index, specifically set time delay, rate fairness and packet loss as evaluation index;

Step 3: the membership function that is divided into goal set according to packet under each evaluation index, calculate the basic probability assignment functional value that packet under each evaluation index is divided into goal set, specifically, according to packet under time delay, rate fairness and packet loss evaluation index be divided into anxious assemble close, the membership function of fuzzy set and wait set, calculate packet under time delay, rate fairness and packet loss evaluation index be divided into anxious assemble close, the basic probability assignment functional value of fuzzy set and wait set;

Wherein, under described time delay evaluation index packet be divided into anxious assemble close, the membership function of fuzzy set and wait set is:

$T\_{\mathrm{\μ}}_1\left(i\right)=\exp (-C_1*\mathrm{\π}*{\left(\frac{T\_\mathrm{delay}\left(i\right)-(T\_\max \left(s\left(i\right)\right)/2)}{2}\right)}^2)$

$T\_{\mathrm{\μ}}_2\left(i\right)=\exp (-C_2*\mathrm{\π}*{\left(\frac{T\_\mathrm{delay}\left(i\right)-T\_\max \left(s\left(i\right)\right)}{2}\right)}^2)$

T_μ ₃(i)=exp(-C ₃*π*(T_delay(i)) ²)

In formula:

T_ μ ₁(i) for packet i under time delay evaluation index is divided into the anxious membership function closing of assembling;

T_ μ ₂(i) for packet i under time delay evaluation index, be divided into the membership function of fuzzy set;

T_ μ ₃(i) for packet i under time delay evaluation index is divided into the membership function of waiting for set;

C ₁, C ₂, C ₃for regulating the parameter of membership function;

π is circumference ratio;

T_delay (i) is the propagation delay time of packet i;

T_delay_max (s (i)) is the propagation delay time upper limit of business s under packet i;

Described according to packet under time delay evaluation index be divided into anxious assemble close, the membership function of fuzzy set and wait set, calculate packet under time delay evaluation index be divided into anxious assemble close, the computing formula of the basic probability assignment functional value of fuzzy set and wait set is:

$\mathrm{BPAF}\_T_1\left(i\right)=\frac{T\_{\mathrm{\μ}}_1\left(i\right)}{\underset{j=\mathrm{1,2,3}}{\mathrm{\Σ}}T\_{\mathrm{\μ}}_j\left(i\right)}$

$\mathrm{BPAF}\_T_2\left(i\right)=\frac{T\_{\mathrm{\μ}}_2\left(i\right)}{\underset{j=\mathrm{1,2,3}}{\mathrm{\Σ}}T\_{\mathrm{\μ}}_j\left(i\right)}$

$\mathrm{BPAF}\_T_3\left(i\right)=\frac{T\_{\mathrm{\μ}}_3\left(i\right)}{\underset{j=\mathrm{1,2,3}}{\mathrm{\Σ}}T\_{\mathrm{\μ}}_j\left(i\right)}$

In formula:

BPAF_T ₁(i) for packet i under time delay evaluation index is divided into the anxious basic probability assignment functional value closing of assembling;

BPAF_T ₂(i) for packet i under time delay evaluation index, be divided into the basic probability assignment functional value of fuzzy set;

BPAF_T ₃(i) for packet i under time delay evaluation index is divided into the basic probability assignment functional value of waiting for set;

Under described rate fairness evaluation index packet be divided into anxious assemble close, the membership function of fuzzy set and wait set is:

$R\_{\mathrm{\μ}}_1\left(i\right)=\frac{R\_\mathrm{total}\left(s\left(i\right)\right)-R\_\mathrm{aver}\left(s\left(i\right)\right)}{R\_\mathrm{total}\left(s\left(i\right)\right)}$

$R\_{\mathrm{\μ}}_2\left(i\right)=\frac{R\_\mathrm{aver}\left(s\left(i\right)\right)}{R\_\mathrm{total}\left(s\left(i\right)\right)}$

$R\_{\mathrm{\μ}}_3\left(i\right)=\left\{\begin{array}{cc}\frac{2R\_\mathrm{aver}\left(s\left(i\right)\right)}{R\_\mathrm{total}\left(s\left(i\right)\right)}& (0\≤R\_\mathrm{aver}\left(s\left(i\right)\right)\≤\frac{1}{2}R\_\mathrm{total}\left(s\left(i\right)\right))\\ \frac{2*R\_\mathrm{total}\left(s\left(i\right)\right)-2*R\_\mathrm{aver}\left(s\left(i\right)\right)}{R\_\mathrm{total}\left(s\left(i\right)\right)}& (\frac{1}{2}R\_\mathrm{total}\left(s\left(i\right)\right)\≤R\_\mathrm{aver}\left(s\left(i\right)\right)\≤1)\end{array}\right.$

In formula:

R_ μ ₁(i) for packet i under rate fairness evaluation index is divided into the anxious membership function closing of assembling;

R_ μ ₂(i) for packet i under rate fairness evaluation index, be divided into the membership function of fuzzy set;

R_ μ ₃(i) for packet i under rate fairness evaluation index is divided into the membership function of waiting for set;

R_aver (s (i)) is the average transmission rate of business s under i packet;

R_total (s (i)) is that the affiliated business s of i packet is in the speed sum of whole subchannel transmission;

Described according to packet under rate fairness evaluation index be divided into anxious assemble close, the membership function of fuzzy set and wait set, calculate packet under rate fairness evaluation index be divided into anxious assemble close, the computing formula of the basic probability assignment functional value of fuzzy set and wait set is:

$\mathrm{BPAF}\_R_1\left(i\right)=\frac{R\_{\mathrm{\μ}}_1\left(i\right)}{\underset{j=\mathrm{1,2,3}}{\mathrm{\Σ}}R\_{\mathrm{\μ}}_j\left(i\right)}$

$\mathrm{BPAF}\_R_2\left(i\right)=\frac{R\_{\mathrm{\μ}}_2\left(i\right)}{\underset{j=\mathrm{1,2,3}}{\mathrm{\Σ}}R\_{\mathrm{\μ}}_j\left(i\right)}$

$\mathrm{BPAF}\_R_3\left(i\right)=\frac{R\_{\mathrm{\μ}}_3\left(i\right)}{\underset{j=\mathrm{1,2,3}}{\mathrm{\Σ}}R\_{\mathrm{\μ}}_3\left(i\right)}$

In formula:

BPAF_R ₁for packet i under rate fairness evaluation index is divided into the anxious basic probability assignment functional value closing of assembling;

BPAF_R ₂for packet i under rate fairness evaluation index is divided into the basic probability assignment functional value of fuzzy set;

BPAF_R ₃for packet i under rate fairness evaluation index is divided into the basic probability assignment functional value of waiting for set;

Under described packet loss evaluation index packet be divided into anxious assemble close, the membership function of fuzzy set and wait set is:

$L\_{\mathrm{\μ}}_1\left(i\right)=\exp (-C_4*\mathrm{\π}*{\left(\frac{(L\_\mathrm{loss}\left(s\left(i\right)\right)-(100*L\_\mathrm{loss}\_\max \left(s\left(i\right)\right))/2)}{2}\right)}^2)$

$L\_{\mathrm{\μ}}_2\left(i\right)=\exp (-C_5*\mathrm{\π}*{\left(\frac{(L\_\mathrm{loss}\left(s\left(i\right)\right)-(100*L\_\mathrm{loss}\_\max \left(s\left(i\right)\right))/2)}{2}\right)}^2)$

L_μ ₃(i)=exp(-C ₆*π*(L_loss(s(i))) ²)

In formula:

L_ μ ₁(i) for packet i under packet loss evaluation index is divided into the anxious membership function closing of assembling;

L_ μ ₂(i) for packet i under packet loss evaluation index, be divided into the membership function of fuzzy set;

L_ μ ₃(i) for packet i under packet loss evaluation index is divided into the membership function of waiting for set;

C ₄, C ₅, C ₆for regulating the parameter of membership function;

L_loss (s (i)) is the packet loss of business s before packet i sends under packet i;

L_loss_max (s (i)) is the packet loss upper limit of business s under packet i;

Described according to packet under packet loss evaluation index be divided into anxious assemble close, the membership function of fuzzy set and wait set, calculate packet under packet loss evaluation index be divided into anxious assemble close, the computing formula of the basic probability assignment functional value of fuzzy set and wait set is:

$\mathrm{BPAF}\_L_1\left(i\right)=\frac{L-{\mathrm{\μ}}_1\left(i\right)}{\underset{j=\mathrm{1,2,3}}{\mathrm{\Σ}}L\_{\mathrm{\μ}}_j\left(i\right)}$

$\mathrm{BPAF}\_L_2\left(i\right)=\frac{L\_{\mathrm{\μ}}_2\left(i\right)}{\underset{j=\mathrm{1,2,3}}{\mathrm{\Σ}}L\_{\mathrm{\μ}}_j\left(i\right)}$

$\mathrm{BPAF}\_L_3\left(i\right)=\frac{L\_{\mathrm{\μ}}_3\left(i\right)}{\underset{j=\mathrm{1,2,3}}{\mathrm{\Σ}}L\_{\mathrm{\μ}}_j\left(i\right)}$

In formula:

BPAF_L ₁(i) for packet i under packet loss evaluation index is divided into the anxious basic probability assignment functional value closing of assembling;

BPAF_L ₂(i) for packet i under packet loss evaluation index, be divided into the basic probability assignment functional value of fuzzy set;

BPAF_L ₃(i) for packet i under packet loss evaluation index is divided into the basic probability assignment functional value of waiting for set;

Step 4: according to D-S evidence theory, the basic probability assignment functional value that packet under each evaluation index is divided into goal set merges, and the packet after being merged is divided into the basic probability assignment functional value of goal set;

Step 5: be divided into the basic probability assignment functional value of goal set according to the packet after merging, the scheduling grade of specified data bag;

Step 6: the packet of packet according to scheduling grade and after merging is divided into the basic probability assignment functional value of goal set and dispatches.

2. a kind of multi-service OFDM cross-layer dynamic resource allocation method based on evidence theory according to claim 1, it is characterized in that in described step 4, the basic probability assignment functional value that packet under each evaluation index is divided into goal set merges, the basic probability assignment functional value that packet after being merged is divided into goal set specifically, by time delay, under rate fairness and packet loss evaluation index, packet is divided into suddenly and assembles and close, the basic probability assignment functional value of fuzzy set and wait set merges, packet after being merged is divided into anxious assembling and closes, the basic probability assignment functional value of fuzzy set and wait set, computing formula is:

$\mathrm{BPAF}\_{\mathrm{TRL}}_1\left(i\right)=\frac{\mathrm{BPAF}\_{\mathrm{TR}}_1\left(i\right)*\mathrm{BPAF}\_L_2\left(i\right)+\mathrm{BPAF}\_{\mathrm{TR}}_2\left(i\right)*\mathrm{BPAF}\_L_1\left(i\right)+\mathrm{BPAF}\_{\mathrm{TR}}_1\left(i\right)*\mathrm{BPAF}\_L_2\left(i\right)}{1-K\left(i\right)}$

$\mathrm{BPAF}\_{\mathrm{TRL}}_2\left(i\right)=\frac{\mathrm{BPAF}\_{\mathrm{TR}}_2\left(i\right)*\mathrm{BPAF}\_L_2\left(i\right)}{1-K\left(i\right)}.$

$\mathrm{BPAF}\_{\mathrm{TRL}}_3\left(i\right)=\frac{\mathrm{BPAF}\_{\mathrm{TR}}_2\left(i\right)*\mathrm{BPAF}\_L_3\left(i\right)+\mathrm{BPAF}\_{\mathrm{TR}}_3\left(i\right)*\mathrm{BPAF}\_L_2\left(i\right)*\mathrm{BPAF}\_{\mathrm{TR}}_3\left(i\right)*\mathrm{BPAF}\_L_3\left(i\right)}{1-K\left(i\right)}$

In formula:

BPAF_TRL ₁(i) for packet i after merging is divided into the anxious basic probability assignment functional value closing of assembling;

BPAF_TRL ₂(i) for packet i after merging, be divided into the basic probability assignment functional value of fuzzy set;

BPAF_TRL ₃(i) for packet i after merging is divided into the basic probability assignment functional value of waiting for set;

BPAF_TR ₁(i) for packet i under time delay and two evaluation indexes of rate fairness being divided into the anxious basic probability assignment functional value after the basic probability assignment functional value closing merges of assembling;

BPAF_TR ₂(i) for packet i under time delay and two evaluation indexes of rate fairness being divided into the basic probability assignment functional value after the basic probability assignment functional value of fuzzy set merges;

BPAF_TR ₃(i) for packet i under time delay and two evaluation indexes of rate fairness being divided into the basic probability assignment functional value of waiting for after the basic probability assignment functional value of gathering merges;

K (i) is the inconsistent factor of packet i under time delay, rate fairness and three evaluation indexes of packet loss, and its computing formula is:

K(i)=BPAF_TR ₁(i)*BPAF_L ₃(i)+BPAF_L ₃(i)*BPAF_TR ₁(i)。

3. a kind of multi-service OFDM cross-layer dynamic resource allocation method based on evidence theory according to claim 2, is characterized in that describedly packet i under time delay and two evaluation indexes of rate fairness is divided into anxious computing formula of assembling the basic probability assignment functional value after the basic probability assignment functional value closing merges is:

$\mathrm{BPAF}\_{\mathrm{TR}}_1\left(i\right)=\frac{\mathrm{BPAF}\_T_1\left(i\right)*\mathrm{BPAF}\_R_1\left(i\right)+\mathrm{BPAF}\_T_1\left(i\right)*\mathrm{BPAF}\_R_2\left(i\right)+\mathrm{BPAF}\_R_1\left(i\right)*\mathrm{BPAF}\_T_2\left(i\right)}{1-K_1\left(i\right)};$

The computing formula of the basic probability assignment functional value after the described basic probability assignment functional value that packet i under time delay and two evaluation indexes of rate fairness is divided into fuzzy set merges is:

$\mathrm{BPAF}\_{\mathrm{TR}}_2\left(i\right)=\frac{\mathrm{BPAF}\_T_2\left(i\right)*\mathrm{BPAF}\_R_2\left(i\right)}{1-K_1\left(i\right)};$

The described computing formula that packet i under time delay and two evaluation indexes of rate fairness is divided into the basic probability assignment functional value after the basic probability assignment functional value of waiting for set merges is:

$\mathrm{BPAF}\_{\mathrm{TR}}_3\left(i\right)=\frac{\mathrm{BPAF}\_T_3\left(i\right)*\mathrm{BPAF}\_R_3\left(i\right)+\mathrm{BPAF}\_T_2\left(i\right)*\mathrm{BPAF}\_R_3\left(i\right)+\mathrm{BPAF}\_R_2\left(i\right)*\mathrm{BPAF}\_T_3\left(i\right)}{1-K_1\left(i\right)};$

K ₁(i) be the inconsistent factor of packet i under time delay, two evaluation indexes of rate fairness, its computing formula is: K ₁(i)=BPAF_T ₁(i) * BPAF_R ₃(i)+BPAF_T ₃(i) * BPAF_R ₁(i).

4. a kind of multi-service OFDM cross-layer dynamic resource allocation method based on evidence theory according to claim 3, is characterized in that described step 6 specifically: for the packet of different brackets, according to scheduling grade order from high to low, dispatch; For the packet of same grade, when the scheduling grade of packet is anxious timing, according to the packet after merging, be divided into and suddenly assemble the descending order of basic probability assignment functional value of closing and dispatch; When the scheduling grade of packet is while being fuzzy, the ascending order of basic probability assignment functional value that is divided into fuzzy set according to the packet after merging is dispatched; When the scheduling grade of packet, for waiting, bide one's time, the ascending order of basic probability assignment functional value that is divided into wait set according to the packet after merging is dispatched.

Images