WO2010096946A1 - 资源调度方法、调度器和基站 - Google Patents

资源调度方法、调度器和基站 Download PDF

Info

Publication number
WO2010096946A1
WO2010096946A1 PCT/CN2009/000194 CN2009000194W WO2010096946A1 WO 2010096946 A1 WO2010096946 A1 WO 2010096946A1 CN 2009000194 W CN2009000194 W CN 2009000194W WO 2010096946 A1 WO2010096946 A1 WO 2010096946A1
Authority
WO
WIPO (PCT)
Prior art keywords
user equipment
resource
user
base station
probability
Prior art date
Application number
PCT/CN2009/000194
Other languages
English (en)
French (fr)
Inventor
温萍萍
尤明礼
吴绍权
孙芳蕾
Original Assignee
上海贝尔股份有限公司
阿尔卡特朗讯
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 上海贝尔股份有限公司, 阿尔卡特朗讯 filed Critical 上海贝尔股份有限公司
Priority to EP09840614.3A priority Critical patent/EP2403305A4/en
Priority to BRPI0924256A priority patent/BRPI0924256A2/pt
Priority to CN200980150486.4A priority patent/CN102246571B/zh
Priority to PCT/CN2009/000194 priority patent/WO2010096946A1/zh
Priority to JP2011551382A priority patent/JP5307904B2/ja
Priority to US13/202,908 priority patent/US9107233B2/en
Priority to KR20117022039A priority patent/KR101489704B1/ko
Publication of WO2010096946A1 publication Critical patent/WO2010096946A1/zh

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/50Allocation or scheduling criteria for wireless resources
    • H04W72/53Allocation or scheduling criteria for wireless resources based on regulatory allocation policies
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/50Allocation or scheduling criteria for wireless resources
    • H04W72/54Allocation or scheduling criteria for wireless resources based on quality criteria
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04JMULTIPLEX COMMUNICATION
    • H04J11/00Orthogonal multiplex systems, e.g. using WALSH codes
    • H04J11/0023Interference mitigation or co-ordination
    • H04J11/005Interference mitigation or co-ordination of intercell interference
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W16/00Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/02Resource partitioning among network components, e.g. reuse partitioning
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/04Wireless resource allocation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/12Wireless traffic scheduling
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/50Allocation or scheduling criteria for wireless resources
    • H04W72/54Allocation or scheduling criteria for wireless resources based on quality criteria
    • H04W72/541Allocation or scheduling criteria for wireless resources based on quality criteria using the level of interference
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W16/00Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/24Cell structures
    • H04W16/30Special cell shapes, e.g. doughnuts or ring cells

Definitions

  • the present invention relates to the field of mobile communications, and more particularly to a distributed probability dynamic interference coordination scheme, which introduces an AL0HA mechanism into dynamic interference coordination, and proposes a resource scheduling method and a scheduler for implementing the foregoing resource scheduling method. And a base station (BS) including the above scheduler.
  • BS base station
  • orthogonal frequency division multiple access OFDM
  • SC-FDMA single-carrier frequency division multiple access
  • Static and semi-static coordination techniques are common interference coordination techniques in the LTE proposal. These small-interval interference coordination techniques impose restrictions on the way in which cells are coordinated. For example, it limits the time-frequency resources available to the resource manager or limits the transmission power available for a particular time-frequency resource.
  • FIG. 1 shows the frequency reuse scheme proposed in the proposal.
  • a total of seven cells are shown, and cells 2 to 7 are the neighboring cells of cell 1.
  • the frequencies between adjacent cells should be selected to be orthogonal to each other at the cell edge, and
  • the frequency reuse factor is increased as much as possible.
  • cell 1 uses frequency 1
  • cells 2, 4, and 6 use the same frequency 2
  • cells 3, 5, and 7 use the same frequency 3.
  • Cell edge users transmit and receive at full power.
  • the cell center user uses the entire spectrum for transmission and reception with limited power, so even if the same frequency is used, it does not cause large inter-cell interference (IC I).
  • IC I inter-cell interference
  • I Reference [2] proposes another static solution called network power planning, which divides the entire frequency band into multiple subsets with corresponding power, for example, 7 to 9 subsets. According to this scheme, the frequency utilization rate of the cell edge user is 3/7.
  • Reference [3] proposes a semi-static scheme: dividing the entire frequency band into N sub-bands, X sub-bands for cell edge users, and N-3X sub-bands for cell center users.
  • the X subbands for cell edge users are orthogonal between neighboring cells, while the N-3X subbands for cell center users are the same for all cells.
  • this scheme only part of the spectrum is used for intra-cell and cell edge, respectively. Summary of the invention
  • the above solution is a static solution or a semi-static solution requiring network planning, and the semi-static solution requires additional signaling to indicate that an adjustment has occurred;
  • the frequency reuse factor of the cell edge user is greater than 1, which reduces the spectrum efficiency
  • the present invention proposes a distributed probability dynamic interference coordination scheme to reduce or eliminate inter-cell interference, wherein the AL0HA mechanism is introduced into dynamic interference coordination.
  • a resource scheduling method including: selecting a resource to be scheduled from a scheduling list; selecting a first user equipment to be scheduled from a scheduling list; and if the first user equipment If it is an edge user, the selected resource is assigned to the first user equipment with a probability P, where 0 ⁇ p ⁇ 1.
  • the resource scheduling method may further include: if the first user equipment is not an edge user, allocating the selected resource to the first user equipment.
  • the resource scheduling method may further include: if the selected resource is not allocated to the first user equipment according to the probability p, returning to the first user equipment selecting step, selecting from the scheduling list The next first user device that is scheduled.
  • the resource scheduling method may further include: notifying, to the first user equipment, information about allocating resources to the first user equipment; obtaining scheduling information from all relevant base stations; Scheduling information obtained by all relevant base stations, determining that at least one relevant base station may allocate resources scheduled to be scheduled to the first user equipment to a second user equipment that is an edge user of the at least one related base station, and then execute the resource Probability allocation step.
  • the resource scheduling method may further include: if it is determined that all related base stations do not allocate resources scheduled to be scheduled to the first user equipment to the second user equipment, allocate the selected resources to the The first user equipment is described.
  • the path loss difference between the first user equipment and its serving cell and its non-serving cell is less than a predetermined threshold PLD. thresho ld, the first user equipment is an edge user, and the non-serving cell
  • PLD predetermined threshold
  • the predetermined threshold S I R- t hresho l d is equal to the Euler number e.
  • the resource probability allocation step may include: generating a random number Re (0, 1); if the random number R is smaller than the probability p, assigning the selected resource to the first user equipment .
  • the probability p is pre-configured or dynamically adjustable.
  • the scheduling list is determined according to a scheduling algorithm.
  • a scheduler for implementing the foregoing resource scheduling method including: a resource selection unit, configured to select a resource to be scheduled from a scheduling list; and a user equipment selection unit, configured to use the scheduling list Selecting a first user equipment to be scheduled; an edge user determining unit, configured to determine whether the first user equipment is an edge user; and a resource probability allocation unit, configured to allocate the selected resource to the a first user equipment, where 0 ⁇ p ⁇ 1, wherein when the edge user determining unit determines that the first user equipment is an edge user, the resource probability allocation unit The resource selected by the resource selection unit is allocated to the first user equipment with the probability p.
  • the edge user determining unit determines that the first user equipment is not allocated to the first user equipment.
  • the user equipment selection unit selects from the scheduling list. The next first user device to be scheduled.
  • the scheduler may further include: a resource allocation information notification unit, configured to: when the edge user determining unit determines that the first user equipment is an edge user, prepare to allocate resources to the first user equipment Information is sent to all relevant base stations of the first user equipment; a scheduling information receiving unit is configured to obtain scheduling information from all relevant base stations; and a relevant base station allocation determining unit is configured to determine all relevant information according to scheduling information obtained from all relevant base stations Whether the base station allocates resources to be scheduled to the first user equipment to the second user equipment that is an edge user of the related base station, where the relevant base station allocation determining unit determines that at least one relevant base station may be ready to be scheduled When the resource of the first user equipment is allocated to the second user equipment that is the edge user of the at least one related base station, the resource probability allocation unit allocates the resource selected by the resource selection unit by the probability p Giving the first user device.
  • a resource allocation information notification unit configured to: when the edge user determining unit determines that the first user equipment is an edge user, prepare to allocate resources to the first
  • the first user equipment is determined when the relevant base station allocation determining unit determines that all related base stations do not allocate resources scheduled to be scheduled to the first user equipment to the second user equipment.
  • the edge user determining unit determines that the first user equipment is an edge. And determining, by the user, the base station to which the non-serving cell belongs is the relevant base station of the first user equipment.
  • the edge user determining unit determines that the first user equipment is an edge user, and will be the first The base station immediately adjacent to the serving base station of the user equipment is determined as the relevant base station of the first user equipment. More preferably, the predetermined threshold SIR.threshold is equal to the Euler number e.
  • the resource probability allocation unit may include: a random number generating unit, configured to generate a random number Re (0, 1); and a random decision unit, configured to determine whether the generated random number is smaller than the probability p; a resource allocation unit, configured to allocate, according to the generated random number R, the resource selected by the resource selection unit to the first user equipment.
  • the probability p is pre-configured or dynamically adjustable.
  • the scheduling list is determined according to a scheduling algorithm.
  • a base station comprising a scheduler according to the second aspect of the invention is presented.
  • the present invention proposes a flexible distributed probability dynamic interference coordination scheme for coordinating inter-cell interference (ICI), which is particularly advantageous in systems with low frequency reuse factors.
  • ICI inter-cell interference
  • the technical solution proposed by the present invention is completely distributed and dynamic, and does not require signaling exchange or a small amount of signaling exchange.
  • FIG. 1 is a schematic diagram showing a frequency reuse scheme proposed in Reference [1];
  • FIG. 2 is a flowchart showing a resource scheduling method according to the present invention
  • FIG. 3 is a block diagram showing a scheduler 300 in accordance with the present invention.
  • Fig. 4 is a schematic view showing an application example of the present invention. detailed description
  • a distributed probability dynamic interference coordination scheme which introduces the ALOHA mechanism into dynamic interference coordination.
  • the basic idea of the invention is:
  • User equipment can be divided into two categories: central users and edge users;
  • the user equipment i is regarded as an edge user; ⁇ Otherwise, the user equipment i is regarded as Central user.
  • the user equipment i is considered as an edge user
  • (B) Define the neighboring base station (near the serving base station) on the first lap of the serving base station as the relevant base station.
  • Edge users are the main cause of inter-cell interference. Therefore, probabilistic dynamic interference coordination is performed for edge users. Probabilistic dynamic interference coordination scheme
  • the scheduler assigns the resource to the edge user with probability P (0 ⁇ p ⁇ 1), and the probability of not assigning the resource to the edge user A is 1- p. If it is determined according to the random decision that the edge user A cannot be scheduled, the scheduler will attempt to allocate the resource to the next user in the scheduling list (determined according to the scheduling algorithm).
  • the scheduler If the scheduler is to allocate resources to edge user A, the scheduler notifies all relevant base stations of edge user A of the resource allocation information, and the scheduler obtains scheduling information from all relevant base stations.
  • FIG. 2 shows a detailed flow chart of a resource scheduling method in accordance with the present invention. Referring to FIG. 2, first in step S200, resources to be scheduled are selected from the scheduling list determined according to the scheduling algorithm.
  • step S201 the first user equipment A to be scheduled is selected from the scheduling list determined according to the scheduling algorithm. That is, the resource selected in step S200 is prepared to be allocated to the first user equipment eight selected in step S201.
  • step S202 it is determined whether the first user equipment A is an edge user, preferably, may be determined according to U) in the above-mentioned theoretical overview section.
  • step S210 the resource scheduled to be scheduled for the first user equipment A is allocated to the first user equipment A, and the resource scheduling of the first user equipment A is completed, and the process proceeds to step S200, and the process proceeds to step S200.
  • the next resource to be scheduled is allocated to the first user equipment A, and the resource scheduling of the first user equipment A is completed, and the process proceeds to step S200, and the process proceeds to step S200. The next resource to be scheduled.
  • step S203 the information about preparing to allocate resources to the first user equipment A is notified to all relevant base stations of the first user equipment A, thereby, from the first All relevant base stations of user equipment A obtain scheduling information.
  • step S204 according to scheduling information obtained from all relevant base stations of the first user equipment A, it is determined whether all relevant base stations of the first user equipment A are to allocate resources to be scheduled to the first user equipment A to the relevant base station. The second user device of the edge user.
  • step S210 the resources scheduled to be scheduled for the first user equipment A are allocated to the first user equipment A, The resource scheduling of the first user equipment A is completed, and the process goes to step S200 to select the next resource to be scheduled.
  • step S206 A random number R e (0, 1).
  • step S208 it is determined whether the generated random number R is smaller than a pre-set or dynamically adjustable probability P (0 ⁇ p ⁇ 1). If it is determined that the generated random number R is smaller than the probability p, then in step S210, the resource to be scheduled for the first user equipment A is allocated to the first user equipment A, and the resource scheduling of the first user equipment A is completed, and the process proceeds to step S200. Select the next resource to schedule.
  • step S200 determines whether the resource selected in step S200 cannot be allocated to the first user equipment A selected in step S201.
  • the next first user equipment A' to be scheduled is selected from the scheduling list determined according to the scheduling algorithm. That is, it is attempted to allocate the resource selected in step S200 to the next first user equipment A' reselected in step S201. It should be noted that steps S203 and S204 of information interaction with the relevant base station in Fig. 2 are not necessarily performed.
  • blind probability resource scheduling may be performed, that is, steps S203 and S204 are omitted, and when it is determined that the first user equipment A is an edge user, a random decision based on the random number R and the probability p is directly performed, and thus the basis is executed.
  • Resource probability allocation of the present invention FIG. 3 shows a detailed block diagram of a scheduler 300 in accordance with the present invention.
  • the scheduler 300 includes: a resource selection unit 310, configured to select a resource to be scheduled from a scheduling list determined according to a scheduling algorithm; a user equipment (UE) selecting unit 320, configured to The first UE A to be scheduled is selected in the scheduling list determined by the algorithm, that is, the resource selected by the resource selecting unit 310 is ready to be allocated to the first UE A selected by the UE selecting unit 320; the edge user determining unit 330 is configured to determine Whether the first UE A is an edge user, preferably, may be determined according to (1) in the above theoretical overview section; the resource allocation information notification unit 340 is configured to determine, at the edge user determining unit 330, the first UE A When it is an edge user, the information about the resources to be allocated to the first UE A is notified to all relevant BSs of the first UE A; the scheduling information receiving unit 350 is configured to obtain scheduling information from all relevant BSs; a determining unit 360, configured to determine, according to scheduling information obtained from
  • the resource probability allocation unit 390 may include: a random number generating unit 370 for generating a random number Re (0, 1); a random decision unit 375, configured to determine whether the generated random number is smaller than the probability p; Minute
  • the allocating unit 380 is configured to allocate the resource selected by the resource selecting unit 310 to the first UE A.
  • the resource allocating unit 380 allocates the resource selected by the resource selecting unit 310 to the first UE A.
  • the edge user determining unit 330 determines that the first UE A is an edge user
  • the related BS allocation determining unit 360 operates.
  • the related BS allocation determining unit 360 determines that at least one related BS C may allocate resources scheduled to be scheduled to the first UE A to the second UE B of the at least one related BS C
  • the random number generating unit 370 operates .
  • the resource allocating unit 380 allocates the resource selected by the resource selecting unit 310 to the first UE A.
  • the resource allocating unit 380 allocates the resources selected by the resource selecting unit 31 0 Giving the first UE A.
  • the UE selecting unit 320 selects the next first UE A' to be scheduled from the scheduling list. That is, an attempt is made to allocate the resource selected by the resource selection unit 310 to the next first UE A' reselected by the UE selection unit 320.
  • the units 340-360 that interact with the relevant base stations in Figure 3 are not required units. In the simple case of performing blind probability resource scheduling, the units 340-360 may be omitted, and when the edge user determining unit 330 determines that the first UE A is an edge user, the resource probability assigning unit 365 directly operates. Fig.
  • the base station 1 and base station 2 comprise separate scheduler subsystems.
  • the base station 1 is a serving base station of the user equipment 1 and the user equipment 3, and the base station 2 is a serving base station of the user equipment 2 and the user equipment 4.
  • User equipment 1 and user equipment 1 are edge users, and user equipment 3 and user equipment 4 are central users.
  • the central user and the edge user can be determined based on (1) (A) in the above theoretical overview.
  • (2) (A) in the above general overview the relevant base station of the user equipment 1 is the base station 2, and the relevant base station of the user equipment 2 is the base station 1. If the user equipment 1 and the user equipment 2 are scheduled at the same time, the interference may be large and the performance is deteriorated.
  • the base station 1 will notify the base station 2 of the information to be scheduled for the edge user (user equipment 1), and the base station 2 will also notify the base station 1 of the information to be scheduled for the edge user (user equipment 2).
  • the probability that user equipment 1 (user equipment 2) is scheduled is p ( 0 ⁇ p ⁇ 1), and the probability of not being scheduled is lp. If User Equipment 1 (User Equipment 2) is not scheduled, resources are allocated to other User Equipments, for example, User Equipment 3 (User Equipment 4). The probability that user equipment 1 and user equipment 2 are scheduled at the same time is reduced to p*p, thus effectively reducing interference, and resources are effectively reused by other user equipment.
  • Table 2 shows the performance comparison of the simulation results of the present invention with the prior art. For the sake of simplicity, a blind probability scheme with no information exchange between base stations is employed (i.e., steps S203 and S204 above are omitted). If the edge user is scheduled, the resource is allocated with the probability p, and the resource is not allocated to it with the probability 1-p.
  • the simulation results shown in Table 2 are based on the LTE uplink system, and Table 1 shows the specific simulation parameters (see reference [5]).
  • the simulation results show that the above blind probability scheme according to the present invention can achieve a gain of 6% in terms of edge user throughput (5% throughput) and a small increase (1.4%) in the average throughput of the cell. Since there is no information exchange between base stations, scheduling is performed with blind information, whether or not there is known information of the user of the neighboring cell edge that is transmitting data.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Quality & Reliability (AREA)
  • Mobile Radio Communication Systems (AREA)

Description

资源调度方法、 调度器和基站
技术领域
本发明涉及移动通信领域, 更具体地, 涉及一种分布式概率动态 干扰协调方案, 将 AL0HA机制引入到动态干扰协调中, 提出了一种资 源调度方法、 一种实现上述资源调度方法的调度器和一种包括上述调 度器的基站 (BS )。 背景技术
在 LTE (长期演进) 系统中, 分别在下行链路和上行链路中采用 正交频分多址 ( 0FDMA ) 和单栽波频分多址 ( SC- FDMA ) 技术。 在 LTE-Advanced系统中, 这些多址接入技术仍然是备选方案。 在这种具 有低频率重用因子的系统中, 小区间干扰是容量的主要限制因素。 如 果移动台位于小区边界附近, 来自邻小区的干扰将成为导致严重性能 恶化 (尤其是吞吐量和覆盖范围) 的重要因素。
静态和半静态协调技术是 LTE提案中常见的干扰协调技术。 这些 小区间干扰协调技术对小区间的协调方式提出了限制。 例如, 限制了 资源管理器可用的时频资源, 或者限制了可用于特定时频资源的传输 功率。
参考文献 [ 1 ]提出了一种静态解决方案, 图 1 示出了该提案中所 提议的频率重用方案。 如图 1 所示, 共示出了 7 个小区, 小区 2 ~ 7 是小区 1的紧邻小区, 为了降低或消除大部分干扰, 在小区边缘, 邻 小区间的频率应选择为彼此正交, 且为了提高频率资源利用率, 尽可 能地提高频率重用因子。 例如, 在各小区的边缘, 小区 1采用频率 1, 小区 2、 4和 6采用相同的频率 2, 小区 3、 5和 7采用相同的频率 3。 小区边缘用户以全功率来进行发射和接收。 小区中心用户以受限的功 率使用整个频譜来进行发射和接收, 因此, 即使使用相同的频率, 也 不会引起较大的小区间干扰 ( I C I )。 但是, 这样做存在两个明显的缺 点: ( 1 ) 小区边缘用户的频率利用率仅为 1 / 3 ; ( 2 ) 如果业务负载发 生变化, 该方案将无法达到最优状态。
I 参考文献 [2]提出了名为网络功率规划的另一种静态解决方案, 将整个频带划分为具有相应功率的多个子集, 例如, 7到 9个子集。 根据这一方案, 小区边缘用户的频率利用率为 3/7。
参考文献 [3]提出了一种半静态方案: 将整个频带划分为 N 个子 频带,将 X个子频帶用于小区边缘用户, 而将 N- 3X个子频带用于小区 中心用户。 用于小区边缘用户的 X个子频带在邻小区间是正交的, 而 用于小区中心用户的 N-3X个子频带对于所有小区都是相同的。在这一 方案中, 分别只有部分频谱用于小区内和小区边缘。 发明内容
但是, 上述现有技术方案具有如下缺点:
( a ) 上述解决方案是静态解决方案或需要网络规划的半静态解 决方案, 而且半静态解决方案需要额外的信令来指示发生了调整;
( b )在上述解决方案中, 小区边缘用户的频率重用因子大于 1, 降低了频谱效率;
( c ) 这些解决方案使调度受限, 并使调度变得更加复杂。 考虑到上述问题, 本发明提出了一种分布式概率动态干扰协调方 案来降低或消除小区间干扰, 其中将 AL0HA机制引入到动态干扰协调 中。
根据本发明的第一方面, 提出了一种资源调度方法, 包括: 从调 度列表中选择要进行调度的资源; 从调度列表中选择要进行调度的第 一用户设备; 如果所述第一用户设备是边缘用户, 则将所选择的资源 以概率 P分配给所述第一用户设备, 其中 0 ≤ p ≤ 1。
优选地, 所述资源调度方法还可以包括: 如果所述第一用户设备 不是边缘用户, 则将所选择的资源分配给所述第一用户设备。
优选地, 所述资源调度方法还可以包括: 如果根据所述概率 p, 所选择的资源未能被分配给所述第一用户设备, 则返回第一用户设备 选择步骤, 从调度列表中选择要进行调度的下一个第一用户设备。
优选地, 如果所述第一用户设备是边缘用户, 则在所述资源概率 分配步骤之前, 所述资源调度方法还可以包括: 将准备分配资源给所 述第一用户设备的信息通知给所述第一用户设备的所有相关基站; 从 所有相关基站获得调度信息; 如果根据从所有相关基站获得的调度信 息, 确定至少一个相关基站可能会将准备调度给所述第一用户设备的 资源分配给作为所述至少一个相关基站的边缘用户的第二用户设备, 则执行所述资源概率分配步骤。
优选地, 所述资源调度方法还可以包括: 如果确定所有相关基站 都不会将准备调度给所述第一用户设备的资源分配给所述第二用户设 备, 则将所选择的资源分配给所述第一用户设备。
优选地, 如果所述第一用户设备到其服务小区与到其非服务小区 的路径损耗差小于预先确定的阈值 PLD. thresho l d , 则所述第一用户 设备是边缘用户, 所述非服务小区所属的基站是所述第一用户设备的 相关基站。
优选地, 如果所述用户设备的信号干扰比小于预先确定的阚值 S I R- t hresho l d , 则所述第一用户设备是边缘用户, 与所述第一用户设 备的服务基站紧邻的基站是所述第一用户设备的相关基站。更优选地, 所述预先确定的阈值 S I R- t hresho l d等于欧拉数 e。
优选地,所述资源概率分配步骤可以包括:产生一随机数 R e (0, 1); 如果所述随机数 R小于所述概率 p, 则将所选择的资源分配给所述第 一用户设备。
优选地, 所述概率 p是预先配置的, 或是可动态调整的。
优选地, 所述调度列表是根据调度算法确定的。 根据本发明的第二方面, 提出了一种实现上述资源调度方法的调 度器, 包括: 资源选择单元, 用于从调度列表中选择要进行调度的资 源; 用户设备选择单元, 用于从调度列表中选择要进行调度的第一用 户设备; 边缘用户确定单元, 用于确定所述第一用户设备是否是边缘 用户; 以及资源概率分配单元, 用于将所选择的资源以概率 p分配给 所述第一用户设备, 其中 0 ≤ p ≤ 1, 其中在所述边缘用户确定单元 确定所述第一用户设备是边缘用户时, 所述资源概率分配单元将所述 资源选择单元所选择的资源以所述概率 p分配给所述第一用户设备。 优选地, 在所述边缘用户确定单元确定所述第一用户设备不是边 分配给所述第一用户设备。
优选地, 在根椐所述概率 p, 所述资源概率分配单元未能将所述 资源选择单元所选择的资源分配给所述第一用户设备时, 所述用户设 备选择单元从调度列表中选择要进行调度的下一个第一用户设备。
优选地, 所述调度器还可以包括: 资源分配信息通知单元, 用于 在所述边缘用户确定单元确定所述第一用户设备是边缘用户时, 将准 备分配资源给所述第一用户设备的信息通知给所述第一用户设备的所 有相关基站; 调度信息接收单元, 用于从所有相关基站获得调度信息; 相关基站分配确定单元, 用于根据从所有相关基站获得的调度信息, 确定所有相关基站是否会将准备调度给所述第一用户设备的资源分配 给作为所述相关基站的边缘用户的第二用户设备, 其中在所述相关基 站分配确定单元确定至少一个相关基站可能会将准备调度给所述第一 用户设备的资源分配给作为所述至少一个相关基站的边缘用户的第二 用户设备时, 所述资源概率分配单元将所述资源选择单元所选择的资 源以所述概率 p分配给所述第一用户设备。
优选地, 在所述相关基站分配确定单元确定所有相关基站都不会 将准备调度给所述第一用户设备的资源分配给所述第二用户设备时, 第一用户设备。
优选地, 在所述第一用户设备到其服务小区与到其非服务小区的 路径损耗差小于预先确定的阈值 PLD_ t hresho l d时, 所述边缘用户确 定单元确定所述第一用户设备是边缘用户, 并将所述非服务小区所属 的基站确定为所述第一用户设备的相关基站。
优选地, 在所述用户设备的信号干扰比小于预先确定的阔值 S I R- t hresho l d 时, 所述边缘用户确定单元确定所述第一用户设备是 边缘用户, 并将与所述第一用户设备的服务基站紧邻的基站确定为所 述第一用户设备的相关基站。 更优选地, 所述预先确定的阈值 SIR.threshold等于欧拉数 e。
优选地, 所述资源概率分配单元可以包括: 随机数产生单元, 用 于产生一随机数 Re (0, 1);随机判决单元,用于判断所产生的随机数是 否小于所述概率 p; 和资源分配单元, 用于在所产生的随机数 R小于 所述概率 p时, 将所述资源选择单元所选择的资源分配给所述第一用 户设备。
优选地, 所述概率 p是预先配置的, 或是可动态调整的。
优选地, 所述调度列表是根据调度算法确定的。 根据本发明的第三方面, 提出了一种包括根据本发明第二方面所 述的调度器的基站 (BS)。 本发明提出了一种灵活的分布式概率动态千扰协调方案, 用于协 调小区间干扰( ICI ), 在具有低频率重用因子的系统中尤为有利。 本 发明所提出的技术方案是完全分布式且动态的, 而且不需要信令交换 或者信令交换量较小。
本发明的优点在于:
( 1 ) 动态、 分布式小区间干扰协调;
( 2 ) 简单、 灵活, 不需要信令交换或信令交换量较小;
( 3) 全动态, 不需要网络规划;
( 4 )中心用户和边缘用户的频率重用因子均为 1, 在调度中, 可 以获得频率选择增益。 附图说明
根据以下结合附图对本发明非限制实施例的详细描述, 本发明的 以上和其他目的、 特征和优点将变得更加清楚, 其中:
图 1是示出了参考文献 [1]所提出的频率重用方案的示意图; 图 2是示出了根据本发明的资源调度方法的流程图;
图 3是示出了根据本发明的调度器 300的方框图;
图 4是示出了本发明的应用实例的示意图。 具体实施方式
下面, 将根据附图描述本发明。 在以下描述中, 一些具体的实施 例只用于描述的目的, 不应该将其理解为对于本发明的任何限制, 而 只是示例。 当可能导致使本发明的理解发生模糊时, 将省略传统结构 或构造。 理论概述
根据本发明,提出了一种分布式概率动态干扰协调方案,将 ALOHA 机制引入到动态干扰协调中。 本发明的基本思想在于:
(1) 可以将用户设备分为两类: 中心用户和边缘用户; 判断准则 下:
(A) 根据长期信道状态信息 ( CSI ) (包括路径损耗和阴影) 来确定:
· 定义针对所有用户的阈值 PLD- threshold
♦ 如果用户设备 i的服务小区与其非服务小区间的路 径损耗 (包括阴影 ) 差小于 ( < ) PLD— threshold, 则将该用户设备 i视为边缘用户; ♦ 否则, 将该用户设备 i视为中心用户。
或者
(B) 根据用户的信号干扰比 (SIR) 来确定:
• 定义针对所有用户的阈值 SIR— threshold
♦ 如果用户设备 i 的 SIR ≥ SIR-.threshold, 则将该 用户设备 i视为中心用户;
♦ 否则, 将该用户设备 i视为边缘用户;
♦ SIR-threshold的优选值是欧拉数 e, 已经证明(参 见参考文献 [4] ): 以 SIR_threshold=e来执行上述 用户设备调度是能够使多个小区的总吞吐量最大化 的解决方案。
(2) 对应于上述两类边缘用户的定义 (A) 和 (B), 相关基站定 义如下:
(A) 如果用户设备 i 的服务小区与其非服务小区间的路径损 耗 (包括阴影) 差小于 (<) PLD— threshold, 则将非服务 小区所属的基站定义为相关基站;
或者
(B) 将服务基站外围第一圈的邻基站 (紧邻服务基站) 定义 为相关基站。
(3) 针对中心用户,来自邻扇区的干扰较小,因此可以忽略不计。
因此, 不必对中心用户进行动态干扰协调, 可以按照原有的 方式进行调度。
(4) 边缘用户是小区间干扰的主要起因, 因此, 对边缘用户进行 概率动态干扰协调。 概率动态干扰协调方案
( I )如果调度器要将资源分配给边缘用户 A, 则调度器将该资源 以概率 P分配给该边缘用户 (0 ≤ p ≤ 1 ), 不分配该资源给边缘用户 A的概率为 1- p。 如果根据随机判决, 确定无法调度该边缘用户 A, 调 度器将尝试把该资源分配给调度列表 (根据调度算法确定) 中的下一 用户。
( II ) 如果调度器要将资源分配给边缘用户 A, 则调度器将该资 源分配信息通知给边缘用户 A的所有相关基站, 同时调度器从所有相 关基站获得调度信息。
(a ) 如果调度器获知该边缘用户 A的所有相关基站都 不会将该资源分配给该相关基站的边缘用户, 则调度器将该 资源分配给该边缘用户 A (概率为 1 );
(b) 如果调度器获知该边缘用户 A的至少一个相关基 站可能会将该资源分配给该至少一个相关基站的边缘用户 B, 则调度器分配该资源给边缘用户 A的概率为 p ( 0 ≤ p ≤ 1 ), 不分配该资源给边缘用户 A的概率为 l-p。 如果根据随 机判决, 确定无法调度该边缘用户 A, 调度器将尝试把该资 源分配给调度列表(根据调度算法确定) 中的下一用户。 具体地, 图 2示出了根据本发明的资源调度方法的详细流程图。 参考图 2 , 首先在步骤 S200 , 从根据调度算法确定的调度列表中选择 要进行调度的资源。 在步骤 S201 , 从根据调度算法确定的调度列表中 选择要进行调度的第一用户设备 A。 即准备将在步骤 S200中选择的资 源分配给在步骤 S201 中选择的第一用户设备八。在步骤 S202 ,确定第 一用户设备 A是否是边缘用户, 优选地, 可以根据上述理论概述部分 中的 U ) 来确定。
如果确定第一用户设备 A不是边缘用户, 则在步骤 S210 , 将准备 调度给第一用户设备 A的资源分配给第一用户设备 A , 完成第一用户 设备 A的资源调度, 转向步骤 S200 , 选择要进行调度的下一资源。
另一方面,如果确定第一用户设备 A是边缘用户,则在步骤 S203, 将准备分配资源给第一用户设备 A的信息通知给第一用户设备 A的所 有相关基站, 由此,从第一用户设备 A的所有相关基站获得调度信息。 在步骤 S204 ,根据从第一用户设备 A的所有相关基站获得的调度信息, 确定第一用户设备 A的所有相关基站是否要将准备调度给第一用户设 备 A的资源分配给作为所述相关基站的边缘用户的第二用户设备。
如果确定所有相关基站都不会将准备调度给第一用户设备 A的资 源分配给第二用户设备, 则在步骤 S210 , 将准备调度给第一用户设备 A的资源分配给第一用户设备 A, 完成第一用户设备 A的资源调度,转 向步骤 S200 , 选择要进行调度的下一资源。
另一方面, 如果确定至少一个相关基站 C可能会将准备调度给第 一用户设备 A的资源分配给作为所述至少一个相关基站 C的边缘用户 的第二用户设备 B, 则在步骤 S206 , 产生一随机数 R e (0, 1)。 在步骤 S208 , 确定所产生的随机数 R是否小于预先设置或可动态调整的概率 P ( 0 ≤ p ≤ 1 )。 如果确定所产生的随机数 R 小于概率 p , 则在步骤 S210 , 将准备调度给第一用户设备 A的资源分配给第一用户设备 A, 完成第一用户设备 A的资源调度, 转向步骤 S200 , 选择要进行调度的 下一资源。 另一方面, 如果确定所产生的随机数 R不小于概率 p, 则确定无 法将在步骤 S200中选择的资源分配给在步骤 S201中选择的第一用户 设备 A。 此时, 返回步骤 S201 , 从根据调度算法确定的调度列表中选 择要进行调度的下一个第一用户设备 A'。 即尝试将在步骤 S200 中选 择的资源分配给在步骤 S201 中重新选择的下一个第一用户设备 A'。 应当注意的是, 在图 2 中与相关基站进行信息交互的步骤 S203 和 S204并不是必须执行的。在简单的情况下,可以执行盲概率资源调 度, 即省略步骤 S203和 S204 , 在确定第一用户设备 A是边缘用户时, 直接执行基于随机数 R和概率 p的随机判决, 并由此执行根据本发明 的资源概率分配。 图 3示出了根据本发明的调度器 300的详细方框图。
参考图 3, 根据本发明的调度器 300 包括: 资源选择单元 310, 用于从根据调度算法确定的调度列表中选择要进行调度的资源; 用户 设备(UE ) 选择单元 320, 用于从根据调度算法确定的调度列表中选 择要进行调度的第一 UE A , 即准备将资源选择单元 310所选择的资源 分配给 UE选择单元 320所选择的第一 UE A; 边缘用户确定单元 330, 用于确定所述第一 UE A是否是边缘用户, 优选地, 可以根据上述理论 概述部分中的 ( 1 )来确定; 资源分配信息通知单元 340, 用于在边缘 用户确定单元 330确定所述第一 UE A是边缘用户时,将准备分配资源 给所述第一 UE A的信息通知给所述第一 UE A的所有相关 BS; 调度信 息接收单元 350, 用于从所有相关 BS获得调度信息; 相关 BS分配确 定单元 360, 用于根据从所有相关 BS获得的调度信息, 确定所有相关 BS是否会将准备调度给所述第一 UE A的资源分配给作为所述相关 BS 的边缘用户的第二 UE; 资源概率分配单元 365, 用于将资源选择单元 310所选择的资源以预先设置或可动态调整的概率 p ( 0 ≤ p ≤ 1 ) 分 配给 UE选择单元 320所选择的第一 UE A。 资源概率分配单元 390可 以包括: 随机数发生单元 370 , 用于产生一随机数 R e (0, 1) ; 随机判 决单元 375,用于判断所产生的随机数是否小于所述概率 p; 和资源分 配单元 380, 用于将资源选择单元 310所选择的资源分配给所述第一 UE A。
当边缘用户确定单元 330确定所述第一 UE A不是边缘用户时, 资源分配单元 380将资源选择单元 310所选择的资源分配给所述第一 UE A。
当边缘用户确定单元 330确定所述第一 UE A是边缘用户时, 相 关 BS分配确定单元 360进行操作。
当相关 BS分配确定单元 360确定至少一个相关 BS C可能会将准 备调度给所述第一 UE A的资源分配给所述至少一个相关 BS C的第二 UE B时, 随机数发生单元 370进行操作。
当随机判决单元 375确定随机数发生单元 370产生的所述随机数 R小于所述概率 p时, 资源分配单元 380将资源选择单元 310所选择 的资源分配给所述第一 UE A。
当相关 BS分配确定单元 360确定所有相关 BS都不会将准备调度 给所述第一 UE A的资源分配给所述第二 UE时, 资源分配单元 380将 资源选择单元 31 0所选择的资源分配给所述第一 UE A。
当随机判决单元 375确定随机数发生单元 370产生的所述随机数 R不小于所述概率 p时, UE选择单元 320从调度列表中选择要进行调 度的下一个第一 UE A'。 即, 尝试将资源选择单元 310所选择的资源 分配给 UE选择单元 320重新选择的下一个第一 UE A'。 应当注意的是, 在图 3中与相关基站进行信息交互的单元 340 ~ 360 并不是必需的单元。 在执行盲概率资源调度的简单情况下, 可以 省略单元 340 - 360 , 在边缘用户确定单元 330确定所述第一 UE A是 边缘用户时, 资源概率分配单元 365直接进行操作。 图 4示出了本发明的应用实例, 其中基站 1和基站 2包括单独的 调度器子系统。 基站 1是用户设备 1和用户设备 3的服务基站, 基站 2是用户设备 2和用户设备 4的服务基站。 用户设备 1和用户设备 1 是边缘用户, 而用户设备 3和用户设备 4是中心用户,在本应用实例, 中心用户和边缘用户可以根椐上述理论概述部分中的( 1 ) ( A )来确定。 根据上述理论概述部分中的 (2 ) (A), 用户设备 1的相关基站是基站 2, 用户设备 2的相关基站是基站 1。 如果同时对用户设备 1和用户设 备 2进行调度, 则干扰可能较大, 且性能恶化。 根据本发明, 基站 1 将向基站 2通知将要对边缘用户 (用户设备 1 ) 进行调度的信息, 而 基站 2也将向基站 1通知将要对边缘用户 (用户设备 2 ) 进行调度的 信息。 在这种情况下, 用户设备 1 (用户设备 2 )被调度的概率为 p ( 0 < p < 1 ), 而不被调度的概率为 l-p。 如果用户设备 1 (用户设备 2 ) 不被调度, 则将资源分配给其他用户设备, 例如, 用户设备 3 (用户 设备 4)。 用户设备 1和用户设备 2同时被调度的概率下降为 p*p, 因 此有效地降低了干扰, 而资源也被其他用户设备有效重用。 表 2示出了本发明的仿真结果与现有技术的性能比较。 为了简单 起见, 采用基站间无信息交换的盲概率方案 (即省略上述步骤 S203 和 S204 )。 如果边缘用户被调度, 则以概率 p对其进行资源分配, 而 以概率 1-p不向其分配资源。 表 2所示的仿真结果基于 LTE上行链路 系统, 表 1示出了具体的仿真参数(参见参考文献 [5] )。 仿真结果表 明: 根据本发明的上述盲概率方案在边缘用户吞吐量 (5%吞吐量) 方 面可以实现 6%的增益, 在小区平均吞吐量方面可以实现小幅增加 ( 1.4%)。 由于是在基站间无信息交换的情况下, 以盲信息进行调度, 于是否存在正在发射数据的邻小区边缘用户的公知信息)。
II 表 1
Figure imgf000014_0001
表 2
无干扰协调 动态干扰协调 (p=0.5 )
IoT (线性值) 37. 64
小区吞吐量(Mpbs) 12. 52 12.7 1.4% 边缘吞吐量(kbps) 19: \.4 6%
以上实施例只是用于示例目的, 并不倾向于限制本发明。 本领域 普通技术人员应该理解的是,在不脱离本发明的 围和精神的情况下, 可以存在对该实施例的各种修改和代替, 并且这些修改和代替落在所 附权利要求所限定的范围中。 参考文献列表:
Rl-050763, " ut ing-Futher Discussion and Results", Er icsson
Rl-05-0694, "Multi-cell Simulation Results for Interference Co-ordinat ion in new OFDM DL", Alcatel, 3GPP TSG RAN WG1 #42, London, UK, 29th August - 2nd September 2005.
Rl-050738, Siemens, "Interference mitigation Considerations and Results on Frequency Reuse", RAN Gl#42, London, UK, Aug. /Sept. 2005.
iani, S. G.; Oien, G. E.; Gesber t, D. "Maximizing Mul t icel 1 Capacity Using Distributed Power Allocation and Scheduling", Wireless Communications and Networking Conference, 2007. WCNC 2007. IEEE 11-15 March 2007 Page(s): 1690 - 1694
3GPP TR 25.814 V7.0.0, Physical Layer Aspects for Evolved UTRA (Release 7), 2006

Claims

权 利 要 求 书
1、 一种资源调度方法, 包括:
从调度列表中选择要进行调度的资源;
从调度列表中选择要进行调度的第一用户设备;
如果所述第一用户设备是边缘用户, 则将所选择的资源以概率 p 分配给所述第一用户设备, 其中 0 ≤ p ≤ 1。
2、 根据权利要求 1所述的资源调度方法, 还包括:
如果所述第一用户设备不是边缘用户, 则将所选择的资源分配给 所述第一用户设备。
3、 根据权利要求 1或 2所述的资源调度方法, 还包括: 如果根椐所述概率 p, 所选择的资源未能被分配给所述第一用户 设备, 则返回第一用户设备选择步骤, 从调度列表中选择要进行调度 的下一个第一用户设备。
4、 根据权利要求 1 ~ 3之一所述的资源调度方法, 其特征在于 如果所述第一用户设备是边缘用户, 则在所述资源概率分配步骤 之前, 所述资源调度方法还包括:
将准备分配资源给所述第一用户设备的信息通知给所述第一用 户设备的所有相关基站;
从所有相关基站获得调度信息;
如果根椐从所有相关基站获得的调度信息, 确定至少一个相关基 站可能会将准备调度给所述第一用户设备的资源分配给作为所述至少 一个相关基站的边缘用户的第二用户设备, 则执行所述资源概率分配 步骤。
5、 根据权利要求 4所述的资源调度方法, 还包括:
如果确定所有相关基站都不会将准备调度给所述第一用户设备 的资源分配给所述第二用户设备, 则将所选择的资源分配给所述第一 用户设备。
6、 根据权利要求 1 ~ 5之一所述的资源调度方法, 其特征在于 如果所述第一用户设备到其服务小区与到其非服务小区的路径 损耗差小于预先确定的阈值 PLD-threshold, 则所述第一用户设备是 边缘用户, 所述非服务小区所属的基站是所述第一用户设备的相关基 站。
7、 根据权利要求 1 ~ 5之一所述的资源调度方法, 其特征在于 如果所述用户设备的信号干扰比小于预先确定的阔值
SIR-threshold,则所述第一用户设备是边缘用户, 与所述第一用户设 备的服务基站紧邻的基站是所述第一用户设备的相关基站。
8、 根据权利要求 7所述的资源调度方法, 其特征在于
所述预先确定的阈值 SIR-threshold等于欧拉数 e。
9、 根据权利要求 1 ~ 8之一所述的资源调度方法, 其特征在于 所述资源概率分配步骤包括:
产生一随机数 Re (0, 1);
如果所产生的随机数 R小于所述概率 p, 则将所选择的 资源分配给所述第一用户设备。
10、 根据权利要求 1 ~ 9之一所述的资源调度方法, 其特征在于 所述概率 P是预先配置的, 或是可动态调整的。
11、 根据权利要求 1 ~ 10之一所述的资源调度方法, 其特征在于 所述调度列表是根据调度算法确定的。
12、 一种调度器, 包括:
资源选择单元, 用于从调度列表中选择要进行调度的资源; 用户设备选择单元, 用于从调度列表中选择要进行调度的第一用 户设备;
边缘用户确定单元, 用于确定所述第一用户设备是否是边缘用 户; 以及
资源概率分配单元, 用于将所选择的资源以概率 p分配给所述第 一用户设备, 其中 0 ≤ p ≤ 1,
其中
在所述边缘用户确定单元确定所述第一用户设备是边缘用户时, 所述资源概率分配单元将所述资源选择单元所选择的资源以所述概率 p分配给所述第一用户设备。
1 3、 根据权利要求 1 2所述的调度器, 其特征在于 在所述边缘用户确定单元确定所述第一用户设备不是边缘用户 所述第一用户设备。
1 4、 根据权利要求 1 2或 1 3所述的调度器, 其特征在于 在根据所述概率 p , 所述资源概率分配单元未能将所述资源选择 单元所选择的资源分配给所述第一用户设备时, 所述用户设备选择单 元从调度列表中选择要进行调度的下一个第一用户设备。
1 5、 根据权利要求 1 2 ~ 1 4之一所述的调度器, 还包括: 资源分配信息通知单元, 用于在所述边缘用户确定单元确定所述 第一用户设备是边缘用户时, 将准备分配资源给所述第一用户设备的 信息通知给所述第一用户设备的所有相关基站;
调度信息接收单元, 用于从所有相关基站获得调度信息; 相关基站分配确定单元, 用于根据从所有相关基站获得的调度信 息, 确定所有相关基站是否会将准备调度给所述第一用户设备的资源 分配给作为所述相关基站的边缘用户的第二用户设备,
其中在所述相关基站分配确定单元确定至少一个相关基站可能 会将准备调度给所述第一用户设备的资源分配给作为所述至少一个相 关基站的边缘用户的第二用户设备时, 所述资源概率分配单元将所述 资源选择单元所选择的资源以所述概率 p分配给所述第一用户设备。
1 6、 根据权利要求 1 5所述的调度器, 其特征在于
在所述相关基站分配确定单元确定所有相关基站都不会将准备 调度给所述第一用户设备的资源分配给所述第二用户设备时, 所述资 源概率分配单元将所述资源选择单元所选择的资源分配给所述第一用 户设备。
1 7、 根据权利要求 1 2 ~ 1 6之一所述的调度器, 其特征在于 在所述第一用户设备到其服务小区与到其非服务小区的路径损 耗差小于预先确定的阈值 PLD_ thresho l d时, 所述边缘用户确定单元 确定所述第一用户设备是边缘用户, 并将所述非服务小区所属的基站 确定为所述第一用户设备的相关基站。
18、 根据权利要求 12 ~ 16之一所述的调度器, 其特征在于 在所述用 户 设备的信号干扰比小于预先确定的 阈值
SIR— threshold 时, 所述边缘用户确定单元确定所述第一用户设备是 边缘用户, 并将与所述第一用户设备的服务基站紧邻的基站确定为所 述第一用户设备的相关基站。
19、 根据权利要求 18所述的调度器, 其特征在于
所述预先确定的阈值 SIR-threshold等于欧拉数 e。
20、 根据权利要求 12 ~ 19之一所述的调度器, 其特征在于 所述资源概率分配单元包括:
随机数产生单元, 用于产生一随机数 Re (0, 1);
随机判决单元,用于判断所产生的随机数是否小于所述 概率 p; 和
资源分配单元,用于在所产生的随机数 R小于所述概率 时, 将所述资源选择单元所选择的资源分配给所述第一用 户设备。
21、 根据权利要求 12 ~ 20之一所述的调度器, 其特征在于 所述概率 P是预先配置的, 或是可动态调整的。
22、 根据权利要求 12 ~ 21之一所述的调度器, 其特征在于 所述调度列表是根据调度算法确定的。
23、 一种基站, 其特征在于包括根据权利要求 12 - 22 之一所述 的调度器。
PCT/CN2009/000194 2009-02-24 2009-02-24 资源调度方法、调度器和基站 WO2010096946A1 (zh)

Priority Applications (7)

Application Number Priority Date Filing Date Title
EP09840614.3A EP2403305A4 (en) 2009-02-24 2009-02-24 RESOURCE PLANNING METHOD, PROGRAMMER AND BASE STATION
BRPI0924256A BRPI0924256A2 (pt) 2009-02-24 2009-02-24 método de programação de recurso, programador e estação de base.
CN200980150486.4A CN102246571B (zh) 2009-02-24 2009-02-24 资源调度方法、调度器和基站
PCT/CN2009/000194 WO2010096946A1 (zh) 2009-02-24 2009-02-24 资源调度方法、调度器和基站
JP2011551382A JP5307904B2 (ja) 2009-02-24 2009-02-24 リソーススケジューリング方法、スケジューラ、および基地局
US13/202,908 US9107233B2 (en) 2009-02-24 2009-02-24 Resource scheduling method, scheduler and base station
KR20117022039A KR101489704B1 (ko) 2009-02-24 2009-02-24 자원 스케줄링 방법, 스케줄러 및 기지국

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2009/000194 WO2010096946A1 (zh) 2009-02-24 2009-02-24 资源调度方法、调度器和基站

Publications (1)

Publication Number Publication Date
WO2010096946A1 true WO2010096946A1 (zh) 2010-09-02

Family

ID=42664988

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2009/000194 WO2010096946A1 (zh) 2009-02-24 2009-02-24 资源调度方法、调度器和基站

Country Status (7)

Country Link
US (1) US9107233B2 (zh)
EP (1) EP2403305A4 (zh)
JP (1) JP5307904B2 (zh)
KR (1) KR101489704B1 (zh)
CN (1) CN102246571B (zh)
BR (1) BRPI0924256A2 (zh)
WO (1) WO2010096946A1 (zh)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2011188164A (ja) * 2010-03-08 2011-09-22 Fujitsu Ltd 基地局装置および通信帯域割り当て方法
US20130215784A1 (en) * 2010-11-10 2013-08-22 Telefonaktiebolaget L M Ericsson (Publ) Radio Base Station and a Method Therein

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8243670B2 (en) * 2009-08-19 2012-08-14 Chunghwa Telecom Co., Ltd. User grouping method for inter-cell interference coordination in mobile telecommunication
EP2684414B1 (en) * 2011-03-11 2017-05-10 Telefonaktiebolaget LM Ericsson (publ) A radio base station and a method therein for scheduling radio resources
JP6916446B2 (ja) * 2018-09-13 2021-08-11 日本電信電話株式会社 基地局管理方法、基地局管理装置及びプログラム
US11064463B2 (en) * 2018-10-03 2021-07-13 The Boeing Company Systems and methods for reuse of spectrum resources
EP3832464B1 (en) * 2019-12-06 2024-07-10 Tata Consultancy Services Limited System and method for selection of cloud service providers in a multi-cloud
WO2023144447A1 (en) * 2022-01-26 2023-08-03 Greatest Heroes Oy Polarization switching

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1571324A (zh) * 2003-07-15 2005-01-26 大唐移动通信设备有限公司 Cdma移动通信系统中多级业务的包数据调度方法
CN1905549A (zh) * 2006-07-28 2007-01-31 华为技术有限公司 正交频分复用系统资源分配系统及方法
CN101064905A (zh) * 2006-04-28 2007-10-31 华为技术有限公司 一种无线系统频率资源分配方法、设备与无线通信系统
CN101183888A (zh) * 2006-09-27 2008-05-21 三星电子株式会社 在通信系统中考虑数据功率的调度数据的方法和设备

Family Cites Families (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5923650A (en) * 1997-04-08 1999-07-13 Qualcomm Incorporated Method and apparatus for reverse link rate scheduling
EP1775979B1 (en) 2004-07-28 2015-02-25 NEC Corporation Wireless transmission system
JP4422660B2 (ja) * 2005-08-26 2010-02-24 パナソニック株式会社 スケジューリング方法及び無線基地局装置
JP4726662B2 (ja) * 2006-03-20 2011-07-20 株式会社エヌ・ティ・ティ・ドコモ 無線アクセスネットワーク装置及び方法
JP5268237B2 (ja) * 2006-07-28 2013-08-21 シャープ株式会社 スケジューリング方法、通信制御装置及び端末装置
US8219092B2 (en) * 2006-10-02 2012-07-10 Freescale Semiconductor, Inc. User equipment frequency allocation methods and apparatus
CN101304594B (zh) 2007-05-11 2011-11-30 电信科学技术研究院 无线资源的管理方法及调度器
EP2166782A1 (en) * 2007-07-10 2010-03-24 Panasonic Corporation Radio communication base station device, radio communication terminal device, and radio communication method
JP5119977B2 (ja) * 2008-02-28 2013-01-16 富士通株式会社 無線リソースの割当制御装置及び方法並びに無線基地局
US8213951B2 (en) * 2008-12-23 2012-07-03 At & T Mobility Ii Llc Using mobile communication devices to facilitate coordinating use of resources

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1571324A (zh) * 2003-07-15 2005-01-26 大唐移动通信设备有限公司 Cdma移动通信系统中多级业务的包数据调度方法
CN101064905A (zh) * 2006-04-28 2007-10-31 华为技术有限公司 一种无线系统频率资源分配方法、设备与无线通信系统
CN1905549A (zh) * 2006-07-28 2007-01-31 华为技术有限公司 正交频分复用系统资源分配系统及方法
CN101183888A (zh) * 2006-09-27 2008-05-21 三星电子株式会社 在通信系统中考虑数据功率的调度数据的方法和设备

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
"Interference mitigation Considerations and Results on Frequency Reuse", RAN GL#42, August 2005 (2005-08-01)
"Multi-cell Simulation Results for Interference Co-ordination in new OFDM DL", ALCATEL, 3GPP TSG RAN WG1, 2 August 2005 (2005-08-02)
3GPP TR 25.814 V7.0.0, PHYSICAL LAYER ASPECTS FOR EVOLVED UTRA, 2006
KIANI, S.G., OIEN, G.E., GESBERT, D.: "Maximizing Multicell Capacity Using Distributed Power Allocation and Scheduling", WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE, 11 March 2007 (2007-03-11), pages 1690 - 1694

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2011188164A (ja) * 2010-03-08 2011-09-22 Fujitsu Ltd 基地局装置および通信帯域割り当て方法
US8594692B2 (en) 2010-03-08 2013-11-26 Fujitsu Limited Base station device and method for allocating communication band based on band priority, weight factors, interference and/or other parameters
US20130215784A1 (en) * 2010-11-10 2013-08-22 Telefonaktiebolaget L M Ericsson (Publ) Radio Base Station and a Method Therein
US9445424B2 (en) * 2010-11-10 2016-09-13 Telefonaktiebolaget Lm Ericsson (Publ) Radio base station and method for scheduling radio resources for user equipment

Also Published As

Publication number Publication date
JP2012518957A (ja) 2012-08-16
KR101489704B1 (ko) 2015-02-11
US20110300873A1 (en) 2011-12-08
US9107233B2 (en) 2015-08-11
BRPI0924256A2 (pt) 2016-01-26
CN102246571A (zh) 2011-11-16
JP5307904B2 (ja) 2013-10-02
EP2403305A4 (en) 2016-04-06
KR20110119817A (ko) 2011-11-02
CN102246571B (zh) 2015-12-16
EP2403305A1 (en) 2012-01-04

Similar Documents

Publication Publication Date Title
KR101174586B1 (ko) 다중 캐리어 통신 시스템에서 주파수 재사용을 위한 방법 및 장치
Hojeij et al. Waterfilling-based proportional fairness scheduler for downlink non-orthogonal multiple access
EP2269414B1 (en) Method and apparatus for carrier selection in multi-carrier communication systems
JP5322906B2 (ja) 基地局装置およびスケジューリング方法
EP2421295B1 (en) Downlink inter-cell interference coordination method and base station
WO2010096946A1 (zh) 资源调度方法、调度器和基站
CN102239717A (zh) 在无线通信网络中优化带宽分配的方法
KR101237343B1 (ko) 다중-캐리어 통신 시스템에서의 리소스 활용 관리를 위한 방법 및 장치
WO2011127856A2 (zh) 资源分配方法、装置和基站
WO2011095060A1 (zh) 一种频率复用组网方法及设备
CN104918207B (zh) 异构网络中基于频谱资源分配的多d2d通信资源分配方法
KR101582879B1 (ko) 협력적 무선 자원 관리 방법
Hafez et al. Resource Allocation in OFDMA Femtocell Based LTE and 5G Networks with QoS Guarantees
Liu et al. Dynamic Fractional Frequency Reuse based on interference avoidance request for downlink OFDMA cellular networks
CN102655645B (zh) 一种lte系统中基于rntp的干扰抑制方法
CN106211092B (zh) 一种集群通信系统小区频带资源分配的方法及基站
Boddu et al. Bandwidth partitioning and SINR threshold design analysis of fractional frequency reuse
WO2009054604A1 (en) Method of performing uplink scheduling
Jiang et al. Flexible Uplink Configuration and User Scheduling in Sub-band Full Duplex Networks
Karthik et al. Dynamic downlink resource allocation for wireless networks with inter-cell interference
WO2011124026A1 (zh) 频率重用方法和设备
Lim et al. PF Scheduling in Hybrid Full Duplex System: Upper Bound and Simple Algorithms
Sciancalepore et al. RIA-ICCS: Intercell coordinated scheduling exploiting application Reservation Information
Hassen et al. A Dynamic Radio Resource Allocation Policy in a Multi-cell System Configuration for IEEE 802.16 m Standard.
KR20060056141A (ko) 직교 주파수 다중 접속 방식의 무선 통신 시스템에서자원할당 방법 및 시스템

Legal Events

Date Code Title Description
WWE Wipo information: entry into national phase

Ref document number: 200980150486.4

Country of ref document: CN

121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 09840614

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 13202908

Country of ref document: US

Ref document number: 6032/CHENP/2011

Country of ref document: IN

NENP Non-entry into the national phase

Ref country code: DE

WWE Wipo information: entry into national phase

Ref document number: 2011551382

Country of ref document: JP

WWE Wipo information: entry into national phase

Ref document number: 2009840614

Country of ref document: EP

ENP Entry into the national phase

Ref document number: 20117022039

Country of ref document: KR

Kind code of ref document: A

REG Reference to national code

Ref country code: BR

Ref legal event code: B01A

Ref document number: PI0924256

Country of ref document: BR

ENP Entry into the national phase

Ref document number: PI0924256

Country of ref document: BR

Kind code of ref document: A2

Effective date: 20110823