CN105163351B - Multiple cell resource allocation methods based on efficiency in a kind of LTE system - Google Patents
Multiple cell resource allocation methods based on efficiency in a kind of LTE system Download PDFInfo
- Publication number
- CN105163351B CN105163351B CN201510687952.XA CN201510687952A CN105163351B CN 105163351 B CN105163351 B CN 105163351B CN 201510687952 A CN201510687952 A CN 201510687952A CN 105163351 B CN105163351 B CN 105163351B
- Authority
- CN
- China
- Prior art keywords
- cell
- user
- prb
- data rate
- list
- 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.)
- Active
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 present invention relates to the multiple cell resource allocation methods based on efficiency in a kind of LTE system, belong to wireless communication technology field.This method establishes an adjacent cell list in each cell, the position of storage neighbor cell, load, PRB resource informations in the list, mutual above- mentioned information is periodically interacted between cell, so as to the adjacent cell list of oneself that timely updates;Judge, if the idle PRB of this cell is inadequate, the changeable user in overlapping region to be switched to target adjacent section if it does, distributing additional PRB for it with the presence or absence of the user for not meeting minimum data rate in cell;In cell, two user's and data rate not transferable PRB are improved to the best user of channel quality and exchange energy by moving the transferable PRB of all residue PRB, other users, improving the data rate of cell.
Description
Technical field
The invention belongs to wireless communication technology field, it is related to the multiple cell resource allocation based on efficiency in a kind of LTE system
Method.
Background technology
LTE technologies have lower propagation delay time, higher data speed mainly using OFDM and MIMO as core technology basis
The features such as network architecture of rate, the capacity of bigger and coverage rate, less running cost and optimization, in the world
To rapid development, become the mainstream technology of global radio mobile communication.However as the continuous expansion of LTE cordless communication network scales
Big and number of users fierce growth, the energy that LTE wireless communication systems are consumed also quickly are going up, and bring huge open
Pin, meanwhile, the greenhouse gases amount of system discharge is also increasing, and exacerbates environmental pollution.The work gesture of communications industry energy-saving and emission-reduction
Must go, it is very urgent.
In relation to being institute's accounting in entire communication network energy consumption studies have shown that the energy consumption of base station accounts for about the 57% of system total energy consumption
The highest part of example, it is seen then that the capacity usage ratio for improving base station reduces the energy consumption of base station, is to realize that entire communication network is energy saving to subtract
The key component of row.In the lte networks, the resource allocation of uplink downlink is controlled by base station, therefore, effective and reasonable
Resource allocation algorithm is particularly important for the energy expenditure for reducing base station side.
Traditional resource allocation algorithm is all based on greatly equitable proportion, max carrier to interference, poll scheduling algorithm, is considering user
Fairness under the premise of, to improve the handling capacity of system as target, seldom consider the energy consumption problem of base station.In current green communications
Epoch, by study base station energy-saving resource allocation algorithm come reduce base station energy consumption, reduce operator cost, reduce ring
It pollutes in border, it has also become a main trend of green communications industry.
In recent years, the research of the resource allocation algorithm based on efficiency mainly has:(1) minimum transmission power (MP) resource is calculated
Method:What the algorithm considered is that every bit information is transmitted required minimum transmission power, and it is every that resource block RB is given progress
The user of transimission power minimum needed for bit information transmission, to reach energy-efficient purpose.The algorithm is needed in the QOS for ensureing user
While fairness of summing, reduce the consumption of energy.(2) joint considers the resource allocation of modulating-coding grade and power control
Algorithm:The algorithm is meeting user QOS according to the real time channel quality condition of user, adaptive selection modulation coding scheme
Under the conditions of, so that overall transmission power is reached minimum.The algorithm is not increasing inhibiting inter-cell interference to play certain effect
Under the premise of bandwidth, cell is made to contain more users.However the Energy Saving Algorithm does not have suitable for peak load scene
There are the factors such as low-load, the lack of uniformity for considering minizone.
In practical communication, it is uncertain, while demand of each user to business that user terminal, which enters some cell,
It is different, this results in the difference of resource allocation between the load imbalance and user of each cell.If base station is still
It is user's transmission data according to ordinary working method, then having user for the cell of load weight is not achieved minimum data speed
Rate is required and can not newly be accessed to user, and the resource for loading low cell is idle, while the user that channel quality is good is not
The high PRB of achievable rate can be obtained, the waste of energy and other idling-resources is thus caused.As it can be seen that research low-load is not
Energy saving resources allocation algorithm under balancing scenario, for improving the availability of frequency spectrum of entire communication network and realizing the energy section of network
About it is of great significance.
Invention content
In view of this, the purpose of the present invention is to provide the multiple cell resource allocation sides based on efficiency in a kind of LTE system
Method, problem to be solved are:It is uncertain since user terminal enters some cell, while each user is to the need of business
It asks and is also different, this results in the difference of resource allocation between the load imbalance and user of each cell.For load
The cell of weight has user and minimum data rate requirement is not achieved and can not newly be accessed to user, and loads the money of low cell
Source is idle, while the user that channel quality is good may not be able to obtain the high PRB of achievable rate, thus cause energy and its
The waste of his idling-resource.Resource allocation algorithm proposed by the present invention based on efficiency, not only increases the resource of whole system
Utilization rate also achieves the energy saving of system.
In order to achieve the above objectives, the present invention provides the following technical solutions:
The multiple cell resource allocation methods based on efficiency are established in each cell in the method in a kind of LTE system
One adjacent cell list, the position of storage neighbor cell, load, PRB resource informations in the list;It is periodically interactive between cell
Mutual above- mentioned information, so as to the adjacent cell list of oneself that timely updates;Judge to whether there is in cell and does not meet minimum data
The user of rate, if it does, additional PRB is distributed for it, it, will be in overlapping region if the idle PRB of this cell is inadequate
Changeable user (boundary user) be switched to target adjacent section, to meet the minimum data rate requirement of each user, simultaneously
Ensure the QOS of user;By the way that the worst changeable user of the channel quality of cell where the best user of channel quality is switched
To corresponding target adjacent section, more PRB resources can be reserved to the best user of channel quality, and then improve multiple cell
And data rate;It is best to channel quality by moving the transferable PRB of all residue PRB, other users in cell
User and exchange energy improve two user's and data rate not transferable PRB, improve the data rate of cell.
Further, in the method, inter-cell user switching method specifically includes following steps:
1) in cell s, achievable rate of each user on allocated each PRB is calculated, finds out user's acquisition
Total rate, judges whether user reaches minimum data rate requirement, for the user not up to required, by its minimum data rate
It is required that the difference with the data rate actually obtained sorts from low to high, composition list K1;If also available free PRB, from the free time
In PRB lists, the PRB for choosing achievable rate minimum gives the user of foremost in list K1, until the minimum data of the user
Rate requirement is met;If K1 is sky, step 4) is branched to, step 2) is otherwise branched to;
If 2) idle PRB not enough in cell s, but still there is the user for not meeting minimum data rate requirement, then
The boundary user list UE_List (user in the overlapping region of cell s and its adjacent cell) for checking cell s, judges the row
Whether changeable user is had in table, if so, optimal user is then selected to be switched to target adjacent section si, siThe condition of satisfaction is:
The best user of its channel quality:
WhereinIndicate cell siChannel
Top-quality user, and siIt is available neighbor cell;PRB is distributed as stated above, until all users reach in cell
Minimum data rate requires or UE_list is sky;
3) after above-mentioned finishing switching, for setThe best user couple of middle channel quality
The cell answered, if judging the worst changeable user of channel quality in cell UE_List lists being switched to optimum target
Cell, under conditions of respective all residue PRB are all given the best user of respective channel quality by two cells, two cells
And data rate whether than being improved before switching, switched over if being improved, otherwise without switching;If all small
Area has all carried out the traversal of above-mentioned switching, with regard to carrying out step 4);
4) for each cell, remaining PRB all in cell is all given into the use that channel quality is best in the cell
Family.
Further, in the method, PRB transfers and exchange algorithm specifically include following steps between intra-cell users:
1) each user is traversed, the transferable PRB and not transferable PRB of user are distinguished;
2) the transferable PRB of other users in cell is transferred to the best user of channel quality;
3) for not transferable PRB, if the home subscriber of certain two not transferable PRB is exchanged, the two users
And data rate improve, and two users still meet minimum data rate requirement, then are interchangeable, otherwise without mutual
It changes.
The beneficial effects of the present invention are:Method of the present invention passes through inter-cell user handoff algorithms and cell twice
PRB transfers between interior user and exchange algorithm, make low-load between multiple cell, unbalanced problem be resolved, how small improve
The resource utilization in area, and according to channel quality conditions in handover between cells user, while will divide up to the high PRB of data rate
The best user of dispensing channel quality realizes that the energy consumption of whole system reduces to maximise the data rate of cell.
Description of the drawings
In order to keep the purpose of the present invention, technical solution and advantageous effect clearer, the present invention provides following attached drawing and carries out
Explanation:
Fig. 1 is inter-cell user handoff algorithms flow chart twice;
Fig. 2 PRB transfers and exchange algorithm flow chart between intra-cell users.
Specific implementation mode
In method of the present invention, the use of inter-cell user handoff algorithms, is specifically described as twice:For possessing
The poor user of channel quality in the cell is switched to Target cell by the cell of the best user of channel quality, and the target is small
Area can meet the minimum data rate requirement for being switched user, and the Target cell is present in the neighbor list of cell-of-origin;It is small
The use of PRB transfer and exchange algorithm in area between user, is specifically described as the transferable PRB of other users being transferred to this small
The best user of channel quality in area, exchange energy make two users' and the increased not transferable PRB of data rate.
Switching for the first time is:It calculates whether each user reaches minimum data rate requirement, gives not up to minimum data speed
The user that rate requires distributes additional PRB.If insufficient additional PRB in cell will just be in overlay region in the cell
The changeable user in domain is switched to best neighbor cell;After the completion of above-mentioned switching, implement second and switch, calculates each use
The channel quality at family selects the best user of the channel quality conditions of each cell, to these users by channel quality by height to
Low sequence, if judging the changeable user in the corresponding cell of first user of the sequence being switched to optimum target small
Area.
PRB transfers and exchange algorithm between intra-cell users include:Each user is traversed, the transferable PRB of user is distinguished
Not transferable PRB;The transferable PRB of other users is transferred to the best user of channel quality;For not transferable PRB,
From high to low according to channel quality, all users are traversed, if the not transferable PRB of certain two user exchanged, calculates and turns
Former and later two users' and data rate difference d is moved, selects corresponding two users of maximum d values to be interchangeable, requires d here
>0。
Below in conjunction with attached drawing, the preferred embodiment of the present invention is described in detail.
In this example, it is assumed that cell sum be S, each cell PRB sums be N, total number of users K, each PRB's
Bandwidth is B.WithIt indicates transmission powers of n-th of the PRB of cell s on user k, usesIndicate n-th of PRB of cell s
The signal-to-noise ratio under unit power on user k, uses PsIndicate the static circuit loss of cell s.If n-th of PRB of cell s
User k is distributed to, thenOtherwiseIf user k belongs to cell s,Otherwise
Fig. 1 is inter-cell user handoff algorithms flow chart twice, as shown, inter-cell user handoff algorithms are specific twice
Step includes:
(1) by formula C1:Judge to whether there is in cell s and not reach
The user required to minimum data rate, whereinIt is the minimum data rate requirement of user k.All data rates are less thanUser pressValue, ascending sequence, composition list K1.
(2) the idle PRB resources for whether having unassigned in cell s are judged, if so, then according to formula C2:B*log2
(1+Ps,n*Is,n), the achievable rate on each PRB is calculated, by PRB according to the ascending sequence of achievable rate, forms free time PRB
List PRB_List.The PRB of foremost in PRB_List is given into first user in K1, until the user meets minimum
Data rate requirement carries out the PRB distribution of next user again.
(3) judge whether K1 and PRB_List lists are empty.If list is empty by K1, and PRB_List lists are not sky,
Then go to step (4);If PRB_List is sky, and K1 is not sky, then checks UE_List lists.For in UE_List lists
Each user, judge whether user can be switched to target adjacent section, judgment condition is:The user is target adjacent section
Boundary user, and after the user is switched to the target adjacent section, all users in the adjacent cell can meet formula C1's
Minimum data rate requirement.If meeting judgment condition, which is exactly changeable user.Select it is all in cell s can
Switch the best user of channel quality in the corresponding target adjacent section of user, the user that these are selected again by channel quality by
Low to high sequence finds corresponding changeable user according to the sequence, forms and user list UE_Listremove can be switched.Choosing
The user for selecting foremost in the list carries out the switching of minizone, until list is empty or UE_Listremove lists are by K1
It is empty.
(4) after above-mentioned distribution, for setThe corresponding cell of first user,
Judge whether the UE_Listremove lists of the cell are empty, it, will be in UE_Listremove if judged if not being sky
The last one user is switched to target adjacent section, and all residue PRB in cell are all given respective channel quality in two cells
Under conditions of best user, two cells and data rate whether than being improved before switching, by formulaIt is labeled as
C4, calculate two cells and data rate, it is switched over if being improved with data rate, otherwise without switching, directly
The traversal of above-mentioned switching has all been carried out to all cells.
(5) for each cell, remaining PRB all in cell is all given into the use that channel quality is best in the cell
Family.
Switching method of this algorithm using user twice in minizone, every time switching all maximumlly leave PRB resources for
The best user of channel quality not only ensure that user's minimum data rate requirement, but improve cell and data rate, to
It realizes energy saving.
Attached drawing 2 is PRB transfers and the exchange algorithm flow chart between user.
After above-mentioned multiple cell is improved with data rate, improved with exchange algorithm by the PRB transfers between user
The data rate of each cell.PRB transfers and the step of exchange algorithm between user are specially:
(1) each user for traversing each cell, the transferable PRB and not transferable PRB of user are distinguished according to formula C1.
(2) the transferable PRB of other users in cell is transferred to the top-quality user of the cell channel.
(3) for not transferable PRB in cell, if judged the home subscriber of certain two not transferable PRB is mutual
It changes, whether the two users still meet the minimum data rate requirement of formula C1, while judging the two users' and data
Whether rate improves, by formula C5:
Calculate two user's and data rate.It is interchangeable if meeting, otherwise without exchanging.
The algorithm passes through interactions and transfer of the PRB between user in Intra-cell so that user's carries with data rate
Height, so improve cell and data rate, realize it is energy saving.
Finally illustrate, preferred embodiment above is merely illustrative of the technical solution of the present invention and unrestricted, although logical
It crosses above preferred embodiment the present invention is described in detail, however, those skilled in the art should understand that, can be
Various changes are made to it in form and in details, without departing from claims of the present invention limited range.
Claims (2)
1. the multiple cell resource allocation methods based on efficiency in a kind of LTE system, it is characterised in that:In the method, each
An adjacent cell list is established in cell, the position of storage neighbor cell, load, PRB resource informations in the list;Between cell
The periodically mutual above- mentioned information of interaction, so as to the adjacent cell list of oneself that timely updates;Judge in cell with the presence or absence of less than
The user of sufficient minimum data rate, if it does, additional PRB is distributed for it, it, will if the idle PRB of this cell is inadequate
Changeable user in overlapping region is switched to target adjacent section, to meet the minimum data rate requirement of each user, simultaneously
Ensure the QOS of user;By the way that the worst changeable user of the channel quality of cell where the best user of channel quality is switched
To corresponding target adjacent section, more PRB resources can be reserved to the best user of channel quality, and then improve multiple cell
And data rate;It is best to channel quality by moving the transferable PRB of all residue PRB, other users in cell
User and exchange energy improve two user's and data rate not transferable PRB, improve the data rate of cell;
In the method, inter-cell user switching method specifically includes following steps:
1) in cell s, achievable rate of each user on allocated each PRB is calculated, finds out total speed of user's acquisition
Rate, judges whether user reaches minimum data rate requirement, for the user not up to required, by its minimum data rate requirement
It sorts from low to high with the difference of the data rate actually obtained, composition list K1;If also available free PRB, arranged from idle PRB
In table, the PRB for choosing achievable rate minimum gives the user of foremost in list K1, until the minimum data rate of the user is wanted
It asks and is met;If K1 is sky, step 4) is branched to, step 2) is otherwise branched to;
If 2) idle PRB not enough in cell s, but still there is the user for not meeting minimum data rate requirement, then checks
The boundary user list UE_List of cell s, judges whether there is changeable user in the list, is used if so, then selection is best
Family is switched to target adjacent section si, siThe condition of satisfaction is:The best user of its channel quality:
WhereinIndicate cell siChannel quality most
Good user, and siIt is available neighbor cell;PRB is distributed as stated above, until all users reach minimum number in cell
It is sky according to rate requirement or UE_list;
3) after above-mentioned finishing switching, for setThe best user of middle channel quality is corresponding small
Area, if judging the worst changeable user of channel quality in cell UE_List lists being switched to best target cell,
Under conditions of respective all residue PRB are all given the best user of respective channel quality by two cells, the sum number of two cells
According to rate whether than being improved before switching, switched over if being improved, otherwise without switching;If all cells all into
The traversal of above-mentioned switching is gone, with regard to carrying out step 4);
4) for each cell, remaining PRB all in cell is all given into the user that channel quality is best in the cell.
2. the multiple cell resource allocation methods based on efficiency, feature exist in a kind of LTE system according to claim 1
In:In the method, PRB transfers and exchange algorithm specifically include following steps between intra-cell users:
1) each user is traversed, the transferable PRB and not transferable PRB of user are distinguished;
2) the transferable PRB of other users in cell is transferred to the best user of channel quality;
3) for not transferable PRB, if the home subscriber of certain two not transferable PRB is exchanged, the sum of the two users
Data rate improves, and two users still meet minimum data rate requirement, then are interchangeable, otherwise without exchanging.
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 CN105163351A (en) | 2015-12-16 |
CN105163351B true 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) |
Families Citing this family (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
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 |
CN112153654B (en) * | 2019-06-26 | 2022-03-25 | 大唐移动通信设备有限公司 | Method and device for controlling resources of cell |
Citations (4)
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 |
-
2015
- 2015-10-21 CN CN201510687952.XA patent/CN105163351B/en active Active
Patent Citations (4)
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)
Title |
---|
基于能效的多小区LTE系统资源分配算法;付锦华等;《计算机应用研究》;20150430;第32卷(第4期);第2节、图2 * |
Also Published As
Publication number | Publication date |
---|---|
CN105163351A (en) | 2015-12-16 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Wu et al. | Green-oriented traffic offloading through dual connectivity in future heterogeneous small cell networks | |
CN104737608B (en) | System and method for interference coordination between dynamic cell | |
CN102098728B (en) | Mobile load balancing method | |
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 | |
Wen et al. | Energy-efficient device-to-device edge computing network: An approach offloading both traffic and computation | |
CN102088736A (en) | User position list-based method for selectively multiplexing multiple honeycomb user resources for device to device (D2D) user pairs | |
CN102244873A (en) | Method for selecting resource multiplexing modes for D2D (Device-to-Device) user pair and cellular user based on position of D2D user pair | |
CN110493757A (en) | The mobile edge calculations discharging method of system energy consumption is reduced under single server | |
CN104918257B (en) | Relaying cooperation isomery cellular network D2D communication resource allocation methods | |
CN106304093A (en) | Frequency spectrum optimization system and method is shared between a kind of network | |
CN101754383B (en) | Structuring method of CoMP cell cluster | |
CN105163351B (en) | Multiple cell resource allocation methods based on efficiency in a kind of LTE system | |
CN104902431A (en) | Cross-cell D2D communication spectrum distributing method in LTE network | |
CN101511107A (en) | Frequency planning method based on synergic multi-point single-user multi-input multi-output | |
Oikonomakou et al. | Cooperative base station switching off in multi-operator shared heterogeneous network | |
CN102905317B (en) | Mobile load balancing method used for multiple cells | |
CN102098679B (en) | Method for reducing long term evolution (LTE) radio communication system cell interference by using cognitive technology | |
Yao et al. | Achieving high throughput with predictive resource allocation | |
CN104918207B (en) | More D2D communication resource allocation methods based on frequency spectrum resource distribution in heterogeneous network | |
Hou et al. | Caching and resource allocation in small cell networks | |
Li et al. | Resource sharing for cellular-assisted D2D communications with imperfect CSI: a many-to-many strategy | |
CN106332124A (en) | Method for reducing energy consumption of wireless network and macro base station | |
Zhang et al. | Congestion-aware user-centric cooperative base station selection in ultra-dense networks | |
CN112543498B (en) | Power self-adaptive distribution method based on layered game model |
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 |