WO2011069461A1 - 协作调度中的用户调度方法及基站 - Google Patents

协作调度中的用户调度方法及基站 Download PDF

Info

Publication number
WO2011069461A1
WO2011069461A1 PCT/CN2010/079624 CN2010079624W WO2011069461A1 WO 2011069461 A1 WO2011069461 A1 WO 2011069461A1 CN 2010079624 W CN2010079624 W CN 2010079624W WO 2011069461 A1 WO2011069461 A1 WO 2011069461A1
Authority
WO
WIPO (PCT)
Prior art keywords
scheduling
user
scheduled
coordinated
coordinated cell
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.)
Ceased
Application number
PCT/CN2010/079624
Other languages
English (en)
French (fr)
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.)
ZTE Corp
Original Assignee
ZTE Corp
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 ZTE Corp filed Critical ZTE Corp
Priority to US13/380,864 priority Critical patent/US20140099984A2/en
Priority to EP10835496.0A priority patent/EP2434804B1/en
Publication of WO2011069461A1 publication Critical patent/WO2011069461A1/zh
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling
    • H04W72/1263—Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows
    • H04W72/1273—Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows of downlink data flows
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
    • H04W72/542—Allocation or scheduling criteria for wireless resources based on quality criteria using measured or perceived quality
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/022—Site diversity; Macro-diversity
    • H04B7/024—Co-operative use of antennas of several sites, e.g. in co-ordinated multipoint or co-operative multiple-input multiple-output [MIMO] systems

Definitions

  • the present invention relates to user scheduling techniques in a Long Term Evaluation-Advanced (LTE-A) system, and more particularly to a user scheduling method and a base station in cooperative scheduling.
  • LTE-A Long Term Evaluation-Advanced
  • Each node in the coordinated transmission set can obtain data information, and at the same time, the data is transmitted through a plurality of nodes or a node on a Physical Downlink Shared Channel (PDSCH).
  • PDSCH Physical Downlink Shared Channel
  • the coordinated cell scheduling for the user includes initial scheduling in the cell and iterative scheduling of one or more small intervals, and performs user scheduling after performing multi-user pairing search in each iterative scheduling. How to quickly and effectively select scheduling users in collaborative scheduling is a problem to be solved in the prior art.
  • the technical problem to be solved by the present invention is to provide a user scheduling method and a base station in cooperative scheduling, which reduces the amount of calculation in the iterative process and improves system performance.
  • the present invention provides a user scheduling method in cooperative scheduling, which is applied to an advanced long term evolution system, including: a coordinated cell determines user pairing information in an initial scheduling and saves, and the coordinated cell is in each subsequent When the iterative scheduling starts, the scheduling user information determined by the other coordinated cells other than the coordinated cell in the previous scheduling is obtained, according to the interference situation of the scheduling user determined by the coordinated cell user to the other coordinated cells, and combined with the initial scheduling. Saved The user pairing information of the coordinated cell determines a pre-scheduled user of the coordinated cell.
  • the above method also has the following characteristics:
  • the pre-scheduled user of the coordinated cell is one or more users of the coordinated cell user that do not interfere with the scheduling user determined by other coordinated cells other than the coordinated cell, or the user of the coordinated cell is determined according to other coordinated cells.
  • the degree of interference of the scheduled users is from small to large before sorting
  • M users the number of users in the coordinated cell is N, and M is an integer greater than or equal to 1 and less than or equal to N.
  • the coordinated cell determines the pre-scheduled user, it is determined that one or more user pairs in the saved user pairing information are included in the pre-scheduled user, and the system performance of the user pair is calculated and calculated separately.
  • the system performance corresponding to each user in the pre-scheduled user is scheduled, and the user or user pair with the best system performance is determined as the scheduled scheduling user.
  • the coordinated cell When the coordinated cell user's interference degree to the scheduled user determined by the other coordinated cell users is greater than the system-set interference threshold, the coordinated cell does not set the pre-scheduled user in the iterative scheduling, and further in this iteration The scheduling user is not set in the scheduling.
  • the coordinated cell performs multiple iteration scheduling, and the condition that the coordinated cell stops the iterative scheduling is: the number of times the iterative scheduling is performed reaches the system set number of times, or the scheduling users determined by the two consecutive iterations are the same.
  • the present invention provides a base station in cooperative scheduling, which is applied to an advanced long term evolution system, including an initial scheduling processing module, and an iterative scheduling processing module.
  • the initial scheduling processing module is configured to: The user pairing information is determined in the scheduling process, and the user pairing information is saved; the iterative scheduling processing module is configured to: determine the scheduling user by using the saved user pairing information in the iterative scheduling of the coordinated cell.
  • the iterative scheduling processing module is further configured to: at each start of the iterative scheduling, learn the scheduling user information determined by the other coordinated cells other than the coordinated cell in the previous scheduling, according to the coordinated cell user determining the other coordinated cells. The interference situation of the user is scheduled, and the pre-scheduled user of the coordinated cell is determined.
  • the above base station also has the following features:
  • the pre-scheduled user of the coordinated cell is one or more users of the coordinated cell user that do not interfere with the scheduled users determined by other coordinated cells, or the degree of interference of the coordinated cell user according to the scheduled users determined by other coordinated cells.
  • the first M users are sorted from small to large; the number of users in the coordinated cell is N, and M is an integer greater than or equal to 1 and less than or equal to N.
  • the above base station also has the following features:
  • the iterative scheduling processing module is further configured to: after determining the pre-scheduled user, determine that one or more user pairs in the saved user pairing information are included in the pre-scheduled user, and calculate a scheduling corresponding to the user pair
  • the system performance is calculated separately, and the system performance corresponding to each user in the pre-scheduled user is calculated, and the user or user pair with the best system performance is determined as the scheduled scheduling user.
  • the above base station also has the following features:
  • the iterative scheduling processing module is further configured to: when the coordination degree of the coordinated user determined by the coordinated cell user to the scheduling user determined by the other coordinated cell users is greater than the interference threshold set by the system, the pre-scheduling is not set in the current iterative scheduling. The user, in turn, does not set the scheduling user in this iterative scheduling.
  • the above base station also has the following features:
  • the iterative scheduling processing module is further configured to: perform multiple iterative scheduling, and stop the iterative scheduling.
  • the condition is that the number of executions of the iterative scheduling reaches the set number of times of the system, or the scheduling users determined by the two consecutive iterations are the same.
  • the user pairing information is saved in the initial scheduling process and used in subsequent iterative scheduling.
  • multi-user pairing search is not required, without degrading systemicity.
  • the calculation amount in the iterative scheduling is reduced, the system resources occupied by the iterative scheduling are reduced, and the system processing time is accelerated, so that the performance in the entire region tends to be optimal.
  • FIG. 1 is a flow chart of a user scheduling method in cooperative scheduling of an embodiment. Preferred embodiment of the invention
  • the present invention is applied to an advanced long-term evolution system.
  • the cooperative area to which the present invention is applicable generally includes a plurality of coordinated cells, and each coordinated cell can support Single-User Multi-Input Multi-Output (SU-MIMO).
  • Multi-User Multi-Input Multi-Output (MU-MIMO) antenna mode the user in each coordinated cell independently measures the channel quality of the cell to the serving cell, and feeds back the measurement information to In the service area.
  • SU-MIMO Single-User Multi-Input Multi-Output
  • MU-MIMO Multi-User Multi-Input Multi-Output
  • the base station in the cooperative scheduling includes an initial scheduling processing module and an iterative scheduling processing module.
  • the initial scheduling processing module is configured to determine user matching information in an initial scheduling process of processing the coordinated cell, and save the user pairing information.
  • An iterative scheduling processing module configured to determine a scheduled user using the saved user pairing information in an iterative scheduling of the coordinated cell.
  • the iterative scheduling processing module learns the scheduling users determined by the other coordinated cells in the previous scheduling, and determines the pre-commissioning of the coordinated cells according to the interference situation of the coordinated users determined by the coordinated users to other coordinated cells.
  • Schedule users The determined pre-scheduled user is one or more users of the coordinated cell users that do not interfere with the scheduling users determined by other coordinated cells, or the interference degree of the coordinated cell users according to the scheduled users determined for other coordinated cells is small.
  • the first M users after the large sort; the number of users in the coordinated cell is N, and M is an integer greater than or equal to 1 and less than or equal to N.
  • An iterative scheduling processing module after determining a pre-scheduled user, determining that one or more user pairs in the saved user pairing information are included in the pre-scheduled user, calculating and scheduling the corresponding system performance of the user, and respectively The system performance corresponding to each user in the pre-scheduled user is calculated, and the user or user pair with the best system performance is determined as the determined scheduling user.
  • the iterative scheduling processing module may perform multiple iterative scheduling, and the conditions for stopping the iterative scheduling are as follows: the number of times of performing the iterative scheduling reaches the set number of times of the system, or the scheduling users determined by the two consecutive iterations are the same.
  • the iterative scheduling processing module does not set the pre-scheduled user in the iterative scheduling, and further The scheduling user is not set in the iterative scheduling.
  • the user scheduling method in cooperative scheduling includes:
  • Step 101 The coordinated cell determines user pairing information in an initial scheduling and saves the information.
  • the initial scheduling means that each coordinated cell performs the local scheduling for the first time without considering other cell information. Specifically, after receiving the channel measurement information of the user in the cell, the coordinated cell completes the initial scheduling of the cell without considering the scheduling situation of other cells, and may perform multi-user scheduling to save all possible users when the channel state permits. Pairing information. User pairing is based on the user's channel information. Two users (ie, user pairs) that are orthogonal or quasi-orthogonal or two users that meet certain performance requirements can be paired.
  • the pairing information retained in the invention is pairing information that satisfies the performance requirements set by the system.
  • the performance requirements set by the system can be the interference strength (or the degree of orthogonality) between the two users.
  • Step 102 The coordinated cell determines the scheduled user in the subsequent iterative scheduling by using the saved user pairing information.
  • the coordinated cell may perform multiple iterative scheduling, and each iteration scheduling includes the following steps:
  • the coordinated cell learns the scheduled users determined by the other coordinated cells in the last scheduling. When the first iteration is scheduled, its last scheduling is the initial scheduling.
  • the pre-scheduled user of the coordinated cell is one or more users of the coordinated cell user that do not interfere with the scheduled users determined by other coordinated cells, or the degree of interference of the coordinated cell user according to the scheduled users determined by other coordinated cells.
  • the first M users are sorted from small to large; the number of users in the coordinated cell is N, and M is an integer greater than or equal to 1 and less than or equal to N.
  • the system may also set a interference threshold for determining the degree of interference between the users of the coordinated cell and other users of the coordinated cell, and the interference degree of the coordinated user determined by the user of the coordinated cell to the scheduled user of the other coordinated cell is greater than the interference threshold set by the system. That means that any user who schedules this cell will be the other If the cell forms interference that exceeds the system acceptance capability, the pre-scheduled user is not set in the current iteration scheduling in the coordinated cell, and the scheduling user is not set in this iterative scheduling.
  • the coordinated cell may perform multiple iteration scheduling, and the condition that the coordinated cell stops the iterative scheduling is: the number of times the iterative scheduling is performed reaches the system set number of times, or the scheduling users determined by the two consecutive iterations are the same.
  • the user pairing information is saved in the initial scheduling process and used in subsequent iterative scheduling, and the multi-user pairing search is not required in the iterative scheduling, without reducing the systemicity.
  • Reduce the amount of computation in iterative scheduling reduce the system resources occupied by iterative scheduling, and speed up the system processing time, so that the performance in the entire region tends to be optimal.
  • the invention can be implemented in a centralized, distributed or a combination of the two.
  • the centralized method refers to summarizing the information of the users to be scheduled of all the coordinated cells on a central control point, so that the central control point independently completes the iterative scheduling. Finally, the scheduling result is sent to the corresponding coordinated cell; the distributed means that each coordinated cell obtains the pre-scheduling information of other coordinated cells by itself, completes the pre-scheduling of the local cell by itself, and sends the pre-scheduling information of the current cell to other coordinated cells;
  • the combination of the two and the distributed mode can be called a relay mode.
  • Each coordinated cell supports MU-MIMO and SU-MIMO modes, and there are three users to be scheduled in the cooperative resource of each coordinated cell.
  • the users to be scheduled of the coordinated cell A are respectively referred to as: user a1, user a2, and user a3.
  • the users to be scheduled of the coordinated cell B are respectively referred to as: user bl, user b2, and user b3.
  • the users to be scheduled of the coordinated cell C are respectively referred to as: user cl, user c2, and user c3. It is assumed that there is a strong interference between the user a2 and the user c2, the first stream of the user a2 and the user b3, and the second stream of the user c3 and the user b3. It is also assumed that the coordinated cell C with the smallest traffic is selected as the relay cell.
  • the three coordinated cells independently perform local cell scheduling.
  • the coordinated cell A completes the initial scheduling of the cell under the consideration of fairness and the current channel state of each user to be scheduled, and determines that the initial scheduled user is a2, and two users al and a3 can perform pairing.
  • the coordinated cell B does not have user pairs that can be matched with each other in the completed channel state under the consideration of the fairness and the current channel state of each user to be scheduled; this scheduling is the SU-MIMO mode.
  • the coordinated cell C completes the initial scheduling of the cell, and determines that the initial scheduling users are c2 and c3, and the scheduling is MU-MIMO mode.
  • the scheduling result and the related information of the scheduling user are respectively sent to the relay cell;
  • the relay cell aggregates the scheduling information of other cells, and then sends all the coordinated information to all the coordinated cells; After all the latest scheduling information sent by the cell, recalculate the scheduling plan of the cell;
  • Cooperative cell A in addition to considering fairness and current channel state of each to-be-scheduled user, considers scheduling of coordinated cell B (scheduling user b3, and using two streams) and scheduling of coordinated cell C (simultaneous scheduling c2 and c3) User), that is, in the case of satisfying certain performance of the cell, the performance loss caused by other coordinated cells should also be considered, thereby completing the initial scheduling of the cell.
  • the possibility of scheduling 3 users in the cell is recalculated.
  • the first stream of user a2 and user b3 has strong interference and interferes with user c2, so the priority of a2 scheduling is the smallest.
  • the scheduled users determined by other coordinated cells do not exist.
  • the user of the disturbance is a3, al.
  • the pre-scheduled user in the first iteration is a3, al.
  • a 3 and a1 of the reserved pairing information in the initial scheduling can be paired, and the system performance corresponding to the simultaneous scheduling of a3 and a1 is calculated, and the system performance corresponding to the single scheduling a3 or a1 is calculated, and the performance of scheduling two users is better than that.
  • scheduling the performance of a3 or al separately it is determined that the scheduling users are a3 and al.
  • the former M users that are determined by the coordinated cell to other coordinated cells according to the degree of interference of the scheduled users determined by the other coordinated cells are used as pre-scheduled users, and the coordinated cell
  • the number of users is N, and M is an integer greater than or equal to 1 and less than or equal to N.
  • the order is a3, al, a2, and the first two users are used as pre-scheduled users.
  • the scheduling order of the scheduling priorities may be determined according to the current channel state of each user.
  • Cooperative cell B in addition to considering fairness and current channel state of each to-be-scheduled user, considers scheduling of coordinated cell A (user a2) and scheduling of coordinated cell C (simultaneous scheduling of c2 and c3 users), that is, satisfying the cell In the case of certain performance, the performance loss caused by other coordinated cells should also be considered, and the initial scheduling of the cell is completed.
  • the scheduling process it is assumed that the users 3, c2, and c3 have been scheduled, and the possibility of scheduling 3 users in the cell is recalculated.
  • the first stream of user a2 and user b3 has strong interference
  • the second stream of user c3 and user b3 has strong interference
  • b3 scheduling has the lowest priority.
  • the users who do not interfere with the scheduled users determined by other collaborative cells are bl , b2
  • the pre-scheduled users in the first iteration are bl and b2. Find the pairing information retained in the initial schedule. Except that b3 can use two streams, there is no other pairing information, and the scheduling user can be determined to be b2.
  • Cooperative cell C in addition to considering fairness and current channel state of each to-be-scheduled user, considers scheduling of coordinated cell A (user a2) and scheduling of coordinated cell B (scheduling user b3, and using two streams) In the case that the certain performance of the cell is satisfied, the performance loss caused by other coordinated cells should also be considered, and the initial scheduling of the cell is completed.
  • the scheduling result and the related information of the scheduling user are respectively sent to the relay cell.
  • the relay cell aggregates the scheduling information of other cells, it is first determined whether the scheduling result is completely consistent with the previous scheduling result. The discovery is not completely consistent, that is, the convergence state is not reached, and then all the scheduling information is sent to all the coordinated cells; after receiving all the latest scheduling information sent by the relaying cell, each coordinated cell recalculates the scheduling scheme of the current cell;
  • the B-cell pre-scheduled user b2 in addition to considering the fairness and the current channel state of each user to be scheduled, the B-cell pre-scheduled user b2; the C-cell pre-scheduled user cl, and then completes the initial scheduling of the cell.
  • the scheduling process under the assumption that b2 and cl have been scheduled, recalculates the possibility of scheduling three users in the cell, and the probability of scheduling the single user is: a3, al, a2; finding the reserved in the initial scheduling
  • the pairing information, a3 and al can be paired, and the performance of the paired user is scheduled to be scheduled at the same time. The performance is better than the single scheduling a3. Therefore, the pre-scheduled result is two users of a1 and a3, that is, consistent with the previous scheduling result.
  • Cooperative cell B in addition to considering fairness and the current channel state of each user to be scheduled, considers both A-cell pre-scheduling al, a3 two-user and C-cell pre-scheduled user cl, and then completes the initial scheduling of the cell.
  • the scheduling process in the case that the users a, a3, and cl have been scheduled, recalculate the possibility of scheduling three users in the cell, and the probability of scheduling the single user is: b2, b3, bl, initial search
  • the pairing information retained in the scheduling, b3 can be used in two streams. By calculating the simultaneous b3 two stream performance is better than the separate scheduling b2, so the pre-scheduled result is user b2, that is, consistent with the last scheduling result.
  • Cooperative cell C in addition to considering the fairness and the current channel state of each user to be scheduled, considers both the A cell pre-scheduling al and a3 two users and the B cell pre-scheduled user b2; and then completes the initial scheduling of the cell.
  • Scheduling process Under the assumption that al, a3 and b2 have been scheduled, recalculate the possibility of scheduling 3 users in the cell, and the probability of single user being scheduled is: cl, c3, c2, in the initial scheduling
  • the reserved pairing information, c3 and c2 can be paired, recalculating and scheduling the performance of two users at the same time. By calculation, the performance of scheduling is better than that of separately scheduling cl, so the pre-scheduled results c2 and c3.
  • the scheduling result and the related information of the scheduling user are respectively sent to the relay cell; after the relay cell aggregates the scheduling information of other cells, the first judgment is made. Whether the secondary scheduling result is completely consistent with the previous scheduling result, and the discovery is not completely consistent, that is, the convergence state is not reached, and then all the scheduling information is sent to all the coordinated cells; each coordinated cell receives all the latest scheduling sent by the relay cell. After the information, recalculate the scheduling scheme of the cell;
  • the B-cell pre-scheduled user b2 in addition to considering the fairness and the current channel state of each user to be scheduled, the B-cell pre-scheduled user b2; the C-cell pre-scheduled users c2 and c3, thereby completing the initial scheduling of the cell.
  • the scheduling process under the assumption that b2, c2, and c3 have been scheduled, recalculates the probability that three users in the cell are scheduled, and the probability of scheduling the single user is: a3, al, a2, and then find the initial scheduling.
  • the reserved pairing information, a3 and al can be paired, and the performance of the paired user is calculated at the same time, and the performance is better than the single scheduling a3. Therefore, the pre-scheduled result is two users of a1 and a3, that is, consistent with the previous scheduling result.
  • Cooperative cell B in addition to considering the fairness and the current channel state of each user to be scheduled, considers the A cell pre-scheduling al, a3 two users and the C cell pre-scheduled users c2 and c3, and then completes the initial scheduling of the cell.
  • the scheduling process after assuming that the users al, a3, c2, and c3 have been scheduled, recalculates the possibility of scheduling three users in the cell, and the probability of scheduling the single user is: b2, bl, b3, initial search
  • the pairing information retained in the scheduling, b3 can be used in two streams. By calculating the simultaneous b3 two stream performance is better than the separate scheduling b2, so the pre-scheduled result is user b2, that is, consistent with the last scheduling result.
  • Cooperative cell C in addition to considering the fairness and the current channel state of each user to be scheduled, considers both the A cell pre-scheduling al and a3 two users and the B cell pre-scheduled user b2; and then completes the initial scheduling of the cell. Scheduling process: Since the previous cell A and cell B pre-scheduling results have not changed, the pre-scheduled result is still the last pre-scheduled result, that is, the users c2 and c3 are scheduled.
  • the scheduling result and the related information of the scheduling user are respectively sent to the relay cell; after the relay cell aggregates the scheduling information of other cells, the scheduling result and the last scheduling result are first determined. Whether it is completely consistent, and it is found to be completely consistent, that is, to the convergence state, to notify all coordinated cell scheduling to reach the optimal state, and the scheduling ends; after receiving the scheduling completion information sent by the relay cell, each coordinated cell performs corresponding scheduling according to the final iteration result. .
  • the final convergence is the iterative end condition, which may require a large number of iterations or a final convergence state.
  • the end condition may also be to limit the number of iterations of the pre-scheduled, or the entire area meets a certain performance threshold.
  • the industrial applicability uses the scheduling scheme in the invention.
  • the user pairing information is saved in the initial scheduling process and used in subsequent iterative scheduling, and the multi-user pairing search is not required in the iterative scheduling.
  • the computational complexity in iterative scheduling is reduced, the system resources occupied by iterative scheduling are reduced, and the system processing time is accelerated, so that the performance in the entire region tends to be optimal.

Landscapes

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

Abstract

本发明公开了一种协作调度中的用户调度方法，应用于高级长期演进系统，协作小区在初始调度中确定用户配对信息并保存，所述协作小区在后续的迭代调度中使用已保存的所述用户配对信息确定调度用户。本发明还公开了相应基站。采用发明中的调度方案，在小区内调度时，在初始调度过程中保存用户配对信息，并在后续的迭代调度中使用，迭代调度中则不需进行多用户配对搜索，在不降低系统性的前提下，减少迭代调度中的计算量，减少迭代调度占用的系统资源，加快系统处理时间，从而使整个区域内的性能趋向最优。

Description

协作调度中的用户调度方法及基站
技术领域
本发明涉及高级长期演进（ Long Term Evaluation-Advanced,简称 LTE-A ) 系统中的用户调度技术， 尤其涉及协作调度中的用户调度方法及基站。
背景技术
在 LTE-A系统中， 为了提高高速数据速率业务的覆盖率和小区平均吞吐 率， 引入了多点协作（ Coordinated Multiple Point , 简称 COMP ) 传输和接收 技术。
当前的 LTE-A系统中， 对 COMP技术主要分为两部分：
( 1 )联合传输技术： 协作传输集合中各个节点都可以获得数据信息， 在 同一时刻将数据在物理下行共享信道 ( Physical Downlink Shared Channel, 简 称 PDSCH )通过多个节点或者一个节点传输。
( 2 )协作调度： 仅仅服务小区可以获得待传输的数据信息， 但是对用户 的调度和波束赋形的确认是通过在协作集合协商完成的。
现有技术中协作小区对用户调度的包括小区内的初始调度和一次或多次 小区间的迭代调度， 并在每次迭代调度中进行多用户配对搜索后完成用户调 度。如何在协作调度中快速有效的选择调度用户是现有技术中需解决的问题。
发明内容
本发明要解决的技术问题是提供协作调度中的用户调度方法及基站， 减 少迭代过程中的计算量， 提高系统性能。
为了解决上述问题， 本发明提供了一种协作调度中的用户调度方法， 应 用于高级长期演进系统， 包括： 协作小区在初始调度中确定用户配对信息并 保存， 所述协作小区在后续的每次迭代调度开始时， 获知本协作小区之外的 其它协作小区在上一次调度中确定的调度用户信息， 按照本协作小区用户对 所述其它协作小区确定的调度用户的干扰情况， 并结合初始调度中已保存的 所述本协作小区的用户配对信息， 确定本协作小区的预调度用户。 上述方法还具有以下特点：
本协作小区的预调度用户是本协作小区用户中对本协作小区之外的其它 协作小区确定的调度用户不存在干扰的一个或多个用户， 或者， 将本协作小 区用户按照对其它协作小区确定的调度用户的干扰程度由小到大排序后的前
M个用户； 本协作小区的用户个数为 N, M为大于等于 1且小于等于 N的整 数。
上述方法还具有以下特点：
在所述协作小区确定预调度用户后， 判断已保存的用户配对信息中的一 个或多个用户对包含于所述预调度用户中时， 计算调度所述用户对对应的系 统性能， 并分别计算调度所述预调度用户中各用户时对应的系统性能， 将系 统性能最好的用户或用户对作为确定的调度用户。
上述方法还具有以下特点：
所述协作小区用户对其它协作小区用户确定的调度用户的干扰程度均大 于系统设定的干扰阔值时， 所述协作小区在本次迭代调度中不设定预调度用 户， 进而在本次迭代调度中不设定调度用户。
上述方法还具有以下特点：
所述协作小区执行多次迭代调度，所述协作小区停止迭代调度的条件是： 执行迭代调度的次数到达系统设定次数， 或者， 连续两次迭代调度确定 的调度用户相同。
为了解决上述问题， 本发明提供了一种协作调度中的基站， 应用于高级 长期演进系统， 包括初始调度处理模块， 迭代调度处理模块； 所述初始调度 处理模块设置为： 在处理协作小区的初始调度过程中确定用户配对信息， 并 保存所述用户配对信息； 所述迭代调度处理模块设置为： 在所述协作小区的 迭代调度中使用已保存的所述用户配对信息确定调度用户。
上述基站还具有以下特点： 所述迭代调度处理模块还设置为： 在每次迭代调度开始时， 获知本协作 小区之外的其它协作小区在上一次调度中确定的调度用户信息， 按照本协作 小区用户对其它协作小区确定的调度用户的干扰情况， 确定本协作小区的预 调度用户。
上述基站还具有以下特点：
本协作小区的预调度用户是本协作小区用户中对其它协作小区确定的调 度用户不存在干扰的一个或多个用户， 或者， 将本协作小区用户按照对其它 协作小区确定的调度用户的干扰程度由小到大排序后的前 M个用户； 本协作 小区的用户个数为 N, M为大于等于 1且小于等于 N的整数。
上述基站还具有以下特点：
所述迭代调度处理模块还设置为： 在确定预调度用户后， 判断已保存的 用户配对信息中的一个或多个用户对包含于所述预调度用户中时， 计算调度 所述用户对对应的系统性能， 并分别计算调度所述预调度用户中各用户时对 应的系统性能， 将系统性能最好的用户或用户对作为确定的调度用户。
上述基站还具有以下特点：
所述迭代调度处理模块还设置为： 在所述协作小区用户对其它协作小区 用户确定的调度用户的干扰程度均大于系统设定的干扰阔值时， 在本次迭代 调度中不设定预调度用户， 进而在本次迭代调度中不设定调度用户。
上述基站还具有以下特点：
所述迭代调度处理模块还设置为： 执行多次迭代调度， 停止迭代调度的 条件是： 执行迭代调度的次数到达系统设定次数， 或者， 连续两次迭代调度 确定的调度用户相同。
釆用发明中的调度方案， 在小区内调度时， 在初始调度过程中保存用户 配对信息， 并在后续的迭代调度中使用， 迭代调度中则不需进行多用户配对 搜索， 在不降低系统性的前提下， 减少迭代调度中的计算量， 减少迭代调度 占用的系统资源， 加快系统处理时间， 从而使整个区域内的性能趋向最优。 附图概述
图 1是实施例的协作调度中的用户调度方法流程图。 本发明的较佳实施方式
本发明应用高级长期演进系统， 本发明适用的协作区域内一般包括若干 协作小区，每个协作小区都可以支持单用户多入多出（ Single-User Multi-Input Multi-Output, 简称 SU-MIMO ) 和多用户多入多出 （ Multi-User Multi-Input Multi-Output , 简称 MU-MIMO )天线模式， 每个协作小区内的用户独立测量 本身到所在服务小区的信道质量， 并将测量信息反馈给所在服务小区。
协作调度中的基站， 包括初始调度处理模块， 迭代调度处理模块； 初始调度处理模块， 用于在处理协作小区的初始调度过程中确定用户配 对信息， 并保存所述用户配对信息。
迭代调度处理模块， 用于在所述协作小区的迭代调度中使用已保存的所 述用户配对信息确定调度用户。
迭代调度处理模块， 在每次迭代调度开始时， 获知其它协作小区在上一 次调度中确定的调度用户， 按照本协作小区用户对其它协作小区确定的调度 用户的干扰情况， 确定本协作小区的预调度用户。 确定的预调度用户是本协 作小区用户中对其它协作小区确定的调度用户不存在干扰的一个或多个用 户， 或者， 将本协作小区用户按照对其它协作小区确定的调度用户的干扰程 度由小到大排序后的前 M个用户； 本协作小区的用户个数为 N, M为大于等 于 1且小于等于 N的整数。
迭代调度处理模块， 在确定预调度用户后， 判断已保存的用户配对信息 中的一个或多个用户对包含于所述预调度用户中时， 计算调度所述用户对对 应的系统性能， 并分别计算调度所述预调度用户中各用户时对应的系统性 能， 将系统性能最好的用户或用户对作为确定的调度用户。
迭代调度处理模块可执行多次迭代调度， 停止迭代调度的条件是： 执行 迭代调度的次数到达系统设定次数， 或者， 连续两次迭代调度确定的调度用 户相同。 在所述协作小区用户对其它协作小区用户确定的调度用户的干扰程度均 大于系统设定的干扰阔值时， 迭代调度处理模块在本次迭代调度中不设定预 调度用户， 进而在本次迭代调度中不设定调度用户。
如图 1所示， 协作调度中的用户调度方法包括：
步骤 101 , 协作小区在初始调度中确定用户配对信息并保存；
所谓初始调度是指各协作小区不考虑其他小区信息， 首次进行本小区调 度。 具体的， 协作小区收到本小区内用户的信道测量信息后， 不考虑其他小 区的调度情况， 完成本小区初始调度， 在信道状态允许的情况下， 可进行多 用户调度， 保存所有可能的用户配对信息。 用户配对是根据用户的信道信息 判断出的正交或准正交的两个用户 （即用户对）或满足一定性能要求的两个 用户可配对使用。
发明中所述保留的配对信息是满足系统设定的性能要求的配对信息。 系 统设定的性能要求可以是两用户间的干扰强度（或者称之为正交程度） 。
步骤 102, 协作小区在后续的迭代调度中使用已保存的所述用户配对信 息确定调度用户。
协作小区可执行多次迭代调度， 每次迭代调度包括以下步骤：
( a )协作小区获知其它协作小区在上一次调度中确定的调度用户。 第一迭代调度时， 其上一次调度即为初始调度。
( b )按照本协作小区用户对其它协作小区确定的调度用户的干扰情况， 确定本协作小区的预调度用户。
本协作小区的预调度用户是本协作小区用户中对其它协作小区确定的调 度用户不存在干扰的一个或多个用户， 或者， 将本协作小区用户按照对其它 协作小区确定的调度用户的干扰程度由小到大排序后的前 M个用户； 本协作 小区的用户个数为 N, M为大于等于 1且小于等于 N的整数。
系统还可设定确定本协作小区用户对其它协作小区用户间干扰程度的干 扰阔值， 本协作小区用户对其它协作小区用户确定的调度用户的干扰程度均 大于系统设定的此干扰阔值时即表示调度本小区的任何一个用户都会对其他 小区形成超出系统接受能力的干扰， 则在本协作小区在本次迭代调度中不设 定预调度用户， 进而在本次迭代调度中不设定调度用户。
( C )在所述协作小区确定预调度用户后， 判断已保存的用户配对信息中 的一个或多个用户对包含于所述预调度用户中时， 计算调度所述用户对对应 的系统性能， 并分别计算调度所述预调度用户中各用户时对应的系统性能， 将系统性能最好的用户或用户对作为确定的调度用户。
所述协作小区可执行多次迭代调度， 所述协作小区停止迭代调度的条件 是： 执行迭代调度的次数到达系统设定次数， 或者， 连续两次迭代调度确定 的调度用户相同。
上述方法中， 在小区内调度时， 在初始调度过程中保存用户配对信息， 并在后续的迭代调度中使用， 迭代调度中则不需进行多用户配对搜索， 在不 降低系统性的前提下， 减少迭代调度中的计算量， 减少迭代调度占用的系统 资源， 加快系统处理时间， 从而使整个区域内的性能趋向最优。
此发明可以釆用集中式、 分布式或者两者相结合的方式实现， 集中式是 指将所有协作小区的待调度用户信息汇总在一个中心控制点上， 由此中心控 制点独立完成迭代调度， 最后将调度结果发送给相应的协作小区； 分布式是 指各协作小区独自获取其他协作小区的预调度信息，独自完成本小区预调度， 并将本小区预调度信息发送给其他协作小区； 集中式和分布式两者相结合的 方式可称之为中继方式。
下面给出本发明在中继式协作网络中的一个具体实施例。 本具体实施例 收敛） 。
假定区域内有 3个协作小区， 分别为协作小区 、 协作小区 B和协作小 区 C。 每个协作小区都支持 MU-MIMO和 SU-MIMO模式， 每个协作小区的 协作资源内有 3个待调度的用户。
协作小区 A的待调度用户分别称之为： 用户 al、 用户 a2和用户 a3。 协作小区 B的待调度用户分别称之为： 用户 bl、 用户 b2和用户 b3。 协作小区 C的待调度用户分别称之为： 用户 cl、 用户 c2和用户 c3。 假定用户 a2与用户 c2、 用户 a2和用户 b3的第一个流、 用户 c3与用户 b3的第二个流之间会形成强烈干扰。并假定选择业务量最小的协作小区 C作 为中继小区。
初始调度：
不考虑其它协作小区， 3个协作小区独立进行本小区调度。
协作小区 A在综合考虑公平性和各待调度用户的当前信道状态下， 完成 本小区初始调度， 确定初始调度用户为 a2, 并且 al和 a3两用户可以进行配 对。
协作小区 B在综合考虑公平性和各待调度用户的当前信道状态下， 完成 内的待调度用户没有可以相互匹配的用户配对； 此调度即为 SU-MIMO模式。
协作小区 C在综合考虑公平性和各待调度用户的当前信道状态下， 完成 本小区初始调度， 确定初始调度用户为 c2和 c3 , 此调度即为 MU-MIMO模 式。
3 个协作小区初始调度完成后， 分别将调度结果及调度用户的相关信息 发送中继小区； 中继小区将其他小区的调度信息汇总后， 再全部发送给所有 协作小区； 各协作小区收到中继小区发送的所有最新的调度信息后， 重新计 算本小区调度方案；
第一次迭代预调度：
协作小区 A, 除考虑公平性和各待调度用户的当前信道状态外， 同时考 虑协作小区 B的调度（调度用户 b3 , 并且釆用两个流 ）和协作小区 C的调 度（同时调度 c2和 c3用户） ， 即在满足本小区一定性能的情况下也要考虑 对其他协作小区带来的性能损失， 进而完成本小区初始调度。
调度过程中， 在假定 b3、 c2和 c3 已被调度情况下， 重新计算本小区 3 个用户被调度可能性。 用户 a2和用户 b3的第一个流有强干扰， 与用户 c2有 干扰， 所以 a2调度的优先级最小。 对其它协作小区确定的调度用户不存在干 扰的用户为 a3 , al , 第一次迭代调度中预调度用户为 a3 , al。 判断初始调度 中的保留的配对信息中 a3和 al可配对， 计算同时调度 a3和 al时对应的系 统性能， 计算单独调度 a3或 al时对应的系统性能， 同时调度两个用户的性 能要好于单独调度 a3或 al的性能时， 确定调度用户为 a3和 al。
其它具体实施例中， 除了上述将本协作小区用户中对其它协作小区确定 按照对其它协作小区确定的调度用户的干扰程度由小到大排序后的前 M个用 户作为预调度用户， 本协作小区的用户个数为 N, M为大于等于 1且小于等 于 N的整数。 例如， 排列顺序为 a3、 al、 a2, 将前两个用户作为预调度用户。
确定了多个预调度用户后， 还可以根据各用户的当前信道状态排列确定 其调度优先级的先后顺序。
协作小区 B, 除考虑公平性和各待调度用户的当前信道状态外， 同时考 虑协作小区 A的调度（用户 a2 )和协作小区 C的调度（同时调度 c2和 c3 用户） ， 即在满足本小区一定性能的情况下也要考虑对其他协作小区带来的 性能损失， 进而完成本小区初始调度。
调度过程中， 在假定用户 a2、 c2和 c3 已被调度情况下， 重新计算本小 区 3个用户被调度可能性。 用户 a2和用户 b3的第一个流有强干扰， 用户 c3 和用户 b3的第二个流有强干扰， 所以 b3调度的优先级最小。 对其它协作小 区确定的调度用户不存在干扰的用户为 bl , b2, 第一次迭代调度中预调度用 户为 bl、 b2。 查找初始调度中保留的配对信息， 除 b3可用两个流外， 无其 它配对信息， 可确定调度用户为 b2。
协作小区 C, 除考虑公平性和各待调度用户的当前信道状态外， 同时考 虑协作小区 A的调度（用户 a2 )和协作小区 B的调度（调度用户 b3 , 并且 釆用两个流 ）即在满足本小区一定性能的情况下也要考虑对其他协作小区带 来的性能损失， 进而完成本小区初始调度。
调度过程中， 在假定 a2和 b3已被调度情况下， 重新计算本小区 3个用 户被调度可能性。 用户 c3和用户 b3的第二个流有强干扰， 用户 a2与用户 c2 之间有强干扰， 所以 c3、 c2调度的优先级最小。 查找初始调度中的保留的配 对信息， c3和 c2可配对， 重新计算同时调度两个用户的性能， 通过计算， 同 时调度的性能仍然要比单独调度 cl的性能差， 所以此次预调度结果 cl。
3 个协作小区初始调度完成后， 分别将调度结果及调度用户的相关信息 发送中继小区； 中继小区将其他小区的调度信息汇总后， 首先判断此次调度 结果与上次调度结果是否完全一致， 发现不完全一致， 即未达到收敛状态， 再将此次调度信息全部发送给所有协作小区； 各协作小区收到中继小区发送 的所有最新的调度信息后， 重新计算本小区调度方案；
第二次迭代预调度：
协作小区 A, 除考虑公平性和各待调度用户的当前信道状态外， B小区 预调度用户 b2; C小区预调度用户 cl ,进而完成本小区初始调度。调度过程， 在假定 b2、 cl已被调度情况下， 重新计算本小区 3个用户被调度可能性， 单 用户被调度的可能性大小依次为： a3、 al、 a2; 查找初始调度中的保留的配 对信息， a3和 al可配对， 计算同时调度此配对用户的性能， 性能比单独调度 a3好， 所以此次预调度结果是 al和 a3两用户， 即与上次调度结果一致。
协作小区 B, 除考虑公平性和各待调度用户的当前信道状态外， 同时考 虑 A小区预调度 al、 a3两用户和 C小区预调度用户 cl , 进而完成本小区初 始调度。 调度过程， 在^^定用户 al、 a3和 cl 已被调度情况下， 重新计算本 小区 3个用户被调度可能性， 单用户被调度的可能性大小依次为： b2、 b3、 bl , 查找初始调度中保留的配对信息， b3 可用两个流， 通过计算同时调度 b3两个流性能比单独调度 b2差， 所以此次预调度结果是用户 b2, 即与上次 调度结果一致。
协作小区 C, 除考虑公平性和各待调度用户的当前信道状态外， 同时考 虑 A小区预调度 al和 a3两用户以及 B小区预调度用户 b2; , 进而完成本小 区初始调度。 调度过程： 在假定 al、 a3和 b2已被调度情况下， 重新计算本 小区 3个用户被调度可能性， 单用户被调度的可能性大小依次为： cl、 c3、 c2, 查找初始调度中的保留的配对信息， c3和 c2可配对， 重新计算同时调度 两个用户的性能， 通过计算， 同时调度的性能要比单独调度 cl的性能好， 所 以此次预调度结果 c2和 c3。
3 个协作小区第一次迭代调度完成后， 分别将调度结果及调度用户的相 关信息发送中继小区； 中继小区将其他小区的调度信息汇总后， 首先判断此 次调度结果与上次调度结果是否完全一致， 发现不完全一致， 即未达到收敛 状态， 再将此次调度信息全部发送给所有协作小区； 各协作小区收到中继小 区发送的所有最新的调度信息后， 重新计算本小区调度方案；
第三次迭代调度：
协作小区 A, 除考虑公平性和各待调度用户的当前信道状态外， B小区 预调度用户 b2; C小区预调度用户 c2和 c3 , 进而完成本小区初始调度。 调 度过程， 在假定 b2、 c2 和 c3已被调度情况下， 重新计算本小区 3个用户被 调度可能性， 单用户被调度的可能性大小依次为： a3、 al、 a2, 然后查找初 始调度中的保留的配对信息， a3和 al可配对，计算同时调度此配对用户的性 能， 性能比单独调度 a3好， 所以此次预调度结果是 al和 a3两用户， 即与上 次调度结果一致。
协作小区 B, 除考虑公平性和各待调度用户的当前信道状态外， 同时考 虑 A小区预调度 al、 a3两用户和 C小区预调度用户 c2和 c3 , 进而完成本小 区初始调度。 调度过程， 在假定用户 al、 a3、 c2、 c3已被调度情况下， 重新 计算本小区 3个用户被调度可能性， 单用户被调度的可能性大小依次为： b2、 bl、 b3 , 查找初始调度中保留的配对信息， b3 可用两个流， 通过计算同时 调度 b3两个流性能比单独调度 b2差， 所以此次预调度结果是用户 b2, 即与 上次调度结果一致。
协作小区 C, 除考虑公平性和各待调度用户的当前信道状态外， 同时考 虑 A小区预调度 al和 a3两用户以及 B小区预调度用户 b2; , 进而完成本小 区初始调度。 调度过程： 由于上次小区 A和小区 B预调度结果未改变， 所以 此次预调度结果仍为上次预调度结果即调度用户 c2和 c3。
3 个协作小区第一次迭代调度完成后， 分别将调度结果及调度用户的相 关信息发送中继小区； 中继小区将其他小区的调度信息汇总后， 首先判断此 次调度结果与上次调度结果是否完全一致， 发现完全一致， 即到收敛状态， 通知所有协作小区调度达到最佳状态， 调度结束； 各协作小区收到中继小区 发送的调度完成信息后， 按照最终的迭代结果进行相应的调度。
当协作小区增多， 待调度用户增多时， 以最终收敛为迭代结束条件， 可 能需要非常多的迭代次数或者无法获得一个最终的收敛状态， 所以判定迭代 结束条件也可以是限定迭代预调度次数、或者整个区域满足一定的性能门限。
以上所述仅为本发明的优选实施例而已， 并不用于限制本发明， 对于本 领域的技术人员来说， 本发明可以有各种更改和变化。 凡在本发明的精神和 原则之内， 所作的任何修改、 等同替换、 改进等， 均应包含在本发明的保护 范围之内。
工业实用性 釆用发明中的调度方案， 在小区内调度时， 在初始调度过程中保存用户 配对信息， 并在后续的迭代调度中使用， 迭代调度中则不需进行多用户配对 搜索， 在不降低系统性的前提下， 减少迭代调度中的计算量， 减少迭代调度 占用的系统资源， 加快系统处理时间， 从而使整个区域内的性能趋向最优。

Claims

权 利 要 求 书
1、 一种协作调度中的用户调度方法， 应用于高级长期演进系统， 其特征 在于，
协作小区在初始调度中确定用户配对信息并保存；
所述协作小区在后续的每次迭代调度开始时， 获知本协作小区之外的其 它协作小区在上一次调度中确定的调度用户信息， 按照本协作小区用户对所 述其它协作小区确定的调度用户的干扰情况， 并结合初始调度中已保存的所 述本协作小区的用户配对信息， 确定本协作小区的预调度用户。
2、 如权利要求 1所述的调度方法， 其中，
本协作小区的预调度用户是本协作小区用户中对本协作小区之外的其它 协作小区确定的调度用户不存在干扰的一个或多个用户， 或者， 将本协作小 区用户按照对所述其它协作小区确定的调度用户的干扰程度由小到大排序后 的前 M个用户； 本协作小区的用户个数为 N, M为大于等于 1且小于等于 N 的整数。
3、 如权利要求 2所述的调度方法， 其中， 所述方法还包括：
在所述协作小区确定预调度用户后， 判断已保存的用户配对信息中的一 个或多个用户对包含于所述预调度用户中时， 计算调度所述用户对对应的系 统性能， 并分别计算调度所述预调度用户中各用户时对应的系统性能， 将系 统性能最好的用户或用户对作为确定的调度用户。
4、 如权利要求 2所述的调度方法， 其中， 所述方法还包括：
所述协作小区用户对所述其它协作小区用户确定的调度用户的干扰程度 均大于系统设定的干扰阔值时， 所述协作小区在本次迭代调度中不设定预调 度用户， 进而在本次迭代调度中不设定调度用户。
5、 如权利要求 3所述的调度方法， 其中，
所述协作小区执行多次迭代调度，所述协作小区停止迭代调度的条件是： 执行迭代调度的次数到达系统设定次数， 或者， 连续两次迭代调度确定 的调度用户相同。
6、 一种协作调度中的基站， 应用于高级长期演进系统， 所述基站包括初 始调度处理模块， 迭代调度处理模块；
所述初始调度处理模块设置为： 在处理协作小区的初始调度过程中确定 用户配对信息， 并保存所述用户配对信息；
所述迭代调度处理模块设置为： 在所述协作小区的迭代调度中使用已保 存的所述用户配对信息确定调度用户。
7、 如权利要求 6所述的基站， 其中，
所述迭代调度处理模块还设置为： 在每次迭代调度开始时， 获知本协作 小区之外的其它协作小区在上一次调度中确定的调度用户信息， 按照本协作 小区用户对所述其它协作小区确定的调度用户的干扰情况， 确定本协作小区 的预调度用户。
8、 如权利要求 7所述的基站， 其中，
本协作小区的预调度用户是本协作小区用户中对所述其它协作小区确定 的调度用户不存在干扰的一个或多个用户， 或者， 将本协作小区用户按照对 其它协作小区确定的调度用户的干扰程度由小到大排序后的前 M个用户； 本 协作小区的用户个数为 N, M为大于等于 1且小于等于 N的整数。
9、 如权利要求 7或 8所述的基站， 其中，
所述迭代调度处理模块还设置为： 在确定预调度用户后， 判断已保存的 用户配对信息中的一个或多个用户对包含于所述预调度用户中时， 计算调度 所述用户对对应的系统性能， 并分别计算调度所述预调度用户中各用户时对 应的系统性能， 将系统性能最好的用户或用户对作为确定的调度用户。
10、 如权利要求 8所述的基站， 其中，
所述迭代调度处理模块还设置为： 在所述协作小区用户对所述其它协作 小区用户确定的调度用户的干扰程度均大于系统设定的干扰阔值时， 在本次 迭代调度中不设定预调度用户， 进而在本次迭代调度中不设定调度用户。
11、 如权利要求 9所述的基站， 其中，
所述迭代调度处理模块还设置为： 执行多次迭代调度， 停止迭代调度的 条件是： 执行迭代调度的次数到达系统设定次数， 或者， 连续两次迭代调度 确定的调度用户相同。
PCT/CN2010/079624 2009-12-11 2010-12-09 协作调度中的用户调度方法及基站 Ceased WO2011069461A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
US13/380,864 US20140099984A2 (en) 2009-12-11 2010-12-09 User Scheduling Method and Base Station in Coordinated Scheduling
EP10835496.0A EP2434804B1 (en) 2009-12-11 2010-12-09 Method and base station in coordinated scheduling

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN200910254329.X 2009-12-11
CN200910254329.XA CN102098736B (zh) 2009-12-11 2009-12-11 协作调度中的用户调度方法及基站

Publications (1)

Publication Number Publication Date
WO2011069461A1 true WO2011069461A1 (zh) 2011-06-16

Family

ID=44131552

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2010/079624 Ceased WO2011069461A1 (zh) 2009-12-11 2010-12-09 协作调度中的用户调度方法及基站

Country Status (4)

Country Link
US (1) US20140099984A2 (zh)
EP (1) EP2434804B1 (zh)
CN (1) CN102098736B (zh)
WO (1) WO2011069461A1 (zh)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102013903B (zh) * 2009-09-29 2013-11-06 电信科学技术研究院 小区间进行空间协调的方法和设备
CN104284440B (zh) * 2013-07-04 2019-05-21 电信科学技术研究院 下行协作传输中的调度方法、协作传输节点及中心协作点
WO2015058333A1 (zh) * 2013-10-21 2015-04-30 华为技术有限公司 调度方法及基站
US10485008B2 (en) 2015-08-31 2019-11-19 Nippon Telegraph And Telephone Corporation Scheduling apparatus and method
US10397739B2 (en) * 2017-03-03 2019-08-27 Here Global B.V. Supporting the creation of a radio map
CN112218299B (zh) * 2019-07-11 2025-09-16 中兴通讯股份有限公司 智能空分小区簇的资源分配方法、装置、设备及存储介质
CN113783590B (zh) * 2020-06-10 2023-04-07 华为技术有限公司 一种多用户配对方法、装置及系统

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1326622A (zh) * 1998-09-10 2001-12-12 夸尔柯姆股份有限公司 在无线通信系统中用于对诸如速率和功率之类的资源进行分布式最佳反向链路调度的方法和装置
CN101282566A (zh) * 2007-04-03 2008-10-08 中兴通讯股份有限公司 一种干扰抑制方法
CN101442808A (zh) * 2008-12-26 2009-05-27 西安电子科技大学 一种lte-a中的上行多点协作联合调度方法
CN101461268A (zh) * 2006-06-01 2009-06-17 卢森特技术有限公司 在多个基站之间协调传输调度
CN101478342A (zh) * 2009-01-22 2009-07-08 清华大学 一种多天线蜂窝通信系统中多小区之间协作调度的方法

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP3419355B2 (ja) * 1999-08-10 2003-06-23 日本電気株式会社 スケジューリング制御装置および方法
CN1870459A (zh) * 2005-05-24 2006-11-29 松下电器产业株式会社 联合脏纸编码与调度的多用户多输入多输出跨层通信方法
CN100581074C (zh) * 2006-06-17 2010-01-13 中国科学技术大学 一种正交频分复用系统的实时业务资源分配方法
CN100589474C (zh) * 2007-04-29 2010-02-10 中国科学技术大学 一种正交频分复用多天线系统中的跨层调度方法
US20080298486A1 (en) * 2007-06-04 2008-12-04 Nec Laboratories America, Inc. Multi-cell interference mitigation via coordinated scheduling and power allocation in downlink odma networks
JP5171196B2 (ja) * 2007-10-09 2013-03-27 株式会社エヌ・ティ・ティ・ドコモ 無線通信システム、無線通信方法及び基地局
JP5400958B2 (ja) * 2009-05-20 2014-01-29 テレフオンアクチーボラゲット エル エム エリクソン（パブル） 無線通信システムにおける方法及び装置

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1326622A (zh) * 1998-09-10 2001-12-12 夸尔柯姆股份有限公司 在无线通信系统中用于对诸如速率和功率之类的资源进行分布式最佳反向链路调度的方法和装置
CN101461268A (zh) * 2006-06-01 2009-06-17 卢森特技术有限公司 在多个基站之间协调传输调度
CN101282566A (zh) * 2007-04-03 2008-10-08 中兴通讯股份有限公司 一种干扰抑制方法
CN101442808A (zh) * 2008-12-26 2009-05-27 西安电子科技大学 一种lte-a中的上行多点协作联合调度方法
CN101478342A (zh) * 2009-01-22 2009-07-08 清华大学 一种多天线蜂窝通信系统中多小区之间协作调度的方法

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP2434804A4 *

Also Published As

Publication number Publication date
EP2434804A4 (en) 2016-12-21
EP2434804A1 (en) 2012-03-28
EP2434804B1 (en) 2018-03-28
US20120244900A1 (en) 2012-09-27
US20140099984A2 (en) 2014-04-10
CN102098736A (zh) 2011-06-15
CN102098736B (zh) 2015-06-03

Similar Documents

Publication Publication Date Title
Zheng et al. NOMA-based multi-pair two-way relay networks with rate splitting and group decoding
Wang et al. A unified approach to QoS-guaranteed scheduling for channel-adaptive wireless networks
JP5580422B2 (ja) 無線通信システムにおける遅延を考慮したマルチノード協力方法
WO2011069461A1 (zh) 协作调度中的用户调度方法及基站
WO2011069468A1 (zh) 一种基于小区优先级的协作调度方法及系统
WO2011072586A1 (zh) 一种多点协作传输中的协作调度方法及系统
CN104756425B (zh) 用于协调多点接收的分布式v-mimo处理
CN102104970B (zh) 多小区之间的协作调度方法、装置和系统
WO2014177094A2 (zh) 干扰处理方法、装置、网络控制单元及终端
WO2013087034A1 (zh) 一种干扰协调方法、基站及通信系统
CN108093411A (zh) D2d通信网络中基于信道签名的资源调度优化方法
CN105591677B (zh) 一种基于干扰对齐技术的d2d协作多点传输方法
CN107710817A (zh) 具有网络编码的联合无线链路控制（rlc）信令
Wang et al. Joint precoding and user scheduling for full-duplex cooperative MIMO-NOMA V2X networks
WO2011009271A1 (zh) 一种多点协作发送和接收的方法及相应基站
CN102137502B (zh) 无线双向中继网络编码系统的用户调度方法
Ronasi et al. Throughput-efficient scheduling and interference alignment for MIMO wireless systems
WO2010133034A1 (zh) 协调多点通信的方法和设备
CN104640226B (zh) 一种认知中继系统下基于多业务的资源调度方法及装置
CN110336596A (zh) Mimo无线网络中基于相继干扰消除的分布式调度方法
Wang et al. An efficient centralized scheduling algorithm for IEEE 802.16 multi-radio mesh networks
Chu et al. Adaptive and distributed scheduling in heterogeneous MIMO-based ad hoc networks
Wang et al. On minimizing data forwarding schedule in multi transmit/receive wireless mesh networks
CN111510988B (zh) 一种基于非正交多址的中继共享网络用户选择方法
Lagkas et al. A novel method of serving multimedia and background traffic in wireless LANs

Legal Events

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

Ref document number: 10835496

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 2010835496

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 13380864

Country of ref document: US

NENP Non-entry into the national phase

Ref country code: DE