CN105163351A - Multi-cell resource allocation algorithm based on energy efficiency in LTE system - Google Patents

Multi-cell resource allocation algorithm based on energy efficiency in LTE system Download PDF

Info

Publication number
CN105163351A
CN105163351A CN201510687952.XA CN201510687952A CN105163351A CN 105163351 A CN105163351 A CN 105163351A CN 201510687952 A CN201510687952 A CN 201510687952A CN 105163351 A CN105163351 A CN 105163351A
Authority
CN
China
Prior art keywords
user
prb
community
data rate
cell
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
CN201510687952.XA
Other languages
Chinese (zh)
Other versions
CN105163351B (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.)
Chongqing University of Post and Telecommunications
Original Assignee
Chongqing University of Post and Telecommunications
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 Chongqing University of Post and Telecommunications filed Critical Chongqing University of Post and Telecommunications
Priority to CN201510687952.XA priority Critical patent/CN105163351B/en
Publication of CN105163351A publication Critical patent/CN105163351A/en
Application granted granted Critical
Publication of CN105163351B publication Critical patent/CN105163351B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/08—Load balancing or load distribution
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W36/00—Hand-off or reselection arrangements
    • H04W36/08—Reselecting an access point
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W64/00—Locating users or terminals or network equipment for network management purposes, e.g. mobility management
    • H04W64/006—Locating users or terminals or network equipment for network management purposes, e.g. mobility management with additional information processing, e.g. for direction or speed determination
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
    • H04W72/542—Allocation or scheduling criteria for wireless resources based on quality criteria using measured or perceived quality
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

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

Abstract

The invention relates to a multi-cell resource allocation algorithm based on energy efficiency in a LTE system and belongs to the technical field of wireless communication. The algorithm comprises steps of: establishing a neighbor cell list in each cell, wherein the positions, the loads, and the PRB resource information of neighbor cells are stored in the neighbor cell list, the cells exchange the above information with one another periodically in order to timely update the neighbor cell lists; determining whether a user not satisfying a minimum data rate exists in a certain cell, allocating extra PRBs to the user if yes, and switching a switchable user in an overlapping region to a target neighbor cell if the idle PRBs of the cell are insufficient; in the cell, moving all rest PRBs and transferable PRBs of other users to the user with best channel quality and exchanging the untransferable PRBs capable of increasing the sum data rate of two users so as to increase the data rate of the cell.

Description

Based on the multiple cell resource allocation algorithm of efficiency in a kind of LTE system
Technical field
The invention belongs to wireless communication technology field, relate to the multiple cell resource allocation algorithm based on efficiency in a kind of LTE system.
Background technology
LTE technology mainly with OFDM and MIMO for core technology basis, there is the feature such as the network architecture of lower propagation delay time, higher data rate, larger capacity and coverage rate, less running cost and optimization, developed rapidly in the world, become the mainstream technology of global radio mobile communication.But along with the continuous expansion of LTE cordless communication network scale and the fierceness growth of number of users, the energy that LTE wireless communication system consumes, also in quick rise, brings huge expense, simultaneously, the greenhouse gas amount of system discharge, also in growth, exacerbates environmental pollution.The work of communications industry energy-saving and emission-reduction is imperative, very urgent.
Relevant research shows, the energy consumption of base station accounts for 57% of system total energy consumption, is the part that in whole communication network energy consumption, proportion is the highest, visible, improves the capacity usage ratio of base station, and reducing the energy consumption of base station, is the key component realizing whole communication network energy-saving and emission-reduction.In the lte networks, the Resourse Distribute of uplink downlink is all controlled by base station, and therefore, effective and reasonable resource allocation algorithm is particularly important for the energy ezpenditure reducing base station side.
Traditional resource allocation algorithm is mostly based on equitable proportion, max carrier to interference, poll scheduling algorithm, under the fairness prerequisite considering user, to improve the throughput of system for target, seldom considers the energy consumption problem of base station.In the epoch of current green communications, reduce the energy consumption of base station, the cost reducing operator, reduction environmental pollution by the resource allocation algorithm studying base station energy-saving, become a main trend of green communications industry.
In recent years, research based on the resource allocation algorithm of efficiency mainly contains: (1) minimum transmission power (MP) resource algorithm: this algorithm it is considered that every bit information transmit required for minimum transmission power, Resource Block RB is given and carries out the minimum user of the required through-put power of every bit information transmission, thus reach energy-conservation object.This algorithm, while the QOS demand ensureing user and fairness, decreases the consumption of energy.(2) resource allocation algorithm considering that modulating-coding grade and power control is combined: this algorithm is according to the real time channel quality condition of user, and adaptive selection modulation coding mode, meeting under user QOS condition, making overall transmission power reach and minimizing.This algorithm plays certain effect to suppression presence of intercell interference, and under the prerequisite not increasing bandwidth, makes community contain more user.But described Energy Saving Algorithm is applicable to peak load scene, do not consider the factor such as low load, lack of uniformity of minizone.
In practical communication, it is uncertain that user terminal enters certain community, and simultaneously each user is also different to the demand of business, and this just causes the difference of Resourse Distribute between the load imbalance of each community and user.If base station still according to ordinary working method for user transmits data, so user is had for the community that load is heavy not reach minimum data rate and require and newly arrive user to access, and the resource of the low community of load is idle, the user that channel quality is good simultaneously can not obtain the high PRB of achievable rate, so just causes the waste of energy and other idling-resources.Visible, study the energy saving resources allocation algorithm under low load imbalance scene, significant with the energy saving realizing network for the availability of frequency spectrum improving whole communication network.
Summary of the invention
In view of this, the object of the present invention is to provide the multiple cell resource allocation algorithm based on efficiency in a kind of LTE system, problem to be solved is: be uncertain because user terminal enters certain community, simultaneously each user is also different to the demand of business, and this just causes the difference of Resourse Distribute between the load imbalance of each community and user.User is had for the community that load is heavy do not reach minimum data rate and require and newly arrive user to access, and the resource of the low community of load is idle, the user that channel quality is good simultaneously may not obtain the high PRB of achievable rate, so just causes the waste of energy and other idling-resources.The resource allocation algorithm based on efficiency that the present invention proposes, not only increases the resource utilization of whole system, also achieves the energy saving of system.
For achieving the above object, the invention provides following technical scheme:
Based on a multiple cell resource allocation algorithm for efficiency in LTE system, in the method, set up an adjacent cell list in each cell, in this list, store the position of neighbor cell, load, PRB resource information; Periodically mutual above-mentioned information each other between community, to upgrade oneself adjacent cell list in time; Judge in community, whether to there is the user not meeting minimum data rate, if existed, for the PRB outside its allocation, if the idle PRB of this community is inadequate, changeable user (boundary user) in overlapping region is switched to target adjacent section, to meet the minimum data rate requirement of each user, ensure the QOS of user simultaneously; By changeable user the poorest for the channel quality of community, user place best for channel quality being switched to corresponding target adjacent section, reserve more PRB resource can to the best user of channel quality, so improve multiple cell and data rate; In community, that improve two users to the best user of channel quality and exchange energy with not transferable PRB that is data rate by the transferable PRB of all residue PRB, other users is moved, improve the data rate of community.
Further, in the method, inter-cell user changing method specifically comprises the following steps:
1) in the s of community, calculate the achievable rate of each user on each PRB distributed, obtain total speed that user obtains, judge whether user reaches minimum data rate requirement, for not meeting the requirements of user, sort from low to high by the difference of its minimum data rate requirement with the actual data rate obtained, composition list K1; If also available free PRB, from idle PRB list, choose the user that the minimum PRB of achievable rate gives foremost in list K1, until the minimum data rate of this user requires to be met; If K1 is empty, just forward step 4 to), otherwise just forward step 2 to);
2) if there is no enough idle PRB in the s of community, but still have the user less than sufficient minimum data rate requirement, then check the boundary user list UE_List (being in the user of the overlapping region of community s and its adjacent cell) of community s, judge whether there is switchable user in this list, if had, then optimal user is selected to be switched to target adjacent section s i, s ithe condition met is: the user that its channel quality is best:
k = min { k s 1 , k s 2 ...... k s i } , k s 1 ≥ k s 2 ≥ ...... ≥ k s i , Wherein represent community s ithe best user of channel quality, and s iit is available neighbor cell; Distribute PRB as stated above, until all users reach minimum data rate requirement in community, or UE_list is empty;
3) after above-mentioned finishing switching, for set the community that the best user of middle channel quality is corresponding, if judge changeable user the poorest for channel quality in the UE_List list of this community to be switched to best target cell, under respective all residue PRB are all given the condition of the best user of respective channel quality by Liang Ge community, whether being improved than before switching with data rate of Liang Ge community, just switch if be improved, otherwise do not switch; If the traversal of above-mentioned switching has all been carried out in all communities, just carry out step 4);
4) for each community, residue PRB all in community is all given the user that in this community, channel quality is best.
Further, in the method, between intra-cell users, PRB transfer and exchange algorithm specifically comprise the following steps:
1) travel through each user, distinguish the transferable PRB of user and not transferable PRB;
2) the transferable PRB of other users in community is transferred to the best user of channel quality;
3) for not transferable PRB, if exchanged by the home subscriber of certain two not transferable PRB, these two users improve with data rate, and two users still meet minimum data rate requirement, then exchange, otherwise do not exchange.
Beneficial effect of the present invention is: method of the present invention is by the PRB transfer between twice inter-cell user handoff algorithms and intra-cell users and exchange algorithm, make low load between multiple cell, unbalanced problem is resolved, improve the resource utilization of multiple cell, and according to channel quality conditions handover between cells user, can reach the high PRB of data rate simultaneously and distribute to the best user of channel quality to maximise the data rate of community, and then the energy consumption realizing whole system reduces
Accompanying drawing explanation
In order to make object of the present invention, technical scheme and beneficial effect clearly, the invention provides following accompanying drawing and being described:
Fig. 1 is twice inter-cell user handoff algorithms flow chart;
Fig. 2 is PRB transfer and exchange algorithm flow chart between intra-cell users.
Embodiment
In method of the present invention, the employing of twice inter-cell user handoff algorithms, specific descriptions are: for the community having the best user of channel quality, user poor for channel quality in this community is switched to Target cell, this Target cell can meet the minimum data rate requirement being switched user, and this Target cell is present in the neighbor list of cell-of-origin; PRB transfer between intra-cell users and the employing of exchange algorithm, specifically describe as the transferable PRB of other users is transferred to the user that in this community, channel quality is best, exchange energy make two users with the not transferable PRB of data rate increase.
First time switches: calculate each user and whether reach minimum data rate requirement, gives the PRB do not reached outside user's allocation of minimum data rate requirement.If there is no sufficient extra PRB in community, just the changeable user being in overlapping region in this community is switched to best neighbor cell; After above-mentioned switching completes, implement second time to switch, calculate the channel quality of each user, select the user that the channel quality conditions of each community is best, these users are sorted from high to low by channel quality, if judge the changeable user in first of this sequence community that user is corresponding to be switched to best target cell.
PRB transfer between intra-cell users and exchange algorithm comprise: travel through each user, distinguish the transferable PRB of user and not transferable PRB; The transferable PRB of other users is transferred to the best user of channel quality; For not transferable PRB, according to channel quality from high to low, travel through all users, if the not transferable PRB of certain two user is exchanged, calculate former and later two users of transfer with the difference d of data rate, select two users corresponding to maximum d value to exchange, require d>0 here.
Below in conjunction with accompanying drawing, the preferred embodiments of the present invention are described in detail.
In the present embodiment, suppose that community adds up to S, each community PRB adds up to N, and total number of users is K, and the bandwidth of each PRB is B.With represent the transmitting power of the n-th PRB on user k of community s, use represent the signal to noise ratio under the unit power of n-th PRB of community s on user k, use P srepresent the static circuit loss of community s.If n-th PRB of community s distributes to user k, then otherwise if user k belongs to community s, then otherwise
Fig. 1 is twice inter-cell user handoff algorithms flow chart, and as shown in the figure, twice inter-cell user handoff algorithms concrete steps comprises:
(1) by formula C1: judge in the s of community, whether to there is the user not reaching minimum data rate requirement, wherein it is the minimum data rate requirement of user k.All data rates are less than user press value, ascending sequence, composition list K1.
(2) judge whether there is the idle PRB resource be not assigned with in the s of community, if had, then according to formula C2:B*log 2(1+P s,n* I s,n), calculate the achievable rate on each PRB, by PRB according to the ascending sequence of achievable rate, form idle PRB list PRB_List.The PRB of foremost in PRB_List is given first user in K1, until this user meets the PRB distribution that next user is carried out in minimum data rate requirement again.
(3) judge whether K1 and PRB_List list is empty.If K1 list is empty, and PRB_List list is not empty, then forward step (4) to; If PRB_List is empty, and K1 is not empty, then check UE_List list.For each user in UE_List list, judge whether user can be switched to target adjacent section, judgment condition is: this user is the boundary user of target adjacent section, and after this user is switched to this target adjacent section, all users in this adjacent cell can meet the minimum data rate requirement of formula C1.If meet judgment condition, then this user is exactly switchable user.Select the user that channel quality in target adjacent section that in the s of community, all changeable users are corresponding is best, the user these selected sorts from low to high by channel quality again, according to this sequence, find corresponding changeable user, form changeable user list UE_Listremove.The user of foremost in this list is selected to carry out the switching of minizone, until K1 list is empty or UE_Listremove list is sky.
(4) after above-mentioned distribution terminates, for set the community that first user is corresponding, judge that whether the UE_Listremove list of this community is empty, if be not empty, if then judge last user in UE_Listremove to be switched to target adjacent section, under in Dou Jiang community, Liang Ge community, all residue PRB give the condition of the best user of respective channel quality, whether being improved, by public affairs than before switching with data rate of Liang Ge community Σ k = 1 K Σ n = 1 N I k S 1 I k S 1 , n * B * log 2 ( 1 + I k S 1 , n * I k S 1 , n ) Σ k = 1 K Σ n = 1 N b k S 2 a k S 2 , n * B * log 2 ( 1 + I k S 2 , n * I k S 2 , n ) Be labeled as C4, calculate Liang Ge community and data rate, and if data rate be improved and just switch, otherwise not switch, until the traversal of above-mentioned switching has all been carried out in all communities.
(5) for each community, residue PRB all in community is all given the user that in this community, channel quality is best.
This algorithm adopts the changing method of twice user in minizone, and each switching all maximizedly leaves PRB resource for channel quality best user, both ensure that the requirement of user's minimum data rate, turn improve community and data rate, thus realizes energy-conservation.
Accompanying drawing 2 is that the PRB between user shifts and exchange algorithm flow chart.
After the obtaining improve with data rate of above-mentioned multiple cell, improved the data rate of each community by PRB between user transfer and exchange algorithm.PRB transfer between user and the step of exchange algorithm are specially:
(1) travel through each user of each community, distinguish the transferable PRB of user and not transferable PRB with formula C1 according to Claim 8.
(2) the transferable PRB of other users in community is transferred to the top-quality user of this cell channel.
(3) for PRB not transferable in community, if judge the home subscriber of certain two not transferable PRB to exchange, whether these two users still meet the minimum data rate requirement of formula C1, judge whether improving with data rate, by formula C5 of these two users simultaneously: Σ n = 1 N a k 1 s , n * B * log 2 ( 1 + P k 1 s , n * I k 1 s , n ) + Σ n = 1 N a k 2 s , n * B * log 2 ( 1 + P k 2 s , n * I k 2 s , n ) Calculate two user's and data rate.Just exchange if met, otherwise do not exchange.
This algorithm, at Intra-cell, by the mutual and transfer of PRB between user, makes improving with data rate of user, so improve community and data rate, realize energy-conservation.
What finally illustrate is, above preferred embodiment is only in order to illustrate technical scheme of the present invention and unrestricted, although by above preferred embodiment to invention has been detailed description, but those skilled in the art are to be understood that, various change can be made to it in the form and details, and not depart from claims of the present invention limited range.

Claims (3)

1. in LTE system based on a multiple cell resource allocation algorithm for efficiency, it is characterized in that: in the method, set up an adjacent cell list in each cell, in this list, store the position of neighbor cell, load, PRB resource information; Periodically mutual above-mentioned information each other between community, to upgrade oneself adjacent cell list in time; Judge in community, whether to there is the user not meeting minimum data rate, if existed, for the PRB outside its allocation, if the idle PRB of this community is inadequate, changeable user in overlapping region is switched to target adjacent section, to meet the minimum data rate requirement of each user, ensure the QOS of user simultaneously; By changeable user the poorest for the channel quality of community, user place best for channel quality being switched to corresponding target adjacent section, reserve more PRB resource can to the best user of channel quality, so improve multiple cell and data rate; In community, that improve two users to the best user of channel quality and exchange energy with not transferable PRB that is data rate by the transferable PRB of all residue PRB, other users is moved, improve the data rate of community.
2. in a kind of LTE system according to claim 1 based on the multiple cell resource allocation algorithm of efficiency, it is characterized in that: in the method, inter-cell user changing method specifically comprises the following steps:
1) in the s of community, calculate the achievable rate of each user on each PRB distributed, obtain total speed that user obtains, judge whether user reaches minimum data rate requirement, for not meeting the requirements of user, sort from low to high by the difference of its minimum data rate requirement with the actual data rate obtained, composition list K1; If also available free PRB, from idle PRB list, choose the user that the minimum PRB of achievable rate gives foremost in list K1, until the minimum data rate of this user requires to be met; If K1 is empty, just forward step 4 to), otherwise just forward step 2 to);
2) if there is no enough idle PRB in the s of community, but still have the user less than sufficient minimum data rate requirement, then check the boundary user list UE_List of community s, judge whether there is switchable user in this list, if had, then optimal user is selected to be switched to target adjacent section S i, S ithe condition met is: the user that its channel quality is best:
wherein represent community S ithe best user of channel quality, and S iit is available neighbor cell; Distribute PRB as stated above, until all users reach minimum data rate requirement in community, or UE_list is empty;
3) after above-mentioned finishing switching, for set the community that the best user of middle channel quality is corresponding, if judge changeable user the poorest for channel quality in the UE_List list of this community to be switched to best target cell, under respective all residue PRB are all given the condition of the best user of respective channel quality by Liang Ge community, whether being improved than before switching with data rate of Liang Ge community, just switch if be improved, otherwise do not switch; If the traversal of above-mentioned switching has all been carried out in all communities, just carry out step 4);
4) for each community, residue PRB all in community is all given the user that in this community, channel quality is best.
3. in a kind of LTE system according to claim 1 based on the multiple cell resource allocation algorithm of efficiency, it is characterized in that: in the method, between intra-cell users PRB transfer and exchange algorithm specifically comprise the following steps:
1) travel through each user, distinguish the transferable PRB of user and not transferable PRB;
2) the transferable PRB of other users in community is transferred to the best user of channel quality;
3) for not transferable PRB, if exchanged by the home subscriber of certain two not transferable PRB, these two users improve with data rate, and two users still meet minimum data rate requirement, then exchange, otherwise do not exchange.
CN201510687952.XA 2015-10-21 2015-10-21 Multiple cell resource allocation methods based on efficiency in a kind of LTE system Active CN105163351B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510687952.XA CN105163351B (en) 2015-10-21 2015-10-21 Multiple cell resource allocation methods based on efficiency in a kind of LTE system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510687952.XA CN105163351B (en) 2015-10-21 2015-10-21 Multiple cell resource allocation methods based on efficiency in a kind of LTE system

Publications (2)

Publication Number Publication Date
CN105163351A true CN105163351A (en) 2015-12-16
CN105163351B CN105163351B (en) 2018-09-18

Family

ID=54804084

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510687952.XA Active CN105163351B (en) 2015-10-21 2015-10-21 Multiple cell resource allocation methods based on efficiency in a kind of LTE system

Country Status (1)

Country Link
CN (1) CN105163351B (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105979549A (en) * 2016-07-06 2016-09-28 北京信息科技大学 Load balancing method and device
CN112153654A (en) * 2019-06-26 2020-12-29 大唐移动通信设备有限公司 Method and device for controlling resources of cell
CN109586861B (en) * 2017-09-28 2021-05-25 中国移动通信集团山东有限公司 Load balancing method and device for carrier aggregation system

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101742565A (en) * 2009-12-11 2010-06-16 北京北方烽火科技有限公司 Method for balancing inter-cell load in LTE mobile communication network
CN102791002A (en) * 2012-08-01 2012-11-21 重庆邮电大学 Energy efficiency-based resource allocation method for LTE network
CN102905307A (en) * 2012-09-12 2013-01-30 北京邮电大学 System for realizing joint optimization of neighbor cell list and load balance
CN104918287A (en) * 2015-06-15 2015-09-16 厦门大学 Load balancing method and device

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101742565A (en) * 2009-12-11 2010-06-16 北京北方烽火科技有限公司 Method for balancing inter-cell load in LTE mobile communication network
CN102791002A (en) * 2012-08-01 2012-11-21 重庆邮电大学 Energy efficiency-based resource allocation method for LTE network
CN102905307A (en) * 2012-09-12 2013-01-30 北京邮电大学 System for realizing joint optimization of neighbor cell list and load balance
CN104918287A (en) * 2015-06-15 2015-09-16 厦门大学 Load balancing method and device

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
付锦华等: "基于能效的多小区LTE系统资源分配算法", 《计算机应用研究》 *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105979549A (en) * 2016-07-06 2016-09-28 北京信息科技大学 Load balancing method and device
CN105979549B (en) * 2016-07-06 2019-11-15 北京信息科技大学 A kind of load-balancing method and device
CN109586861B (en) * 2017-09-28 2021-05-25 中国移动通信集团山东有限公司 Load balancing method and device for carrier aggregation system
CN112153654A (en) * 2019-06-26 2020-12-29 大唐移动通信设备有限公司 Method and device for controlling resources of cell

Also Published As

Publication number Publication date
CN105163351B (en) 2018-09-18

Similar Documents

Publication Publication Date Title
Zhang et al. Energy-efficient resource allocation in NOMA heterogeneous networks
CN102791002B (en) Based on the resource allocation methods of efficiency in LTE network
CN1992962B (en) Inter-cell interference coordination method based on evolution network architecture of 3G system
CN101600212B (en) Method for improving soft-frequency reuse in OFDM system
CN102098728B (en) Mobile load balancing method
CN101415207B (en) Method, apparatus and base station for balancing load of honeycomb collaboration relay network
CN102905317B (en) Mobile load balancing method used for multiple cells
CN103024921B (en) A kind of dispatching method divided into groups based on CQI feedback parameter and SINR numerical value
CN104902431B (en) A kind of LTE network mid-span cell D2D communication spectrum distribution methods
CN106454850A (en) Resource distribution method for energy efficiency optimization of honeycomb heterogeneous network
CN102017682A (en) Downlink inter-cell interference coordination method and base station
CN101784078A (en) Load balancing and throughput optimization method in mobile communication system
CN102098679B (en) Method for reducing long term evolution (LTE) radio communication system cell interference by using cognitive technology
CN103281786B (en) The method for optimizing resources of a kind of Home eNodeB double-layer network based on energy efficiency
CN103118424A (en) Long term evolution (LTE) uplink power control method and control system based on interference consciousness
CN103052113B (en) Collaborative load balancing method of wireless access network system based on RAN (Residential Access Network) framework
CN104640185B (en) A kind of cell dormancy power-economizing method based on base station collaboration
CN102821391A (en) Distance ratio based D2D (dimension to dimension) link spectrum allocation method
CN104540178B (en) One kind cognition heterogeneous network joint spectrum switching and power distribution method
Li et al. An advanced spectrum allocation algorithm for the across-cell D2D communication in LTE network with higher throughput
CN105163351A (en) Multi-cell resource allocation algorithm based on energy efficiency in LTE system
CN102215492B (en) User-feedback-based multi-cell resource allocation method
CN103313309B (en) A kind of minizone D2D user model system of selection based on load
CN101711033A (en) Dynamic channel allocating method applicable for perceiving radio network and system thereof
Li et al. Resource sharing for cellular-assisted D2D communications with imperfect CSI: a many-to-many strategy

Legal Events

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