CN102905317B - Mobile load balancing method used for multiple cells - Google Patents

Mobile load balancing method used for multiple cells Download PDF

Info

Publication number
CN102905317B
CN102905317B CN201210414682.1A CN201210414682A CN102905317B CN 102905317 B CN102905317 B CN 102905317B CN 201210414682 A CN201210414682 A CN 201210414682A CN 102905317 B CN102905317 B CN 102905317B
Authority
CN
China
Prior art keywords
cell
load
source
highest priority
cells
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.)
Expired - Fee Related
Application number
CN201210414682.1A
Other languages
Chinese (zh)
Other versions
CN102905317A (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.)
Xidian University
Original Assignee
Xidian University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Xidian University filed Critical Xidian University
Priority to CN201210414682.1A priority Critical patent/CN102905317B/en
Publication of CN102905317A publication Critical patent/CN102905317A/en
Application granted granted Critical
Publication of CN102905317B publication Critical patent/CN102905317B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a mobile load balancing method used for multiple cells. The problems of the existing load balancing method, such as ping-pong load transfer and low load balancing convergence speed are solved. The method comprises the following implementation steps of: determining a cell cluster and triggering load balance; generating a source cell collection and a target cell collection in the cell cluster; carrying out priority ranking on the source cell collection and calculating load transfer step length; carrying out priority ranking on the target cell collection; sequentially selecting target cells by the priority from the source cell with the highest priority to carry out load transfer; after the load transfer of the source cell with the highest priority, selecting the target cell with the lower priority from the source cell collection to carry out load transfer; and finishing the load transfer process until load transfer is carried out on all the source cells in the cell cluster. The ping-pong load transfer problem is effectively solved, and meanwhile the load balancing convergence speed is raised, so that the system performance is improved.

Description

Mobility load balancing method applied to multiple cells
Technical Field
The invention relates to the technical field of wireless communication, in particular to a mobility load balancing method which can be used for mobility load balancing among a plurality of cells in an Advanced international mobile telecommunication system (IMT-Advanced).
Background
The Advanced international mobile telecommunication system IMT-Advanced is different from the conventional cellular network, and a flat network structure is used to replace the conventional centralized control structure, as shown in fig. 1, information is directly exchanged between base stations through an X2 interface, and corresponding radio resource allocation and switching are performed through a negotiation manner.
The new characteristics and technical requirements of the IMT-Advanced system enable the traditional network management and optimization method to be no longer efficient, and the self-organizing network SON technology can improve the self-organizing capability of the network, realize self-configuration, self-optimization and self-healing of the network, simplify the design, operation and maintenance of the wireless network, greatly reduce the maintenance cost of the network, and well meet the new characteristics and technical requirements of the IMT-Advanced system.
The wireless cellular network in the IMT-Advanced system has limited resources, but due to the non-uniformity of the distribution of the user geographical location and the randomness of the service initiation, the load in the network may exhibit an uneven distribution, resulting in that the limited resources cannot be fully utilized. In order to solve the above problems, a mobility load balancing MLB technology is introduced as an important SON use case, and the technology enables one of two networks or two systems with heavier load to transfer part of the load to the other while reducing network management and optimizing manual workload, thereby balancing load distribution between the networks or the systems, improving wireless resource utilization rate, and improving system performance.
The existing MLB technology is mainly used for balancing the load between a hot cell and an adjacent target cell in a homogeneous network, and the specific method is as follows: and the base station of the hot cell performs information interaction with the base stations of the adjacent cells through an X2 interface to acquire the load states of the adjacent cells, and selects the adjacent cell with the lightest load as a target cell to perform load transfer until the load state of the hot cell is lower than a load balancing threshold, and the load balancing is finished. In the method, only the cell with the lightest load is considered to be selected as the target cell for load transfer, so that the same cell may be selected as the target cell by a plurality of hot cells, and the target cell may become the hot cell after load balancing is finished and further needs to transfer the load outwards, so that a ping-pong transfer process of the load is generated, and the convergence speed of the load balancing is slowed; in addition, after the load balancing of a single hotspot cell is finished, because other hotspot cells do not relieve the high load state, the area blocking under the burst service is easily caused, thereby affecting the overall performance of the system.
Disclosure of Invention
The present invention aims to provide a mobility load balancing method applied to multiple cells to stably implement load balancing, avoid ping-pong load transfer, accelerate the convergence rate of load balancing, and further improve the performance of the system, in view of the above-mentioned deficiencies of the conventional MLB technology.
The invention provides a mobility load balancing method applied to multiple cells, which comprises the following steps:
(1) in the load balancing execution period, each cell in the system detects the load state of the cell, interacts load information with the adjacent cells, and simultaneously carries the load l of the cell and a load balancing threshold lthComparing the values of l and lthThe cell and the adjacent cell form a cell cluster with the size of N, and a load balancing process is triggered in the cell cluster;
(2) dividing N cells in a cell cluster into theta source cells and N-theta target cells, namely, the load l is more than or equal to lthThe cell of epsilon is the source cell and vice versa is the target cell, where epsilon is the cell load protection margin and has a value less than the load balancing threshold/thAnd theta source cells constitute a source cell set thetasA target cell set theta consisting of N-theta target cellst
(3) To source cell set thetasCarrying out priority sequencing according to the size of load, carrying out load transfer from a source cell i with the highest priority firstly, and calculating the load transfer step length:wherein Δ li=li-(lthε) the amount of load that needs to be unloaded for the source cell i with the highest priority, liThe load of a source cell i with the highest priority is obtained, m is the maximum load transfer frequency, and the value is a positive integer;
(4) for target cell set thetatAccording to target cell designationIs prioritized, the indexReceivable load amount delta l according to target cell jj=lj-(lthε) in which ljLoad amount for target cell j:
<math> <mrow> <mover> <mi>j</mi> <mo>^</mo> </mover> <mo>=</mo> <mfenced open='{' close=''> <mtable> <mtr> <mtd> <mn>0</mn> <mo>,</mo> </mtd> <mtd> <mi>&Delta;</mi> <msub> <mi>l</mi> <mi>j</mi> </msub> <mo>&lt;</mo> <msub> <mi>&pi;</mi> <mi>i</mi> </msub> </mtd> </mtr> <mtr> <mtd> <mn>1</mn> <mo>,</mo> </mtd> <mtd> <msub> <mi>&pi;</mi> <mi>i</mi> </msub> <mo>&le;</mo> <mi>&Delta;</mi> <msub> <mi>l</mi> <mi>j</mi> </msub> <mo>&lt;</mo> <mn>2</mn> <msub> <mi>&pi;</mi> <mi>i</mi> </msub> </mtd> </mtr> <mtr> <mtd> <mo>.</mo> </mtd> <mtd> </mtd> </mtr> <mtr> <mtd> <mo>.</mo> </mtd> <mtd> </mtd> </mtr> <mtr> <mtd> <mo>.</mo> </mtd> <mtd> </mtd> </mtr> <mtr> <mtd> <mi>m</mi> <mo>-</mo> <mn>1</mn> <mo>,</mo> </mtd> <mtd> <mrow> <mo>(</mo> <mi>m</mi> <mo>-</mo> <mn>1</mn> <mo>)</mo> </mrow> <msub> <mi>&pi;</mi> <mi>i</mi> </msub> <mo>&le;</mo> <mi>&Delta;</mi> <msub> <mi>l</mi> <mi>j</mi> </msub> <mo>&lt;</mo> <mi>m</mi> <msub> <mi>&pi;</mi> <mi>i</mi> </msub> </mtd> </mtr> <mtr> <mtd> <mi>m</mi> <mo>,</mo> </mtd> <mtd> <mi>m</mi> <msub> <mi>&pi;</mi> <mi>i</mi> </msub> <mo>&le;</mo> <mi>&Delta;</mi> <msub> <mi>l</mi> <mi>j</mi> </msub> </mtd> </mtr> </mtable> </mfenced> <mo>;</mo> </mrow> </math>
(5) the source cell i with the highest priority selects the target cells in sequence according to the priority to carry out load transfer;
(6) after the load transfer of the source cell i with the highest priority is finished, the step (3) is returned, and the source cell set theta is collectedsAnd selecting the next source cell according to the priority to continue load transfer until all the source cells in the cell cluster perform load transfer, and ending the load balancing process.
Compared with the prior art, the invention has the following advantages:
(1) by setting the cell load protection margin epsilon, the hot cell is subjected to load transfer in advance, so that the problem of area blockage caused by burst service can be avoided; meanwhile, the cell load protection margin epsilon also enables a certain load margin to be reserved in the target cell, and even after the load transferred by a plurality of hot spot cells is received, the possibility that the target cell becomes a hot spot cell can be avoided, so that the ping-pong load transfer is effectively avoided;
(2) by setting the load transfer step length pi, the mobility load balancing MLB is stably realized, the load transfer times in a single load transfer process and the load transfer times of the whole system can be controlled, and the convergence speed of the mobility load balancing MLB is accelerated.
Drawings
FIG. 1 is a schematic diagram of an IMT-Advanced system in the prior art;
FIG. 2 is a general flow diagram of mobility load balancing of the present invention;
fig. 3 is a sub-flowchart of load shifting in the present invention.
Detailed Description
Referring to fig. 2, a mobility load balancing method applied to multiple cells provided by the present invention specifically includes the following steps:
step 1, determining a cell cluster and triggering load balancing.
1a) In the load balancing execution period, the base station of each cell in the system acquires the current load state of the cell, and performs load information interaction with the base station of the adjacent cell through an X2 interface between the base stations;
1b) each cell balances the self load l and the load balance threshold lthA comparison is made wherein a load balancing threshold/isthFor normalized values, set by the system, and 0<lth<1, if the load l of the cell is more than or equal to lthAnd forming a cell cluster with the size of N by the cell and the adjacent cells, triggering a load balancing process in the cell cluster, and otherwise, waiting for the next load balancing execution cycle.
Step 2, generating a source cell set thetasAnd target cell set thetat
2a) Respectively judging N cells in the cell cluster as follows: if the load capacity l of the cell is more than or equal to lthIf epsilon, then the cell is the source cell, otherwise the target cell, where epsilon is the cell load protection margin, and its value is less than lthA positive number of;
2b) after the judgment process is finished, N cells in the cell cluster are divided into theta source cells and N-theta target cells;
2c) forming a source cell set theta by theta source cellssA target cell set theta consisting of N-theta target cellst
Step 3, collecting theta for the source cellsAnd carrying out priority sorting and calculating the load transfer step size.
3a) To source cell set thetasCarrying out priority sequencing according to the load from large to small so as to ensure that the source cell with the largest load obtains the highest priority, and carrying out load transfer operation firstly;
3b) calculating load transfer step length pi from source cell i with highest priorityi
Firstly, the load quantity delta l needing to be unloaded is calculated by the source cell i with the highest priorityi=li-(lthε) ofiThe load capacity of the source cell i with the highest priority is obtained;
secondly, calculating a load transfer step size:wherein m is the maximum load transfer times and is a positive integer.
Step 4, target cell set thetatAnd carrying out priority sorting.
4a) Calculating the receivable load quantity delta l of the target cell jj=lj-(lthε) ofjIs the load capacity of the target cell j;
4b) according to Δ ljThe range in which the reference number of the target cell j is acquired
<math> <mrow> <mover> <mi>j</mi> <mo>^</mo> </mover> <mo>=</mo> <mfenced open='{' close=''> <mtable> <mtr> <mtd> <mn>0</mn> <mo>,</mo> </mtd> <mtd> <mi>&Delta;</mi> <msub> <mi>l</mi> <mi>j</mi> </msub> <mo>&lt;</mo> <msub> <mi>&pi;</mi> <mi>i</mi> </msub> </mtd> </mtr> <mtr> <mtd> <mn>1</mn> <mo>,</mo> </mtd> <mtd> <msub> <mi>&pi;</mi> <mi>i</mi> </msub> <mo>&le;</mo> <mi>&Delta;</mi> <msub> <mi>l</mi> <mi>j</mi> </msub> <mo>&lt;</mo> <mn>2</mn> <msub> <mi>&pi;</mi> <mi>i</mi> </msub> </mtd> </mtr> <mtr> <mtd> <mo>.</mo> </mtd> <mtd> </mtd> </mtr> <mtr> <mtd> <mo>.</mo> </mtd> <mtd> </mtd> </mtr> <mtr> <mtd> <mo>.</mo> </mtd> <mtd> </mtd> </mtr> <mtr> <mtd> <mi>m</mi> <mo>-</mo> <mn>1</mn> <mo>,</mo> </mtd> <mtd> <mrow> <mo>(</mo> <mi>m</mi> <mo>-</mo> <mn>1</mn> <mo>)</mo> </mrow> <msub> <mi>&pi;</mi> <mi>i</mi> </msub> <mo>&le;</mo> <mi>&Delta;</mi> <msub> <mi>l</mi> <mi>j</mi> </msub> <mo>&lt;</mo> <mi>m</mi> <msub> <mi>&pi;</mi> <mi>i</mi> </msub> </mtd> </mtr> <mtr> <mtd> <mi>m</mi> <mo>,</mo> </mtd> <mtd> <mi>m</mi> <msub> <mi>&pi;</mi> <mi>i</mi> </msub> <mo>&le;</mo> <mi>&Delta;</mi> <msub> <mi>l</mi> <mi>j</mi> </msub> </mtd> </mtr> </mtable> </mfenced> <mo>;</mo> </mrow> </math>
4c) Target set of cells thetatAccording to target cell designationThe priority ranking is carried out according to the size of the load, so that the target cell with the strongest load receiving capacity can receive the load firstly, and the reasonable utilization of resources is realized.
And 5, carrying out load transfer by the source cell i with the highest priority.
Referring to fig. 3, the specific implementation of this step is as follows:
5a) the source cell i with the highest priority is selected from the target cell set thetatIn accordance with the reference numberSelecting a target cell j from large to small for load transfer, wherein the load capacity of one transfer isWherein m piiThe amount of load to be transferred for the source cell i with the highest priority,the maximum acceptable load capacity at one time of the target cell j is obtained;
5b) respectively calculating the current utility value of the cell and the receiving size of the cell as delta by the target cell j according to a utility value formulajComparing the two values, if the utility value after the cell receives the load is larger than the current utility value, executing the step 5 d), otherwise executing the step 5 c);
wherein the utility value formula is represented as follows:
<math> <mrow> <mover> <mi>U</mi> <mo>~</mo> </mover> <mo>=</mo> <mi>U</mi> <mo>-</mo> <mi>C</mi> <mo>=</mo> <mfenced open='{' close=''> <mtable> <mtr> <mtd> <mi>a</mi> <mo>&CenterDot;</mo> <msub> <mi>log</mi> <mn>2</mn> </msub> <mrow> <mo>(</mo> <mn>1</mn> <mo>+</mo> <mi>l</mi> <mo>)</mo> </mrow> <mo>,</mo> <mi>l</mi> <mo>&lt;</mo> <msub> <mi>l</mi> <mi>th</mi> </msub> <mo>-</mo> <mi>&epsiv;</mi> </mtd> </mtr> <mtr> <mtd> <mi>a</mi> <mo>&CenterDot;</mo> <msub> <mi>log</mi> <mn>2</mn> </msub> <mrow> <mo>(</mo> <mn>1</mn> <mo>+</mo> <mi>l</mi> <mo>)</mo> </mrow> <mo>-</mo> <mfrac> <mi>b</mi> <mi>&epsiv;</mi> </mfrac> <mrow> <mo>(</mo> <mi>l</mi> <mo>-</mo> <mrow> <mo>(</mo> <msub> <mi>l</mi> <mi>th</mi> </msub> <mo>-</mo> <mi>&epsiv;</mi> <mo>)</mo> </mrow> <mo>)</mo> </mrow> <mo>,</mo> <msub> <mi>l</mi> <mi>th</mi> </msub> <mo>-</mo> <mi>&epsiv;</mi> <mo>&le;</mo> <mi>l</mi> <mo>&lt;</mo> <msub> <mi>l</mi> <mi>th</mi> </msub> </mtd> </mtr> <mtr> <mtd> <mi>a</mi> <mo>&CenterDot;</mo> <msub> <mi>log</mi> <mn>2</mn> </msub> <mrow> <mo>(</mo> <mn>1</mn> <mo>+</mo> <mi>l</mi> <mo>)</mo> </mrow> <mo>+</mo> <msup> <mrow> <mo>(</mo> <mi>l</mi> <mo>-</mo> <mrow> <mo>(</mo> <msub> <mi>l</mi> <mi>th</mi> </msub> <mo>+</mo> <mi>&epsiv;</mi> <mo>)</mo> </mrow> <mo>)</mo> </mrow> <mn>2</mn> </msup> <mo>-</mo> <mrow> <mo>(</mo> <mi>b</mi> <mo>+</mo> <msup> <mi>&epsiv;</mi> <mn>2</mn> </msup> <mo>)</mo> </mrow> <mo>,</mo> <msub> <mi>l</mi> <mi>th</mi> </msub> <mo>&le;</mo> <mi>l</mi> </mtd> </mtr> </mtable> </mfenced> </mrow> </math>
wherein,the utility value of the cell is represented, U represents the gross profit of the cell, C represents the cost of the cell, a is a parameter related to the gross profit U of the cell and takes a value of 0 to 1, and b is a parameter related to the cost C of the cell and takes a value of 0 to 1;
5c) the source cell i with the highest priority is selected from the target cell set thetatSelecting next target cell to proceedLoad shifting if the target cell set thetatIf the next target cell does not exist, the load transfer process of the source cell i with the highest priority is finished; otherwise, returning to the step 5 a);
5d) respectively calculating the current utility value of the cell and the cell transfer size delta according to the utility value formula by the source cell i with the highest priorityjThe corresponding utility value after the load amount is obtained, the two values are compared, and if the utility value after the load transfer of the cell is larger than the current utility value, the transfer of the source cell i with the highest priority to the target cell j is deltajWherein the utility value formula is the same as the utility value formula in step 5 b);
5e) the source cell i with the highest priority makes the following decisions: if it isThen update m piiHas a value ofReturning to the step 5 c); otherwise, the load transfer process of the source cell i with the highest priority is ended.
And 6, judging the end of load balancing.
If all source cells in the cell cluster are subjected to load transfer, finishing the load balancing process once, otherwise, returning to the step 3, and collecting theta from the source cellssAnd selecting the next source cell according to the priority to continue the load transfer.
The above is a specific example of the present invention, and is not to be construed as limiting the invention in any way, and it is obvious that various modifications can be made within the spirit of the present invention, and these modifications are included in the scope of the present invention.

Claims (4)

1. A mobility load balancing method applied to multiple cells comprises the following steps:
(1) in the load balancing execution period, each cell in the system detects the load state of the cell, interacts load information with the adjacent cells, and simultaneously carries the load l of the cell and a load balancing threshold lthComparing the values of l and lthThe cell and the adjacent cell form a cell cluster with the size of N, and a load balancing process is triggered in the cell cluster;
(2) dividing N cells in a cell cluster into theta source cells and N-theta source cellsTarget cell, i.e. load l ≧ lthThe cell of epsilon is the source cell and vice versa is the target cell, where epsilon is the cell load protection margin and has a value less than the load balancing threshold/thAnd theta source cells constitute a source cell set thetasA target cell set theta consisting of N-theta target cellst
(3) To source cell set thetasCarrying out priority sequencing according to the size of load, carrying out load transfer from a source cell i with the highest priority firstly, and calculating the load transfer step length:wherein Δ li=li-(lthε) the amount of load that needs to be unloaded for the source cell i with the highest priority, liThe load of a source cell i with the highest priority is obtained, m is the maximum load transfer frequency, and the value is a positive integer;
(4) for target cell set thetatAccording to target cell designationIs prioritized, the indexReceivable load amount delta l according to target cell jj=lj-(lthε) in which ljLoad amount for target cell j:
(5) the source cell i with the highest priority selects the target cells in sequence according to the priority to carry out load transfer;
(6) after the source cell i with the highest priority finishes load transfer, the step returns to the step (3)) From the source cell set thetasAnd selecting the next source cell according to the priority to continue load transfer until all the source cells in the cell cluster perform load transfer, and ending the load balancing process.
2. The method as claimed in claim 1, wherein each cell in the system in step 1) detects its own load status and interacts load information with its neighboring cells, and the base station of each cell obtains the current load status of the cell and interacts load information with the base stations of its neighboring cells through an X2 interface between the base stations.
3. The method as claimed in claim 1, wherein the source cell i with the highest priority in step 5) selects the target cells in turn according to the priorities for load transfer, and the method comprises the following steps:
5a) the source cell i with the highest priority is selected from the target cell set thetatIn accordance with the reference numberSelecting a target cell j from large to small for load transfer, wherein the load capacity of one transfer isWherein m piiThe amount of load to be transferred for the source cell i with the highest priority,the maximum acceptable load capacity at one time of the target cell j is obtained;
5b) respectively calculating the current utility value of the target cell j and the corresponding utility value after the cell receives the load with the size of delta j according to a utility value formula, comparing the two values, and executing the step 5 d) if the utility value after the cell receives the load is larger than the current utility value, or executing the step 5 c);
5c) the source cell i with the highest priority is selected from the target cell set thetatSelecting next target cell to continue load transfer, if the target cell set thetatIf the next target cell does not exist, the load transfer process of the source cell i with the highest priority is finished; otherwise, returning to the step 5 a);
5d) respectively calculating the current utility value of the cell and the cell transfer size delta according to the utility value formula by the source cell i with the highest priorityjThe corresponding utility value after the load amount is obtained, the two values are compared, and if the utility value after the load transfer of the cell is larger than the current utility value, the transfer of the source cell i with the highest priority to the target cell j is deltajThe amount of load of (a);
5e) the source cell i with the highest priority makes the following decisions: if it isThen update m piiHas a value ofReturning to the step 5 c); otherwise, the load transfer process of the source cell i with the highest priority is ended.
4. A mobility load balancing method applied to multi-cells according to claim 3, wherein the utility value formula in step 5 b) and step 5 d) is expressed as follows:
wherein,the utility value of the cell is represented, U represents the gross benefit of the cell, C represents the cost of the cell, a is a parameter related to the gross benefit U of the cell and takes a value of 0 to 1, b is a parameter related to the cost C of the cell and takes a valueFrom 0 to 1.
CN201210414682.1A 2012-10-25 2012-10-25 Mobile load balancing method used for multiple cells Expired - Fee Related CN102905317B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201210414682.1A CN102905317B (en) 2012-10-25 2012-10-25 Mobile load balancing method used for multiple cells

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201210414682.1A CN102905317B (en) 2012-10-25 2012-10-25 Mobile load balancing method used for multiple cells

Publications (2)

Publication Number Publication Date
CN102905317A CN102905317A (en) 2013-01-30
CN102905317B true CN102905317B (en) 2014-12-17

Family

ID=47577305

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201210414682.1A Expired - Fee Related CN102905317B (en) 2012-10-25 2012-10-25 Mobile load balancing method used for multiple cells

Country Status (1)

Country Link
CN (1) CN102905317B (en)

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104185264B (en) * 2013-05-23 2017-12-15 华为技术有限公司 The method and apparatus of uplink power control
CN104469861B (en) * 2013-09-24 2019-12-24 中兴通讯股份有限公司 Cell selection method, device and terminal
CN103491576B (en) * 2013-09-29 2016-03-02 西安电子科技大学 A kind of type energy efficiency priority load transfer method disturbing perception
CN105611545A (en) * 2014-11-19 2016-05-25 中兴通讯股份有限公司 Base station interference coordination method, base station interference coordination device and base station interference coordination system
CN105682143B (en) * 2014-11-19 2019-01-11 中国联合网络通信集团有限公司 Load transfer method and device under a kind of isomery cellular network
TWI572221B (en) * 2014-12-01 2017-02-21 財團法人資訊工業策進會 Central control server and load balancing method thereof
CN104754655B (en) * 2015-02-27 2018-10-23 大唐移动通信设备有限公司 A kind of business reorganization method and apparatus
CN115442865B (en) * 2021-06-02 2024-10-01 中国移动通信集团广东有限公司 Network load balancing method and device, electronic equipment and storage medium

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101711044A (en) * 2009-11-17 2010-05-19 中兴通讯股份有限公司 Method and device for realizing load balance among neighboring cells
CN102256307A (en) * 2011-06-21 2011-11-23 北京邮电大学 Method and system for balancing distributed load in LTE (Long Term Evolution) access network

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102111813B (en) * 2010-03-22 2013-09-25 电信科学技术研究院 Method and equipment for balancing loads of carriers

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101711044A (en) * 2009-11-17 2010-05-19 中兴通讯股份有限公司 Method and device for realizing load balance among neighboring cells
CN102256307A (en) * 2011-06-21 2011-11-23 北京邮电大学 Method and system for balancing distributed load in LTE (Long Term Evolution) access network

Also Published As

Publication number Publication date
CN102905317A (en) 2013-01-30

Similar Documents

Publication Publication Date Title
CN102905317B (en) Mobile load balancing method used for multiple cells
CN102098728B (en) Mobile load balancing method
CN102625389B (en) A kind of cut-in method of mobile communications network, device and system
Wang et al. Dynamic load balancing and throughput optimization in 3gpp lte networks
CN104160725B (en) Method for carrying out geographical load balancing using distributing antenna system
CN102791002B (en) Based on the resource allocation methods of efficiency in LTE network
WO2015127880A1 (en) Base station frequency resource allocation method and network device
CN102026388B (en) Method for allocating radio resources under coordinated multipoint transmission/reception (CoMP) in long term evolution-advanced (LTE-A) system
CN106454850B (en) The resource allocation methods of honeycomb heterogeneous network efficiency optimization
CN103929781A (en) Cross-layer interference coordination optimization method in super dense heterogeneous network
CN102413510A (en) Cell access control method and device
CN101754383B (en) Structuring method of CoMP cell cluster
CN103167557B (en) Method for balancing load based on virtual cell breathing in long term evolution-advanced (LTE-A) system
CN101998514A (en) Method and controller for balancing load among cells of multiband time division-synchronous code division multiple access (TD-SCDMA) system
CN103249160B (en) A kind of resource allocation methods in lte-a system under CoMP
CN103313251A (en) Multi-cell cooperative resource allocation method based on potential game theory
CN103327533A (en) User-based mobile member carrier wave selection method in carrier wave aggregation system
CN104602300B (en) The method and apparatus of power grid heterogeneous network load balancing
CN102202350A (en) Optimization method for load balancing actively initiated by light load cell
CN101784078A (en) Load balancing and throughput optimization method in mobile communication system
CN105072620A (en) Network visualization-based resource sharing method among service providers
CN104284433A (en) Heterogeneous network per-bit energy minimization resource distribution method based on rate limitation
Gao et al. A mobility load balancing algorithm based on handover optimization in LTE network
Wang et al. Graph-based dynamic frequency reuse in Cloud-RAN
Li et al. QoS and channel state aware load balancing in 3GPP LTE multi-cell networks

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20141217

Termination date: 20191025

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