CN110177340A - A kind of super-intensive network resource allocation method of customer-centric - Google Patents

A kind of super-intensive network resource allocation method of customer-centric Download PDF

Info

Publication number
CN110177340A
CN110177340A CN201910634521.5A CN201910634521A CN110177340A CN 110177340 A CN110177340 A CN 110177340A CN 201910634521 A CN201910634521 A CN 201910634521A CN 110177340 A CN110177340 A CN 110177340A
Authority
CN
China
Prior art keywords
user
rrh
subcarrier
sub
distribution
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
CN201910634521.5A
Other languages
Chinese (zh)
Other versions
CN110177340B (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.)
University of Electronic Science and Technology of China
Original Assignee
University of Electronic Science and Technology of China
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 University of Electronic Science and Technology of China filed Critical University of Electronic Science and Technology of China
Priority to CN201910634521.5A priority Critical patent/CN110177340B/en
Publication of CN110177340A publication Critical patent/CN110177340A/en
Application granted granted Critical
Publication of CN110177340B publication Critical patent/CN110177340B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W24/00Supervisory, monitoring or testing arrangements
    • H04W24/02Arrangements for optimising operational condition
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W4/00Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/02Services making use of location information
    • H04W4/029Location-based management or tracking services
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/24Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/32Connectivity information management, e.g. connectivity discovery or connectivity update for defining a routing cluster membership
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/04Wireless resource allocation
    • H04W72/044Wireless resource allocation based on the type of the allocated resource
    • H04W72/0453Resources in frequency domain, e.g. a carrier in FDMA
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/04Wireless resource allocation
    • H04W72/044Wireless resource allocation based on the type of the allocated resource
    • H04W72/046Wireless resource allocation based on the type of the allocated resource the resource being in the space domain, e.g. beams
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/50Allocation or scheduling criteria for wireless resources
    • H04W72/56Allocation or scheduling criteria for wireless resources based on priority criteria

Landscapes

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

Abstract

The invention discloses a kind of super-intensive network resource allocation methods of customer-centric, comprising the following steps: S1, is allocated using the two-way choice overlapping RRH cluster algorithm based on geographical location to RRH;S2, subcarrier distribution is carried out to all RRH using system subcarrier allocation algorithm priority-based;S3, the minimum-rate lower limit constraint of each user is assigned on subcarrier according to the allocation result design of first two steps, and minimizes method using WSMSE and solves power distribution and wave beam forming vector.The present invention is realized using the lower method of complexity and is distributed the RRH distribution of user each in system and subcarrier, rate constraint is shared on each subcarrier, it improves resource utilization to greatest extent simultaneously and reduces inter-user interference, system efficiency of transmission can be effectively improved.

Description

A kind of super-intensive network resource allocation method of customer-centric
Technical field
The invention belongs to 5G wireless communication field, in particular to the super-intensive Internet resources of a kind of customer-centric distribute Method.
Background technique
In recent years, mobile data services have become the main business of cordless communication network, and out of expected speed Constantly grow rapidly.With the continuous rising of mobile data amount, in order to meet the ever-increasing flow demand of user, mobile network Network operator must increase network capacity.MIMO technology can serve multiple use by introducing additional space dimension simultaneously Family simultaneously provides spatial multiplexing gain, can effectively improve system spectral efficiency.In new generation of wireless communication system, multiple technologies phase In conjunction with having become a kind of trend.It is worth noting that, the combination and application of these new techniques, so that next generation wireless network Network structure and interference environment become complex, interference problem is more acute, becomes the key of system for restricting performance boost Factor.
Super-intensive network (Ultra dense Network, UDN) is one of the key technology of 5G mobile communication, is increased low Power site deployment density makes network-intensive, and node is closer to the user, improves power system capacity, improves spectrum efficiency and function Rate efficiency.Due to the reduction of node spacing, the transmission loss of adjacent node is not much different, and may have multiple intensity phases around user Close interference source makes user by interference more serious than legacy cellular net.How multi-jamming sources caused by performance loss is solved And network cooperating and interference management how to be utilized to promote user performance as the critical issue in 5G UDN Interference Suppression Study.
In conclusion the interference coordination technique in the dynamic cooperative region based on UDN framework is very with practical value, Ke Yiman The growing flow demand of sufficient non-uniform Distribution user.But the research of the relevant technologies and using still in the initial stage, such as What meets the needs of users in conjunction with different characteristic of network environment, propose better antenna and subcarrier distribution and wave beam forming to Design scheme is measured, is still to be worth the problem of discussing.
Summary of the invention
It is an object of the invention to overcome the deficiencies of the prior art and provide a kind of using the lower method realization pair of complexity The RRH distribution and subcarrier distribution of each user, rate constraint is shared on each subcarrier, while to greatest extent in system It improves resource utilization and reduces the super-intensive network resource allocation method of the customer-centric of inter-user interference.
The purpose of the present invention is achieved through the following technical solutions: a kind of super-intensive network money of customer-centric Source distribution method, comprising the following steps:
S1, RRH is allocated using the two-way choice overlapping RRH cluster algorithm based on geographical location;
S2, subcarrier distribution is carried out to all RRH using system subcarrier allocation algorithm priority-based;
S3, the minimum-rate lower limit constraint of each user is assigned to subcarrier according to the allocation result design of first two steps On, and minimize method using WSMSE and solve power distribution and wave beam forming vector.
Further, the step S1 includes following sub-step:
S11, initialization sub-clustering distance restraint D0
S12, for user k, filter out with it distance be no more than D0All RRH, be denoted as setIt willIn RRH according to the distance to k from closely to remote sequence;Before user k givesA RRH sends association request, and having had sent The RRH of association request fromMiddle deletion;Represent the RRH number that the sub-clustering most multipotency of user k includes;
Whether user's number of association request that m-th S13, statistics of RRH are received is more than use that it is at best able to service Family numberIf then by these users according to the distance to m from closely to being far ranked up, before takingA user, by m The cooperative cluster of these users is added in a RRH;Otherwise m-th of RRH is directly added to the cooperative cluster of these users;
S14, the cooperative cluster element number for judging whether there is user k' do not reach the upper limitAndIt is not sky, If then continuing successively RRH thereto initiates request, until the cooperative cluster element of all users reach the upper limit orFor Sky executes step S15;Otherwise step S15 is directly executed;
S15, the service for still having user not obtain RRH is checked whether, if then D0Increase by 5%, repetition step S12~ S14, otherwise end operation.
Further, the step S2 concrete methods of realizing are as follows: note overall system bandwidth is B, and is divided into N number of wide orthogonal Subchannel, it is assumed that frequency duplex factor as one 1, that is, every sub-channels can only distribute to the user of its service;
A priority is established for all users, and constantly dynamically updates the excellent of the user during subchannel distribution First grade;Sub-channel allocation scheme needs to allow the user of shared RRH that different subchannels is selected to carry out signal transmission on the RRH, Therefore selection carries out subchannel distribution to each RRH that enlivens respectively;
Each user node has an alternative list of sub-channels, and flat in the subchannel according to the user k and m-th of RRH Equal quality carries out priority ranking from getting well to going bad, and remembers that the list isThen, all RRH are followed successively by and execute following steps:
M-th S21, initialization of RRH can distribute list of sub-channels
S22, a priority orders are established to all connection users of m-th of RRH;
S23, all user node k that m-th of RRH service is traversed according to the priority that step S22 is provided, select for itMiddle available channel isValue is 1, andThe channel n of highest priority1, give the Point Coloring, record coloringThe channel n selected1?In be set to zero, i.e.,
S24, step S23 and S24 are repeated, that is, existedIn the case where having saved, sort again to the user that m is serviced And successively carry out subchannel selection distribution;UntilNo longer change, obtains the sub-channel assignment result of the RRH
Further, the step S22 includes following sub-step:
S221, a number is set for all user's random sequences;
S222, the degree for calculating each user node, i.e. RRH number of its sub-clustering;
S223, to all user nodes, first, in accordance with whether having been allocated for subchannel user be divided into two big groups: not yet The User Priority for distributing subchannel is higher, and it is lower that the more User Priorities of subchannel have been assigned in every group;It has obtained The user node of the number of channel, the bigger priority of degree is small lower than spending, and the small priority of the identical label of degree is lower;By this Method is that user establishes a priority orders.
Further, the step S3 concrete methods of realizing are as follows: distribution is established using the distribution method about rate constraint Weight matrixThe wherein expression formula of each entry value are as follows:
Wherein,The channel gains vector of user k to RRHm on subcarrier n is represented,Indicate 2 norm of vector;
Then, it is determined that the rate constraint of each subcarrier is Indicate the lowest speed of user k Rate requirement;
Model abbreviation is as follows for the form that can be solved with WEMSE method:
Wherein,Indicate the wave beam forming vector with power distribution of user k to m-th RRH on subcarrier n; Represent the upper limit of the power constraint of m-th of RRH;It is rate of the user k on subcarrier n, expression formula are as follows:
Indicating the subchannel distribution set of user k, σ indicates the additive white noise mean power of channel,It represents The RRH number that the sub-clustering of user k most multipotency includes.
The beneficial effects of the present invention are: the invention proposes a kind of overlappings based on geographical location of customer-centric RRH cluster-dividing method;In turn, a subcarrier distribution scheme for the purpose of the co-channel interference for eliminating overlapping sub-clustering is designed;Finally The rate constraint of each user is assigned in active channel and is carried out wave beam forming vector calculating, realizes the money in whole network Source distribution and interference coordination.The present invention is realized using the lower method of complexity to the RRH distribution of user each in system and son Carrier wave distribution, rate constraint is shared on each subcarrier, while improving resource utilization to greatest extent and reducing between user Interference, can effectively improve system efficiency of transmission.
Detailed description of the invention
The position Fig. 1 super-intensive network cluster dividing schematic diagram;
Fig. 2 is the flow chart of the super-intensive network resource allocation method of customer-centric of the invention;
Fig. 3 is that two-way choice of the use based on geographical location of the invention is overlapped what RRH cluster algorithm was allocated RRH Flow chart;
Fig. 4 is that the allocation algorithm of system subcarrier priority-based of the invention carries out subcarrier distribution to all RRH Flow chart.
Specific embodiment
Technical solution of the present invention is further illustrated with reference to the accompanying drawing.
The present invention is suitable for the MIMO super-intensive network scenarios of customer-centric.In this scenario, user node is each other Between distance it is close, RRH is also dense distribution, by certain beamforming scheme to user transmit data;System passes through BBU The United Dispatching of (baseband unit, base-band resource) Chi Jinhang signal transmission, both any RRH can exist to any user Service is provided on any channel.Scene of the invention is as shown in Figure 1.
In such cellular network, between the user equipment that is closer can to causing very huge interference each other, System efficiency of transmission is seriously affected.For this purpose, present invention firstly provides a kind of customer-centric based on geographical location It is overlapped RRH cluster-dividing method;In turn, a subcarrier distribution scheme for the purpose of the co-channel interference for eliminating overlapping sub-clustering is designed; The rate constraint of each user is finally assigned in active channel and is carried out wave beam forming vector calculating, is realized in whole network Resource allocation and interference coordination.
Wherein, wave beam forming can be directly used mention WSMSE (weighted sum mean-square-error, Error mean square weighted sum) minimize the convex Optimization Solution of method progress.
Consider a downlink UDN system, there is M RRH, each RRH to have N in systemtA antenna;System is super-intensive net Network, it is contemplated that sharing K < < M user in system, each user is single antenna.The geographical location of user and RRH all follow It is uniformly distributed.
Problem can be expressed with above-mentioned model, whereinIt is rate of the user k on subcarrier n, expression formula For
Indicate the subchannel distribution set of user k;Represent the RRH number that the sub-clustering most multipotency of user k includes;Indicate whether sub-channel n distributes to user k to RRHm.
Traditional wireless communication system based on fixed cells planning is difficult to effectively be adapted to the communication requirement of user, can not The inhomogeneities and dynamic changeability that good fit user shows in time domain and spatial distribution and type of business.Based on upper Reason is stated, customer-centric realizes the division of user service group, can more effectively meet the business needs of user.Meanwhile Existing subcarrier distribution scheme often can assume that the RRH for servicing the same user can select identical subcarrier to the user into Row transmission, or even a subcarrier only is distributed to each user, although this hypothesis is simpler easy in allocation algorithm It is also easier to carry out subsequent calculating in realization, but actually will cause the waste of some available bands.Therefore, the present invention considers Independent subcarrier distribution selection is carried out on each RRH;It is carried out compared to respectively rate constraint or according to transmission channel quality Weight distribution, while considering that the influence of signal channel and interfered with transport channels more can effectively realize load balancing, begin to be The whole band efficiency of system reaches highest.
As shown in Fig. 2, a kind of super-intensive network resource allocation method of customer-centric of the invention, including following step It is rapid:
S1, in order to balance customer-centric and low overhead requirement, are overlapped RRH using the two-way choice based on geographical location Cluster algorithm is allocated RRH;Specific implementation process is as shown in figure 3, include following sub-step:
S11, initialization sub-clustering distance restraint D0
S12, for user k, filter out with it distance be no more than D0All RRH, be denoted as setIt willIn RRH according to the distance to k from closely to remote sequence;Before user k givesA RRH sends association request, and having had sent The RRH of association request fromMiddle deletion;Represent the RRH number that the sub-clustering most multipotency of user k includes;
Whether user's number of association request that m-th S13, statistics of RRH are received is more than use that it is at best able to service Family numberIf by these users according to the distance to m from closely to being far ranked up, before takingA user, by m-th The cooperative cluster of these users is added in RRH;Otherwise m-th of RRH is directly added to the cooperative cluster of these users;
S14, the cooperative cluster element number for judging whether there is user k' do not reach the upper limitAndIt is not sky, If then continuing successively RRH thereto initiates request, until the cooperative cluster element of all users reach the upper limit orFor Sky executes step S15;Otherwise step S15 is directly executed;
S15, the service for still having user not obtain RRH is checked whether, if then D0Increase by 5%, repetition step S12~ S14, otherwise end operation.
S2, subcarrier distribution is carried out to all RRH using system subcarrier allocation algorithm priority-based;
In the sub-clustering result discussed due to step S1, different user cooperative cluster may include identical RRH, so if this A little users will generate very big co-channel interference using transmitting in identical subchannel on the RRH of overlapping.Need one Resource block allocation method of the kind for the purpose of eliminating short distance co-channel interference.
As shown in figure 4, step S2 concrete methods of realizing are as follows:
Note overall system bandwidth is B, and is divided into N number of wide orthogonal sub-channels, it is assumed that frequency duplex factor as one 1, that is, Every sub-channels can only distribute to the user of its service;
A priority is established for all users, and constantly dynamically updates the excellent of the user during subchannel distribution First grade;Sub-channel allocation scheme needs to allow the user of shared RRH that different subchannels is selected to carry out signal transmission on the RRH, Therefore selection carries out subchannel distribution to each RRH that enlivens respectively;
Each user node has an alternative list of sub-channels, and flat in the subchannel according to the user k and m-th of RRH Equal quality carries out priority ranking from getting well to going bad, and remembers that the list isThen, all RRH are followed successively by and execute following steps:
M-th S21, initialization of RRH can distribute list of sub-channels
S22, a priority orders are established to all connection users of m-th of RRH;Including following sub-step:
S221, a number is set for all user's random sequences;
S222, the degree for calculating each user node, i.e. RRH number of its sub-clustering;
S223, to all user nodes, first, in accordance with whether having been allocated for subchannel user be divided into two big groups: not yet The User Priority for distributing subchannel is higher, and it is lower that the more User Priorities of subchannel have been assigned in every group;It has obtained The user node of the number of channel, the bigger priority of degree is small lower than spending, and the small priority of the identical label of degree is lower;By this Method is that user establishes a priority orders.
S23, all user node k that m-th of RRH service is traversed according to the priority that step S22 is provided, select for itMiddle available channel isValue is 1, andThe channel n of highest priority1, give the Point Coloring, record coloringThe channel n selected1?In be set to zero, i.e.,
S24, step S23 and S24 are repeated, that is, existedIn the case where having saved, arranged again to the user that m is serviced Sequence simultaneously successively carries out subchannel selection distribution;UntilNo longer change, obtains the sub-channel assignment result of the RRH
S3, the minimum-rate lower limit constraint of each user is assigned to subcarrier according to the allocation result design of first two steps On, and minimize method using WSMSE and solve power distribution and wave beam forming vector;
Finally, needing to carry out the calculating of power distribution and wave beam forming vector, final overall system throughput can be just obtained With capacity usage ratio expression formula, selection herein uses existing WEMSE and minimizes method solution.According to the spy of method for solving Point, it is also necessary to which rate constraint, which is assigned on each subcarrier, to be convex Optimized model by model abbreviation.It is expressed according to rate Formula is and identical it is found that information transmission channel quality of the user on some subcarrier can play positive acting to its final rate Other transmission intensity on subcarrier will have a direct impact on its interference strength.Concrete methods of realizing are as follows: use about rate about The distribution method of beam establishes distribution weight matrixThe wherein expression formula of each entry value are as follows:
Wherein,The channel gains vector of user k to RRHm on subcarrier n is represented,Indicate 2 norm of vector;
Then, it is determined that the rate constraint of each subcarrier is Indicate the lowest speed of user k Rate requirement;
Model abbreviation is as follows for the form that can be solved with WEMSE method:
Wherein,Indicate the wave beam forming vector with power distribution of user k to m-th RRH on subcarrier n; Represent the upper limit of the power constraint of m-th of RRH;It is rate of the user k on subcarrier n, expression formula are as follows:
Indicating the subchannel distribution set of user k, σ indicates the additive white noise mean power of channel,It represents and uses The RRH number that the sub-clustering of family k most multipotency includes.Two parameters of power distribution and wave beam forming vector can be found out, are passed through It is exactly power distribution that model, which finds out the non-unity vector field homoemorphism value come,;Then be exactly wave beam forming after vector is unitization to Amount.
Those of ordinary skill in the art will understand that the embodiments described herein, which is to help reader, understands this hair Bright principle, it should be understood that protection scope of the present invention is not limited to such specific embodiments and embodiments.This field Those of ordinary skill disclosed the technical disclosures can make according to the present invention and various not depart from the other each of essence of the invention The specific variations and combinations of kind, these variations and combinations are still within the scope of the present invention.

Claims (5)

1. a kind of super-intensive network resource allocation method of customer-centric, which comprises the following steps:
S1, RRH is allocated using the two-way choice overlapping RRH cluster algorithm based on geographical location;
S2, subcarrier distribution is carried out to all RRH using system subcarrier allocation algorithm priority-based;
S3, the minimum-rate lower limit constraint of each user is assigned on subcarrier according to the allocation result design of first two steps, and Method, which is minimized, using WSMSE solves power distribution and wave beam forming vector.
2. a kind of super-intensive network resource allocation method of customer-centric according to claim 1, which is characterized in that The step S1 includes following sub-step:
S11, initialization sub-clustering distance restraint D0
S12, for user k, filter out with it distance be no more than D0All RRH, be denoted as setIt willIn RRH According to the distance to k from closely to remote sequence;Before user k givesA RRH sends association request, and is associated with having had sent The RRH of request fromMiddle deletion;Represent the RRH number that the sub-clustering most multipotency of user k includes;
Whether the user's number for the association request that m-th S13, statistics of RRH are received is more than its user for being at best able to service NumberIf by these users according to the distance to m from closely to being far ranked up, before takingA user, by m-th of RRH The cooperative cluster of these users is added;Otherwise m-th of RRH is directly added to the cooperative cluster of these users;
S14, the cooperative cluster element number for judging whether there is user k' do not reach the upper limitAndIt is not sky, if Then continue successively RRH thereto and initiate request, until the cooperative cluster element of all users reach the upper limit orFor sky, hold Row step S15;Otherwise step S15 is directly executed;
S15, the service for still having user not obtain RRH is checked whether, if then D0Increase by 5%, repeats step S12~S14, it is no Then end operation.
3. a kind of super-intensive network resource allocation method of customer-centric according to claim 1, which is characterized in that The step S2 concrete methods of realizing are as follows: note overall system bandwidth is B, and is divided into N number of wide orthogonal sub-channels, it is assumed that frequency is multiple It is 1 with the factor, that is, every sub-channels can only distribute to the user of its service;
A priority is established for all users, and constantly dynamically updates the preferential of the user during subchannel distribution Grade;Sub-channel allocation scheme needs to allow the user of shared RRH that different subchannels is selected to carry out signal transmission on the RRH, because This selection carries out subchannel distribution to each RRH that enlivens respectively;
Each user node has an alternative list of sub-channels, and is averaged matter according to the user k and m-th of RRH in the subchannel Amount carries out priority ranking from getting well to going bad, and remembers that the list isThen, all RRH are followed successively by and execute following steps:
M-th S21, initialization of RRH can distribute list of sub-channels
S22, a priority orders are established to all connection users of m-th of RRH;
S23, all user node k that m-th of RRH service is traversed according to the priority that step S22 is provided, select for it Middle available channel isValue is 1, andThe channel n of highest priority1, give the Point Coloring, record coloring The channel n selected1?In be set to zero, i.e.,
S24, step S23 and S24 are repeated, that is, existedIn the case where having saved, again to m service user sequence and according to Secondary progress subchannel selection distribution;UntilNo longer change, obtains the sub-channel assignment result of the RRH
4. a kind of super-intensive network resource allocation method of customer-centric according to claim 1, which is characterized in that The step S22 includes following sub-step:
S221, a number is set for all user's random sequences;
S222, the degree for calculating each user node, i.e. RRH number of its sub-clustering;
S223, to all user nodes, first, in accordance with whether having been allocated for subchannel user be divided into two big groups: not yet distributing The User Priority for crossing subchannel is higher, and it is lower that the more User Priorities of subchannel have been assigned in every group;Channel is obtained Several user nodes, the bigger priority of degree is small lower than spending, and the small priority of the identical label of degree is lower;By this method A priority orders are established for user.
5. a kind of super-intensive network resource allocation method of customer-centric according to claim 1, which is characterized in that The step S3 concrete methods of realizing are as follows: distribution weight matrix is established using the distribution method about rate constraintThe wherein expression formula of each entry value are as follows:
Wherein,The channel gains vector of user k to RRHm on subcarrier n is represented,Indicate 2 norm of vector;
Then, it is determined that the rate constraint of each subcarrier is Indicate that the minimum speed limit of user k is wanted It asks;
Model abbreviation is as follows for the form that can be solved with WEMSE method:
Wherein,Indicate the wave beam forming vector with power distribution of user k to m-th RRH on subcarrier n;It represents The upper limit of the power constraint of m-th of RRH;It is rate of the user k on subcarrier n, expression formula are as follows:
Indicating the subchannel distribution set of user k, σ indicates the additive white noise mean power of channel,Represent user k Sub-clustering most multipotency RRH number including.
CN201910634521.5A 2019-07-15 2019-07-15 User-centered ultra-dense network resource allocation method Active CN110177340B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910634521.5A CN110177340B (en) 2019-07-15 2019-07-15 User-centered ultra-dense network resource allocation method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910634521.5A CN110177340B (en) 2019-07-15 2019-07-15 User-centered ultra-dense network resource allocation method

Publications (2)

Publication Number Publication Date
CN110177340A true CN110177340A (en) 2019-08-27
CN110177340B CN110177340B (en) 2020-10-20

Family

ID=67699982

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910634521.5A Active CN110177340B (en) 2019-07-15 2019-07-15 User-centered ultra-dense network resource allocation method

Country Status (1)

Country Link
CN (1) CN110177340B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2021068762A1 (en) * 2019-10-11 2021-04-15 华为技术有限公司 Carrier configuration method and related apparatus
CN114938244A (en) * 2022-05-07 2022-08-23 重庆邮电大学 Time-frequency resource allocation method of indoor VLC network based on cooperative transmission

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2011134230A1 (en) * 2010-04-26 2011-11-03 中兴通讯股份有限公司 Beamforming method and device
CN102655677A (en) * 2011-03-02 2012-09-05 株式会社日立制作所 Mobile communication system and far-end radio frequency unit clustering method thereof
CN104618946A (en) * 2015-01-08 2015-05-13 西安电子科技大学 LTE (Long Term Evolution) heterogeneous network interference coordination method based on three-dimensional (3D) beam model of active antenna
CN104796918A (en) * 2015-03-17 2015-07-22 无锡北邮感知技术产业研究院有限公司 Wireless communication networking method
CN105684543A (en) * 2013-05-10 2016-06-15 瑞典爱立信有限公司 Mechanism and method for making connection between electronic devices

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2011134230A1 (en) * 2010-04-26 2011-11-03 中兴通讯股份有限公司 Beamforming method and device
CN102655677A (en) * 2011-03-02 2012-09-05 株式会社日立制作所 Mobile communication system and far-end radio frequency unit clustering method thereof
CN105684543A (en) * 2013-05-10 2016-06-15 瑞典爱立信有限公司 Mechanism and method for making connection between electronic devices
CN104618946A (en) * 2015-01-08 2015-05-13 西安电子科技大学 LTE (Long Term Evolution) heterogeneous network interference coordination method based on three-dimensional (3D) beam model of active antenna
CN104796918A (en) * 2015-03-17 2015-07-22 无锡北邮感知技术产业研究院有限公司 Wireless communication networking method

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
BINBIN DAI: "Sparse Beamforming and User-Centric Clustering for Downlink Cloud Radio Access Network", 《IEEE XPLORE DIGITAL LIBRARY》 *
XIAOYAN HUANG: "Joint Scheduling and Beamforming Coordination in Cloud Radio Access Networks With QoS Guarantees", 《IEEE XPLORE DIGITAL LIBRARY》 *
朱晓荣: "超密集小峰窝网中基于干扰协调的小区分簇和功率分配算法", 《百度学术》 *
王振: "超密集无线网络资源分配若干算法研究", 《GOOGLE》 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2021068762A1 (en) * 2019-10-11 2021-04-15 华为技术有限公司 Carrier configuration method and related apparatus
CN114938244A (en) * 2022-05-07 2022-08-23 重庆邮电大学 Time-frequency resource allocation method of indoor VLC network based on cooperative transmission

Also Published As

Publication number Publication date
CN110177340B (en) 2020-10-20

Similar Documents

Publication Publication Date Title
US8705484B2 (en) Method for varying transmit power patterns in a multi-cell environment
CN101868017B (en) A kind of method and apparatus realizing CoMP downlink communication
Wang et al. Dynamic load balancing and throughput optimization in 3gpp lte networks
CN106850173B (en) Multi-cell pilot frequency distribution method based on large-scale MIMO
CN103797725A (en) Systems and methods to exploit areas of coherence in wireless systems
CN104717755A (en) Downlink frequency spectrum resource distribution method with D2D technology introduced in cellular network
US7983710B2 (en) Method of coordinated wireless downlink transmission
CN112601284A (en) Downlink multi-cell OFDMA resource allocation method based on multi-agent deep reinforcement learning
CN113852453B (en) Combined optimization method combining pilot frequency distribution and AP selection
Mauricio et al. A low complexity solution for resource allocation and SDMA grouping in massive MIMO systems
Wang et al. Beamforming optimization and power allocation for user-centric MIMO-NOMA IoT networks
CN112954806B (en) Chord graph coloring-based joint interference alignment and resource allocation method in heterogeneous network
CN111682915B (en) Self-allocation method for frequency spectrum resources
Leng et al. User-level scheduling and resource allocation for multi-beam satellite systems with full frequency reuse
CN110177340A (en) A kind of super-intensive network resource allocation method of customer-centric
Li et al. Resource allocation for OFDMA systems with multi-cell joint transmission
CN108471608A (en) A kind of D2D communication resources dispatching method and device
Sarker et al. Uplink power allocation scheme for user-centric cell-free massive MIMO systems
CN111953463B (en) Pilot frequency distribution method based on user clustering
Peng et al. Network planning based on interference alignment in density WLANs
CN106209335B (en) A kind of pilot multiplex method for D2D communication system
CN105873071B (en) A kind of dynamic clustering method and device resource-constrained based on cooperation
CN105744605B (en) A kind of resource allocation methods based on minimum power
Zhang et al. Energy minimization for fog computing-enabled hierarchical networks with dynamic TDD
Xie et al. An energy-efficient resource allocation strategy in massive mimo-enabled vehicular edge computing networks

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant