WO2011069468A1 - 一种基于小区优先级的协作调度方法及系统 - Google Patents

一种基于小区优先级的协作调度方法及系统 Download PDF

Info

Publication number
WO2011069468A1
WO2011069468A1 PCT/CN2010/079657 CN2010079657W WO2011069468A1 WO 2011069468 A1 WO2011069468 A1 WO 2011069468A1 CN 2010079657 W CN2010079657 W CN 2010079657W WO 2011069468 A1 WO2011069468 A1 WO 2011069468A1
Authority
WO
WIPO (PCT)
Prior art keywords
cell
coordinated
scheduling
coordinated cell
information
Prior art date
Application number
PCT/CN2010/079657
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 JP2012538186A priority Critical patent/JP5575255B2/ja
Priority to EP10835503.3A priority patent/EP2485557A4/en
Priority to US13/509,798 priority patent/US9288817B2/en
Publication of WO2011069468A1 publication Critical patent/WO2011069468A1/zh

Links

Classifications

    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0032—Distributed allocation, i.e. involving a plurality of allocating devices, each making partial allocation
    • H04L5/0035—Resource allocation in a cooperative multipoint environment
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/10—Scheduling measurement reports ; Arrangements for measurement reports
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/20—Control channels or signalling for resource management
    • 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
    • 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/56—Allocation or scheduling criteria for wireless resources based on priority criteria

Definitions

  • the present invention relates to the field of mobile communication technologies, and in particular, to a community scheduling method and system based on cell priority.
  • CoMP Coordinated Multiple Point Transmission and Reception
  • the CoMP technology in LTE-A is mainly divided into: 1) joint transmission technology, in which all nodes in the coordinated transmission set can obtain data information, and at the same time, PDSCH (Physical Downlink Shared Channel) data passes through multiple nodes or One node transmits; 2) cooperative scheduling, only the serving cell can obtain the data information to be transmitted, and the confirmation of the user's scheduling and beamforming is completed by negotiation in the cooperative set.
  • PDSCH Physical Downlink Shared Channel
  • the cooperative scheduling scheme of the existing coordinated cell has the following problems:
  • the technical problem to be solved by the present invention is to provide a cooperative scheduling method and system, which fully considers the characteristics of each coordinated cell and optimizes resource allocation of the entire collaborative area.
  • the present invention provides a cell-priority-based cooperative scheduling method, which is applied to a system using CoMP technology, and the method includes: Prioritizing each coordinated cell according to the history and/or current information of each coordinated cell;
  • the scheduling of each coordinated cell is completed in order of priority from high to low.
  • the step of sequentially completing the scheduling of each coordinated cell according to the priority from high to low includes: after completing the scheduling of the high priority coordinated cell, the low priority coordinated cell according to the scheduling result of the high priority coordinated cell Scheduling;
  • the scheduling result includes: scheduling user information, and scheduling weight information of the user.
  • the step of performing scheduling of each coordinated cell in order of priority from high to low further includes: when scheduling a coordinated cell, according to channel feedback information of each user to be scheduled in the coordinated cell and the completed information thereof The data throughput is preferentially selected for the scheduled users whose data throughput is small and the current channel quality is high.
  • the coordinated cell When the coordinated cell is scheduled, if the user to be scheduled interferes with the scheduled user exceeds the preset interference strength threshold, the user is abandoned.
  • the historical information includes one of the following information or any combination thereof: traffic volume of the coordinated cell, busyness, type of service served;
  • the current information includes one of the following information or any combination thereof: the number of users to be scheduled in the coordinated cell, the current channel state information, and the data type of the user.
  • MU-MIMO multi-antenna mode
  • channel conditions permit, scheduling multiple to-be-scheduled users in the coordinated cell; if the coordinated cell supports single-user multiple-input multiple-output (SU-MIMO) mode, and channel conditions permit In case, the to-be-scheduled user scheduled by the coordinated cell uses multiple flows.
  • SU-MIMO single-user multiple-input multiple-output
  • the steps of performing scheduling of each coordinated cell in order of priority from high to low include: being performed by any coordinated cell in the network, or according to each coordinated cell
  • the traffic volume or a coordinated cell determined by the busy state is used as the central control cell, and the scheduling of each coordinated cell is completed, and the scheduling result is separately sent to each coordinated cell;
  • the method further includes: each coordinated cell Transmitting the history and current information of the current cell to all other coordinated cells, and each coordinated cell also receives the cell history and current information sent by other coordinated cells; and prioritizes each coordinated cell according to the history and/or current information of each coordinated cell.
  • the step of sorting includes: each coordinated cell performs prioritization according to history and/or related information of all coordinated cells; and the steps of completing scheduling of each coordinated cell in order of priority from high to low include: high priority coordinated cell After the scheduling is completed, the scheduling result is notified to all low priority coordinated cells; the low priority cell receives the scheduling result sent by the high priority cell.
  • the above methods also include:
  • the priority ranking is re-scheduled for each coordinated cell at each collaboration time or according to a preset period.
  • the present invention also provides a cell priority-based cooperative scheduling system, which includes an information transceiving module, a prioritization module, and a cell scheduling module, where:
  • the information transceiver module is configured to: send or receive a history and current information of the coordinated cell;
  • the priority ranking module is configured to: prioritize the coordinated cells according to the history and/or current information of each coordinated cell;
  • the cell scheduling module is configured to: perform scheduling of each coordinated cell in order from highest to lowest priority.
  • the present invention also provides a cell-priority-based cooperative scheduling system, the system being applied to a centralized cooperative network, the system comprising a base station including a central control cell and base stations of other coordinated cells, where:
  • the base stations in the other coordinated cells include:
  • the first information transceiver module is configured to: send the history and current information of the coordinated cell, and related information of the user to be scheduled in the coordinated cell to the central control cell; and, the receiving center controls the scheduling result sent by the base station;
  • the base station in the central control cell includes:
  • a second information transceiver module configured to: receive history and current information of each coordinated cell, and related information of users to be scheduled in each coordinated cell; and send the scheduling result to each coordinated cell separately;
  • a prioritization module configured to: prioritize each coordinated cell according to a history and/or current information of each coordinated cell;
  • the cell scheduling module is configured to: schedule corresponding coordinated cells according to related information of users to be scheduled in each coordinated cell.
  • the central control cell is any coordinated cell in the centralized cooperative network, or a coordinated cell determined according to traffic volume or busy state in each coordinated cell in the network.
  • the present invention also provides a cell-priority-based cooperative scheduling system, which is applied to a distributed cooperative network, and includes a base station in each coordinated cell in the network, where the base station includes:
  • the information transceiver module is configured to: send the history and current information of the coordinated cell to all other coordinated cells; receive cell history information and current information sent by other coordinated cells, and scheduling results of the high priority coordinated cell; Notifying the scheduling result of the coordinated cell to all low priority coordinated cells;
  • the prioritization module is configured to: prioritize each coordinated cell according to a history of each coordinated cell, and/or current information;
  • the cell scheduling module is configured to: complete the scheduling of the coordinated cell according to the scheduling result of the high priority cell and the related information of the user to be scheduled in the coordinated cell.
  • the characteristics of each coordinated cell can be fully considered, the resource allocation of the entire area can be optimized, and when users are scheduled in each cell, the user is scheduled to be proportionally fair, so that the network is in a reasonable working state. , in turn, can improve the performance of the entire system.
  • FIG. 1 is a schematic flow chart of a collaborative scheduling method in a centralized cooperative network according to an embodiment of the present invention
  • FIG. 2 is a schematic block diagram of a cooperative scheduling system applied to a centralized cooperative network according to an embodiment of the present invention
  • each coordinated cell can support MU-MIMO (Multi-User Multiple Input Multiple Output) and SU-MIMO (Single- User Multiple Input Multiple Output (Multiple Input Multiple Output)
  • MU-MIMO Multi-User Multiple Input Multiple Output
  • SU-MIMO Single- User Multiple Input Multiple Output
  • users in each coordinated cell independently measure the channel quality of the user to the serving cell, and feed back the measurement information to the serving cell.
  • the core idea of the present invention is: determining the priority of each coordinated cell according to the history and current related information of each coordinated cell, and performing scheduling according to the priority from high to low; and when scheduling the low priority cell, Consider the scheduling result of the high priority cell.
  • the collaborative scheduling method provided by the present invention includes the following contents:
  • Prioritization of each coordinated cell may be performed according to the history of each coordinated cell, and/or current information.
  • the historical information includes, but is not limited to, one of the following information or any combination thereof: information about the traffic volume, busyness, service type of the service, and the like, which are counted before the current time;
  • the current information includes but is not limited to one of the following information or any combination thereof: the number of users to be served in the cell (ie, users who need to transmit data, hereinafter referred to as users to be scheduled), current channel state information, and user's Information such as data type.
  • the traffic volume of the cell is usually large, that is, the cell belongs to a busy cell, and if there are a large number of users currently serving, the real-time requirement of the user data is high, and the channel condition of the user is Ok, then the priority of this community will be high.
  • Priority ordering can use either dynamic mode or semi-static mode.
  • the dynamic mode refers to re-prioritization of each cooperation time;
  • the semi-static mode refers to periodically prioritizing the priorities, that is, the priority order is not updated within a certain cooperation time interval, and the interval is exceeded according to the history.
  • the information and current information re-update the priority of each coordinated cell.
  • scheduling information of the higher priority cell and related information of the user to be scheduled you need to consider the following information: scheduling information of the higher priority cell and related information of the user to be scheduled.
  • higher priority cell scheduling information is considered in order to reduce interference to them, for example, such as If it is found that any user in the coordinated cell will form a strong interference to the coordinated cell that has been scheduled, the strong interference can be determined by setting the interference strength threshold, and the coordinated cell will not schedule the coordinated time-frequency resource. The user of the collaborative cell.
  • Considering the relevant information of the users to be scheduled is to balance the principle of fairness and improve resource utilization.
  • a cooperating cell supports the MU-MIMO multi-antenna mode, and if the channel conditions permit, the cooperating cell can schedule a plurality of users within the cooperating cell. Similarly, if the cooperating cell supports the SU-MIMO mode, and the channel conditions permit, the user that the cooperating cell can schedule can use multiple streams.
  • the coordinated cell does not support the MU-MIMO multi-antenna mode, or the channel condition does not allow scheduling multiple users or multiple streams, it is still possible to schedule a single user.
  • the invention can be applied in a centralized collaborative network or a distributed collaborative network.
  • the centralized cooperative network refers to a central control point (cell) in the cooperation area, and the entire scheduling process is completely completed by the central control point; the distributed cooperative network refers to each coordinated cell in the cooperation area.
  • the cell prioritization is performed independently according to the history of each coordinated cell and the current related information. (Because the information obtained by each coordinated cell is completely the same, the ranking results obtained by all the cells are also consistent), where among the coordinated cells
  • the information of the other coordinated cells may be obtained by the interaction between the two cells.
  • the cooperative cell may send the history and current information of the current cell to all other coordinated cells, and also receive the cell history sent by other coordinated cells. And current information.
  • the scheduling result includes scheduling user information (that is, which users are scheduled), and weight information used by each user who performs scheduling (hereinafter referred to as determined scheduling), etc., to notify all low priorities.
  • the cell, the low priority cell receives the scheduling result sent by the high priority cell, and performs the scheduling of the cell according to the scheduling result of the high priority cell.
  • Embodiment 1 The following describes the implementation of the technical solution of the present invention in detail by taking a centralized cooperative network as an example.
  • Each coordinated cell supports MU-MIMO and SU-MIMO modes, and there are 3 users to be scheduled within the cooperative resources of each coordinated cell.
  • the users to be scheduled in the coordinated cell A are: user a, User a2 and user a3; the users to be scheduled of the coordinated cell B are: user bl, user b2, and user b3; the users to be scheduled of the coordinated cell C are: user cl, user c2, and user c3.
  • the interference strength threshold may be uniformly set by each coordinated cell, or may be separately set; if the scheduling user is scheduled, if the to-be-scheduled user interferes with the determined scheduled user is greater than the threshold Then, the user is abandoned to schedule. Specifically, the interference of the user to be scheduled to the determined scheduled user may be determined according to the energy of the leak.
  • the three users to be scheduled in the coordinated cell A user a, user a2, and user a3 independently measure the channel quality of the base station to the coordinated cell A, and feed back the measurement information to the coordinated cell A;
  • 3 to be scheduled in the coordinated cell B User: User bl, user b2 and user b3 independently measure the channel quality of the base station to the coordinated cell B base station, and feed back the measurement information to the coordinated cell B;
  • 3 to be scheduled users in the coordinated cell C user cl, user c2 and user C3 independently measures the channel quality of itself to the coordinated cell C base station, and feeds back the measurement information to the coordinated cell C.
  • the coordinated cell C has the smallest traffic, or the current busy state is the lowest, then the coordinated cell C is selected as the central control cell;
  • the coordinated cell A sends the related information of the three users to be scheduled in the cell and the related information of the local cell to the central control cell.
  • the information about the user to be scheduled includes the channel feedback information of the user to be scheduled and the data throughput of the user to be scheduled in a certain period of time; the cell related information of the coordinated cell A.
  • the cell related information mainly includes the current information. Information such as the busyness of the community, the type of service to be served, and so on.
  • the coordinated cell B sends the related information of the three users to be scheduled in the cell and the related information of the local cell to the central control cell.
  • the information about the user to be scheduled includes the channel feedback information of the user to be scheduled and the data throughput and other information that the user to be scheduled has completed within a certain time period (which can be set and adjusted according to actual needs);
  • the cell related information of the coordinated cell B includes the current Information such as the busyness of the community, the type of service to be served, and so on.
  • the collaborative scheduling method mainly includes the following steps:
  • the central control cell C first determines the priority of each coordinated cell according to the cell related information of each coordinated cell.
  • the determining principle is that the busy the coordinated cell is, the higher the level is, the higher the real-time performance of the service to be served is. The higher the level, the higher the level.
  • the final cell priority is assumed to be The order of high to low is: cooperative small B, coordinated cell A, and coordinated cell C; after the level is determined, the scheduling of each coordinated cell is sequentially determined in a hierarchical order.
  • the highest priority cell that is, the coordinated cell B scheduling is performed.
  • the central control cell C completes the scheduling of the cell according to the three principles of the proportional fairness and the current channel quality according to the three to-be-scheduled user information in the cell transmitted by the coordinated cell B.
  • the smaller the throughput of the user to be scheduled is completed.
  • the higher the current channel quality, this user will be prioritized. It is assumed that the final scheduled users are two users bl and b2, each user only transmits one stream, that is, each user has only one optimal weight; and the third step, the next highest priority cell, that is, coordinated cell A scheduling.
  • the central control cell C according to the three to-be-scheduled user information in the cell transmitted by the coordinated cell A and the scheduling decision result of the higher priority cell, in addition to considering the proportional fairness principle and the current channel quality of the user to be scheduled,
  • the cell scheduling is performed by using the maximum signal leakage ratio criterion. For example, the signal energy s is emitted, and the energy leaked to other users is L.
  • the maximum signal-to-drag ratio criterion is to maximize the ratio of the desired s/L. In this process, it is found that if any one of the three users al, a2, and a3 is scheduled, the interference to the determined scheduling user exceeds the specified interference strength threshold, so the final scheduling result is that the coordinated cell A is in the cooperative resource. Do not schedule users within;
  • the lowest priority cell that is, the central control cell C scheduling is performed.
  • the central control cell C selects the scheduling result of the cell B and the cell A according to the three scheduled user information in the cell and the scheduling decision result of the higher priority cell, in addition to considering the proportional fairness principle and the current channel quality of the user to be scheduled.
  • the maximum channel-to-leak ratio criterion is used to perform the scheduling of the cell; it is assumed that due to the channel condition of the cell, the channel condition does not support the simultaneous presence of two users, and the cell can only schedule one user at a time, and finally determines the scheduling user c2.
  • the central control cell sends the scheduling results to the corresponding coordinated cells.
  • a cell-priority-based cooperative scheduling system is provided, which is applied to a centralized cooperative network, where the network includes a control center cell and other cooperative cells, where
  • Base stations in other coordinated cells include:
  • An information transceiver module configured to record the history and current information of the coordinated cell, and the collaboration cell
  • the related information of the user to be scheduled is sent to the central control cell; and the receiving center controls the scheduling result sent by the base station;
  • the base stations in the central control cell include:
  • the information transceiver module is configured to receive the history and current information of each coordinated cell, and related information of the to-be-scheduled user in each coordinated cell; and send the scheduling result to each coordinated cell separately;
  • a prioritization module configured to prioritize each collaborative cell according to a history and/or current information of each coordinated cell
  • the cell scheduling module is configured to complete the scheduling of each coordinated cell according to the priority information of the users to be scheduled in each coordinated cell according to the priority from high to low.
  • the central control cell is any coordinated cell in the network, or a coordinated cell determined according to traffic volume or busy state in each coordinated cell in the network.
  • Embodiment 2 is a diagrammatic representation of Embodiment 1:
  • the coordinated cells are called a coordinated cell, a coordinated cell B, and a coordinated cell C.
  • the users to be scheduled in 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; Call it: user cl, user c2, and user c3.
  • An interference threshold is set. When the user to be scheduled is scheduled, the to-be-scheduled user has more interference to the determined user than the threshold, and the user is abandoned.
  • the three users to be scheduled in the coordinated cell A user a, user a2, and user a3 independently measure the channel quality of the base station to the coordinated cell A, and feed back the measurement information to the coordinated cell A;
  • 3 to be scheduled in the coordinated cell B User: User bl, user b2 and user b3 independently measure the channel quality of the base station to the coordinated cell B base station, and feed back the measurement information to the coordinated cell B;
  • 3 to be scheduled users in the coordinated cell C user cl, user c2 and user C3 independently measures the channel quality of itself to the coordinated cell C base station, and feeds back the measurement information to the coordinated cell C.
  • the three coordinated cells respectively send related information of the respective cells to all other coordinated cells, and the related information of the cell includes information such as the current busyness of the cell, the type of service to be served, and the like.
  • Each coordinated cell uses the information of the local cell and the information sent by other coordinated cells to perform prioritization according to the set cell priority algorithm, because the information used by each cell and the priority algorithm are identical, so three cooperations The priority given by the cell is the same.
  • the priority of each coordinated cell is determined.
  • the determining principle is that the higher the busy level of the coordinated cell, the higher the real-time performance of the service to be served, and the higher the amount of data, the higher the level. According to this principle, it is assumed that the priority of the final cell from high to low is: coordinated cell 8, coordinated cell A and coordinated cell C;
  • the high priority coordinated cell After each coordinated cell obtains the cell priority, the high priority coordinated cell first performs scheduling, and after the low priority cell waits for the scheduling result of the high priority cell, the scheduling starts.
  • the highest priority cell that is, the coordinated cell B scheduling
  • the coordinated cell A and the coordinated cell C wait for the scheduling result of the coordinated cell B.
  • the coordinated cell B considers both the proportional fairness principle and the current channel quality to complete the scheduling of the cell; the smaller the throughput of the to-be-scheduled user is completed and the higher the current channel quality, the user is preferentially scheduled; the final determined scheduling user It is two users bl and b2, each user only transmits one stream, that is, each user has only one optimal weight.
  • This scheduling result indicates that the coordinated cell B uses the MU-MIMO mode at this time; the coordinated cell B sends the scheduling result to Cooperative cell A and coordinated cell C;
  • Cooperative cell C still waits after receiving the scheduling result of coordinated cell B, because the level of coordinated cell A is higher than itself;
  • the coordinated cell A can perform the scheduling of the cell after receiving the scheduling result of the coordinated cell B, because currently it is the highest rank among all the unscheduled coordinated cells.
  • the coordinated cell A considers the proportional fairness principle and the current channel quality of the user to be scheduled and the scheduling decision result of the coordinated cell B, and uses the maximum signal-to-leak ratio criterion to perform the scheduling of the cell; in this process, it is found that if three users al, a2, and a3 are scheduled, In any of the cases, the interference to the determined scheduling user exceeds the specified interference threshold, so the final scheduling result is that the coordinated cell A does not schedule the user within the cooperative resource; the coordinated cell A notifies the scheduling result to the more Low priority cooperative cell C;
  • the coordinated cell C After receiving the scheduling result of the coordinated cell A, the coordinated cell C can perform the local cell scheduling because it is currently the highest rank among all the unscheduled coordinated cells.
  • the coordinated cell C considers the principle of proportional fairness, the current channel quality of the user to be scheduled, and the scheduling result of the coordinated cell A and the coordinated cell B,
  • the cell scheduling is performed by using the maximum information leakage ratio criterion. Due to the channel condition of the cell, the cell can only schedule one user at a time, and finally determines the scheduling user c2.
  • the present invention further provides another cell priority-based cooperative scheduling system, which is applied to a distributed cooperative network.
  • the base station of each coordinated cell in the network further includes an information transceiver module, a priority ordering module, and a cell scheduling module, wherein:
  • An information transceiver module configured to send the history and current information of the coordinated cell to all other coordinated cells; receive cell history information and current information sent by other coordinated cells, and scheduling results of the high priority coordinated cell; and, The scheduling result of the cell is notified to all low priority coordinated cells;
  • a prioritization module configured to prioritize each collaborative cell according to a history and/or current information of each coordinated cell
  • the cell scheduling module is configured to complete the scheduling of the coordinated cell according to the scheduling result of the high priority cell and the related information of the user to be scheduled in the coordinated cell.
  • the cooperative scheduling scheme in the invention can fully consider the characteristics of each coordinated cell, and optimize the whole The resource allocation of each area, when scheduling users in each cell, simultaneously scheduling the users according to the principle of proportional fairness, so that the network is in a reasonable working state, and thus the performance of the whole system can be improved.

Landscapes

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

Description

一种基于小区优先级的协作调度方法及系统
技术领域
本发明涉及移动通信技术领域， 尤其涉及一种基于小区优先级的协作调 度方法及系统。
背景技术
LTE-A ( Long Term Evaluation- Advanced, 高级长期演进 ) 系统中， 为了 提高高速数据速率业务的覆盖率， 并提高小区边缘和小区平均吞吐率， 引入 了 CoMP ( Coordinated Multiple Point Transmission and Reception, 多点协作传 输与接收）技术。
LTE-A中的 CoMP技术主要分为： 1 )联合传输技术， 协作传输集合中各 个节点都可以获得数据信息， 在同一时刻 PDSCH ( Physical Downlink Shared Channel, 物理下行共享信道）数据通过多个节点或者一个节点传输； 2 )协 作调度， 仅仅服务小区可以获得待传输的数据信息， 对用户的调度和波束赋 形的确认通过在协作集合协商完成。
目前， 已有的协作小区的协作调度方案存在如下问题：
1 , 在对一个协作小区进行调度时， 仅考虑本协作小区的特性， 因此， 可 能会对协作区域内其它已完成调度的协作小区造成强干扰；
2, 在对协作小区内的用户进行调度时， 并未考虑公平原则， 且资源利用 率低。
发明内容
本发明要解决的技术问题是提供一种协作调度方法及系统， 充分考虑各 协作小区的特性， 优化整个协作区域的资源分配。
为解决上述问题， 本发明提供一种基于小区优先级的协作调度方法， 应 用于使用 CoMP技术的系统， 所述方法包括： 根据各协作小区的历史和 /或当前信息对各协作小区进行优先级排序； 以 及
按照优先级从高到低的顺序依次完成各协作小区的调度。
所述按照优先级从高到低的顺序依次完成各协作小区的调度的步骤包 括： 在完成高优先级协作小区的调度后， 根据所述高优先级协作小区的调度 结果对低优先级协作小区进行调度；
所述调度结果包括： 调度用户信息， 以及调度用户的权值信息。
所述按照优先级从高到低的顺序依次完成各协作小区的调度的步骤还包 括： 在对一协作小区进行调度时， 根据该协作小区内各待调度用户的信道反 馈信息及其已完成的数据吞吐量， 优先选择已完成的数据吞吐量小且当前信 道质量高的待调度用户进行调度。
所述根据所述高优先级协作小区的调度结果对低优先级协作小区进行调 度的步骤包括：
在对协作小区进行调度时， 如果待调度用户对已完成调度用户的干扰超 出预先设置的干扰强度门限值， 则放弃调度该用户。
所述历史信息包括以下信息中的一种或其任意组合： 本协作小区的业务 量、 繁忙程度、 所服务的业务类型；
所述当前信息包括以下信息中的一种或其任意组合： 本协作小区内待调 度用户的数目、 当前信道状态信息、 用户的数据类型。
在对协作小区进行调度时， 如果该协作小区支持多用户多输入多输出
( MU-MIMO ) 多天线模式、 且信道条件允许， 对该协作小区内的多个待调 度用户进行调度； 如果该协作小区支持单用户多输入多输出 （ SU-MIMO )模 式， 且信道条件允许的情况下， 该协作小区所调度的待调度用户使用多个流。
当所述方法应用于集中式协作网络中时， 按照优先级从高到低的顺序依 次完成各协作小区的调度的步骤包括： 由所述网络中的任一协作小区、 或者 根据各协作小区中的业务量或繁忙状态确定的一个协作小区作为中心控制小 区， 完成各协作小区的调度， 并将调度结果分别发送给各协作小区；
当所述方法应用于分布式协作网络中时， 所述方法还包括： 各协作小区 将本小区的历史和当前信息发送给其他所有协作小区， 同时各协作小区也接 收其它协作小区发送的小区历史和当前信息； 根据各协作小区的历史和 /或当 前信息对各协作小区进行优先级排序的步骤包括： 各协作小区根据所有协作 小区的历史、 和 /或相关信息进行优先级排序； 按照优先级从高到低的顺序依 次完成各协作小区的调度的步骤包括： 高优先级协作小区调度完成后将调度 结果通知所有低优先级协作小区； 低优先级小区接收高优先级小区发送的调 度结果。
上述方法还包括：
在每个协作时刻、 或者按照预先设定的周期对各协作小区重新进行所述 优先级的排序。
本发明还一种基于小区优先级的协作调度系统， 其包括信息收发模块、 优先级排序模块和小区调度模块， 其中：
所述信息收发模块设置为： 发送或接收协作小区的历史和当前信息； 所述优先级排序模块设置为： 根据各协作小区的历史和 /或当前信息对各 协作小区进行优先级排序；
所述小区调度模块设置为： 按照优先级从高到低的顺序依次完成各协作 小区的调度。
本发明还提供一种基于小区优先级的协作调度系统， 所述系统应用于集 中式协作网络， 所述系统包括包括中心控制小区的基站和其他协作小区的基 站， 其中：
所述其他协作小区内的基站包括：
第一信息收发模块， 其设置为： 将本协作小区的历史和当前信息、 和本 协作小区内待调度用户的相关信息发送给所述中心控制小区； 以及， 接收中 心控制基站发送的调度结果；
所述中心控制小区内的基站包括：
第二信息收发模块， 其设置为： 接收各协作小区的历史和当前信息、 和 各协作小区内待调度用户的相关信息； 以及， 将调度结果分别发送给各协作 小区； 优先级排序模块， 其设置为： 根据各协作小区的历史和 /或当前信息对各 协作小区进行优先级排序； 以及
小区调度模块， 其设置为： 根据各协作小区内待调度用户的相关信息对 相应的协作小区进行调度。
所述中心控制小区为所述集中式协作网络中的任一协作小区， 或者根据 所述网路中各协作小区中的业务量或繁忙状态确定的一个协作小区。
本发明还提供一种基于小区优先级的协作调度系统， 应用于分布式协作 网络， 包括所述网络中的各协作小区内的基站， 所述基站包括：
所述信息收发模块， 其设置为： 将本协作小区的历史和当前信息发送给 其他所有协作小区； 接收其它协作小区发送的小区历史信息和当前信息、 及 高优先级协作小区的调度结果； 以及， 将本协作小区的调度结果通知给所有 低优先级协作小区；
所述优先级排序模块， 其设置为： 根据各协作小区的历史、 和 /或当前信 息对各协作小区进行优先级排序； 以及
所述小区调度模块， 其设置为： 根据高优先级小区的调度结果、 以及本 协作小区内待调度用户的相关信息完成本协作小区的调度。
釆用发明中的协作调度方案， 可以充分考虑各协作小区的特性， 优化整 个区域的资源分配， 在每个小区内调度用户时， 同时兼顾比例公平原则调度 用户， 使网络处于一个合理的工作状态， 进而可以提高整个系统的性能。
附图概述
图 1 为本发明实施例的集中式协作网络中的协作调度方法的流程示意 图；
图 2为本发明实施例的应用于集中式协作网络的协作调度系统的示意框 图； 图。 ' ' ' ' ' ' 、： " ' " 本发明的较佳实施方式
LTE-A的 CoMP技术中， 一个协作区域内有若干协作小区， 每个协作小 区都可以支持 MU-MIMO ( Multi-User Multiple Input Multiple Output, 多用户 多输入多输出）和 SU-MIMO ( Single-User Multiple Input Multiple Output, 单 用户多输入多输出） 多天线模式， 每个协作小区内的用户独立测量本身到所 在服务小区的信道质量， 并将测量信息反馈给所在服务小区。
本发明的核心思想是： 按照各协作小区的历史和当前相关信息确定各协 作小区的优先级， 按照优先级从高到低的顺序依次完成调度； 且在进行低优 先级小区的调度时， 要考虑高优先级小区的调度结果。
基于上述思想， 本发明提供的协作调度方法包括以下内容：
A, 小区优先级的排序
可根据各协作小区的历史、 和 /或当前信息对各协作小区进行优先级的排 序。 视具体应用场景的不同， 所述历史信息包括但不限于以下信息中的一种 或其任意组合： 在此时刻之前统计的本小区的业务量、 繁忙程度、 所服务的 业务类型等信息； 所述当前信息包括但不限于以下信息中的一种或其任意组 合： 本小区即将要服务的用户 （即需要传输数据的用户， 以下称为待调度用 户） 的数目、 当前信道状态信息、 用户的数据类型等信息。 从统计的历史信 息看， 如果小区的业务量通常较大， 即此小区属于一个业务比较繁忙的小区， 同时， 如果当前要服务的用户数量多， 用户数据的实时性要求高， 用户的信 道条件好， 那么本小区的优先级就会高。
B, 排序模式
优先级的排序可以釆用动态模式也可以釆用半静态模式。 所述动态模式 是指每个协作时刻重新进行优先级排序； 所述半静态模式指周期地进行优先 级的排序， 即在一定的协作时间间隔内不更新优先级顺序， 超过此间隔则按 照历史信息和当前信息重新更新各协作小区的优先级。
C, 在对某一个协作小区进行调度时， 需考虑以下信息： 更高优先级小区 的调度信息、 待调度用户的相关信息。
其中， 考虑更高优先级小区调度信息为了减少对他们的干扰， 例如， 如 果发现调度本协作小区内的任何用户都会对已完成调度的协作小区形成强干 扰， 强干扰的判定可以通过设置干扰强度门限来实现， 那么本协作小区在此 协作时频资源上将不调度本协作小区的用户。
考虑待调度用户的相关信息则是为了兼顾公平性原则、提高资源利用率。
D, 优选地， 如果某个协作小区支持 MU-MIMO多天线模式， 并且在信 道条件允许的情况下， 此协作小区可以调度本协作小区内的多个用户。 同样， 如果协作小区支持 SU-MIMO模式， 并且在信道条件允许的情况下， 此协作 小区可以调度的用户可以使用多个流。
而如果协作小区不支持 MU-MIMO多天线模式， 或者信道条件不允许调 度多用户或者多流， 则还是可以调度单个用户的。
本发明可以应用在集中式协作网络或分布式协作网络中。 所述的集中式 协作网络是指在协作区域内有一个中心控制点 （小区） ， 整个调度过程完全 由此中心控制点完成； 所述的分布式协作网络是指在协作区域内， 各协作小 区分别根据各协作小区的历史和当前的相关信息独自完成小区优先级排序 (由于各协作小区获得的信息是完全一样的， 所有各小区获得的排序结果也 是一致的） ， 其中， 各协作小区之间可以通过协作小区间两两进行交互的方 式获取其他协作小区的信息； 也可以是， 各协作小区将本小区的历史和当前 信息发送给其他所有协作小区， 同时也接收其它协作小区发送的小区历史和 当前信息。 高优先级小区调度完成后将调度结果， 包括调度用户信息 （即对 哪些用户进行了调度） ， 以及进行调度的各用户 （以下称为已确定调度）使 用的权值信息等通知所有低优先级小区， 低优先级小区接收高优先级小区发 送的调度结果， 并根据高优先级小区的调度结果进行本小区的调度。
实施例一： 下面以集中式协作网络为例对本发明技术方案的实施作进一 步详细介绍。
假定区域内有 3个协作小区， 称之为协作小 A、 协作小区 B和协作小 区 C。 每个协作小区都支持 MU-MIMO和 SU-MIMO模式， 每个协作小区的 协作资源内有 3个待调度用户。 协作小区 A的待调度用户分别为： 用户 al、 用户 a2和用户 a3; 协作小区 B的待调度用户分别为： 用户 bl、 用户 b2和用 户 b3; 协作小区 C的待调度用户分别为： 用户 cl、 用户 c2和用户 c3。
设定一个干扰强度门限 (该干扰强度门限可以是各协作小区统一设定， 也可以分别设定； 在对待调度用户进行调度时， 如果该待调度用户对已确定 调度的用户的干扰大于此门限， 则放弃调度此用户。 具体地， 待调度用户对 已确定调度用户的干扰可根据泄漏的能量来确定。
协作小区 A中的 3个待调度用户： 用户 al、 用户 a2和用户 a3独立测量 本身到协作小区 A基站的信道质量， 并将测量信息反馈给协作小区 A; 协作 小区 B中的 3个待调度用户： 用户 bl、 用户 b2和用户 b3独立测量本身到协 作小区 B基站的信道质量， 并将测量信息反馈给协作小区 B; 协作小区 C中 的 3个待调度用户： 用户 cl、 用户 c2和用户 c3独立测量本身到协作小区 C 基站的信道质量， 并将测量信息反馈给协作小区 C。
假定， 从统计结果看， 协作小区 C的业务量最小， 或者当前繁忙状态最 低， 那么将选择协作小区 C作为中心控制小区；
协作小区 A将本小区内 3个待调度用户的相关信息和本小区的相关信息 发送给中心控制小区。 待调度用户相关信息包括待调度用户的信道反馈信息 以及在一定时间段内待调度用户已经完成的数据吞吐量等信息； 协作小区 A 的小区相关信息， 本实施例中， 小区相关信息主要包括当前小区繁忙程度、 即将服务的业务类型等信息。
同样， 协作小区 B将本小区内 3个待调度用户的相关信息和本小区的相 关信息发送给中心控制小区。 待调度用户相关信息包括待调度用户的信道反 馈信息以及在一定时长内 （可根据实际需要设置并调整该时长）待调度用户 已经完成的数据吞吐量等信息； 协作小区 B的小区相关信息包括当前小区繁 忙程度、 即将服务的业务类型等信息。
如图 1所示， 该协作调度方法主要包括以下步骤：
第一步， 中心控制小区 C首先按照各协作小区的小区相关信息， 确定各 协作小区的优先级， 确定原则是协作小区越繁忙， 其等级越高， 即将服务的 业务的实时性越高数据量越大等级越高。 按照此原则假定最终小区优先级从 高到低依次是： 协作小 B、 协作小区 A和协作小区 C; 等级确定后， 下面 按照等级次序依次确定各协作小区的调度。
第二步， 进行最高优先级小区即协作小区 B调度。 中心控制小区 C根据 协作小区 B传输来的小区内的 3个待调度用户信息， 考虑比例公平原则和当 前信道质量两方面的因素， 完成本小区调度； 待调度用户已完成的吞吐量越 小且当前信道质量越高， 此用户会被优先调度。 假定最终确定的调度用户是 bl和 b2两个用户， 每个用户只发射一个流即每个用户只有一个最佳权值； 第三步， 进行次最高优先级小区即协作小区 A调度。 中心控制小区 C根 据协作小区 A传输来的小区内的 3个待调度用户信息以及更高优先级小区的 调度判决结果， 除考虑比例公平原则和当前待调度用户信道质量两方面的因 素外， 釆用最大信漏比准则， 进行本小区调度。 例如， 发射信号能量 s, 泄漏 到其他用户能量为 L, 该最大信漏比准则就是将希望 s/L的比值最大。此过程 中发现如果调度 3个用户 al、 a2和 a3中的任何一个时， 其对已确定调度用 户的干扰都超过了规定的干扰强度门限， 因此最终的调度结果是， 协作小区 A在协作资源内不调度用户；
第四步， 进行最低优先级小区即中心控制小区 C调度。 中心控制小区 C 根据本小区内的 3个待调度用户信息以及更高优先级小区的调度判决结果即 小区 B和小区 A的调度结果， 除考虑比例公平原则和当前待调度用户信道质 量两方面的因素外， 釆用最大信漏比准则， 进行本小区调度； 假定由于本小 区信道条件所致， 信道条件不支持两个用户同时存在， 本小区同时只能调度 一个用户， 最终确定调度用户 c2。
至此 3个小区的调度完成， 中心控制小区将调度结果分别发送给相应的 协作小区。
此外， 如图 2所示， 本发明实施例中提供了一种基于小区优先级的协作 调度系统， 应用于集中式协作网络中， 该网络中包括控制中心小区和其他协 作小区， 其中
其他协作小区内的基站包括：
信息收发模块， 用于将本协作小区的历史和当前信息、 和本协作小区内 待调度用户的相关信息发送给所述中心控制小区； 以及， 接收中心控制基站 发送的调度结果；
中心控制小区内的基站包括：
信息收发模块， 用于接收各协作小区的历史和当前信息、 和各协作小区 内待调度用户的相关信息； 以及， 将调度结果分别发送给各协作小区；
优先级排序模块， 用于根据各协作小区的历史和 /或当前信息对各协作小 区进行优先级排序；
小区调度模块， 用于根据各协作小区内待调度用户的相关信息按照优先 级从高到低的顺序依次完成各协作小区的调度。
其中， 所述的中心控制小区为该网络中的任一协作小区， 或者根据网路 中各协作小区中的业务量或繁忙状态确定的一个协作小区。
实施例二：
下面以分布式协作网络为例本发明技术方案的实施作进一步详细介绍。 4叚定区域内有 3 个协作小区， 每个协作小区都支持 MU-MIMO 和
SU-MIMO模式，每个协作小区的协作资源内有 3个待调度的用户，协作小区 称之为协作小区 、 协作小区 B和协作小区 C。 协作小区 A的待调度用户分 别称之为： 用户 al、 用户 a2和用户 a3; 协作小区 B的待调度用户分别称之 为： 用户 bl、 用户 b2和用户 b3; 协作小区 C的待调度用户分别称之为： 用 户 cl、 用户 c2和用户 c3。
设定一个干扰门限； 当调度待调度用户时， 此待调度用户对已确定调度 的用户的干扰大于此门限， 放弃调度此用户。
协作小区 A中的 3个待调度用户： 用户 al、 用户 a2和用户 a3独立测量 本身到协作小区 A基站的信道质量， 并将测量信息反馈给协作小区 A; 协作 小区 B中的 3个待调度用户： 用户 bl、 用户 b2和用户 b3独立测量本身到协 作小区 B基站的信道质量， 并将测量信息反馈给协作小区 B; 协作小区 C中 的 3个待调度用户： 用户 cl、 用户 c2和用户 c3独立测量本身到协作小区 C 基站的信道质量， 并将测量信息反馈给协作小区 C。 三个协作小区分别将各自小区的相关信息发送给其他所有协作小区， 小 区相关信息包括当前小区繁忙程度、 即将服务的业务类型等信息。 各协作小 区利用本小区的信息及接收到的其他协作小区发送的信息， 按照设定的小区 优先级算法分别进行优先级排序， 因为各小区利用的信息和优先级算法完全 相同， 故三个协作小区得到的优先级是一样的。 确定各协作小区的优先级， 确定原则是协作小区的越繁忙等级越高， 即将服务的业务的实时性越高数据 量越大等级越高。 按照此原则假定最终小区优先级从高到低依次是： 协作小 区8、 协作小区 A和协作小区 C;
各协作小区得到小区优先级后， 高优先级的协作小区首先进行调度， 低 优先级的小区等待高优先级的小区的调度结果后， 在开始调度。
首先进行最高优先级小区即协作小区 B调度， 协作小区 A和协作小区 C 等待协作小区 B的调度结果。 协作小区 B考虑比例公平原则和当前信道质量 两方面的因素， 完成本小区调度； 待调度用户已完成的吞吐量越小且当前信 道质量越高， 此用户会被优先调度； 最终确定的调度用户是 bl和 b2两个用 户， 每个用户只发射一个流即每个用户只有一个最佳权值， 此调度结果表明 协作小区 B此时釆用 MU-MIMO模式；协作小区 B将调度结果发送给协作小 区 A和协作小区 C;
协作小区 C接收到协作小区 B的调度结果后仍然等待， 因为协作小区 A 的等级高于自己；
协作小区 A接收到协作小区 B的调度结果后即可进行本小区调度， 因为 当前自己是所有未调度协作小区中等级最高的。 协作小区 A考虑比例公平原 则和当前待调度用户信道质量以及协作小区 B的调度判决结果， 釆用最大信 漏比准则， 进行本小区调度； 此过程中发现如果调度 3个用户 al、 a2和 a3 中的任何一个时， 其对已确定调度用户的干扰都超过了规定的干扰门限， 因 此最终的调度结果是， 协作小区 A在协作资源内不调度用户； 协作小区 A将 此调度结果通知给更低优先级的协作小区 C;
协作小区 C接收到协作小区 A的调度结果后即可进行本小区调度， 因为 当前自己是所有未调度协作小区中等级最高的。 协作小区 C考虑比例公平原 则、 当前待调度用户信道质量以及协作小区 A和协作小区 B的调度结果， 釆 用最大信漏比准则， 进行本小区调度； 由于本小区信道条件所致， 本小区同 时只能调度一个用户， 最终确定调度用户 c2。
至此 3个小区的调度完成， 各协作小区按照小区各自的调度结果进行调 度。
如图 3所示， 本发明还提供了另一种基于小区优先级的协作调度系统， 应用于分布式协作网络中， 网络中的各协作小区的基站进一步包括信息收发 模块， 优先级排序模块和小区调度模块， 其中：
信息收发模块， 用于将本协作小区的历史和当前信息发送给其他所有协 作小区； 接收其它协作小区发送的小区历史信息和当前信息、 及高优先级协 作小区的调度结果； 以及， 将本协作小区的调度结果通知给所有低优先级协 作小区；
优先级排序模块， 用于根据各协作小区的历史和 /或当前信息对各协作小 区进行优先级排序；
小区调度模块， 用于根据高优先级小区的调度结果、 以及本协作小区内 待调度用户的相关信息完成本协作小区的调度。
尽管为示例目的， 已经公开了本发明的优选实施例， 本领域的技术人员 将意识到各种改进、 增加和取代也是可能的， 因此， 本发明的范围应当不限 于上述实施例。
本领域普通技术人员可以理解上述方法中的全部或部分步骤可通过程序 来指令相关硬件完成， 所述程序可以存储于计算机可读存储介质中， 如只读 存储器、 磁盘或光盘等。 可选地， 上述实施例的全部或部分步骤也可以使用 一个或多个集成电路来实现。 相应地， 上述实施例中的各模块 /单元可以釆用 硬件的形式实现， 也可以釆用软件功能模块的形式实现。 本发明不限制于任 何特定形式的硬件和软件的结合。
工业实用性 釆用发明中的协作调度方案， 可以充分考虑各协作小区的特性， 优化整 个区域的资源分配， 在每个小区内调度用户时， 同时兼顾比例公平原则调度 用户， 使网络处于一个合理的工作状态， 进而可以提高整个系统的性能。

Claims

权 利 要 求 书
1、 一种基于小区优先级的协作调度方法， 应用于使用多点协作传输 ( CoMP )技术的系统， 所述方法包括：
根据各协作小区的历史和 /或当前信息对各协作小区进行优先级排序； 以 及
按照优先级从高到低的顺序依次完成各协作小区的调度。
2、 如权利要求 1所述的方法， 其中，
所述按照优先级从高到低的顺序依次完成各协作小区的调度的步骤包 括： 在完成高优先级协作小区的调度后， 根据所述高优先级协作小区的调度 结果对低优先级协作小区进行调度；
所述调度结果包括： 调度用户信息， 以及调度用户的权值信息。
3、 如权利要求 2所述的方法， 其中，
所述按照优先级从高到低的顺序依次完成各协作小区的调度的步骤还包 括： 在对一协作小区进行调度时， 根据该协作小区内各待调度用户的信道反 馈信息及其已完成的数据吞吐量， 优先选择已完成的数据吞吐量小且当前信 道质量高的待调度用户进行调度。
4、 如权利要求 2所述的方法， 其中，
所述根据所述高优先级协作小区的调度结果对低优先级协作小区进行调 度的步骤包括：
在对协作小区进行调度时， 如果待调度用户对已完成调度用户的干扰超 出预先设置的干扰强度门限值， 则放弃调度该用户。
5、 如权利要求 1至 4之任一项所述的方法， 其中，
所述历史信息包括以下信息中的一种或其任意组合： 本协作小区的业务 量、 繁忙程度、 所服务的业务类型；
所述当前信息包括以下信息中的一种或其任意组合： 本协作小区内待调 度用户的数目、 当前信道状态信息、 用户的数据类型。
6、 如权利要求 5所述的方法， 其中， 在对协作小区进行调度时， 如果该协作小区支持多用户多输入多输出
( MU-MIMO ) 多天线模式、 且信道条件允许， 对该协作小区内的多个待调 度用户进行调度； 如果该协作小区支持单用户多输入多输出 （ SU-MIMO )模 式， 且信道条件允许的情况下， 该协作小区所调度的待调度用户使用多个流。
7、 如权利要求 5所述的方法， 其中，
当所述方法应用于集中式协作网络中时， 按照优先级从高到低的顺序依 次完成各协作小区的调度的步骤包括： 由所述网络中的任一协作小区、 或者 根据各协作小区中的业务量或繁忙状态确定的一个协作小区作为中心控制小 区， 完成各协作小区的调度， 并将调度结果分别发送给各协作小区；
当所述方法应用于分布式协作网络中时， 所述方法还包括： 各协作小区 将本小区的历史和当前信息发送给其他所有协作小区， 同时各协作小区也接 收其它协作小区发送的小区历史和当前信息； 根据各协作小区的历史和 /或当 前信息对各协作小区进行优先级排序的步骤包括： 各协作小区根据所有协作 小区的历史、 和 /或相关信息进行优先级排序； 按照优先级从高到低的顺序依 次完成各协作小区的调度的步骤包括： 高优先级协作小区调度完成后将调度 结果通知所有低优先级协作小区； 低优先级小区接收高优先级小区发送的调 度结果。
8、 如权利要求 1至 4之任一项所述的方法， 该方法还包括：
在每个协作时刻、 或者按照预先设定的周期对各协作小区重新进行所述 优先级的排序。
9、 一种基于小区优先级的协作调度系统， 其包括信息收发模块、 优先级 排序模块和小区调度模块， 其中：
所述信息收发模块设置为： 发送或接收协作小区的历史和当前信息； 所述优先级排序模块设置为： 根据各协作小区的历史和 /或当前信息对各 协作小区进行优先级排序；
所述小区调度模块设置为： 按照优先级从高到低的顺序依次完成各协作 小区的调度。
10、 一种基于小区优先级的协作调度系统， 所述系统应用于集中式协作 网络， 所述系统包括包括中心控制小区的基站和其他协作小区的基站， 其中： 所述其他协作小区内的基站包括：
第一信息收发模块， 其设置为： 将本协作小区的历史和当前信息、 和本 协作小区内待调度用户的相关信息发送给所述中心控制小区； 以及， 接收中 心控制基站发送的调度结果；
所述中心控制小区内的基站包括：
第二信息收发模块， 其设置为： 接收各协作小区的历史和当前信息、 和 各协作小区内待调度用户的相关信息； 以及， 将调度结果分别发送给各协作 小区；
优先级排序模块， 其设置为： 根据各协作小区的历史和 /或当前信息对各 协作小区进行优先级排序； 以及
小区调度模块， 其设置为： 根据各协作小区内待调度用户的相关信息对 相应的协作小区进行调度。
11、 如权利要求 10所述的系统， 其中，
所述中心控制小区为所述集中式协作网络中的任一协作小区， 或者根据 所述网路中各协作小区中的业务量或繁忙状态确定的一个协作小区。
12、 一种基于小区优先级的协作调度系统， 应用于分布式协作网络， 包 括所述网络中的各协作小区内的基站， 所述基站包括：
所述信息收发模块， 其设置为： 将本协作小区的历史和当前信息发送给 其他所有协作小区； 接收其它协作小区发送的小区历史信息和当前信息、 及 高优先级协作小区的调度结果； 以及， 将本协作小区的调度结果通知给所有 低优先级协作小区；
所述优先级排序模块， 其设置为： 根据各协作小区的历史、 和 /或当前信 息对各协作小区进行优先级排序； 以及
所述小区调度模块， 其设置为： 根据高优先级小区的调度结果、 以及本 协作小区内待调度用户的相关信息完成本协作小区的调度。
PCT/CN2010/079657 2009-12-11 2010-12-10 一种基于小区优先级的协作调度方法及系统 WO2011069468A1 (zh)

Priority Applications (3)

Application Number Priority Date Filing Date Title
JP2012538186A JP5575255B2 (ja) 2009-12-11 2010-12-10 セルの優先順位に基づいた協調スケジューリング方法及びシステム
EP10835503.3A EP2485557A4 (en) 2009-12-11 2010-12-10 Method and system for coordinated scheduling based on cell priority
US13/509,798 US9288817B2 (en) 2009-12-11 2010-12-10 Method and system for coordinated scheduling based on cell priority

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN200910254334.0 2009-12-11
CN200910254334.0A CN102098737B (zh) 2009-12-11 2009-12-11 一种基于小区优先级的协作调度方法及系统

Publications (1)

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

Family

ID=44131553

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2010/079657 WO2011069468A1 (zh) 2009-12-11 2010-12-10 一种基于小区优先级的协作调度方法及系统

Country Status (5)

Country Link
US (1) US9288817B2 (zh)
EP (1) EP2485557A4 (zh)
JP (1) JP5575255B2 (zh)
CN (1) CN102098737B (zh)
WO (1) WO2011069468A1 (zh)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104349483A (zh) * 2013-08-07 2015-02-11 电信科学技术研究院 一种协作多点传输场景下的资源调度方法和装置
RU2580935C2 (ru) * 2012-01-20 2016-04-10 Сони Корпорейшн Система и устройство радиосвязи, способ радиосвязи и машиночитаемый носитель данных

Families Citing this family (21)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8549379B2 (en) 2010-11-19 2013-10-01 Xilinx, Inc. Classifying a criticality of a soft error and mitigating the soft error based on the criticality
CN103748950A (zh) * 2011-09-28 2014-04-23 富士通株式会社 多点协作系统中的调度分配方法以及装置
US8522091B1 (en) * 2011-11-18 2013-08-27 Xilinx, Inc. Prioritized detection of memory corruption
CN103227703B (zh) * 2012-01-30 2018-08-03 南京中兴新软件有限责任公司 系统资源分配方法及装置
WO2014094191A1 (en) * 2012-12-21 2014-06-26 France Telecom Method and apparatus for coordinated multipoint transmission
CN103828422A (zh) * 2012-12-31 2014-05-28 华为技术有限公司 负载均衡的方法和网络控制节点
CN103167617B (zh) * 2013-03-12 2016-03-16 华南师范大学 一种多小区动态资源分配方法
CN104080177B (zh) * 2013-03-28 2019-01-11 株式会社Ntt都科摩 协作多点调度方法和基站
KR101523509B1 (ko) * 2013-07-01 2015-06-10 전남대학교산학협력단 이종 네트워크에서 다중 포인트 협력 통신 기반의 셀간 간섭 제어에 따른 성능 분석 장치 및 방법
KR101399293B1 (ko) 2013-07-01 2014-05-27 전남대학교산학협력단 Lte-a 네트워크에서 다중 포인트 협력 통신 기반의 셀간 간섭 제어에 따른 성능 분석 장치 및 방법
CN104284440B (zh) * 2013-07-04 2019-05-21 电信科学技术研究院 下行协作传输中的调度方法、协作传输节点及中心协作点
WO2015010267A1 (en) * 2013-07-24 2015-01-29 Telefonaktiebolaget L M Ericsson(Publ) Methods and devices for cell selection
WO2015096092A1 (zh) * 2013-12-26 2015-07-02 华为技术有限公司 资源调度方法、信息交互方法及设备
CN105245318B (zh) * 2014-07-10 2018-06-01 普天信息技术有限公司 一种上行协同多点的实现方法
CN104780032B (zh) * 2015-04-14 2018-01-26 大唐移动通信设备有限公司 一种自适应的下行CoMP传输方法和装置
CN107548118B (zh) * 2016-06-27 2021-06-25 中兴通讯股份有限公司 一种无线互联网接入方法及装置、设备
CN108124265B (zh) * 2016-11-28 2021-05-11 中国移动通信有限公司研究院 一种网络覆盖强度的调整方法及装置
WO2020118636A1 (en) * 2018-12-13 2020-06-18 Telefonaktiebolaget Lm Ericsson (Publ) Method and base station for multi-user multiple input multiple output
CN113225156B (zh) 2020-02-06 2022-08-26 上海朗帛通信技术有限公司 一种被用于无线通信的节点中的方法和装置
CN114584996B (zh) * 2022-05-09 2022-08-05 中国移动通信有限公司研究院 一种基于业务的干扰优化方法、网络设备及存储介质
CN118057888A (zh) * 2022-11-21 2024-05-21 上海华为技术有限公司 一种通信方法及装置

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101442808A (zh) * 2008-12-26 2009-05-27 西安电子科技大学 一种lte-a中的上行多点协作联合调度方法
CN101478342A (zh) * 2009-01-22 2009-07-08 清华大学 一种多天线蜂窝通信系统中多小区之间协作调度的方法
CN101516112A (zh) * 2009-02-19 2009-08-26 上海交通大学 多小区无线网络控制器信道信息反馈和调度方法
EP2101460A2 (en) * 2008-03-12 2009-09-16 NEC Laboratories America, Inc. Scheduling in multi-cell multi-carrier wireless systems

Family Cites Families (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100574501C (zh) 2004-07-27 2009-12-23 日本电气株式会社 上行链路无线电资源控制方法、基站设备和无线电网络控制器
US8559359B2 (en) * 2008-04-29 2013-10-15 Qualcomm Incorporated Information exchange mechanisms to achieve network QoS in wireless cellular systems
US8169931B2 (en) * 2008-05-21 2012-05-01 Airhop Communications, Inc. Method and apparatus for base stations and their provisioning, management, and networking
US8229443B2 (en) * 2008-08-13 2012-07-24 Ntt Docomo, Inc. Method of combined user and coordination pattern scheduling over varying antenna and base-station coordination patterns in a multi-cell environment
US8542640B2 (en) * 2008-08-28 2013-09-24 Ntt Docomo, Inc. Inter-cell approach to operating wireless beam-forming and user selection/scheduling in multi-cell environments based on limited signaling between patterns of subsets of cells
CN101686557B (zh) * 2008-09-22 2014-04-02 华为技术有限公司 一种多小区调度信息发送方法、装置及用户设备
US8867493B2 (en) * 2009-02-02 2014-10-21 Qualcomm Incorporated Scheduling algorithms for cooperative beamforming based on resource quality indication
US8619563B2 (en) * 2009-02-03 2013-12-31 Qualcomm Incorporated Method and apparatus for interference management in a wireless communication system
CN105099597B (zh) * 2009-03-13 2018-02-02 Lg电子株式会社 考虑上行链路/下行链路分量载波设定所执行的切换
US8219128B2 (en) * 2009-06-12 2012-07-10 Telefonaktiebolaget L M Ericsson (Publ) Network-centric link adaptation for coordinated multipoint downlink transmission
WO2011002374A1 (en) * 2009-07-02 2011-01-06 Telefonaktiebolaget L M Ericsson (Publ) Improved mobility management in a coordinated multipoint network
US8923844B2 (en) * 2009-08-14 2014-12-30 Futurewei Technologies, Inc. Coordinated beam forming and multi-user MIMO
US8243670B2 (en) * 2009-08-19 2012-08-14 Chunghwa Telecom Co., Ltd. User grouping method for inter-cell interference coordination in mobile telecommunication
KR101567831B1 (ko) * 2009-09-30 2015-11-10 엘지전자 주식회사 무선 통신 시스템에서의 ＣｏＭＰ 피드백 정보를 전송하기 위한 방법 및 단말 장치

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2101460A2 (en) * 2008-03-12 2009-09-16 NEC Laboratories America, Inc. Scheduling in multi-cell multi-carrier wireless systems
CN101442808A (zh) * 2008-12-26 2009-05-27 西安电子科技大学 一种lte-a中的上行多点协作联合调度方法
CN101478342A (zh) * 2009-01-22 2009-07-08 清华大学 一种多天线蜂窝通信系统中多小区之间协作调度的方法
CN101516112A (zh) * 2009-02-19 2009-08-26 上海交通大学 多小区无线网络控制器信道信息反馈和调度方法

Non-Patent Citations (1)

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

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
RU2580935C2 (ru) * 2012-01-20 2016-04-10 Сони Корпорейшн Система и устройство радиосвязи, способ радиосвязи и машиночитаемый носитель данных
CN104349483A (zh) * 2013-08-07 2015-02-11 电信科学技术研究院 一种协作多点传输场景下的资源调度方法和装置
CN104349483B (zh) * 2013-08-07 2018-03-27 电信科学技术研究院 一种协作多点传输场景下的资源调度方法和装置

Also Published As

Publication number Publication date
US20120238283A1 (en) 2012-09-20
CN102098737B (zh) 2014-02-26
JP5575255B2 (ja) 2014-08-20
US9288817B2 (en) 2016-03-15
EP2485557A4 (en) 2017-06-21
CN102098737A (zh) 2011-06-15
EP2485557A1 (en) 2012-08-08
JP2013510526A (ja) 2013-03-21

Similar Documents

Publication Publication Date Title
WO2011069468A1 (zh) 一种基于小区优先级的协作调度方法及系统
Wang et al. A unified approach to QoS-guaranteed scheduling for channel-adaptive wireless networks
TWI451779B (zh) 在複數個字典間做選擇之方法及裝置
WO2011072586A1 (zh) 一种多点协作传输中的协作调度方法及系统
EP2389026B1 (en) Method and system for coordinated transmission and a mobile terminal and network side device
EP1909442B1 (en) System and methods for determining granularity level of information about buffer status
JP6005879B2 (ja) セルラーネットワークにおいて無線リソースをスケジュールする方法およびシステム
WO2013034115A1 (zh) 多节点协作传输的方法和装置
EP2434804B1 (en) Method and base station in coordinated scheduling
WO2011072590A1 (zh) 多小区之间的协作调度方法、装置和系统
WO2013044468A1 (zh) 多点协作系统中的调度分配方法以及装置
WO2010133034A1 (zh) 协调多点通信的方法和设备
Torabzadeh et al. Packet scheduling and fairness for multiuser MIMO systems
Kartheek et al. Providing QoS in a cognitive radio network
JP7126165B2 (ja) 端末、基地局、無線通信システム及び回線状態情報取得方法
CN105517161A (zh) 一种下行资源分配方法和基站
CN104640226B (zh) 一种认知中继系统下基于多业务的资源调度方法及装置
CN105517178B (zh) 一种可调节的低复杂度无线资源调度器的调度方法
Li et al. A packet scheduling algorithm with interruption factor for cognitive radio
Rao et al. QoS based radio resource management techniques for next generation MU-MIMO WLANs: A survey
WO2015096092A1 (zh) 资源调度方法、信息交互方法及设备
CN105264980B (zh) 一种mvno资源控制方法及设备
Maniru Enhanced Adaptive Call Admission Control (EA-CAC) Scheme with Bandwidth Reservation for LTE Networks
CN105307275A (zh) 一种下行CoMP资源分配方法
Liu et al. Improved utility-based radio resource allocation in ofdma systems with mixed traffics

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: 10835503

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 2010835503

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 4017/CHENP/2012

Country of ref document: IN

WWE Wipo information: entry into national phase

Ref document number: 2012538186

Country of ref document: JP

WWE Wipo information: entry into national phase

Ref document number: 13509798

Country of ref document: US

NENP Non-entry into the national phase

Ref country code: DE

REG Reference to national code

Ref country code: BR

Ref legal event code: B01A

Ref document number: 112012011506

Country of ref document: BR

REG Reference to national code

Ref country code: BR

Ref legal event code: B01E

Ref document number: 112012011506

Country of ref document: BR

Free format text: SOLICITA-SE IDENTIFICAR O SIGNATARIO DAS PETICOES APRESENTADAS, COMPROVANDO QUE O MESMO TEM PODERES PARA ATUAR EM NOME DO DEPOSITANTE.

ENPW Started to enter national phase and was withdrawn or failed for other reasons

Ref document number: 112012011506

Country of ref document: BR

Free format text: PEDIDO RETIRADO POR NAO ATENDER DETERMINACOES REFERENTES A ENTRADA DO PEDIDO NA FASE NACIONAL E POR NAO TER CUMPRIDO EXIGENCIA PUBLICADA NA RPI NO 2541, DE 17/09/2019.