CN103281702A - Cooperative communication method based on multi-cell dynamic clustering - Google Patents

Cooperative communication method based on multi-cell dynamic clustering Download PDF

Info

Publication number
CN103281702A
CN103281702A CN2013102161395A CN201310216139A CN103281702A CN 103281702 A CN103281702 A CN 103281702A CN 2013102161395 A CN2013102161395 A CN 2013102161395A CN 201310216139 A CN201310216139 A CN 201310216139A CN 103281702 A CN103281702 A CN 103281702A
Authority
CN
China
Prior art keywords
base station
list
station
tabulation
candidate
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
CN2013102161395A
Other languages
Chinese (zh)
Other versions
CN103281702B (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.)
White Box Shanghai Microelectronics Technology Co ltd
Original Assignee
Southeast 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 Southeast University filed Critical Southeast University
Priority to CN201310216139.5A priority Critical patent/CN103281702B/en
Publication of CN103281702A publication Critical patent/CN103281702A/en
Application granted granted Critical
Publication of CN103281702B publication Critical patent/CN103281702B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a cooperative communication method based on multi-cell dynamic clustering. The cooperative communication method comprises the following steps: (1) building a base station list and a matrix for measuring and calculating inter-cell mutual interference, (2) selecting a guiding base station of a current cluster, and updating a candidate base station list and a selected base station list, (3) selecting a cell base station i' which maximally interferes the guiding base station i1 of the current cluster, adding the cell base station i' into the current cluster, and updating the candidate base station list and the selected base station list, (4) returning to the step (3) until the number of the base stations in the current cluster is equal to that of the base stations in a set cluster Bc, (5) carrying out base station selection of a next cluster until the candidate base station list after last-time updating becomes an empty set, and (6) allowing all base stations in a system to carry out cooperative communication according to selected base station lists, built in the step (5), of all clusters. According to the cooperative communication method, the base stations decide whether form clusters with other base stations or not according to association degrees with other base stations, the dynamic clustering speed is greatly quickened, and therefore communication efficiency is improved.

Description

A kind of collaboration communication method based on many district dynamic cluster
Technical field
The invention belongs to the wireless cellular network communications field, specifically, relate to a kind of collaboration communication method based on many district dynamic cluster.
Background technology
Along with the sharp increase of userbase and increasing of wireless traffic, cellular communications networks faces a significant challenge---improve the utilance of limited band resource.For satisfying the demands, the base station will be set up more thick and fast, frequency repeat utilization ratio will improve, even takies the available band of whole distribution.(inter-cell interference, ICI), (Quality of Service QoS) will be affected, particularly Cell Edge User to make QoS of customer but this will further cause more serious presence of intercell interference.Collaboration communication is a kind of effective means of being devoted to alleviate presence of intercell interference, and 3GPP formally includes the collaboration communication technology in the LTE-Advanced standard, makes it to become the key technology that improves following Radio Network System performance.
Collaboration communication provides possibility for abundant development system spatial degrees of freedom, and its basic thought is in down link, and handle the combined signal that will send a plurality of residential quarters, thereby make home cell suppress the interference signal of other residential quarters.Base station cooperation in a cooperation unit forms one bunch, and by cooperation, the interference of minizone will be effectively suppressed in bunch like this.In theory, more many with number of base stations in the cluster, presence of intercell interference is suppressed more obvious; But in practicality, more cell cooperative means more feedback overhead, computing cost and backbone network transport overhead, and this situation makes can not be too many with number of cells in the cluster.
At choosing which this problem of base station cluster, some fruitful algorithms are suggested, what consider mostly is according to the static policies of base station geography close position cluster, namely no longer change behind the selected cluster base station, yet the wireless channel time-varying characteristics may make this method improve limited to performance.To this, the base station of some dynamic clustering methods---cluster is suggested according to continuous variation of channel information, makes the static relatively clustering method of systematic function have clear improvement.Yet, existing dynamic clustering algorithm be mostly all cluster may in search thoroughly and calculate have maximum system capacity bunch as a result of, this process is quite complicated; There is the scholar that this class algorithm has been made slight change, calculates the cluster result that target is changed to all possible bunch channel gain and selects the overall gain maximum; But these methods all need the possibility of all clusters of limit.When network size was big, even base station number is less in each bunch, amount of calculation was also quite big, may calculate finish after, channel condition changes already.It is also inapplicable when therefore, this exhaustive search method is in real network.
Summary of the invention
Technical problem: technical problem to be solved by this invention is: a kind of collaboration communication method based on many district dynamic cluster is provided, this communication means makes each base station to determine whether and its cluster according to the degree of association size with other base stations, greatly accelerate dynamic clustering speed, thereby improved communication efficiency.
Technical scheme: for solving the problems of the technologies described above, the technical solution used in the present invention is:
A kind of collaboration communication method based on many district dynamic cluster, these many residential quarters comprise at least three residential quarters, are provided with travelling carriage and base station in each residential quarter, this communication means may further comprise the steps:
The first step: set up station list and calculate the minizone matrix of mutual interference mutually:
Initialization candidate base station tabulation Candidacy={1,2 ..., B} has selected station list
Figure BDA00003278609100021
B represents the sum of base station in many residential quarters, sets the base station maximum quantity that comprises in each bunch and is B c, B c<B, the number in many residential quarters bunch is
Figure BDA00003278609100024
Wherein, symbol Expression rounds downwards;
Feed back to the channel information matrix H of each base station according to all travelling carriages of many residential quarters, by formula (1) the measuring and calculating mutual interference matrix F in minizone:
f ij = | h ij | 2 + | h ji | 2 , i ≠ j 0 , i = j Formula (1)
Wherein, h IjChannel gain between the transmitting antenna of expression user i and base station j, h JiChannel gain between the transmitting antenna of expression user j and base station i, f IjBe the capable j column element of i of mutual interference matrix F, f IjMutual interference degree between expression base station i and the base station j;
Second step: in the candidate base station tabulation, select a cell base station i who is subjected to other area interference maximums l, as when the guiding base station of prevariety, guide base station i lSatisfy formula (2):
i l = max i ∈ Candidacy Σ j ≠ i f ij Formula (2)
According to formula (3) with i lDeletion from candidate base station tabulation, thus upgrade the candidate base station tabulation, according to formula (4) with i lAdd to and select in the station list, selected station list thereby upgrade:
Candidacy1=Candidacy-{i lFormula (3)
Preclusion1=Preclusion+{i lFormula (4)
Wherein, the tabulation of candidate base station after Candidacy1 represents to upgrade is first selected station list after Preclusion1 represents to upgrade first;
The 3rd step: select one to the guiding base station i when prevariety in the candidate base station tabulation after renewal lDisturb maximum cell base station i ' adding to work as prevariety, base station i ' satisfies
Figure BDA00003278609100031
f Ii 'Annoyance level between expression base station i and the base station i '; With deletion the candidate base station tabulation of base station i ' after last update, upgrade the candidate base station tabulation; Add base station i ' to selecting in the station list after the last update, upgrade and selected station list, entered for the 4th step then;
The 4th step: returned for the 3rd step, equal B until the number of base stations in prevariety c, entered for the 5th step then;
The 5th step: the candidate base station tabulation after will upgrading through the 4th step is tabulated as candidate base station, station list has been selected in the station list conduct of selecting after will upgrading through the 4th step, returned for second step, carry out next bunch base station selected, the candidate base station tabulation after once upgrading as of late is empty set After the last update select station list be 1,2 ..., B}, that sets up all bunches in many residential quarters selects station list;
The 6th step: system in all base stations by all bunches of the 5th step foundation select station list, carry out collaboration communication by the cluster result.
Beneficial effect: compared with prior art, technical scheme of the present invention has following beneficial effect:
1. the measuring and calculating interaction matrix is simple to operate, and only a sub-addition just can obtain, and this matrix can accurately be weighed the degree that influences each other between the residential quarter, but not independent influence to the other side.
2. adopt the guiding base station selecting method, different base station has different priority in bunch, the randomness of having got rid of the conventional dynamic clustering method has to a certain extent improved the information rate performance of collaboration communication, the formation that the cell base station that can accurately select influenced maximum is dominated bunch.
3. guiding base station cell annoyance level being come finally got rid of the randomness of conventional dynamic clustering method for the different priority of other base station configurations, thus make cluster bunch in disturb minimum.The present invention determines whether and its cluster according to the degree of association size of base station and other base stations, has greatly accelerated dynamic clustering speed.
Description of drawings
Fig. 1 is the system schematic of the embodiment of the invention, and wherein, solid line is represented the useful signal link, and dotted line is represented the interference signal link, the base station cluster in two residential quarters of light-colored part, the base station cluster in three residential quarters of dark part.
Fig. 2 be bunch in the base station count B c=2 o'clock, the method for the embodiment of the invention, static clustering method and do not have the contrast string diagram of system's average size of obtaining respectively of cooperation clustering method.
Fig. 3 be bunch in the base station count B c=3 o'clock, the method for the embodiment of the invention, static clustering method and do not have the contrast string diagram of system's average size of obtaining respectively of cooperation clustering method.
Fig. 4 be bunch in the base station count B c=4 o'clock, the method for the embodiment of the invention, static clustering method and do not have the contrast string diagram of system's average size of obtaining respectively of cooperation clustering method.
Fig. 5 be bunch in the base station count B c=2 o'clock, the method for the embodiment of the invention, tradition were based on the dynamic clustering method of searching mode thoroughly and do not have the contrast string diagram of system's average size of obtaining respectively of cooperation clustering method.
Fig. 6 be bunch in the base station count B c=3 o'clock, the method for the embodiment of the invention, tradition were based on the dynamic clustering method of searching mode thoroughly and do not have the contrast string diagram of system's average size of obtaining respectively of cooperation clustering method.
Fig. 7 be bunch in the base station count B c=4 o'clock, the method for the embodiment of the invention, tradition were based on the dynamic clustering method of searching mode thoroughly and do not have the contrast string diagram of system's average size of obtaining respectively of cooperation clustering method.
Embodiment
Below in conjunction with drawings and Examples, technical scheme of the present invention is described in further detail.
The many residential quarters that the present invention relates to comprise at least three residential quarters, are provided with travelling carriage and base station in each residential quarter.A kind of collaboration communication method based on many district dynamic cluster of the present invention may further comprise the steps:
The first step: set up station list and calculate the minizone matrix of mutual interference mutually:
Initialization candidate base station tabulation Candidacy={1,2 ..., B} has selected station list
Figure BDA00003278609100044
B represents the sum of base station in many residential quarters, sets the base station maximum quantity that comprises in each bunch and is B c, B c<B, the number in many residential quarters bunch is Wherein, symbol
Figure BDA00003278609100042
Expression rounds downwards;
Feed back to the channel information matrix H of each base station according to all travelling carriages of many residential quarters, by formula (1) the measuring and calculating mutual interference matrix F in minizone:
f ij = | h ij | 2 + | h ji | 2 , i ≠ j 0 , i = j Formula (1)
Wherein, h IjChannel gain between the transmitting antenna of expression user i and base station j, h JiChannel gain between the transmitting antenna of expression user j and base station i, f IjBe the capable j column element of i of mutual interference matrix F, f IjMutual interference degree between expression base station i and the base station j.As preferred version, B cIn that { value among 2,3, the 4}, the quantity of B is less than or equal to 37.
Second step: in the candidate base station tabulation, select a cell base station i who is subjected to other area interference maximums l, as when the guiding base station of prevariety, guide base station i lSatisfy formula (2):
i l = max i ∈ Candidacy Σ j ≠ i f ij Formula (2)
According to formula (3) with i lDeletion from candidate base station tabulation, thus upgrade the candidate base station tabulation, according to formula (4) with i lAdd to and select in the station list, selected station list thereby upgrade:
Candidacy1=Candidacy-{i lFormula (3)
Preclusion1=Preclusion+{i lFormula (4)
Wherein, the tabulation of candidate base station after Candidacy1 represents to upgrade is first selected station list after Preclusion1 represents to upgrade first;
The 3rd step: select one to the guiding base station i when prevariety in the candidate base station tabulation after renewal lDisturb maximum cell base station i ' adding to work as prevariety, base station i ' satisfies
Figure BDA00003278609100052
f Ii 'Annoyance level between expression base station i and the base station i '.With deletion the candidate base station tabulation of base station i ' after last update, upgrade the candidate base station tabulation; Add base station i ' to selecting in the station list after the last update, upgrade and selected station list, entered for the 4th step then.
The 4th step: returned for the 3rd step, equal B until the number of base stations in prevariety c, entered for the 5th step then.
The 5th step: the candidate base station tabulation after will upgrading through the 4th step is tabulated as candidate base station, station list has been selected in the station list conduct of selecting after will upgrading through the 4th step, returned for second step, carry out next bunch base station selected, the candidate base station tabulation after once upgrading as of late is empty set
Figure BDA00003278609100053
After the last update select station list be 1,2 ..., B}, that sets up all bunches in many residential quarters selects station list;
The 6th step: system in all base stations by all bunches of the 5th step foundation select station list, carry out collaboration communication by the cluster result.
Collaboration communication method based on many district dynamic cluster provided by the invention, for reducing the common-channel interference of minizone, the LTE-A standard has been introduced a kind of mechanism of multi-cell cooperating, by a plurality of base stations associated treatment receiving and transmitting signal (set of the base station in an IWU be called bunch), to disturb signal be useful signal thereby become dry.At how to choose this problem of base station cluster, existing method generally according to geographical far and near as sole criterion between the base station, can't adapt to the wireless channel time-varying characteristics.The dynamic clustering method allows the different base station cluster adaptively according to channel variation, existing dynamic clustering method all by search thoroughly to find the solution make the channel gain maximum cluster may, the huge amount of calculation of this mode has hindered its practicality.The friend-making mechanism of communication means simulating human of the present invention has proposed the dynamic clustering method based on the friend-making algorithm.Existing relatively dynamic clustering method, dynamic clustering method of the present invention have the low advantage of complexity.Method of the present invention has been constructed the mutual interference matrix of each minizone according to the channel condition information of each travelling carriage feedback, and directly determines which base station cluster according to the annoyance level between each residential quarter, can the disposable cluster result that tries to achieve.This calculation side makes and the base station collaboration cluster that common-channel interference is serious disturbs by ZF precoding counteracting, thereby improves power system capacity.The present invention is based on the characteristic of human friend-making activity, be applied to multi-cell cooperating dynamic clustering problem, make each base station to determine whether and its cluster according to the degree of association size with other base stations, greatly accelerated cluster speed, and the gained performance is almost identical with the mode of searching thoroughly, and this method will be well suited for practical application.
Residential quarter as shown in Figure 1, the collaboration communication pattern that adopts method of the present invention to set up.Be provided with five residential quarters among Fig. 1, solid line is represented the useful signal link, dotted line is represented the interference signal link, the base station of two residential quarters of light-colored part (namely being positioned at leftmost two residential quarters) becomes one bunch, the cluster in base station of three residential quarters of dark part (namely being positioned at three residential quarters on middle part and the right).
Exemplify an embodiment below.
This embodiment chooses four layers of cell pattern, and total number of base is 37 in the system, i.e. B=37, and B is counted in the base station in bunch cIn { value among 2,3, the 4}.It is 1km that radius of society is set, and travelling carriage is randomly dispersed in each position in the residential quarter, and poll strategy scheduling travelling carriage is adopted in the base station, and the base station number is fixed as B in bunch c, remain not enough B cThe independent cluster in individual base station.Channel model between travelling carriage i and the base station j is shown below:
h ij = Γ ij G ij β d ij - α r ij
Wherein, Γ IjBe that variance is 1, obey the Rayleigh fading of multiple Gaussian Profile, G IjLong-pending for the dual-mode antenna gain, α is path loss index, and β is the path loss constant, d IjBe the distance between travelling carriage i and the base station j, r IjFor obeying the shadow fading of logarithm Gaussian Profile.According to model that existing 3GPP gives (source is seen: LTE-A Evaluation Model, NTT DocoMo, Available online.), G is set Ij=9dB, α=3.76, β=10 -14.84, r IjAverage be 0dB, variance is 8dB.Given antenna for base station maximum transmission power is P n=1W, the definition relative signal-to-noise ratio is the signal to noise ratio that cell edge is only considered path loss and Gaussian noise.Adopt the ZF precoding to carry out Monte-Carlo Simulation 3000 times.Simulation result such as table 1, Fig. 2 are to shown in Figure 7.Clustering method as a comparison has: (source is seen: S.Zhou to search tactful dynamic clustering method thoroughly, J.Gong, Z.Niu, Y.Jia, and P.Yang, " A decentralized framework for dynamic downlink base station cooperation; " in Proc.IEEE GLOBECOM, Dec.2009, pp.1 – 6.), the clustering method of static clustering method and nothing cooperation (C.3-Cell Network MIMO Architectures with Sectorization and Fractional Frequency Reuse[J of Wang L is seen in the source] .IEEE Journal on Selected Areas in Communications.2011.29 (6): 1185-1199.).
Table 1
Figure BDA00003278609100071
In table 1, T mRepresent the required CM number of times of cluster in the communication means of the present invention, T aRepresent that the required plural number of cluster adds number of times, T in the communication means of the present invention cThe number of times of representing the comparison operation that cluster in the communication means of the present invention is required; T mThe required CM number of times of dynamic clustering method of the poor search method of mentioning in ' expression the background technology, T aThe required plural number of dynamic clustering method of the poor search method of mentioning in ' expression the background technology adds number of times, T cThe number of times of the comparison operation that the dynamic clustering method of the poor search method of mentioning in ' expression the background technology is required.As can be seen from Table 1, in having same cluster during number of base stations, T mMuch smaller than T m', T aMuch smaller than T a', T cMuch smaller than T c'.
From Fig. 2 to Fig. 4 as can be seen, compare with static clustering method, adopt dynamic clustering method of the present invention, the average size gain that system obtains has obtained bigger must the raising.From Fig. 5-Fig. 7 as can be seen, with based on search thoroughly the strategy the dynamic clustering method compare, adopt the current performance of dynamic clustering method of the present invention to be more or less the same, but its amount of calculation obviously reduces.

Claims (2)

1. the collaboration communication method based on many district dynamic cluster is characterized in that, these many residential quarters comprise at least three residential quarters, are provided with travelling carriage and base station in each residential quarter, and this communication means may further comprise the steps:
The first step: set up station list and calculate the minizone matrix of mutual interference mutually:
Initialization candidate base station tabulation Candidacy={1,2 ..., B} has selected station list
Figure FDA00003278609000011
B represents the sum of base station in many residential quarters, sets the base station maximum quantity that comprises in each bunch and is B c, B c<B, the number in many residential quarters bunch is
Figure FDA00003278609000012
Wherein, symbol
Figure FDA00003278609000013
Expression rounds downwards;
Feed back to the channel information matrix H of each base station according to all travelling carriages of many residential quarters, by formula (1) the measuring and calculating mutual interference matrix F in minizone:
f ij = | h ij | 2 + | h ji | 2 , i ≠ j 0 , i = j Formula (1)
Wherein, h IjChannel gain between the transmitting antenna of expression user i and base station j, h JiChannel gain between the transmitting antenna of expression user j and base station i, f IjBe the capable j column element of i of mutual interference matrix F, f IjMutual interference degree between expression base station i and the base station j;
Second step: in the candidate base station tabulation, select a cell base station i who is subjected to other area interference maximums l, as when the guiding base station of prevariety, guide base station i lSatisfy formula (2):
i l = max i ∈ Candidacy Σ j ≠ i f ij Formula (2)
According to formula (3) with i lDeletion from candidate base station tabulation, thus upgrade the candidate base station tabulation, according to formula (4) with i lAdd to and select in the station list, selected station list thereby upgrade:
Candidacy1=Candidacy-{i lFormula (3)
Preclusion1=Preclusion+{i lFormula (4)
Wherein, the tabulation of candidate base station after Candidacy1 represents to upgrade is first selected station list after Preclusion1 represents to upgrade first;
The 3rd step: select one to the guiding base station i when prevariety in the candidate base station tabulation after renewal lDisturb maximum cell base station i ' adding to work as prevariety, base station i ' satisfies f Ii 'Annoyance level between expression base station i and the base station i '; With deletion the candidate base station tabulation of base station i ' after last update, upgrade the candidate base station tabulation; Add base station i ' to selecting in the station list after the last update, upgrade and selected station list, entered for the 4th step then;
The 4th step: returned for the 3rd step, equal B until the number of base stations in prevariety c, entered for the 5th step then;
The 5th step: the candidate base station tabulation after will upgrading through the 4th step is tabulated as candidate base station, station list has been selected in the station list conduct of selecting after will upgrading through the 4th step, returned for second step, carry out next bunch base station selected, the candidate base station tabulation after once upgrading as of late is empty set
Figure FDA00003278609000022
After the last update select station list be 1,2 ..., B}, that sets up all bunches in many residential quarters selects station list;
The 6th step: system in all base stations by all bunches of the 5th step foundation select station list, carry out collaboration communication by the cluster result.
2. according to the described collaboration communication method based on many district dynamic cluster of claim 1, it is characterized in that described B cIn that { value among 2,3, the 4}, the quantity of B is less than or equal to 37.
CN201310216139.5A 2013-05-31 2013-05-31 A kind of collaboration communication method based on multiple cell dynamic clustering Active CN103281702B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201310216139.5A CN103281702B (en) 2013-05-31 2013-05-31 A kind of collaboration communication method based on multiple cell dynamic clustering

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201310216139.5A CN103281702B (en) 2013-05-31 2013-05-31 A kind of collaboration communication method based on multiple cell dynamic clustering

Publications (2)

Publication Number Publication Date
CN103281702A true CN103281702A (en) 2013-09-04
CN103281702B CN103281702B (en) 2015-10-28

Family

ID=49064114

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310216139.5A Active CN103281702B (en) 2013-05-31 2013-05-31 A kind of collaboration communication method based on multiple cell dynamic clustering

Country Status (1)

Country Link
CN (1) CN103281702B (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103458442A (en) * 2013-09-16 2013-12-18 东南大学 Dynamic clustering method for multi-base-station cooperation
CN104080092A (en) * 2014-07-15 2014-10-01 清华大学 Base station grouping method and system
CN105282748A (en) * 2014-06-06 2016-01-27 中国移动通信集团浙江有限公司 Communication network base station cluster dividing method and device
CN106549689A (en) * 2015-09-22 2017-03-29 中国移动通信集团公司 A kind of multiple cell SIC dispatching methods and device

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101389115A (en) * 2008-11-07 2009-03-18 北京工业大学 Collaboration communication method for multi-cell base station dynamic clustering
US20090073954A1 (en) * 2007-09-14 2009-03-19 Alexander Maltsev Techniques for Wireless Personal Area Network Communications with Efficient Spatial Reuse
CN101478342A (en) * 2009-01-22 2009-07-08 清华大学 Method for cooperative scheduling between multiple districts in multi-antenna cellular communication system
KR20130042673A (en) * 2011-10-17 2013-04-29 한국과학기술원 Method of cooperative inter-cell interference managemenet using a cooperative cluster for power saving and device using the method

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090073954A1 (en) * 2007-09-14 2009-03-19 Alexander Maltsev Techniques for Wireless Personal Area Network Communications with Efficient Spatial Reuse
CN101389115A (en) * 2008-11-07 2009-03-18 北京工业大学 Collaboration communication method for multi-cell base station dynamic clustering
CN101478342A (en) * 2009-01-22 2009-07-08 清华大学 Method for cooperative scheduling between multiple districts in multi-antenna cellular communication system
KR20130042673A (en) * 2011-10-17 2013-04-29 한국과학기술원 Method of cooperative inter-cell interference managemenet using a cooperative cluster for power saving and device using the method

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103458442A (en) * 2013-09-16 2013-12-18 东南大学 Dynamic clustering method for multi-base-station cooperation
CN105282748A (en) * 2014-06-06 2016-01-27 中国移动通信集团浙江有限公司 Communication network base station cluster dividing method and device
CN105282748B (en) * 2014-06-06 2018-12-07 中国移动通信集团浙江有限公司 A kind of method and apparatus for the base station cluster dividing communication network
CN104080092A (en) * 2014-07-15 2014-10-01 清华大学 Base station grouping method and system
CN106549689A (en) * 2015-09-22 2017-03-29 中国移动通信集团公司 A kind of multiple cell SIC dispatching methods and device
CN106549689B (en) * 2015-09-22 2018-12-07 中国移动通信集团公司 A kind of multiple cell SIC dispatching method and device

Also Published As

Publication number Publication date
CN103281702B (en) 2015-10-28

Similar Documents

Publication Publication Date Title
Gu et al. Distributed multi-relay selection in accumulate-then-forward energy harvesting relay networks
CN102892188B (en) Based on the ascending power control method of genetic algorithm and device in communication network
Wang et al. Coverage and throughput analysis with a non-uniform small cell deployment
Zhang et al. Deep reinforcement learning for multi-agent power control in heterogeneous networks
CN102857934B (en) Method and device for selecting cooperation sets
Zhai et al. Joint position optimization, user association, and resource allocation for load balancing in UAV-assisted wireless networks
CN106028456A (en) Power allocation method of virtual cell in 5G high density network
CN103281702B (en) A kind of collaboration communication method based on multiple cell dynamic clustering
CN106358300A (en) Distributed resource distribution method in microcellular network
CN106131855A (en) The method for channel allocation of virtual subdistrict in a kind of 5G high density network
Yu et al. Interference coordination strategy based on Nash bargaining for small‐cell networks
CN116347635A (en) NB-IoT wireless resource allocation method based on NOMA and multi-agent reinforcement learning
Liu et al. Mobility-aware centralized reinforcement learning for dynamic resource allocation in HetNets
Cui et al. A two-timescale resource allocation scheme in vehicular network slicing
CN102118754A (en) Partitioning method of dynamic cooperation sets in CoMP technology
Yang et al. Cluster-based joint resource allocation with successive interference cancellation for ultra-dense networks
CN105959043A (en) Multi-base station cooperative transmission strategy in energy efficiency drive
Cai et al. A joint game-theoretic interference coordination approach in uplink multi-cell OFDMA networks
Zeng et al. Optimal base stations planning for coordinated multi-point system
Mirzaei et al. Efficient resource management for non-orthogonal multiple access: A novel approach towards green hetnets
Pourkabirian et al. An evolutionary game-theoretic approach for base station allocation in wireless femtocell networks
Wu et al. Maximization of con-current links in V2V communications based on belief propagation
Sun et al. A Distributed approach in uplink device-to-device enabled cloud radio access networks
Deng et al. Outage and capacity of heterogeneous cellular networks with intra-tier dependence
Nie et al. Joint optimization of FeICIC and spectrum allocation for spectral and energy efficient heterogeneous networks

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
TR01 Transfer of patent right

Effective date of registration: 20210326

Address after: 201306 building C, No. 888, Huanhu West 2nd Road, Lingang New Area, Pudong New Area, Shanghai

Patentee after: Shanghai Hanxin Industrial Development Partnership (L.P.)

Address before: 211189 No. 2 Southeast University Road, Jiangning District, Nanjing, Jiangsu

Patentee before: SOUTHEAST University

TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20230914

Address after: 201615 room 301-6, building 6, no.1158, Jiuting Central Road, Jiuting Town, Songjiang District, Shanghai

Patentee after: White box (Shanghai) Microelectronics Technology Co.,Ltd.

Address before: 201306 building C, No. 888, Huanhu West 2nd Road, Lingang New Area, Pudong New Area, Shanghai

Patentee before: Shanghai Hanxin Industrial Development Partnership (L.P.)

TR01 Transfer of patent right