Partitioning method for mobile communication network with overlapping location areas

• US 20060009237A1
• Filed: 06/24/2005
• Published: 01/12/2006
• Est. Priority Date: 06/25/2004
• Status: Abandoned Application

• Current Assignee: Groundhog Technologies, Inc.
• Original Assignee: Groundhog Technologies, Inc.
• Inventors: Kuo, Tzu-Wen, Shieh, Yuh-Pyng, Chen, Meng-Seng, Hsiao, Ching-Jui
• Application Number:
  US11/159,994
• Publication Number:
  US 20060009237A1
• Time in Patent Office: Days
• US Class Current: 455/456.100
• CPC Class Codes: H04W 16/00 Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
• CPC Class Codes: H04W 24/00 Supervisory, monitoring or testing arrangements
• CPC Class Codes: H04W 60/04 using triggered events
• CPC Class Codes: H04W 8/26 Network addressing or numbering for mobility support

Abstract

A partitioning method for a mobile communication network with overlapping location areas is disclosed. The method comprises: finding at least a potential LAC labeling operation for each cell within the network; determining a respective gain for each potential LAC labeling operation; selecting one potential LAC labeling operations according to the respective gains; and adjusting the LAC list of the cell according to the selected operation. The method can provide an optimal partitioning to upgrade the network performance.

Claims

1. A method for determining a location area code (LAC) list of a first cell in a mobile communication network, comprising following steps:

finding at least a potential LAC labeling operation for the first cell;

determining a respective gain for each potential LAC labeling operation;

selecting one of the potential LAC labeling operations according to the respective gains; and

adjusting the LAC list according to the selected potential LAC labeling operation.

2. The method of claim 1, prior to the finding step further comprising:

applying a network partitioning algorithm to the mobile communication network.

3. The method of claim 2, wherein the network partitioning algorithm is one of greedy algorithm, genetic algorithm, K-L (Kernighan-Lin) algorithm, F-M (Fiduccia-Mattheyses) algorithm, and simulated annealing algorithm.

4. The method of claim 1, wherein the potential LAC labeling operation is one of Add operation, Replace operation, Swap operation, and Remove operation.

5. The method of claim 1, wherein the potential LAC labeling operation is found according to a possible configuration of the LAC list.

6. The method of claim 1, wherein the gain corresponds to at least a first portion of the mobile communication network.

7. The method of claim 6, wherein the first portion includes the first cell.

8. The method of claim 6, wherein the gain is determined by comparing location update load of the first portion before and after applying the potential LAC labeling operation to the first cell.

9. The method of claim 8, wherein the location update load of the first portion is calculated according to the location update load for each cell within the first portion.

10. The method of claim 9, wherein the location update load for the cell within the first portion is calculated according to LAC distribution of at least a neighboring cell of the cell.

11. The method of claim 9, wherein the determining step comprises a procedure for predicting the LAC distribution for a second cell after applying the potential LAC labeling operation to the first cell, and the procedure comprising:

determining a respective contribution to each LAC of the second cell provided by each neighboring cell of the second cell according to signal movements from the neighboring cell to the second cell and an initial LAC distribution of the neighboring cell; and

predicting the LAC distribution of the second cell according to the respective contributions provided by the neighboring cells of the second cell.

12. The method of claim 11, wherein the procedure is repeatedly performed until the LAC distributions of the second cell and the neighboring cells approach to a stable state.

13. The method of claim 1, wherein the selecting step comprises selecting the potential LAC labeling operation with a maximum gain.

14. The method of claim 1, wherein the selecting step comprises selecting the potential LAC labeling operation with a gain larger than a predetermined threshold.

15. The method of claim 1, after the adjusting step further comprising:

determining whether at least a second portion of the mobile communication network is paging-overloaded.

16. The method of claim 15, further comprising:

restoring the LAC list to a pre-adjustment state if the second portion is paging-overloaded.

17. The method of claim 15, wherein the second portion corresponds to the first portion.

18. The method of claim 1, further comprising:

repeating the finding, gain-determining, selecting and adjusting steps until no potential LAC labeling operation can be selected for the first cell.

19. The method of claim 1, wherein the LAC list comprises at least a registration area code (RAC).

20. The method of claim 1, wherein a paging load of the first cell is estimated according to a total paging of each LAC in the LAC list, wherein the total paging of each LAC is generated according to a respective paging contribution of the LAC made by each cell within a location area with the LAC.

29. A partitioning method for a mobile communication network with overlapping location areas comprising the method of claim 1, wherein the method of claim 1 is applied to each cell in the mobile communication network.

21. A method for predicting a location area code (LAC) distribution of a first cell in a mobile communication network with overlapping location areas, comprising following steps:

(a) determining a respective contribution to each LAC of the first cell provided by a neighboring cell of the first cell according to signal movements from the neighboring cell to the first cell and an initial LAC distribution of the neighboring cell;

(b) repeating the step (a) for each of other neighboring cells of the first cell; and

(c) predicting the LAC distribution of the first cell according to the respective contributions provided by the neighboring cells of the first cell.

22. The method of claim 21, wherein the method is performed after a LAC labeling operation is applied to the first cell.

23. The method of claim 21, wherein in the step (a), if a LAC of the neighboring cell is also labeled to the first cell, the respective contribution to the LAC of the first cell provided by the neighboring cell comprises a product of the signal movements from the neighboring cell to the first cell and a distributed value of the LAC in the initial LAC distribution of the neighboring cell.

24. The method of claim 21, wherein in the step (a), if a LAC of the neighboring cell is not labeled to the first cell, the respective contribution to a default LAC of the first cell provided by the neighboring cell comprises a product of the signal movements from the neighboring cell to the first cell and a distributed value of the LAC in the initial LAC distribution of the neighboring cell.

25. The method of claim 24, wherein the default LAC is a registration area code (RAC) of the first cell.

26. The method of claim 21, wherein in the step (c), a distributed value of a LAC in the LAC distribution of the first cell is determined by accumulating the contributions to the LAC provided by the neighboring cells of the first cell.

27. The method of claim 21, further comprising:

(d) repeating the steps (a) to (c) for each neighboring cell to predict an updated LAC distribution of the neighboring cell according to the predicted LAC distribution of the first cell; and

(e) repeating the steps (a) to (c) for the first cell again to predict an updated LAC distribution of the first cell according to the updated LAC distribution of the neighboring cell.

28. The method of claim 27, further comprising:

(f) repeating the steps (d) and (e) until the LAC distributions of the first cell and the neighboring cells approach to a stable state.