CN102056177A - Coordinated node point selection and wireless resource dispatching method in coordinated multi-point transmission technology - Google Patents

Coordinated node point selection and wireless resource dispatching method in coordinated multi-point transmission technology Download PDF

Info

Publication number
CN102056177A
CN102056177A CN2010105918613A CN201010591861A CN102056177A CN 102056177 A CN102056177 A CN 102056177A CN 2010105918613 A CN2010105918613 A CN 2010105918613A CN 201010591861 A CN201010591861 A CN 201010591861A CN 102056177 A CN102056177 A CN 102056177A
Authority
CN
China
Prior art keywords
user
expression
sinr
cooperation
collaboration
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.)
Granted
Application number
CN2010105918613A
Other languages
Chinese (zh)
Other versions
CN102056177B (en
Inventor
邓建国
赵丰
唐小勇
杨金龙
罗新民
王小鹏
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xian Jiaotong University
Original Assignee
Xian Jiaotong University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Xian Jiaotong University filed Critical Xian Jiaotong University
Priority to CN 201010591861 priority Critical patent/CN102056177B/en
Publication of CN102056177A publication Critical patent/CN102056177A/en
Application granted granted Critical
Publication of CN102056177B publication Critical patent/CN102056177B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a coordinated node point selection and wireless resource dispatching method in coordinated multi-point transmission technology. In the method, firstly, coordinated user sets and non-coordinated user sets are confirmed preliminarily; then the preliminary compartmentalization of coordinated sets is carried out; and finally, the coordinated set of each user is further confirmed for conducting wireless resource dispatching. Through the stepwise optimization of the coordinated sets, the re-dispatching can be conducted for the coordinated users who are not distributed with resource during the resource dispatching, and the optimization of resource dispatching is conducted in the coordinated sets, so that under the condition of smaller complexity, the same frequency interference in a small region is reduced, the throughput of users at the edge of the small region is improved, and the fairness for the users is guaranteed.

Description

Cooperative node is selected and scheduling method for wireless resource in the cooperative multipoint transmission technology
Technical field
The invention belongs to wireless communication technology field, the cooperative node in especially a kind of cooperative multipoint transmission technology (CoMP, Coordinated multi-point transmission) is selected and scheduling method for wireless resource.This method can improve the throughput of Cell Edge User, improves the performance of system.
Background technology
Along with development of wireless communication devices, people also improve the requirement of performance in wireless communication systems thereupon.In LTE (Long Term Evolution), Cell Center User is subjected to the interference of adjacent cell less, and the interference that Cell Edge User is subjected to is bigger, and this interference deals with thorny relatively.And the CoMP technology can be eliminated the interference that adjacent cell produces Cell Edge User, improves the throughput of Cell Edge User, therefore in LTE-A with the cooperative node transmission technology as one of its important candidate technologies.
The cooperative multipoint transmission technology is divided in the base station cooperation and cooperation between base stations, and cooperation is meant that mainly a plurality of sub-districts same base station in cooperate the base station in, and cooperation between base stations is meant that belonging to the interior a plurality of sub-districts of different base station cooperates, as scheming shown in (2).The cooperative multipoint transmission technology is divided into collaboration user and non-collaboration user with the user, for collaboration user, need be communicated by letter to it by a plurality of cell cooperatives, and this a plurality of sub-districts of cooperating are called a cooperation collection.Therefore in the CoMP system, to make up rational cooperation collection, just can better bring into play the advantage of CoMP technology.The main method that makes up CoMP cooperation collection at present has two kinds, and a kind of sub-district that is based on constitutes the cooperation collection, and another kind is based on the user and constitutes the cooperation collection.Be that the center constitutes the CoMP cooperation and concentrates with the sub-district, the sub-district that cooperation is concentrated is fixed, and the edge customer that cooperation is concentrated is concentrated sub-district that need to select cooperation from fixing cooperation, and this method is fairly simple, also is limited to the lifting of the performance of system.Concentrate constituting cooperation based on UE, can determine own cooperation collection according to the demand of UE, this method promotes bigger to the performance ground of system, but because cooperation collects overlaps, in the back during scheduling of resource complexity also than higher.
At present in the cooperative multipoint transmission technology, scheduling of resource often has dual mode, a kind of is with two zones of whole frequency band layering, CoMP zone and non-CoMP zone, in different zones CoMP user and non-CoMP user are carried out scheduling of resource respectively then, this method is because be not that the user is being optimized on whole frequency band, so be limited on the elevator system performance.Another is in whole frequency band, earlier collaboration user is carried out PF (Proport ional Fairness) scheduling, and then remaining frequency range carries out PF scheduling to non-collaboration user, and this method is because be to being optimized, so can improve the performance of system effectively in whole frequency band.
Summary of the invention
The objective of the invention is that cooperative node in the existing C oMP technology is selected and the irrationality of RRM in order to overcome, under the less situation of complexity, cooperative node selection and scheduling method for wireless resource in a kind of cooperative multipoint transmission technology are proposed, this dispatching method can effectively be eliminated the co-channel interference of minizone, improve the throughput of Cell Edge User, thereby improve the performance of whole system.
The objective of the invention is to solve by the following technical programs:
Cooperative node is selected and scheduling method for wireless resource in this cooperative multipoint transmission technology, may further comprise the steps:
1) determines collaboration user set and the set of non-collaboration user;
2) divide CoMP cooperation collection;
3) further determine collaboration user and each collaboration user CoMP cooperation collection and carry out wireless resource scheduling.
2, cooperative node is selected and scheduling method for wireless resource in the cooperative multipoint transmission technology according to claim 1, it is characterized in that the concrete grammar of step 1) is as follows:
2-1) calculate each user's Signal to Interference plus Noise Ratio SINR WideBand, its computing formula is as follows:
SINR WideBand = P receive P Noise - - - ( 1 )
P wherein ReceiveThe power that the expression user receives, representation formula is as follows:
P receive=P Trans-P PathLoss-L Shadow (2)
Here P TransThe expression transmitting power, P PathLossExpression path loss, L ShadowThe expression shadow fading;
The interference that the user receives is the power sum of all sub-districts except Serving cell, and is as follows:
Figure BDA0000038753160000032
P wherein ReceiveExpression is from the watt level of interfered cell, P WhiteThe expression thermal noise, shown in being expressed as follows:
P White=KTNB=-174dB+10log10(B)+NF (4)
Wherein KTNB represents the thermal noise of receiver, and NF represents noise factor;
2-2) set Signal to Interference plus Noise Ratio thresholding SINR Gate, and according to the artificial actual situation, real-time this thresholding of change in a plurality of TTI (Transmission Time Interval); Here collaboration user accounts for total user's n%, and n is 1-10, determines SINR according to the ratio of collaboration user then Gate
2-3) with each user's SINR value and SINR GateCompare, if user's SINR value is less than SINR Gate, then this user is divided into collaboration user, otherwise is divided into non-collaboration user.
Further, above-mentioned steps 2) concrete steps as follows:
Determine the collaboration mode of minizone, be divided into cooperation and cooperation between base stations in the base station here, cooperation is to determine that tentatively in each base station cooperate in 3 sub-districts in the base station; Cooperation between base stations is meant tentatively determines to belong to 3 neighbor cells of different base station as a cooperation collection.
Further, above-mentioned steps 3) concrete steps as follows:
4-1) calculate the priority of each collaboration user on each Resource Block that CoMP cooperation in its place is concentrated, select the highest user of priority then, the scheduling of resource principle is as follows:
Max ( Ti k ( t ) Ta k ( t ) ) , ( k = 1,2,3 , · · · · · · M c ) - - - ( 5 )
Wherein Max is for choosing maximum, Ti k(t) the instantaneous throughput of expression user k when moment t, Ta k(t) average throughput of expression user k when moment t, M cNumber for collaboration user in the cooperation collection;
4-2) calculate the priority of non-collaboration user on each Resource Block of its sub-district, place, select the highest user of priority then, the scheduling of resource principle is as follows:
Max ( Ti k ( t ) Ta k ( t ) ) , ( k = 1,2,3 , · · · · · · M ) - - - ( 6 )
Wherein Max is for choosing maximum, Ti k(t) the instantaneous throughput of expression user k when moment t, Ta k(t) average throughput of expression user k when moment t, M is the number of non-collaboration user in the sub-district;
4-3) compare the priority size of collaboration user and non-collaboration user, if satisfy following formula, then this Resource Block is that collaboration user occupies:
3*p c,m>p 1,m+p 2,m+p 3,m (7)
Wherein, p C, mBe the scheduling grade of collaboration user on Resource Block m, p mBe the scheduling grade of Resource Block m in first cooperation cell, p 2, mBe the scheduling grade of Resource Block m in second cooperation cell, p 3, mIt is the scheduling grade of Resource Block m in the 3rd cooperation cell;
4-4) the Resource Block that takies for collaboration user, determine the concrete cooperation collection of collaboration user again by following formula:
SINR c , r 1,2,3 > γ * max ( SINR c , r 1,2 , SINR c , r 2,3 , SINR c , r 1,3 ) - - - ( 8 )
If following formula is set up, the cooperation collection then is made of jointly 3 sub-districts so, otherwise the cooperation collection is made up of pairing 2 sub-districts of maximum SINR;
Here the computing formula of k user's SINR is as follows:
SINR k = p k | G k H k v k | 2 Σ i = 1 , i ≠ k N k p i | G k H k v i | 2 + | G k | 2 ( N 0 + Σ j = 1 N all - N k p j | H jk v j | 2 ) - - - ( 9 )
Wherein, G k = [ H k v k ] k ( H k v k v k H H k H + R η p 0 ) - 1 ;
P wherein kThe transmitting power of representing k user, H kThe channel matrix of representing k user, H JkExpression base station j is to the channel matrix of user k, v kThe pre-coding matrix of representing k user, N AllTotal number of users in the expression whole system, N kTotal number of users in the expression user place cooperation collection, R ηThe covariance matrix of expression noise, R η=E[η (m, l) η H(m, l)], η (m, the l) additive white Gaussian noise on the resource particle of m on l OFDM symbol of expression, p here 0The expression noise power;
4-5) unallocated collaboration user to resource in this time slot is divided into non-collaboration user;
4-6) for the Resource Block that is not taken by collaboration user, use it for the scheduling of resource of non-collaboration user, the dispatching algorithm of employing is the direct ratio fair scheduling algorithm equally;
4-7) judge whether that all Resource Block distribute,, then continue to distribute by above-mentioned steps again, otherwise assigned if unallocated in addition.
The present invention has following beneficial effect:
The present invention at first tentatively determines collaboration user set and the set of non-collaboration user, the Preliminary division of cooperating then and collecting, when dividing the cooperation collection, be earlier that the center constitutes fixing cooperation collection with the sub-district, and then customer-centric, the concrete cooperation cell of selection concentrated in residing cooperation, this method is under the lower situation of computation complexity, more reasonably determine each user's cooperation collection, thereby can effectively eliminate co-channel interference, improve the throughput of Cell Edge User.When wireless resource scheduling, the basic direct ratio equity dispatching that adopts, earlier collaboration user is carried out the direct ratio equity dispatching, and determine that tentatively collaboration user takies the subcarrier at family, and then unallocated collaboration user to resource is divided in the non-collaboration user, in remaining resource non-collaboration user is carried out scheduling of resource again, this method can be carried out reasonable optimizing to collaboration user, thereby improves the performance of communication system.
Description of drawings
Fig. 1 selects and the scheduling of resource schematic diagram for cooperative node;
Fig. 2 is the working mode figure of CoMP;
Fig. 3 is the wireless resource scheduling flow chart;
Fig. 4 is a bandwidth assignment schematic diagram after the initial collaboration user scheduling of resource;
Fig. 5 makes bandwidth assignment schematic diagram after user's scheduling of resource for all.
Embodiment
The present invention is described in further detail with concrete embodiment below in conjunction with accompanying drawing.
In a wireless communication system, comprise a plurality of base stations, each base station is made up of 3 sub-districts here, if the user is in the edge of sub-district, the interference that then is subjected to adjacent cell is bigger.In order to eliminate the interference of adjacent cell, need adjacent cell and Serving cell to form a cooperation collection, be the Cell Edge User service jointly.The present invention is the method that the residing cooperation collection of Cell Edge User is divided and scheduling of resource is optimized.
When carrying out cooperative node selection and wireless resource scheduling, as shown in Figure 1, comprise the steps:
1), Preliminary division collaboration user set and the set of non-collaboration user, concrete steps are as follows:
1-1), the result that at first arranges according to wireless scene, determine each user's signal quality, use SINR here WideBandExpression user's signal quality.Each user's SINR WideBandComputing formula can be expressed as:
SINR WideBand = P receive P Noise - - - ( 1 )
P wherein ReceiveThe power that the expression user receives, representation formula is as follows:
P receive=P Trans-P PathLoss-L Shadow (2)
Here P TransThe expression transmitting power, P PathLossExpression path loss, L ShadowThe expression shadow fading.
The interference that the user receives is the power sum of all sub-districts except Serving cell, and is as follows:
Figure BDA0000038753160000072
P wherein ReceiveExpression is from the power of interfered cell, P WhiteThe expression thermal noise power is expressed as follows:
P White=KTNB=-174dB+10log10(B)+NF (4)
Wherein KTNB represents the thermal noise power of receiver, and NF represents noise factor.
1-2), set Signal to Interference plus Noise Ratio thresholding SINR Gate, and according to the actual emulation situation, real-time this thresholding of change in a plurality of TTI; Here collaboration user accounts for total user's n%, and n is 1-10, determines SINR according to the ratio of collaboration user Gate
The SINR and the SINR that 1-3), compare each user GateIf the size of thresholding less than thresholding then it is grouped in the collaboration user set, otherwise then is grouped into it in non-collaboration user set.
Whether just preliminary here definite collaboration user can participate in cooperation for each collaboration user, also will further determine in the 3rd step.
2) collection of, tentatively cooperating is divided, if the cooperation set is excessive, then makes the complexity of scheduling of resource very high, the Preliminary division of the collection of cooperating here, and each cooperation is concentrated and is comprised 3 sub-districts.
Determine the collaboration mode of CoMP, the collaboration mode of CoMP technology can be divided in the base station two kinds of cooperation and cooperation between base stations, and Fig. 2 is respectively and cooperates in the base station and the example of cooperation between base stations.Cooperation is to determine that tentatively in each base station cooperate in 3 sub-districts in the base station; Cooperation between base stations is meant tentatively determines to belong to 3 neighbor cells of different base station as a cooperation collection;
In technique scheme, just preliminary definite cooperation collection, and each user's cooperation cell collection is also further determined in the step below.
3), after the cooperation collection to the user carries out Preliminary division, again Radio Resource is carried out PF scheduling, concrete implementing procedure figure may further comprise the steps as shown in Figure 3.
3-1), at first calculate each collaboration user priority on each Resource Block in its place cooperation collection, select the highest user of priority then, the scheduling of resource criterion is undertaken by following formula:
Max Ti k ( t ) Ta k ( t ) , ( k = 1,2,3 , · · · · · · M c ) - - - ( 5 )
Ti wherein k(t) the instantaneous throughput of expression user k when moment t, Ta k(t) average throughput of expression user k when moment t, M cNumber for collaboration user in the cooperation collection.
3-2), calculate non-collaboration user priority on each Resource Block in its sub-district, place, select the highest user of priority then;
Max Ti k ( t ) Ta k ( t ) , ( k = 1,2,3 , · · · · · · M ) - - - ( 6 )
Ti wherein k(t) the instantaneous throughput of expression user k when moment t, Ta k(t) average throughput of expression user k when moment t, M is the number of non-collaboration user in the sub-district.
3-3), the size of priority under cooperation and two kinds of situations of non-cooperation relatively, determine that by following formula cooperation concentrates the user on each Resource Block:
3*p c,m>p 1,m+p 2,m+p 3,m (7)
Wherein, p C, mBe the scheduling grade of collaboration user on Resource Block m, p 1, mBe the scheduling grade of Resource Block m in first cooperation cell, p 2, mBe the scheduling grade of Resource Block m in second cooperation cell, p 3, mIt is the scheduling grade of Resource Block m in the 3rd cooperation cell.
If following formula is set up, then take this Resource Block by collaboration user; Otherwise then take this Resource Block of family by non-collaboration user.
3-4), the Resource Block that takies for collaboration user, judge the concrete cooperation collection of collaboration user again by following formula;
SINR c , r 1,2,3 > γ * max ( SINR c , r 1,2 , SINR c , r 2,3 , SINR c , r 1,3 ) - - - ( 8 )
If following formula is set up, this user's cooperation collection then is made of jointly 3 sub-districts so, otherwise the cooperation collection is made up of pairing 2 sub-districts of maximum SINR;
Here
Figure BDA0000038753160000093
Be illustrated in last 3 values of cooperating simultaneously and obtain in the sub-district of Resource Block r among the cooperation collection c, and Be two values of cooperating and obtain on Resource Block r in the sub-district of getting respectively among the cooperation collection c, γ is a regulatory factor, and span is 1-2, can specifically determine as required.
For example, if
max ( SINR c , r 1,2 , SINR c , r 2,3 , SINR c , r 1,3 ) = SINR c , r 1,2
And
SINR c , r 1,2,3 > γ * max ( SINR c , r 1,2 , SINR c , r 2,3 , SINR c , r 1,3 ) ,
Also be
SINR c , r 1,2,3 < &gamma; * SINR c , r 1,2 ,
The sub-district that comprises of this cooperation collection is 1 and 2 so.
Wherein Be illustrated in last 3 values of cooperating simultaneously and obtain in the sub-district of cooperation collection c Resource Block r, and
Figure BDA0000038753160000105
Be two values of cooperating and obtain in the sub-district of getting respectively wherein, γ is a regulatory factor, and general value is between 1 to 2.
The computing formula of k user's Signal to Interference plus Noise Ratio is as follows:
SINR k = p k | G k H k v k | 2 &Sigma; i = 1 , i &NotEqual; k N k p i | G k H k v i | 2 + | G k | 2 ( N 0 + &Sigma; j = 1 N all - N k p j | H jk v j | 2 ) - - - ( 9 )
Wherein, G k = [ H k v k ] k ( H k v k v k H H k H + R &eta; p 0 ) - 1 .
The useful signal that divides k user of subrepresentation to receive in the following formula, first interference signal (comprising the interference that a plurality of data flow, multi-user produce) that the interior user of expression cooperation collection produces in the denominator, second co-channel interference and noise that the outer user of expression cooperation collection produces, because in the CoMP algorithm, the selection of the cooperation collection of each portable terminal is to go to select according to the quality of channel condition, therefore can think Gauss's interference signal from the interference signal outside the cooperation collection.
P wherein kThe transmitting power of representing k user, H kThe channel matrix of representing k user, H JkExpression base station j is to the channel matrix of user k, v kThe pre-coding matrix of representing k user, N AllTotal number of users in the expression whole system, N kTotal number of users in the expression user place cooperation collection, R ηThe covariance matrix of expression noise, R η=E[η (n, l) η H(n, l)], η (n, the l) additive white Gaussian noise on the resource particle of n on l OFDM symbol of expression, p here 0The expression noise power.
3-5), unallocated collaboration user to resource is divided in the non-collaboration user;
3-6), in the Resource Block that is not taken by collaboration user, more non-collaboration user is carried out the direct ratio equity dispatching, and gives corresponding non-collaboration user user resource block assignments;
3-7), judge whether that all Resource Block distribute, if unallocated in addition, then continue to distribute by above-mentioned steps again, otherwise assigned.
Fig. 4 and Fig. 5 are allocation of radio resources process schematic diagrames, in Fig. 4, earlier collaboration user has been carried out scheduling of resource, collaboration user has taken Resource Block 2,5,7, Radio Resource to Fig. 4 in Fig. 5 further distributes, Resource Block 5 among the C of sub-district and the Resource Block 7 among the A of sub-district have been distributed to non-collaboration user, and Resource Block 1,3,4,6,8 respectively by respective cell non-collaboration user take.

Claims (4)

1. cooperative node is selected and scheduling method for wireless resource in the cooperative multipoint transmission technology, it is characterized in that, may further comprise the steps:
1) determines collaboration user set and the set of non-collaboration user;
2) divide CoMP cooperation collection;
3) further determine collaboration user and each collaboration user CoMP cooperation collection and carry out wireless resource scheduling.
2. cooperative node is selected and scheduling method for wireless resource in the cooperative multipoint transmission technology according to claim 1, it is characterized in that the concrete grammar of step 1) is as follows:
2-1) calculate each user's Signal to Interference plus Noise Ratio SINR WideBand, its computing formula is as follows:
SINR WideBand = P receive P Noise - - - ( 1 )
P wherein ReceiveThe power that the expression user receives, representation formula is as follows:
P receive=P Trans-P PathLoss-L Shadow (2)
Here P TransThe expression transmitting power, P PathLossExpression path loss, L ShadowThe expression shadow fading;
The interference that the user receives is the power sum of all sub-districts except Serving cell, and is as follows:
Figure FDA0000038753150000012
P wherein ReceiveExpression is from the watt level of interfered cell, P WhiteThe expression thermal noise, shown in being expressed as follows:
P White=KTNB=-174dB+10log10(B)+NF (4)
Wherein KTNB represents the thermal noise of receiver, and NF represents noise factor;
2-2) set Signal to Interference plus Noise Ratio thresholding SINR Gate, and according to the artificial actual situation, real-time this thresholding of change in a plurality of TTI (Transmission Time Interval); Here collaboration user accounts for total user's n%, and n is 1-10, determines SINR according to the ratio of collaboration user then Gate
2-3) with each user's SINR value and SINR GateCompare, if user's SINR value is less than SINR Gate, then this user is divided into collaboration user, otherwise is divided into non-collaboration user.
3. radio node is selected and resource regulating method in a kind of cooperative multipoint transmission technology according to claim 1, described step 2) concrete steps as follows:
Determine the collaboration mode of minizone, be divided into cooperation and cooperation between base stations in the base station here, cooperation is to determine that tentatively in each base station cooperate in 3 sub-districts in the base station; Cooperation between base stations is meant tentatively determines to belong to 3 neighbor cells of different base station as a cooperation collection.
4. radio node is selected and resource regulating method in a kind of cooperative multipoint transmission technology according to claim 1, and the concrete steps of described step 3) are as follows:
4-1) calculate the priority of each collaboration user on each Resource Block that CoMP cooperation in its place is concentrated, select the highest user of priority then, the scheduling of resource principle is as follows:
Max ( Ti k ( t ) Ta k ( t ) ) , ( k = 1,2,3 , &CenterDot; &CenterDot; &CenterDot; &CenterDot; &CenterDot; &CenterDot; M c ) - - - ( 5 )
Wherein Max is for choosing maximum, Ti k(t) the instantaneous throughput of expression user k when moment t, Ta k(t) average throughput of expression user k when moment t, M cNumber for collaboration user in the cooperation collection;
4-2) calculate the priority of non-collaboration user on each Resource Block of its sub-district, place, select the highest user of priority then, the scheduling of resource principle is as follows:
Max ( Ti k ( t ) Ta k ( t ) ) , ( k = 1,2,3 , &CenterDot; &CenterDot; &CenterDot; &CenterDot; &CenterDot; &CenterDot; M ) - - - ( 6 )
Wherein Max is for choosing maximum, Ti k(t) the instantaneous throughput of expression user k when moment t, Ta k(t) average throughput of expression user k when moment t, M is the number of non-collaboration user in the sub-district;
4-3) compare the priority size of collaboration user and non-collaboration user, if satisfy following formula, then this Resource Block is that collaboration user occupies:
3*p c,m>p 1,m+p 2,m+p 3,m (7)
Wherein, p C, mBe the scheduling grade of collaboration user on Resource Block m, p mBe the scheduling grade of Resource Block m in first cooperation cell, p 2, mBe the scheduling grade of Resource Block m in second cooperation cell, p 3, mIt is the scheduling grade of Resource Block m in the 3rd cooperation cell;
4-4) the Resource Block that takies for collaboration user, determine the concrete cooperation collection of collaboration user again by following formula:
SINR c , r 1,2,3 > &gamma; * max ( SINR c , r 1,2 , SINR c , r 2,3 , SINR c , r 1,3 ) - - - ( 8 )
If following formula is set up, the cooperation collection then is made of jointly 3 sub-districts so, otherwise the cooperation collection is made up of pairing 2 sub-districts of maximum SINR;
Here the computing formula of k user's SINR is as follows:
SINR k = p k | G k H k v k | 2 &Sigma; i = 1 , i &NotEqual; k N k p i | G k H k v i | 2 + | G k | 2 ( N 0 + &Sigma; j = 1 N all - N k p j | H jk v j | 2 ) - - - ( 9 )
Wherein, G k = [ H k v k ] k ( H k v k v k H H k H + R &eta; p 0 ) - 1 ;
P wherein kThe transmitting power of representing k user, H kThe channel matrix of representing k user, H JkExpression base station j is to the channel matrix of user k, v kThe pre-coding matrix of representing k user, N AllTotal number of users in the expression whole system, N kTotal number of users in the expression user place cooperation collection, R ηThe covariance matrix of expression noise, R η=E[η (m, l) η H(m, l)], η (m, the l) additive white Gaussian noise on the resource particle of m on l OFDM symbol of expression, p here 0The expression noise power;
4-5) unallocated collaboration user to resource in this time slot is divided into non-collaboration user;
4-6) for the Resource Block that is not taken by collaboration user, use it for the scheduling of resource of non-collaboration user, the dispatching algorithm of employing is the direct ratio fair scheduling algorithm equally;
4-7) judge whether that all Resource Block distribute,, then continue to distribute by above-mentioned steps again, otherwise assigned if unallocated in addition.
CN 201010591861 2010-12-16 2010-12-16 Coordinated node point selection and wireless resource dispatching method in coordinated multi-point transmission technology Expired - Fee Related CN102056177B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 201010591861 CN102056177B (en) 2010-12-16 2010-12-16 Coordinated node point selection and wireless resource dispatching method in coordinated multi-point transmission technology

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 201010591861 CN102056177B (en) 2010-12-16 2010-12-16 Coordinated node point selection and wireless resource dispatching method in coordinated multi-point transmission technology

Publications (2)

Publication Number Publication Date
CN102056177A true CN102056177A (en) 2011-05-11
CN102056177B CN102056177B (en) 2013-08-28

Family

ID=43959988

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 201010591861 Expired - Fee Related CN102056177B (en) 2010-12-16 2010-12-16 Coordinated node point selection and wireless resource dispatching method in coordinated multi-point transmission technology

Country Status (1)

Country Link
CN (1) CN102056177B (en)

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102612155A (en) * 2011-12-22 2012-07-25 北京邮电大学 Scheduling method and system for joint transmission of heterogeneous network
CN103298132A (en) * 2013-05-08 2013-09-11 东南大学 Sending point selecting method based on multi-point cooperation
CN103490869A (en) * 2012-06-12 2014-01-01 中国移动通信集团公司 Scheduling method and device for coordinated multi-point user terminals
CN104080177A (en) * 2013-03-28 2014-10-01 株式会社Ntt都科摩 Coordinated multiple point scheduling method and base station
CN104135315A (en) * 2014-08-14 2014-11-05 哈尔滨工业大学 Downlink CoMP (Coordinated Multi-Point) hybrid collaborative communication method based on LTE-Advanced (Long Term Evolution-Advanced) system
CN104333865A (en) * 2014-11-19 2015-02-04 北京北方烽火科技有限公司 Coordinated multi-point CoMP resource distribution method and device
CN104918256A (en) * 2014-03-14 2015-09-16 电信科学技术研究院 Transmission scheduling method and device
CN102802194B (en) * 2011-05-23 2017-09-05 中兴通讯股份有限公司 A kind of eat dishes without rice or wine jamming control method and system based on CoMP
CN107484177A (en) * 2017-08-08 2017-12-15 北京科技大学 A kind of method for realizing heterogeneous network down collaboration multi-point
CN108377542A (en) * 2018-01-17 2018-08-07 西安邮电大学 A kind of power dividing method based on the dry leakage ratio of letter
CN108668325A (en) * 2017-12-22 2018-10-16 航天恒星科技有限公司 User oriented grade efficiency CoMP switching methods based on lte-a system
CN112218379A (en) * 2019-07-12 2021-01-12 中国科学院信息工程研究所 Mobile communication dynamic interference coordination method and system based on joint transmission

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101583194A (en) * 2009-06-18 2009-11-18 清华大学 Resource allocation method based on the cooperation between base stations of virtual subdistrict and system thereof
CN101668295A (en) * 2009-05-31 2010-03-10 北京邮电大学 Resource reuse method and system for supporting cooperative transmission in communication system
CN101895994A (en) * 2010-07-21 2010-11-24 华为技术有限公司 Method, device and base station for updating multi-point cooperative set

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101668295A (en) * 2009-05-31 2010-03-10 北京邮电大学 Resource reuse method and system for supporting cooperative transmission in communication system
CN101583194A (en) * 2009-06-18 2009-11-18 清华大学 Resource allocation method based on the cooperation between base stations of virtual subdistrict and system thereof
CN101895994A (en) * 2010-07-21 2010-11-24 华为技术有限公司 Method, device and base station for updating multi-point cooperative set

Cited By (21)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102802194B (en) * 2011-05-23 2017-09-05 中兴通讯股份有限公司 A kind of eat dishes without rice or wine jamming control method and system based on CoMP
CN102612155B (en) * 2011-12-22 2014-12-17 北京邮电大学 Scheduling method and system for joint transmission of heterogeneous network
CN102612155A (en) * 2011-12-22 2012-07-25 北京邮电大学 Scheduling method and system for joint transmission of heterogeneous network
CN103490869A (en) * 2012-06-12 2014-01-01 中国移动通信集团公司 Scheduling method and device for coordinated multi-point user terminals
CN103490869B (en) * 2012-06-12 2016-09-07 中国移动通信集团公司 The dispatching method of a kind of coordinate multipoint user terminal and device
CN104080177A (en) * 2013-03-28 2014-10-01 株式会社Ntt都科摩 Coordinated multiple point scheduling method and base station
CN104080177B (en) * 2013-03-28 2019-01-11 株式会社Ntt都科摩 Cooperative multi-point dispatching method and base station
CN103298132A (en) * 2013-05-08 2013-09-11 东南大学 Sending point selecting method based on multi-point cooperation
CN103298132B (en) * 2013-05-08 2016-03-02 东南大学 Based on the sending point system of selection of multipoint cooperative
CN104918256B (en) * 2014-03-14 2018-09-11 电信科学技术研究院 A kind of transmission dispatching method and device
CN104918256A (en) * 2014-03-14 2015-09-16 电信科学技术研究院 Transmission scheduling method and device
CN104135315A (en) * 2014-08-14 2014-11-05 哈尔滨工业大学 Downlink CoMP (Coordinated Multi-Point) hybrid collaborative communication method based on LTE-Advanced (Long Term Evolution-Advanced) system
CN104135315B (en) * 2014-08-14 2017-11-03 哈尔滨工业大学 Descending CoMP mixing collaboration communication method based on LTE Advanced systems
CN104333865A (en) * 2014-11-19 2015-02-04 北京北方烽火科技有限公司 Coordinated multi-point CoMP resource distribution method and device
CN107484177A (en) * 2017-08-08 2017-12-15 北京科技大学 A kind of method for realizing heterogeneous network down collaboration multi-point
CN108668325A (en) * 2017-12-22 2018-10-16 航天恒星科技有限公司 User oriented grade efficiency CoMP switching methods based on lte-a system
CN108668325B (en) * 2017-12-22 2020-10-23 航天恒星科技有限公司 User-level-energy-efficiency-oriented CoMP switching method based on LTE-A system
CN108377542A (en) * 2018-01-17 2018-08-07 西安邮电大学 A kind of power dividing method based on the dry leakage ratio of letter
CN108377542B (en) * 2018-01-17 2020-11-17 西安邮电大学 Power segmentation method based on signal-to-interference-and-leakage ratio
CN112218379A (en) * 2019-07-12 2021-01-12 中国科学院信息工程研究所 Mobile communication dynamic interference coordination method and system based on joint transmission
CN112218379B (en) * 2019-07-12 2022-03-22 中国科学院信息工程研究所 Mobile communication dynamic interference coordination method and system based on joint transmission

Also Published As

Publication number Publication date
CN102056177B (en) 2013-08-28

Similar Documents

Publication Publication Date Title
CN102056177B (en) Coordinated node point selection and wireless resource dispatching method in coordinated multi-point transmission technology
CN103929781B (en) Cross-layer interference coordination optimization method in super dense heterogeneous network
CN101442808B (en) United scheduling method for ascending multi-point collaboration in LTE-A
CN101951307B (en) Method for selecting cell cooperation set under CoMP
CN102026388B (en) Method for allocating radio resources under coordinated multipoint transmission/reception (CoMP) in long term evolution-advanced (LTE-A) system
CN102014393B (en) Frequency allocation method for multi-point coordinated transmission in cellular communication system
CN101621834B (en) CoMP downlink dynamic cooperative cluster selection method based on SINR threshold and token
CN103281770B (en) Method for achieving collaborative multipoint transmission dispatch and power distribution
CN103313260B (en) A kind of based on game theoretic cognitive radio networks bandwidth, power combined allocation method
CN101754346A (en) Intercell interference suppression method based on channel coherence multi-subscriber dispatching
CN101854201B (en) Multicell cooperative transmission method
CN103596120A (en) D2D communication method in macro cell and small cell heterogeneous network
CN102457358B (en) A kind of dispatching method of cooperative transmission and system
CN102647727B (en) Selection method of mixed cooperation cluster
CN101511107A (en) Frequency planning method based on synergic multi-point single-user multi-input multi-output
CN103338517A (en) A multipoint cooperation system clustering method based on a high-performance processor
CN101784078A (en) Load balancing and throughput optimization method in mobile communication system
CN102118754B (en) Partitioning method of dynamic cooperation sets in CoMP technology
CN105188147B (en) A kind of lte-a system full duplex resource allocation methods based on power control
CN102215492B (en) User-feedback-based multi-cell resource allocation method
CN101877913B (en) User scheduling method in LTE (Long Term Evolution) system
CN102104964B (en) Method and system for coordinating and scheduling frequency band resources in cellular network
CN102196585B (en) Method for determining downlink transmission mode of coordinated multi-point transmission
CN103024752A (en) Method and system for selecting user collaboration subdistrict set
CN103402268B (en) Downlink MU_COMP scheduling method based on improved chordal distance

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

Granted publication date: 20130828

Termination date: 20171216

CF01 Termination of patent right due to non-payment of annual fee