WO2011069468A1 - 一种基于小区优先级的协作调度方法及*** - Google Patents
一种基于小区优先级的协作调度方法及*** Download PDFInfo
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 32
- 230000005540 biological transmission Effects 0.000 claims abstract description 6
- 238000012913 prioritisation Methods 0.000 claims description 12
- 238000005516 engineering process Methods 0.000 claims description 7
- 238000012163 sequencing technique Methods 0.000 abstract 1
- CIWBSHSKHKDKBQ-JLAZNSOCSA-N Ascorbic acid Chemical compound OC[C@H](O)[C@H]1OC(=O)C(O)=C1O CIWBSHSKHKDKBQ-JLAZNSOCSA-N 0.000 description 24
- 238000005259 measurement Methods 0.000 description 7
- 238000013468 resource allocation Methods 0.000 description 3
- 238000007792 addition Methods 0.000 description 1
- 238000012790 confirmation Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 230000007774 longterm Effects 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
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
Claims
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP10835503.3A EP2485557A4 (en) | 2009-12-11 | 2010-12-10 | Method and system for coordinated scheduling based on cell priority |
JP2012538186A JP5575255B2 (ja) | 2009-12-11 | 2010-12-10 | セルの優先順位に基づいた協調スケジューリング方法及びシステム |
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)
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)
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 | 电信科学技术研究院 | 下行协作传输中的调度方法、协作传输节点及中心协作点 |
US9900834B2 (en) * | 2013-07-24 | 2018-02-20 | 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 | ***通信有限公司研究院 | 一种网络覆盖强度的调整方法及装置 |
CN113170437A (zh) * | 2018-12-13 | 2021-07-23 | 瑞典爱立信有限公司 | 用于多用户多输入多输出的方法和基站 |
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)
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)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101626622A (zh) * | 2004-07-27 | 2010-01-13 | 日本电气株式会社 | 上行链路无线电资源控制方法、基站设备和无线电网络控制器 |
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 |
KR101356525B1 (ko) * | 2009-03-13 | 2014-01-29 | 엘지전자 주식회사 | 상하향링크 콤포넌트 반송파 설정을 고려한 핸드오버 |
US8219128B2 (en) * | 2009-06-12 | 2012-07-10 | Telefonaktiebolaget L M Ericsson (Publ) | Network-centric link adaptation for coordinated multipoint downlink transmission |
EP2449818B1 (en) * | 2009-07-02 | 2013-05-29 | Telefonaktiebolaget LM 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 | 엘지전자 주식회사 | 무선 통신 시스템에서의 CoMP 피드백 정보를 전송하기 위한 방법 및 단말 장치 |
-
2009
- 2009-12-11 CN CN200910254334.0A patent/CN102098737B/zh not_active Expired - Fee Related
-
2010
- 2010-12-10 WO PCT/CN2010/079657 patent/WO2011069468A1/zh active Application Filing
- 2010-12-10 EP EP10835503.3A patent/EP2485557A4/en not_active Withdrawn
- 2010-12-10 JP JP2012538186A patent/JP5575255B2/ja not_active Expired - Fee Related
- 2010-12-10 US US13/509,798 patent/US9288817B2/en not_active Expired - Fee Related
Patent Citations (4)
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)
Title |
---|
See also references of EP2485557A4 * |
Cited By (3)
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 |
---|---|
CN102098737B (zh) | 2014-02-26 |
CN102098737A (zh) | 2011-06-15 |
JP2013510526A (ja) | 2013-03-21 |
US9288817B2 (en) | 2016-03-15 |
EP2485557A4 (en) | 2017-06-21 |
JP5575255B2 (ja) | 2014-08-20 |
US20120238283A1 (en) | 2012-09-20 |
EP2485557A1 (en) | 2012-08-08 |
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) | 在複數個字典間做選擇之方法及裝置 | |
EP2389026B1 (en) | Method and system for coordinated transmission and a mobile terminal and network side device | |
WO2011072586A1 (zh) | 一种多点协作传输中的协作调度方法及*** | |
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) | 一种下行资源分配方法和基站 | |
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 | |
Long et al. | Efficient rate-guaranteed opportunistic scheduling for wireless networks |
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. |