CN102098737B - Cell priority level based cooperation scheduling method and system - Google Patents
Cell priority level based cooperation scheduling method and system Download PDFInfo
- Publication number
- CN102098737B CN102098737B CN200910254334.0A CN200910254334A CN102098737B CN 102098737 B CN102098737 B CN 102098737B CN 200910254334 A CN200910254334 A CN 200910254334A CN 102098737 B CN102098737 B CN 102098737B
- Authority
- CN
- China
- Prior art keywords
- cooperation cell
- cell
- scheduling
- cooperation
- information
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Images
Classifications
-
- 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
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Signal Processing (AREA)
- Computer Networks & Wireless Communication (AREA)
- Quality & Reliability (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a cell priority level based cooperation scheduling method and system which are applied to a system utilizing a multipoint coordination transmission technology. The method comprises the following steps of: ordering priority levels of all cooperation cells according to historical information and/or current information of the cooperation cells; and completing the scheduling of cooperation cells with high priority levels and then completing the scheduling of cooperation cells with low priority levels. In the cooperation scheduling scheme of the invention, the characteristics of all cooperation cells are fully considered, the resource allocation of the whole region is optimized, and users in each cell are scheduled in accordance with a proportional fairness principle so that the network is in a reasonable working state and the performance of the whole system can be improved.
Description
Technical field
The present invention relates to mobile communication technology field, relate in particular to a kind of cooperative scheduling method and system based on native region priority.
Background technology
LTE-A (Long Term Evaluation-Advanced, senior Long Term Evolution) in system, in order to improve the coverage rate of high data rate business, and improve cell edge and community average throughput, introduced CoMP (Coordinated Multiple Point Transmission and Reception, coordinated multipoint transmission and reception) technology.
CoMP technology in LTE-A is mainly divided into: 1) joint transmission technology, in cooperation transmission set, each node can obtain data message, in synchronization PDSCH (Physical DownlinkShared Channel, Physical Downlink Shared Channel) data, by a plurality of nodes or a node, transmit; 2) cooperative scheduling, only Serving cell can obtain data message waiting for transmission, to the confirmation of user's scheduling and wave beam forming by having consulted in cooperation set.
At present, there are the following problems for the cooperative scheduling scheme of existing cooperation cell:
1, when a cooperation cell is dispatched, only consider the characteristic of this cooperation cell, therefore, may cause strong jamming to other cooperation cell that has completed scheduling in collaboration region;
2, when the user in cooperation cell dispatches, do not consider the fairness doctrine, and resource utilization is low.
Summary of the invention
The technical problem to be solved in the present invention is to provide a kind of cooperative scheduling method and system, takes into full account the characteristic of each cooperation cell, optimizes the resource of whole collaboration region and distributes.
In order to address the above problem, the invention provides a kind of cooperative scheduling method based on native region priority, be applied to use the system of coordinated multipoint transmission (CoMP) technology, described method comprises:
According to the history of each cooperation cell and/or current information, prioritization is carried out in each cooperation cell;
According to priority order from high to low, complete successively the scheduling of each cooperation cell.
Further, after completing the scheduling of high priority cooperation cell, according to the scheduling result of described high priority cooperation cell, low priority cooperation cell is dispatched;
Described scheduling result comprises: dispatched users information, and the weights information of dispatched users.
Further, when a certain cooperation cell is dispatched, according to channel feedback information and the completed data throughout thereof of respectively treating dispatched users in this cooperation cell, preferentially select the completed data throughout dispatched users for the treatment of little and that current channel quality is high to dispatch.
Further, the described scheduling result according to described high priority cooperation cell is dispatched and is referred to low priority cooperation cell:
When cooperation cell is dispatched, if treat that dispatched users exceeds to completing the interference of dispatched users the interference strength threshold value setting in advance, and abandons dispatching this user.
Further, described historical information includes but not limited to a kind of or its combination in any in following information: the traffic carrying capacity of this cooperation cell, busy extent, the type of service of serving;
Described current information includes but not limited to a kind of or its combination in any in following information: in this cooperation cell, treat number, the current channel condition information of dispatched users, user's data type.
Further, when cooperation cell is dispatched, if this cooperation cell supports multi-user's multiple-input and multiple-output (MU-MIMO) multi-antenna mode and channel condition to allow, a plurality of in this cooperation cell are treated to dispatched users dispatches; If alone family multiple-input and multiple-output (SU-MIMO) pattern is supported in this cooperation cell, and in the situation of channel condition permission, the dispatched users for the treatment of that dispatch this cooperation cell is used a plurality of stream.
Further, when described method is applied in centralized collaborative network, arbitrary cooperation cell in described network or a cooperation cell determining according to the traffic carrying capacity in each cooperation cell or busy state are as control community, center, complete the scheduling of each cooperation cell, and scheduling result is sent to respectively to each cooperation cell;
When described method is applied in distributed collaborative network, the history of Jiang Zhe community, each cooperation cell and current information send to other all cooperation cell, and each cooperation cell also receives cell history and the current information that other cooperation cell sends simultaneously; Prioritization is carried out according to the history of all cooperation cell and/or relevant information in each cooperation cell; And all low priorities cooperation cell is notified by scheduling result after having dispatched in high priority cooperation cell; Low priority community receives the scheduling result that high priority community sends.
Further, at each, cooperate constantly or according to the predefined cycle, each cooperation cell re-started the sequence of described priority.
The present invention also provides a kind of cooperative scheduling system based on native region priority, comprises signal dispatcher module, prioritization module and cell scheduling module, wherein:
Described signal dispatcher module, for sending or receive history and the current information of cooperation cell;
Described prioritization module, for carrying out prioritization according to the history of each cooperation cell and/or current information to each cooperation cell;
Described cell scheduling module, for completing successively the scheduling of each cooperation cell according to priority order from high to low.
Further, described system applies is in centralized collaborative network, and described network comprises control community, center and other cooperation cell, wherein
Base station in described other cooperation cell comprises:
Signal dispatcher module, for sending to control community, described center by the relevant information for the treatment of dispatched users in the history of this cooperation cell and current information and this cooperation cell; And receiving center is controlled the scheduling result that base station sends;
Base station in control community, described center comprises:
Signal dispatcher module, for receiving the relevant information for the treatment of dispatched users in the history of each cooperation cell and current information and each cooperation cell; And, scheduling result is sent to respectively to each cooperation cell;
Prioritization module, for carrying out prioritization according to the history of each cooperation cell and/or current information to each cooperation cell;
Cell scheduling module, for dispatching corresponding cooperation cell according to the relevant information for the treatment of dispatched users in each cooperation cell.
Further, control community, described center is the arbitrary cooperation cell in described network, or according to the traffic carrying capacity in Zhong Ge cooperation cell, described networking or a definite cooperation cell of busy state.
Further, described system applies is in distributed collaborative network, and the base station in each cooperation cell in described network comprises:
Described signal dispatcher module, for sending to other all cooperation cell by the history of this cooperation cell and current information; Receive the cell history information of other cooperation cell transmission and the scheduling result of current information and high priority cooperation cell; And, the scheduling result of this cooperation cell is notified to all low priorities cooperation cell;
Described prioritization module, for carrying out prioritization according to the history of each cooperation cell and/or current information to each cooperation cell;
Described cell scheduling module, for according to treating in the scheduling result of high priority community and this cooperation cell that the relevant information of dispatched users completes the scheduling of this cooperation cell.
Adopt the cooperative scheduling scheme in invention, can take into full account the characteristic of each cooperation cell, optimizing the resource in whole region distributes, in each community during dispatched users, take into account proportional fairness principle dispatched users simultaneously, make network in a rational operating state, and then can improve the performance of whole system.
Accompanying drawing explanation
Fig. 1 is the schematic flow sheet of the cooperative scheduling method in the centralized collaborative network of the embodiment of the present invention;
Fig. 2 is the schematic block diagram of the cooperative scheduling system that is applied to centralized collaborative network of the embodiment of the present invention;
Fig. 3 is the schematic block diagram of the cooperative scheduling system that is applied to distributed collaborative network of the embodiment of the present invention.
Embodiment
In the CoMP technology of LTE-A, in a collaboration region, there are some cooperation cell, MU-MIMO (Multi-User Multiple Input Multiple Output can be supported in each cooperation cell, multi-user's multiple-input and multiple-output) and SU-MIMO (Single-User Multiple Input Multiple Output, alone family multiple-input and multiple-output) multi-antenna mode, user's independent measurement itself in each cooperation cell arrives the channel quality of Serving cell, place, and metrical information is fed back to Serving cell, place.
Core concept of the present invention is: according to the history of each cooperation cell and current relevant information, determine the priority of each cooperation cell, according to priority order from high to low, complete successively scheduling; And when carrying out the scheduling of low priority community, consider the scheduling result of high priority community.
Based on above-mentioned thought, cooperative scheduling method provided by the invention comprises following content:
A, the sequence of native region priority
Can to each cooperation cell, carry out the sequence of priority according to the history of each cooperation cell and/or current information.Depending on the difference of concrete application scenarios, described historical information includes but not limited to a kind of or its combination in any in following information: add up before this moment the traffic carrying capacity, busy extent of Zhe community, the information such as type of service of serving; Described current information includes but not limited to a kind of or its combination in any in following information: the user's that this community will be served (needing to transmit the user of data, hereinafter referred to as treating dispatched users) number, current channel condition information, user's the information such as data type.From the historical information of statistics, if the traffic carrying capacity of community belongs to a community that business is busier compared with great ，Ji Ci community conventionally, meanwhile, if the current number of users that will serve is many, the requirement of real-time of user data is high, user's channel condition is good, and the priority of this community will be high so.
B, sequencing model
The sequence of priority can adopt dynamic mode also can adopt semi-static pattern.Described dynamic mode refers to that each cooperation re-starts prioritization constantly; Described semi-static pattern refers to carry out periodically the sequence of priority, within certain cooperation time interval, does not upgrade priority orders, surpasses this interval and according to historical information and current information, again upgrades the priority of each cooperation cell.
C, when some cooperation cell are dispatched, need to consider following information: the schedule information of higher priority community, treat the relevant information of dispatched users.
Wherein, consider that higher priority cell scheduling information is in order to reduce the interference to them, for example, if find that any user in this cooperation cell of scheduling can form strong jamming to completing the cooperation cell of scheduling, strongly disturbing judgement can realize by interference strength thresholding is set, and the user of this cooperation cell will not dispatched in this cooperation cell on this cooperation running time-frequency resource so.
Consider to treat that the relevant information of dispatched users is in order to take into account fair principle, to improve resource utilization.
D, preferably, if MU-MIMO multi-antenna mode is supported in certain cooperation cell, and in the situation that channel condition allows, a plurality of users in this cooperation cell can be dispatched in this cooperation cell.Equally, if SU-MIMO pattern is supported in cooperation cell, and in the situation that channel condition allows, the user that this cooperation cell can be dispatched can use a plurality of stream.
And if MU-MIMO multi-antenna mode is not supported in cooperation cell, or channel condition do not allow scheduling multi-user or multithread, or can dispatch unique user.
The present invention can be applied in centralized collaborative network or distributed collaborative network.Described centralized collaborative network refers to control point, You Yige center (community) in collaboration region, and whole scheduling process completes at control point, center completely thus; Described distributed collaborative network refers in collaboration region, each cooperation cell completes alone native region priority sequence according to the history of each cooperation cell and current relevant information respectively, and (information obtaining due to each cooperation cell is duplicate, the ranking results that all each communities obtain is also consistent), wherein, can be by carrying out between two the information that mutual mode is obtained other cooperation cell between cooperation cell between each cooperation cell; Also can be, the history of Jiang Zhe community, each cooperation cell and current information send to other all cooperation cell, also receive cell history and current information that other cooperation cell sends simultaneously.After high priority cell scheduling completes by scheduling result, comprise dispatched users information (which user being dispatched), and the weights information used of each user who dispatches (hereinafter referred to as determining scheduling) etc. is notified all low priorities community, low priority community receives the scheduling result that high priority community sends, and according to the scheduling result of high priority community, carries out the scheduling of this community.
The centralized collaborative network of take is below further described in detail the enforcement of technical solution of the present invention as example.
In hypothesis district, there are 3 cooperation cell, are referred to as cooperation cell A, cooperation cell B and cooperation cell C.MU-MIMO and SU-MIMO pattern are supported in each cooperation cell, in the cooperation resource of each cooperation cell, have 3 to treat dispatched users.The dispatched users for the treatment of of cooperation cell A is respectively: user a1, user a2 and user a3; The dispatched users for the treatment of of cooperation cell B is respectively: user b1, user b2 and user b3; The dispatched users for the treatment of of cooperation cell C is respectively: user c1, user c2 and user c3.
(this interference strength thresholding can be the unified setting in each cooperation cell, also can set respectively to set an interference strength thresholding; When treating dispatched users and dispatch, if this treats that dispatched users is greater than this thresholding to determining the user's of scheduling interference, abandons dispatching this user.Particularly, treat that dispatched users can determine according to the energy leaking determining the interference of dispatched users.
Treat dispatched users for 3 in the A of cooperation cell: user a1, user a2 and user a3 independent measurement itself be to the channel quality of A base station, cooperation cell, and metrical information is fed back to cooperation cell A; Treat dispatched users for 3 in the B of cooperation cell: user b1, user b2 and user b3 independent measurement itself be to the channel quality of B base station, cooperation cell, and metrical information is fed back to cooperation cell B; Treat dispatched users for 3 in the C of cooperation cell: user c1, user c2 and user c3 independent measurement itself be to the channel quality of C base station, cooperation cell, and metrical information is fed back to cooperation cell C.
Suppose, from statistics, the traffic carrying capacity of cooperation cell C is minimum, or current busy state is minimum, will select so cooperation cell C as control community, center;
In A Jiang Zhe community, cooperation cell, 3 relevant informations for the treatment of the relevant information He Zhe community of dispatched users send to control community, center.Treat that dispatched users relevant information comprises and treat the channel feedback information of dispatched users and in certain hour section, treat the information such as data throughout that dispatched users has completed; The community relevant information of cooperation cell A, the present embodiment Zhong， community relevant information mainly comprises current area busy extent, is about to the information such as type of service of service.
Equally, in cooperation cell B Jiang Zhe community, 3 relevant informations for the treatment of the relevant information He Zhe community of dispatched users send to control community, center.Treat that dispatched users relevant information comprises and treat the channel feedback information of dispatched users and (can arrange according to actual needs and adjust this duration) in certain time length to treat the information such as data throughout that dispatched users has completed; The community relevant information of cooperation cell B comprises current area busy extent, is about to the information such as type of service of service.
As shown in Figure 1, this cooperative scheduling method mainly comprises the following steps:
The first step, control community, center C, first according to the community relevant information of each cooperation cell, determines the priority of each cooperation cell, determines that principle is that cooperation cell is busier, and its higher grade, and soon the larger grade of the higher data volume of real-time of the business of service is higher.According to this principle, suppose that final native region priority from high to low successively: cooperation cell B, cooperation cell A and cooperation cell C; After classification, according to rank order, determine successively the scheduling of each cooperation cell below.
Second step, carrying out limit priority community is cooperation cell B scheduling.Control community, center C treats dispatched users information according to 3 in cooperation cell B transmission Lai community, considers the factor of proportional fairness principle and current channel quality two aspects, completes this cell scheduling; Treat that the completed throughput of dispatched users is less and current channel quality is higher, this user can be by priority scheduling.Suppose that final definite dispatched users is b1 and two users of b2, it is that each user only has a best weight value that each user only launches a stream;
The 3rd step, carrying out time limit priority community is cooperation cell A scheduling.Control community, center C is according to 3 scheduling court verdicts for the treatment of dispatched users information and higher priority community in cooperation cell A transmission Lai community, except considering proportional fairness principle and the current factor for the treatment of dispatched users channel quality two aspects, adopt maximum letter to leak than criterion, carry out this cell scheduling.For example, transmit signal energy s, leaking into other user's energy is L, it is exactly that the ratio of wishing s/L is maximum that this maximum letter leaks than criterion.If while finding in this process to dispatch any one in 3 user a1, a2 and a3, it has all surpassed the interference strength thresholding of regulation to determining interference of dispatched users, and therefore final scheduling result is, cooperation cell A dispatched users not in cooperation resource;
The 4th step, carrying out lowest priority community is control community, center C scheduling.Control community, center C is the scheduling result of community B and community A according to 3 in this community scheduling court verdicts for the treatment of dispatched users information and higher priority community, except considering proportional fairness principle and the current factor for the treatment of dispatched users channel quality two aspects, adopt maximum letter to leak than criterion, carry out this cell scheduling; Suppose due to due to this cell channel condition, channel condition does not support two users to exist ，Zhe community can only dispatch a user simultaneously simultaneously, finally determines dispatched users c2.
So far the scheduling of 3 communities completes, and control community, center sends to respectively corresponding cooperation cell by scheduling result.
In addition, as shown in Figure 2, provide a kind of cooperative scheduling system based on native region priority in the embodiment of the present invention, be applied in centralized collaborative network, this network comprises control centre community and other cooperation cell, wherein
Base station in other cooperation cell comprises:
Signal dispatcher module, for sending to control community, described center by the relevant information for the treatment of dispatched users in the history of this cooperation cell and current information and this cooperation cell; And receiving center is controlled the scheduling result that base station sends;
Base station in control community, center comprises:
Signal dispatcher module, for receiving the relevant information for the treatment of dispatched users in the history of each cooperation cell and current information and each cooperation cell; And, scheduling result is sent to respectively to each cooperation cell;
Prioritization module, for carrying out prioritization according to the history of each cooperation cell and/or current information to each cooperation cell;
Cell scheduling module, for completing successively the scheduling of each cooperation cell according to the relevant information for the treatment of dispatched users in each cooperation cell according to priority order from high to low.
Wherein, described control community, center is the arbitrary cooperation cell in this network, or according to the traffic carrying capacity in Zhong Ge cooperation cell, networking or a definite cooperation cell of busy state.
As shown in Figure 3, the present invention also provides the another kind of cooperative scheduling system based on native region priority, is applied in distributed collaborative network, and each cooperation cell in network further comprises signal dispatcher module, prioritization module and cell scheduling module, wherein:
Signal dispatcher module, for sending to other all cooperation cell by the history of this cooperation cell and current information; Receive the cell history information of other cooperation cell transmission and the scheduling result of current information and high priority cooperation cell; And, the scheduling result of this cooperation cell is notified to all low priorities cooperation cell;
Prioritization module, for carrying out prioritization according to the history of each cooperation cell and/or current information to each cooperation cell;
Cell scheduling module, for according to treating in the scheduling result of high priority community and this cooperation cell that the relevant information of dispatched users completes the scheduling of this cooperation cell.
The foregoing is only the preferred embodiments of the present invention, be not limited to the present invention, for a person skilled in the art, the present invention can have various modifications and variations.Within the spirit and principles in the present invention all, any modification of doing, be equal to replacement, improvement etc., within all should being included in protection scope of the present invention.
Claims (10)
1. the cooperative scheduling method based on native region priority, is characterized in that, is applied to use the system of coordinated multipoint transmission (CoMP) technology, and described method comprises:
According to the history of each cooperation cell and/or current information, prioritization is carried out in each cooperation cell;
According to priority order from high to low, complete successively the scheduling of each cooperation cell; Wherein:
When described method is applied in centralized collaborative network, arbitrary cooperation cell in described network or a cooperation cell determining according to the traffic carrying capacity in each cooperation cell or busy state are as control community, center, complete the scheduling of each cooperation cell, and scheduling result is sent to respectively to each cooperation cell;
When described method is applied in distributed collaborative network, the history of Jiang Zhe community, each cooperation cell and current information send to other all cooperation cell, and each cooperation cell also receives cell history and the current information that other cooperation cell sends simultaneously; Prioritization is carried out according to the history of all cooperation cell and/or relevant information in each cooperation cell; And all low priorities cooperation cell is notified by scheduling result after having dispatched in high priority cooperation cell; Low priority community receives the scheduling result that high priority community sends.
2. the method for claim 1, is characterized in that,
After completing the scheduling of high priority cooperation cell, according to the scheduling result of described high priority cooperation cell, low priority cooperation cell is dispatched;
Described scheduling result comprises: dispatched users information, and the weights information of dispatched users.
3. method as claimed in claim 2, is characterized in that,
When a certain cooperation cell is dispatched, according to channel feedback information and the completed data throughout thereof of respectively treating dispatched users in this cooperation cell, preferentially select the completed data throughout dispatched users for the treatment of little and that current channel quality is high to dispatch.
4. method as claimed in claim 2, is characterized in that,
The described scheduling result according to described high priority cooperation cell is dispatched and is referred to low priority cooperation cell:
When cooperation cell is dispatched, if treat that dispatched users exceeds to completing the interference of dispatched users the interference strength threshold value setting in advance, and abandons dispatching this user.
5. the method as described in any one of claim 1 to 4, is characterized in that,
Described historical information includes but not limited to a kind of or its combination in any in following information: the traffic carrying capacity of this cooperation cell, busy extent, the type of service of serving;
Described current information includes but not limited to a kind of or its combination in any in following information: in this cooperation cell, treat number, the current channel condition information of dispatched users, user's data type.
6. method as claimed in claim 5, is characterized in that,
When cooperation cell is dispatched, if this cooperation cell supports multi-user's multiple-input and multiple-output (MU-MIMO) multi-antenna mode and channel condition to allow, a plurality of in this cooperation cell are treated to dispatched users dispatches; If alone family multiple-input and multiple-output (SU-MIMO) pattern is supported in this cooperation cell, and in the situation of channel condition permission, the dispatched users for the treatment of that dispatch this cooperation cell is used a plurality of stream.
7. the method as described in any one of claim 1 to 4, is characterized in that,
At each, cooperate constantly or according to the predefined cycle, each cooperation cell re-started the sequence of described priority.
8. the cooperative scheduling system based on native region priority, is characterized in that, comprises signal dispatcher module, prioritization module and cell scheduling module, wherein:
Described signal dispatcher module, for sending or receive history and the current information of cooperation cell;
Described prioritization module, for carrying out prioritization according to the history of each cooperation cell and/or current information to each cooperation cell;
Described cell scheduling module, for completing successively the scheduling of each cooperation cell according to priority order from high to low; Wherein:
Be applied to distributed collaborative network, the base station in each cooperation cell in described network comprises:
Described signal dispatcher module, for sending to other all cooperation cell by the history of this cooperation cell and current information; Receive the cell history information of other cooperation cell transmission and the scheduling result of current information and high priority cooperation cell; And, the scheduling result of this cooperation cell is notified to all low priorities cooperation cell;
Described prioritization module, for carrying out prioritization according to the history of each cooperation cell and/or current information to each cooperation cell;
Described cell scheduling module, for according to treating in the scheduling result of high priority community and this cooperation cell that the relevant information of dispatched users completes the scheduling of this cooperation cell.
9. system as claimed in claim 8, is characterized in that, described system applies is in centralized collaborative network, and described network comprises control community, center and other cooperation cell, wherein
Base station in described other cooperation cell comprises:
Signal dispatcher module, for sending to control community, described center by the relevant information for the treatment of dispatched users in the history of this cooperation cell and current information and this cooperation cell; And receiving center is controlled the scheduling result that base station sends;
Base station in control community, described center comprises:
Signal dispatcher module, for receiving the relevant information for the treatment of dispatched users in the history of each cooperation cell and current information and each cooperation cell; And, scheduling result is sent to respectively to each cooperation cell;
Prioritization module, for carrying out prioritization according to the history of each cooperation cell and/or current information to each cooperation cell;
Cell scheduling module, for dispatching corresponding cooperation cell according to the relevant information for the treatment of dispatched users in each cooperation cell.
10. system as claimed in claim 9, is characterized in that,
Control community, described center is the arbitrary cooperation cell in described network, or according to the traffic carrying capacity in Zhong Ge cooperation cell, described networking or a definite cooperation cell of busy state.
Priority Applications (5)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200910254334.0A CN102098737B (en) | 2009-12-11 | 2009-12-11 | Cell priority level based cooperation scheduling method and system |
| PCT/CN2010/079657 WO2011069468A1 (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 |
| JP2012538186A JP5575255B2 (en) | 2009-12-11 | 2010-12-10 | Coordinated scheduling method and system based on cell priority |
| EP10835503.3A EP2485557A4 (en) | 2009-12-11 | 2010-12-10 | Method and system for coordinated scheduling based on cell priority |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200910254334.0A CN102098737B (en) | 2009-12-11 | 2009-12-11 | Cell priority level based cooperation scheduling method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102098737A CN102098737A (en) | 2011-06-15 |
| CN102098737B true CN102098737B (en) | 2014-02-26 |
Family
ID=44131553
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200910254334.0A Expired - Fee Related CN102098737B (en) | 2009-12-11 | 2009-12-11 | Cell priority level based cooperation scheduling method and system |
Country Status (5)
| Country | Link |
|---|---|
| US (1) | US9288817B2 (en) |
| EP (1) | EP2485557A4 (en) |
| JP (1) | JP5575255B2 (en) |
| CN (1) | CN102098737B (en) |
| WO (1) | WO2011069468A1 (en) |
Families Citing this family (23)
| 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 |
| JP2014531835A (en) * | 2011-09-28 | 2014-11-27 | 富士通株式会社 | Scheduling assignment method and apparatus in multipoint cooperative system |
| US8522091B1 (en) * | 2011-11-18 | 2013-08-27 | Xilinx, Inc. | Prioritized detection of memory corruption |
| CN103220079B (en) * | 2012-01-20 | 2018-05-25 | 索尼公司 | For determining method, base station, user equipment and the communication system of transmission set |
| CN103227703B (en) * | 2012-01-30 | 2018-08-03 | 南京中兴新软件有限责任公司 | Method for distributing system resource and device |
| WO2014094191A1 (en) * | 2012-12-21 | 2014-06-26 | France Telecom | Method and apparatus for coordinated multipoint transmission |
| CN103828422A (en) * | 2012-12-31 | 2014-05-28 | 华为技术有限公司 | Method for balancing load and network control node |
| CN103167617B (en) * | 2013-03-12 | 2016-03-16 | 华南师范大学 | A kind of multi-cell dynamic resource allocation method |
| CN104080177B (en) * | 2013-03-28 | 2019-01-11 | 株式会社Ntt都科摩 | Cooperative multi-point dispatching method and base station |
| KR101523509B1 (en) * | 2013-07-01 | 2015-06-10 | 전남대학교산학협력단 | APPARATUS AND METHOD FOR ANALYZING PERFORMANCE ACCORDING TO CONTROLLING INTERCELL INTERFERENCE BASED ON CoMP IN A HETEROGENEOUS NETWORK |
| KR101399293B1 (en) | 2013-07-01 | 2014-05-27 | 전남대학교산학협력단 | Apparatus and method for analyzing performance according to controlling intercell interference based on comp in a lte-advanced network |
| CN104284440B (en) * | 2013-07-04 | 2019-05-21 | 电信科学技术研究院 | Dispatching method, cooperative transmission node and center cooperation point in down collaboration transmission |
| EP3025550B1 (en) * | 2013-07-24 | 2020-01-08 | Telefonaktiebolaget LM Ericsson (publ) | Method and device for cell selection in shared radio access network |
| CN104349483B (en) * | 2013-08-07 | 2018-03-27 | 电信科学技术研究院 | Resource regulating method and device under a kind of cooperative multipoint transmission scene |
| CN104429144A (en) * | 2013-12-26 | 2015-03-18 | 华为技术有限公司 | A resource scheduling method, an information interaction method and a device |
| CN105245318B (en) * | 2014-07-10 | 2018-06-01 | 普天信息技术有限公司 | A kind of implementation method of uplink collaboration multiple spot |
| CN104780032B (en) | 2015-04-14 | 2018-01-26 | 大唐移动通信设备有限公司 | A kind of adaptive descending CoMP transmission method and apparatus |
| CN107548118B (en) * | 2016-06-27 | 2021-06-25 | 中兴通讯股份有限公司 | Wireless internet access method, device and equipment |
| CN108124265B (en) * | 2016-11-28 | 2021-05-11 | 中国移动通信有限公司研究院 | Network coverage intensity adjusting method and device |
| EP3850898A4 (en) * | 2018-12-13 | 2022-05-18 | Telefonaktiebolaget LM Ericsson (publ) | Method and base station for multi-user multiple input multiple output |
| CN113225156B (en) * | 2020-02-06 | 2022-08-26 | 上海朗帛通信技术有限公司 | Method and apparatus in a node used for wireless communication |
| CN114584996B (en) * | 2022-05-09 | 2022-08-05 | 中国移动通信有限公司研究院 | Interference optimization method based on service, network equipment and storage medium |
| CN118057888A (en) * | 2022-11-21 | 2024-05-21 | 上海华为技术有限公司 | Communication method and device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101442808A (en) * | 2008-12-26 | 2009-05-27 | 西安电子科技大学 | United scheduling method for ascending multi-point collaboration in LTE-A |
| CN101478342A (en) * | 2009-01-22 | 2009-07-08 | 清华大学 | Method for cooperative scheduling between multiple districts in multi-antenna cellular communication system |
| CN101516112A (en) * | 2009-02-19 | 2009-08-26 | 上海交通大学 | Multi-cell radio network controller channel information feedback and dispatching method |
| 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 |
|---|---|---|---|---|
| WO2006011337A1 (en) | 2004-07-27 | 2006-02-02 | Nec Corporation | Uplink line radio resource control method, base station device, and radio network control device |
| 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 (en) * | 2008-09-22 | 2014-04-02 | 华为技术有限公司 | Method and device for sending multi-cell scheduling information and user equipment |
| 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 (en) * | 2009-03-13 | 2014-01-29 | 엘지전자 주식회사 | Handover performed in consideration of uplink/downlink component carrier setup |
| 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 (en) * | 2009-09-30 | 2015-11-10 | 엘지전자 주식회사 | User Equipment apparatus and method for transmitting CoMP feedback information |
-
2009
- 2009-12-11 CN CN200910254334.0A patent/CN102098737B/en not_active Expired - Fee Related
-
2010
- 2010-12-10 US US13/509,798 patent/US9288817B2/en not_active Expired - Fee Related
- 2010-12-10 WO PCT/CN2010/079657 patent/WO2011069468A1/en active Application Filing
- 2010-12-10 JP JP2012538186A patent/JP5575255B2/en not_active Expired - Fee Related
- 2010-12-10 EP EP10835503.3A patent/EP2485557A4/en not_active Withdrawn
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 (en) * | 2008-12-26 | 2009-05-27 | 西安电子科技大学 | United scheduling method for ascending multi-point collaboration in LTE-A |
| CN101478342A (en) * | 2009-01-22 | 2009-07-08 | 清华大学 | Method for cooperative scheduling between multiple districts in multi-antenna cellular communication system |
| CN101516112A (en) * | 2009-02-19 | 2009-08-26 | 上海交通大学 | Multi-cell radio network controller channel information feedback and dispatching method |
Also Published As
| Publication number | Publication date |
|---|---|
| JP2013510526A (en) | 2013-03-21 |
| US20120238283A1 (en) | 2012-09-20 |
| CN102098737A (en) | 2011-06-15 |
| EP2485557A4 (en) | 2017-06-21 |
| US9288817B2 (en) | 2016-03-15 |
| WO2011069468A1 (en) | 2011-06-16 |
| EP2485557A1 (en) | 2012-08-08 |
| JP5575255B2 (en) | 2014-08-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102098737B (en) | Cell priority level based cooperation scheduling method and system | |
| Hu et al. | Edge and central cloud computing: A perfect pairing for high energy efficiency and low-latency | |
| Alemaishat et al. | An efficient resource allocation algorithm for D2D communications based on NOMA | |
| CN101341775B (en) | Methods and apparatus for communicating control information | |
| CN101784103B (en) | Method for scheduling users in a plurality of communities and wireless access network equipment thereof | |
| CN102638872B (en) | Relay selection method based on load balancing in cooperation relay network | |
| CN101442808B (en) | United scheduling method for ascending multi-point collaboration in LTE-A | |
| CN102857979B (en) | About the method and apparatus determining, transmit and/or using delay information | |
| CN101217301B (en) | A collaborative transmission method realized in isomerization wireless network with cooperating relay nodes | |
| CN101778479B (en) | Resource scheduling method and resource scheduling device | |
| CN103460658B (en) | LTE dispatches | |
| CN101997583A (en) | Method and device for pairing uplink multi-user multi-input multi-output (MIMO) users supporting cooperation multi-point transmission | |
| CN102655677A (en) | Mobile communication system and far-end radio frequency unit clustering method thereof | |
| CN101568155B (en) | Method for distributing radio resources | |
| CN101778428A (en) | Method, system and device for determining time frequency resource | |
| CN102098736B (en) | User scheduling method and base station in cooperation scheduling | |
| CN101742667B (en) | Distributed resource scheduling method and system, base station and relay | |
| CN102480737A (en) | Scheduling method, device and system for cooperative communication | |
| CN102325375A (en) | Resource allocation method and device | |
| Yin et al. | Resource management of video traffic over heterogeneous NOMA networks | |
| CN104105208A (en) | Same-frequency full duplex scheduling method and device | |
| CN102196585B (en) | Method for determining downlink transmission mode of coordinated multi-point transmission | |
| CN101541042A (en) | Downlink dispatching method for WiMAX system | |
| CN101527673A (en) | Method and system for allocating resources of single-user MIMO | |
| CN105517161A (en) | Downlink resource distribution method and base station |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20140226 Termination date: 20191211 |