CN103037528B - Resource dispatching method based on carrier weight in multi-carrier system - Google Patents

Resource dispatching method based on carrier weight in multi-carrier system Download PDF

Info

Publication number
CN103037528B
CN103037528B CN201310017660.6A CN201310017660A CN103037528B CN 103037528 B CN103037528 B CN 103037528B CN 201310017660 A CN201310017660 A CN 201310017660A CN 103037528 B CN103037528 B CN 103037528B
Authority
CN
China
Prior art keywords
carrier
user
mtd
lte
msub
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Fee Related
Application number
CN201310017660.6A
Other languages
Chinese (zh)
Other versions
CN103037528A (en
Inventor
付卫红
孔庆亮
田维新
王成
黑永强
刘乃安
李晓辉
韦娟
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xidian University
Original Assignee
Xidian University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Xidian University filed Critical Xidian University
Priority to CN201310017660.6A priority Critical patent/CN103037528B/en
Publication of CN103037528A publication Critical patent/CN103037528A/en
Application granted granted Critical
Publication of CN103037528B publication Critical patent/CN103037528B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a resource dispatching method based on a carrier weight in a multi-carrier system, which mainly solves problems that system performance and complicatedness are hard to be both taken into account and an LTE (Long Term Evolution) user and cell edge user are limited in performance in the prior art. The method comprises the following realizing steps: obtaining user information and carrier information through a base station end and setting maximum accessible carrier number of each user; figuring out a carrier coverage weight factor and a user type weight factor according to the user and the carrier information so as to obtain a carrier weight factor of the user; figuring out user priority according to the carrier weight factor of the user and using the carrier weight factor as one factor in a priority calculating formula; and distributing resources to the user according to a user priority sequence so as to finish resource dispatching. According to the invention, the complicatedness of the system is reduced and the performances of the cell edge user and the LTE user in the system are improved on the premise that the throughput is guaranteed; and the resource dispatching method can be used for resource dispatching in an LTE-Advanced carrier polymerization system.

Description

Resource scheduling method based on carrier weight in multi-carrier system
Technical Field
The invention belongs to the field of wireless communication, relates to a resource scheduling technology, in particular to a resource scheduling method based on carrier weight in a multi-carrier system, and can be used for resource scheduling in an LTE-Advanced carrier aggregation system.
Background
With the development of mobile communication technology, it is difficult for the third generation mobile communication system to completely meet the requirements of users, and in order to meet the new requirements of IMT-Advanced in frequency point, bandwidth, peak rate, compatibility and other aspects, the 3GPP further evolves on the basis of the long term evolution LTE, and an evolved LTE version is proposed: LTE-Advanced.
In the requirement analysis of the LTE-Advanced system, it is pointed out that in order to achieve the peak rate of 1Gb/s, it is required to use the maximum bandwidth of 100MHz, and it is difficult to find such a wide bandwidth on the existing spectrum resource table, especially for the frequency division multiplexing FDD system, it is also necessary to find symmetric uplink and downlink frequency bands of 100MHz, which is more difficult. In response to the problem of spectrum resource shortage, an idea is to aggregate a plurality of discontinuous spectrums into a broadband spectrum, and based on this, the LTE-Advanced system introduces a concept of carrier aggregation.
Due to the introduction of the carrier aggregation technology, the LTE-Advanced system and the LTE system are greatly different in terms of radio resource management, and particularly in terms of radio resource scheduling, a resource scheduling algorithm needs to be redesigned. The LTE system uses a continuous frequency spectrum, resource scheduling is carried out on a carrier wave, and only one scheduler needs to be maintained; the LTE-Advanced system aggregates a plurality of non-contiguous frequency spectrums into one wideband frequency spectrum, and for how to reasonably allocate resources of a plurality of carriers, the existing schemes mainly include two types: the first IS independent carrier scheduling IS, and the second IS joint carrier scheduling JS.
The IS scheme IS characterized in that each carrier IS provided with a scheduler, and resource scheduling IS performed on each carrier independently, which has the advantages that the complexity of the system IS relatively low, the wireless resources cannot be fully utilized, and the system throughput IS low.
The JS scheme is characterized in that only one scheduler is provided, all carrier wave units are allocated with resources by one shared resource scheduler, and a plurality of carrier waves share user information. Therefore, how to reasonably design the resource scheduling algorithm so that the system can give consideration to both complexity and throughput is an extremely urgent problem.
When scheduling resources, how to guarantee the throughput of cell edge users is a very critical issue, especially after introducing carrier aggregation technology. Because the frequency bands of the carriers are different, the coverage area of each carrier is also different, and how to design a proper carrier weight factor for a user, so that a cell edge user can preferentially use the carrier with a wide carrier coverage area to ensure the throughput of the carrier is also a concern.
One very important feature in the LTE-Advanced system is backward compatibility, and two kinds of users can exist in the system at the same time: LTE-A users meeting the requirements of an LTE-Advanced system and LTE users meeting the requirements of the LTE system. The terminal capability of the LTE-A user is strong, and the LTE-A user can access all carriers, and the LTE user is limited in that the terminal capability of the LTE user can only access one specific carrier, namely the LTE carrier. In this case, how to guarantee the service quality of the LTE user is also a very important issue, which requires reasonable design of the user weight on the carrier.
Disclosure of Invention
The invention aims to provide a resource scheduling method based on carrier weight in a multi-carrier system, so as to solve the problems that the system performance and complexity in the LTE-Advanced system are difficult to be considered at the same time, and the performance of an LTE user and a cell edge user is limited.
The technical idea for realizing the aim of the invention is as follows: maintaining reasonable carrier weight factors for users by using a base station end, and reducing the complexity of a system on the premise of ensuring throughput by limiting the users to access one or more specific carriers in the scheduling process; the performance of the cell edge user is improved by improving the weight of the edge user on the carrier; by reducing the weight of the LTE-A user on the LTE carrier, the performance of the LTE user in the system is improved. The method comprises the following concrete implementation steps:
(1) the base station end obtains the distance d between a user and the base station, the number n of carriers, the proportion alpha of LTE users to all users, the proportion beta of LTE carriers to all carriers, the frequency f of each carrier and the coverage radius R of the carriers, and sets the number m of the carriers which can be accessed by each user at most, wherein m is more than or equal to 1 and less than or equal to n;
(2) calculating carrier weight factors of the user on different carriers according to the user and carrier information obtained in the step (1):
(2.1) setting a user i between the coverage range of the kth-1 carrier and the coverage range of the kth carrier, and calculating the carrier coverage weight factors of the user i on different carriers:
if k =1, then:
<math> <mrow> <msub> <mi>W</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>l</mi> </mrow> </msub> <mo>=</mo> <mfenced open='{' close=''> <mtable> <mtr> <mtd> <mfrac> <msub> <mi>d</mi> <mi>i</mi> </msub> <msub> <mi>R</mi> <mi>l</mi> </msub> </mfrac> <mo>,</mo> </mtd> <mtd> <mn>1</mn> <mo>&le;</mo> <mi>l</mi> <mo>&le;</mo> <mi>m</mi> </mtd> </mtr> <mtr> <mtd> <mn>0</mn> <mo>,</mo> </mtd> <mtd> <mi>m</mi> <mo>+</mo> <mn>1</mn> <mo>&le;</mo> <mi>l</mi> <mo>&le;</mo> <mi>n</mi> </mtd> </mtr> </mtable> </mfenced> </mrow> </math>
if k is more than or equal to 2 and less than or equal to n-m, then:
<math> <mrow> <msub> <mi>W</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>l</mi> </mrow> </msub> <mo>=</mo> <mfenced open='{' close=''> <mtable> <mtr> <mtd> <mn>0</mn> <mo>,</mo> </mtd> <mtd> <mn>1</mn> <mo>&le;</mo> <mi>l</mi> <mo>&le;</mo> <mi>k</mi> <mo>-</mo> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mfrac> <msub> <mi>d</mi> <mi>i</mi> </msub> <msub> <mi>R</mi> <mi>l</mi> </msub> </mfrac> <mo>,</mo> </mtd> <mtd> <mi>k</mi> <mo>&le;</mo> <mi>l</mi> <mo>&le;</mo> <mi>k</mi> <mo>+</mo> <mi>m</mi> <mo>-</mo> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mn>0</mn> <mo>,</mo> </mtd> <mtd> <mi>k</mi> <mo>+</mo> <mi>m</mi> <mo>&le;</mo> <mi>l</mi> <mo>&le;</mo> <mi>n</mi> </mtd> </mtr> </mtable> </mfenced> </mrow> </math>
if k is more than or equal to n-m +1 and less than or equal to n, then:
<math> <mrow> <msub> <mi>W</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>l</mi> </mrow> </msub> <mo>=</mo> <mfenced open='{' close=''> <mtable> <mtr> <mtd> <mn>0</mn> <mo>,</mo> </mtd> <mtd> <mn>1</mn> <mo>&le;</mo> <mi>l</mi> <mo>&le;</mo> <mi>k</mi> <mo>-</mo> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mfrac> <msub> <mi>d</mi> <mi>i</mi> </msub> <msub> <mi>R</mi> <mi>l</mi> </msub> </mfrac> <mo>,</mo> </mtd> <mtd> <mi>k</mi> <mo>&le;</mo> <mi>l</mi> <mo>&le;</mo> <mi>n</mi> </mtd> </mtr> </mtable> </mfenced> </mrow> </math>
where the symbol l denotes the l-th carrier in the system, Wi,lA carrier coverage weight factor, d, representing user i on carrier liDenotes the distance, R, between user i and the base stationiRepresents the coverage radius of carrier l;
(2.2) calculating user type weight factors of the user i on different carriers:
wherein, Ui,lTo representA user type weight factor of a user i on a carrier l, wherein alpha represents the proportion of an LTE user in all users, and beta represents the proportion of the LTE carrier in all carriers;
(2.3) integrating the carrier coverage weight factors obtained in the step (2.1) and the user type weight factors obtained in the step (2.2), and calculating the carrier weight factors of the user on different carriers:
Pi,l=Ui,lWi,l
wherein, Pi,lRepresenting the carrier weight factor, U, of user i on carrier li,lWeight factor, W, representing the user type of user i on carrier li,lA carrier coverage weight factor representing a user i on a carrier l;
(3) calculating the priority of the user on different carriers according to the carrier weight factors of the user on different carriers obtained in the step (2):
PPi,l=Pi,lFi,l
wherein, PPi,lIndicating the priority of user i on carrier l, Fi,lIs a priority calculation formula of a proportional fair scheduling algorithm,Di,lis the highest data rate for user i on carrier i,is that user i has passed a period of time t on carrier lcAverage transmission rate of tcThe time window of the algorithm is generally 1000 ms;
(4) and (4) allocating the wireless resources of the carriers to the users according to the user priority obtained in the step (3) and the user priority sequence.
Compared with the prior art, the invention has the beneficial effects that:
1) according to the invention, a simple formula for calculating the carrier weight factor is constructed, so that the calculation complexity of the system can be reduced;
2) the invention can obtain a reasonable compromise between the system performance and the complexity by limiting the user to access one or more specific carriers;
3) according to the invention, by introducing the weight factor of the coverage area of the carrier, the weight of the cell edge users on the carrier is improved, so that the cell center users preferentially use the resources of the carrier with a small coverage area, and the carrier resources with a large coverage area are reserved for the cell edge users, thereby improving the performance of the cell edge users;
4) according to the invention, by introducing the user class weight factor, the priority of the LTE-A user on the LTE carrier is reduced, so that the LTE carrier resource is preferentially used by the LTE user, and the performance of the LTE user is improved under the condition that the LTE-A user and the LTE user exist at the same time.
Drawings
FIG. 1 is a schematic diagram of an application scenario of the present invention;
FIG. 2 is a general flow chart of an implementation of the present invention;
FIG. 3 is a sub-flow diagram of the calculation of carrier weight factors in the present invention;
fig. 4 is an average throughput curve of LTE-a users and LTE users simulated by the prior art method and the present invention method when the ratio of LTE users to all users α =0.2 and the ratio of LTE carriers to all carriers β = 0.25;
fig. 5 is an average throughput curve of LTE-a users and LTE users simulated by the prior art method and the present invention method when the ratio of LTE users to all users α =0.4 and the ratio of LTE carriers to all carriers β = 0.25;
fig. 6 is a graph of average throughput of cell edge users and cell center users simulated by the existing method and the method of the present invention when the ratio α =0.2 of LTE users to all users and the ratio β =0.25 of LTE carriers to all carriers;
fig. 7 is an average throughput curve of cell edge users and cell center users simulated by the prior art method and the present invention method when the ratio α =0.4 of LTE users to all users and the ratio β =0.25 of LTE carriers to all carriers.
Detailed Description
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the invention and together with the description serve to explain the invention without limiting the invention.
Referring to fig. 1, an application scenario in which the present invention is applied is a multi-carrier communication system. A cell of the system is provided with a base station eNB and a plurality of user equipment UE, wherein the UE is LTE user equipment or LTE-A user equipment. There are n carriers in the system, each carrier has different frequency and coverage range, and each UE can access one member or multiple members in the carrier CC.
Referring to fig. 2, the implementation steps of the invention are as follows:
step 1, a base station side acquires user information and carrier information:
1) a base station end sends a pilot signal to a user, the user processes the pilot signal after receiving the pilot signal and feeds back position information to the base station through an uplink, and the base station obtains a distance d between the user and the base station according to the position information fed back by the user;
2) the base station side counts the number of LTE users and the total number of users in the system, and calculates the proportion alpha of the LTE users in all users:
3) the base station side counts the number of LTE carriers and the total number of carriers n in the system, and calculates the proportion beta of the LTE carriers to all carriers:
4) the coverage radius R of the carrier is calculated as follows:
58.83+37.6log(10Rl)+21log(10fl)=Lth
wherein R islIs the coverage radius of the carrier l, flIs the frequency, L, of the carrier wave LthA path loss threshold value for the carrier, which is given by the base station according to the specific scene and has f1>f2>…>fn,R1<R2<…<Rn,f1、f2、…、fnFor the frequency, R, of each carrier1、R2、…、RnThe coverage radius for each carrier;
5) the maximum accessible carrier number m of each user is set, m is more than or equal to 1 and less than or equal to n, the larger the value of m is, the more the carrier number accessible by the user is, the higher the system complexity is, but the corresponding system throughput is higher, and conversely, the smaller the value of m is, the less the carrier number accessible by the user is, the lower the system complexity is, but the system throughput is lower.
And 2, calculating carrier weight factors of the user on different carriers according to the user and carrier information obtained in the step 1.
Referring to fig. 3, the steps of calculating the carrier weight factor according to the present invention are as follows:
(2a) and (3) setting a user i between the coverage range of the kth-1 carrier and the coverage range of the kth carrier, and calculating a carrier coverage range weight factor of the user i on each carrier:
if k =1, then:
<math> <mrow> <msub> <mi>W</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>l</mi> </mrow> </msub> <mo>=</mo> <mfenced open='{' close=''> <mtable> <mtr> <mtd> <mfrac> <msub> <mi>d</mi> <mi>i</mi> </msub> <msub> <mi>R</mi> <mi>l</mi> </msub> </mfrac> <mo>,</mo> </mtd> <mtd> <mn>1</mn> <mo>&le;</mo> <mi>l</mi> <mo>&le;</mo> <mi>m</mi> </mtd> </mtr> <mtr> <mtd> <mn>0</mn> <mo>,</mo> </mtd> <mtd> <mi>m</mi> <mo>+</mo> <mn>1</mn> <mo>&le;</mo> <mi>l</mi> <mo>&le;</mo> <mi>n</mi> </mtd> </mtr> </mtable> </mfenced> </mrow> </math>
if k is more than or equal to 2 and less than or equal to n-m, then:
<math> <mrow> <msub> <mi>W</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>l</mi> </mrow> </msub> <mo>=</mo> <mfenced open='{' close=''> <mtable> <mtr> <mtd> <mn>0</mn> <mo>,</mo> </mtd> <mtd> <mn>1</mn> <mo>&le;</mo> <mi>l</mi> <mo>&le;</mo> <mi>k</mi> <mo>-</mo> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mfrac> <msub> <mi>d</mi> <mi>i</mi> </msub> <msub> <mi>R</mi> <mi>l</mi> </msub> </mfrac> <mo>,</mo> </mtd> <mtd> <mi>k</mi> <mo>&le;</mo> <mi>l</mi> <mo>&le;</mo> <mi>k</mi> <mo>+</mo> <mi>m</mi> <mo>-</mo> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mn>0</mn> <mo>,</mo> </mtd> <mtd> <mi>k</mi> <mo>+</mo> <mi>m</mi> <mo>&le;</mo> <mi>l</mi> <mo>&le;</mo> <mi>n</mi> </mtd> </mtr> </mtable> </mfenced> </mrow> </math>
if k is more than or equal to n-m +1 and less than or equal to n, then:
<math> <mrow> <msub> <mi>W</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>l</mi> </mrow> </msub> <mo>=</mo> <mfenced open='{' close=''> <mtable> <mtr> <mtd> <mn>0</mn> <mo>,</mo> </mtd> <mtd> <mn>1</mn> <mo>&le;</mo> <mi>l</mi> <mo>&le;</mo> <mi>k</mi> <mo>-</mo> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mfrac> <msub> <mi>d</mi> <mi>i</mi> </msub> <msub> <mi>R</mi> <mi>l</mi> </msub> </mfrac> <mo>,</mo> </mtd> <mtd> <mi>k</mi> <mo>&le;</mo> <mi>l</mi> <mo>&le;</mo> <mi>n</mi> </mtd> </mtr> </mtable> </mfenced> </mrow> </math>
where the symbol l denotes the l-th carrier in the system, Wi,lA carrier coverage weight factor, d, representing user i on carrier liDenotes the distance, R, between user i and the base stationlRepresents the coverage radius of carrier l;
the weight of cell edge users on carriers is improved by setting a carrier coverage weight factor, so that the priority of the cell edge users is improved, and the performance of the cell edge users is improved;
(2b) calculating user type weight factors of a user i on different carriers:
wherein, Ui,lThe method comprises the steps of representing a user type weight factor of a user i on a carrier l, wherein alpha represents the proportion of an LTE user in all users, and beta represents the proportion of the LTE carrier in all carriers;
when the alpha is larger than the beta, namely the LTE user proportion is larger than the LTE carrier proportion, (beta-alpha) <0, the weight max {0, (beta-alpha) } =0 of the LTE-A user on the LTE carrier, the LTE-A user is prohibited from accessing the LTE carrier, so that the LTE carrier resource can be ensured to be only used by the LTE user, and the performance of the LTE user can be improved;
when alpha < beta, namely the proportion of LTE users is smaller than the proportion of LTE carriers, (beta-alpha) >0, the weight max {0, (beta-alpha) } = (beta-alpha) of the LTE-A users on the LTE carriers, the LTE-A users are allowed to access the LTE carriers, at this time, 0< (beta-alpha) <1, and the closer to the beta is, the smaller the user type weight of the LTE-A users on the LTE carriers is, so that the weight of the LTE-A users on the LTE carriers can be reduced, and the LTE users can be preferentially scheduled on the LTE carriers, thereby improving the performance of the LTE users;
(2c) and (3) integrating the carrier coverage weight factors obtained in the step (2a) and the user type weight factors obtained in the step (2b), and calculating the carrier weight factors of the user on different carriers:
Pi,l=Ui,lWi,l
wherein, Pi,lRepresenting the carrier weight factor, U, of user i on carrier li,lWeight factor, W, representing the user type of user i on carrier li,lA carrier coverage weight factor representing a user i on a carrier l;
Wi,land Ui,lThe multiplication results are divided into the following four cases:
carrier weight factor of LTE user i on LTE carrier i: pi,l=Wi,l
Carrier weight factor of LTE user i on LTE-a carrier l: pi,l=0;
Carrier weight factor of LTE-A user i on LTE-A carrier l: pi,l=Wi,l
Carrier weight factor of LTE-a user i on LTE carrier i: pi,l=Wi,l·max{0,(β-α)}。
Step 3, calculating the priority of the user on different carriers according to the carrier weight factors of the user on different carriers obtained in the step 2:
<math> <mrow> <msub> <mi>PP</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>l</mi> </mrow> </msub> <mo>=</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>l</mi> </mrow> </msub> <msub> <mi>F</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>l</mi> </mrow> </msub> <mo>=</mo> <msub> <mi>P</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>l</mi> </mrow> </msub> <mo>&CenterDot;</mo> <mfrac> <msub> <mi>D</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>l</mi> </mrow> </msub> <mover> <msub> <mi>R</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>l</mi> </mrow> </msub> <mo>&OverBar;</mo> </mover> </mfrac> </mrow> </math>
wherein, PPi,lIndicating the priority of user i on carrier l, Fi,lPriority calculation formula, D, for proportional fair scheduling algorithmi,lIs the highest transmission rate of user i on carrier i,is that user i has passed a period of time t on carrier lcAverage transmission rate of tcThe value is 1000ms for the time window of the algorithm.
And 4, allocating the resources of the carriers to the users according to the user priorities obtained in the step 3, namely allocating the wireless resources to the users according to the priority from high to low on each carrier by the scheduler according to the user priorities obtained in the step 3 at each scheduling moment, and after the allocation is finished, transmitting data by using the allocated resources by the users to finish the resource scheduling process.
The advantages of the present invention can be further illustrated by the following simulations:
1. simulation condition and method
1.1) the total carrier number of the system is 4, the LTE carrier number is 1, the LTE-A carrier number is 3, the LTE carrier frequency is 1.8GHz, the LTE-A carrier frequency is 900MHz, 2.7GHz and 3.6GHz respectively, and the carrier number which can be accessed by a user at most is 2;
1.2) other simulation conditions are shown in Table 1
TABLE 1 Main System parameters used for simulation
1.3) simulation method:
the invention discloses a traditional joint carrier scheduling proportional fairness algorithm JS-PF and a method thereof.
2. Emulated content
Simulation 1.
Under the simulation conditions, when the proportion of the number of the LTE users to all the users α =0.2 and the proportion of the LTE carriers to all the carriers β =0.25 are simulated by using the conventional joint carrier scheduling proportional fair algorithm JS-PF and the method of the present invention, the average throughput of the two types of users, LTE and LTE-a, is shown in fig. 4.
As can be seen from fig. 4, for the throughput of the LTE user, the throughput of the present invention is improved compared to the existing JS-PF algorithm, and the throughput of the LTE-a user is reduced, because, in the case of α < β, when the method of the present invention is adopted, the priority of the LTE-a user on the LTE carrier is reduced, so that the resources on the LTE carrier are preferentially used by the LTE user.
Simulation 2.
Under the simulation conditions, when the proportion of the number of the LTE users to all the users is α =0.4 and the proportion of the LTE carriers to all the carriers is β =0.25, the average throughput of the two types of users, LTE and LTE-a, is simulated by using the conventional joint carrier scheduling proportional fair algorithm JS-PF and the method of the present invention, and the simulation result is shown in fig. 5.
As can be seen from fig. 5, compared with the existing JS-PF algorithm, the throughput of the LTE user is improved, and the throughput of the LTE-a user is reduced, because, in the case of α > β, when the method of the present invention is adopted, the LTE-a user is prohibited from accessing to the LTE carrier, and the LTE carrier resources are only allocated to the LTE user for use.
And (3) simulating.
Under the simulation conditions, when the proportion of the number of LTE users to all users α =0.2 and the proportion of the LTE carriers to all carriers β =0.25 are simulated by using the conventional joint carrier scheduling proportional fair algorithm JS-PF and the method of the present invention, the average throughput of the cell edge users and the cell center users is shown in fig. 6.
As can be seen from fig. 6, compared with the existing JS-PF algorithm, the present invention improves the throughput of the cell edge users, and reduces the throughput of the cell center users, because the carrier coverage weight factor is introduced into the user priority calculation formula, the carrier weight of the cell edge users is improved, and thus the priority of the cell edge users is improved.
Simulation 4.
Under the simulation conditions, when the proportion of the number of LTE users to all users α =0.4 and the proportion of the LTE carriers to all carriers β =0.25 are simulated by using the conventional joint carrier scheduling proportional fair algorithm JS-PF and the method of the present invention, the average throughput of the cell edge users and the cell center users is shown in fig. 7.
As can be seen from fig. 7, compared with the existing JS-PF algorithm, the present invention improves the throughput of cell edge users, and reduces the throughput of cell center users, because the carrier coverage weight factor is introduced into the priority calculation formula, the carrier weight of cell edge users is improved, and thus the priority is improved.
The simulation shows that compared with the traditional resource scheduling algorithm, the method can effectively improve the performance of cell edge users and improve the performance of LTE users when LTE and LTE-A users exist at the same time.
The foregoing is only a preferred embodiment of the present invention, and it should be noted that, for those skilled in the art, various modifications and decorations can be made without departing from the principle of the present invention, and these modifications and decorations should also be regarded as the protection scope of the present invention.

Claims (4)

1. A resource scheduling method based on carrier weight in a multi-carrier system is characterized by comprising the following steps:
1) the base station end obtains the distance d between the user and the base station, the number n of carriers, the proportion alpha of LTE user to all users, the proportion beta of LTE carrier to all carriers, the frequency f of each carrier and the coverage radius R of the carrier, and sets the number m of the carriers which can be accessed by each user at most, wherein m is more than or equal to 1 and less than or equal to n,
the coverage radius R is calculated according to the following formula:
58.83 + 37.6 log ( 10 R l ) + 21 log ( 10 f l ) = L th
wherein,is a carrier waveThe radius of coverage of (a) is,is a carrier waveFrequency of (L)thThe specific value of the path loss threshold value for the carrier is given by the base station end and has f1>f2>...>fn,R1<R2<...<Rn,f1、f2、...、fnFor the frequency, R, of each carrier1、R2、...、RnThe coverage radius for each carrier;
2) calculating carrier weight factors of the user on different carriers according to the user and carrier information obtained in the step 1):
2.1) setting a user i between the coverage range of the kth-1 carrier and the coverage range of the kth carrier, and calculating the carrier coverage weight factors of the user i on different carriers:
if k is 1, then:
<math> <mrow> <msub> <mi>W</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>l</mi> </mrow> </msub> <mo>=</mo> <mfenced open='{' close=''> <mtable> <mtr> <mtd> <mfrac> <msub> <mi>d</mi> <mi>i</mi> </msub> <msub> <mi>R</mi> <mi>l</mi> </msub> </mfrac> <mo>,</mo> </mtd> <mtd> <mn>1</mn> <mo>&le;</mo> <mi>l</mi> <mo>&le;</mo> <mi>m</mi> </mtd> </mtr> <mtr> <mtd> <mn>0</mn> <mo>,</mo> </mtd> <mtd> <mi>m</mi> <mo>+</mo> <mn>1</mn> <mo>&le;</mo> <mi>l</mi> <mo>&le;</mo> <mi>n</mi> </mtd> </mtr> </mtable> </mfenced> </mrow> </math>
if k is more than or equal to 2 and less than or equal to n-m, then:
<math> <mrow> <msub> <mi>W</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>l</mi> </mrow> </msub> <mo>=</mo> <mfenced open='{' close=''> <mtable> <mtr> <mtd> <mn>0</mn> <mo>,</mo> </mtd> <mtd> <mn>1</mn> <mo>&le;</mo> <mi>l</mi> <mo>&le;</mo> <mi>k</mi> <mo>-</mo> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mfrac> <msub> <mi>d</mi> <mi>i</mi> </msub> <msub> <mi>R</mi> <mi>l</mi> </msub> </mfrac> <mo>,</mo> </mtd> <mtd> <mi>k</mi> <mo>&le;</mo> <mi>l</mi> <mo>&le;</mo> <mi>k</mi> <mo>+</mo> <mi>m</mi> <mo>-</mo> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mn>0</mn> <mo>,</mo> </mtd> <mtd> <mi>k</mi> <mo>+</mo> <mi>m</mi> <mo>&le;</mo> <mi>l</mi> <mo>&le;</mo> <mi>n</mi> </mtd> </mtr> </mtable> </mfenced> </mrow> </math>
if k is more than or equal to n-m +1 and less than or equal to n, then:
<math> <mrow> <msub> <mi>W</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>l</mi> </mrow> </msub> <mo>=</mo> <mfenced open='{' close=''> <mtable> <mtr> <mtd> <mn>0</mn> <mo>,</mo> </mtd> <mtd> <mn>1</mn> <mo>&le;</mo> <mi>l</mi> <mo>&le;</mo> <mi>k</mi> <mo>-</mo> <mn>1</mn> </mtd> </mtr> <mtr> <mtd> <mrow> <mfrac> <msub> <mi>d</mi> <mi>i</mi> </msub> <msub> <mi>R</mi> <mi>l</mi> </msub> </mfrac> <mo>,</mo> </mrow> </mtd> <mtd> <mi>k</mi> <mo>&le;</mo> <mi>l</mi> <mo>&le;</mo> <mi>n</mi> </mtd> </mtr> </mtable> </mfenced> </mrow> </math>
wherein, the symbolIn a presentation systemA number of carriers to be transmitted,indicating user i is on carrierUpper carrier coverage weight factor, diIndicating the distance between user i and the base station,representing a carrier waveThe radius of coverage of;
2.2) calculating user type weight factors of the user i on different carriers:
wherein,indicating user i is on carrierThe user type weight factor is as above, alpha represents the proportion of LTE users in all users, and beta represents the proportion of LTE carriers in all carriers;
2.3) integrating the carrier coverage weight factors obtained in the step 2.1) and the user type weight factors obtained in the step 2.2), and calculating the carrier weight factors of the user on different carriers:
P i , l = U i , l W i , l
wherein,indicating user i is on carrierA carrier weight factor of;
3) calculating the priority of the user on different carriers according to the carrier weight factors of the user on different carriers obtained in the step 2):
PP i , l = P i , l F i , l
wherein,indicating user i is on carrierThe priority of the upper side of the network,is a priority calculation formula of a proportional fair scheduling algorithm, is that user i is on a carrierThe highest data rate of the data packet (c),is that user i is on a carrierLast period of time tcAverage transmission rate of tcThe time window of the algorithm is generally 1000 ms;
4) allocating the wireless resources of the carrier waves to the users according to the priority order of the users obtained in the step 3).
2. The method according to claim 1, wherein the ratio α of users and the ratio β of carriers in step 1) are respectively expressed as:
3. the method according to claim 1, wherein in step 2.3) the carrier weight factors of the users on different carriers,andthe multiplication results are divided into the following four cases:
LTE user i in LTE carrierUpper carrier weight factor:
LTE user i in LTE-A carrierUpper carrier weight factor:
LTE-A user i in LTE-A carrierUpper carrier weight factor:
LTE-A user i in LTE carrierUpper carrier weight factor:
4. the method according to claim 1, wherein the step 4) of allocating radio resources of carriers to users according to the user priority order is that at each scheduling time, on each carrier, according to the user priority obtained in step 3), the scheduler allocates radio resources to users in the order of priority from high to low, and after the allocation is finished, the users transmit data by using the allocated resources, thereby completing the resource scheduling process.
CN201310017660.6A 2013-01-17 2013-01-17 Resource dispatching method based on carrier weight in multi-carrier system Expired - Fee Related CN103037528B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201310017660.6A CN103037528B (en) 2013-01-17 2013-01-17 Resource dispatching method based on carrier weight in multi-carrier system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201310017660.6A CN103037528B (en) 2013-01-17 2013-01-17 Resource dispatching method based on carrier weight in multi-carrier system

Publications (2)

Publication Number Publication Date
CN103037528A CN103037528A (en) 2013-04-10
CN103037528B true CN103037528B (en) 2015-06-03

Family

ID=48023870

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310017660.6A Expired - Fee Related CN103037528B (en) 2013-01-17 2013-01-17 Resource dispatching method based on carrier weight in multi-carrier system

Country Status (1)

Country Link
CN (1) CN103037528B (en)

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103427972B (en) * 2013-08-15 2016-08-10 北京北方烽火科技有限公司 A kind of carrier wave resource allocation method and device
CN104980934B (en) * 2015-07-08 2018-08-21 北京邮电大学 Multi-service resource dispatching method and device
CN106559197A (en) * 2015-09-28 2017-04-05 中兴通讯股份有限公司 A kind of carrier selecting method and device
CN106455101B (en) * 2016-10-31 2019-11-08 中国联合网络通信集团有限公司 A kind of method and device of wireless resource scheduling
CN110876140B (en) * 2018-08-30 2022-02-18 Oppo广东移动通信有限公司 Carrier aggregation configuration method and device, electronic equipment and storage medium
CN113994735B (en) * 2019-04-25 2024-06-07 诺基亚通信公司 Pilot data between serving cells in carrier aggregation

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101459958A (en) * 2009-01-06 2009-06-17 东南大学 Downlink resource distributing method for distributed multi-antenna OFDMA system
CN101541086A (en) * 2009-05-08 2009-09-23 华为技术有限公司 Method and device for distributing carrier number

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TWI276322B (en) * 2005-12-28 2007-03-11 Ind Tech Res Inst A system and a method of request scheduling using request classification and allowable server resource for the differentiated quality of service

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101459958A (en) * 2009-01-06 2009-06-17 东南大学 Downlink resource distributing method for distributed multi-antenna OFDMA system
CN101541086A (en) * 2009-05-08 2009-09-23 华为技术有限公司 Method and device for distributing carrier number

Also Published As

Publication number Publication date
CN103037528A (en) 2013-04-10

Similar Documents

Publication Publication Date Title
US11930508B2 (en) Downlink control information transmission method
CN103037528B (en) Resource dispatching method based on carrier weight in multi-carrier system
EP2586252B1 (en) Method and apparatus for transmitting and receiving uplink data in mobile communication system
WO2018224042A1 (en) Signal transmission method, related device and system
US20170237592A1 (en) Peak to average power ratio reduction in elaa
CN102215593B (en) Improved LTE (long term evolution) scheduling method based on proportional fair
US20170245263A1 (en) PUCCH Resource Allocation and Peak to Average Power Ratio Reduction in eLAA
US8934361B2 (en) Downlink inter-cell interference coordination method and eNB
US9860038B2 (en) Resource configuration method, equipment and system for uplink control channel
Mihovska et al. Overview of 5G new radio and carrier aggregation: 5G and beyond networks
WO2020094025A1 (en) Method and device for transmitting uplink control information
WO2017167265A1 (en) Pucch resource allocation and peak to average power ratio reduction in elaa
WO2009059460A1 (en) Method and device for scheduling resource between different tdd systems
CN113079577A (en) Resource allocation method based on coexistence scene of EMBB and URLLC
WO2020220377A1 (en) Selection of channel access priority
Zhao et al. Power-efficient radio resource allocation for low-medium-altitude aerial platform based TD-LTE networks
CN102056305B (en) User grouping and resource allocation method for wireless relay network
US20140029425A1 (en) Method And Apparatus For Inter-Carrier Load Balancing
CN102457972A (en) Same-frequency networking method and device for different time slot allocations
Lee et al. On resource block sharing in 3GPP-LTE system
Krasilov et al. Efficient multiplexing of downlink eMBB and URLLC traffic with massive MU-MIMO
CN102202413A (en) Method for dispatching resources by combining network coding and user pairing
Ahmed et al. Throughput-fairness tradeoff in LTE uplink scheduling algorithms
Park et al. System level performance evaluation of various carrier aggregation scenarios in LTE-advanced
WO2022186816A1 (en) User equipment-aborted full-duplex communication

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20150603

Termination date: 20200117

CF01 Termination of patent right due to non-payment of annual fee