Area division method, area division device, and program

The area division method using graph partitioning and tilt angle optimization in cellular networks addresses the challenges of optimizing tilt angles in large areas by dividing the network into smaller clusters, reducing interference and coverage holes, and improving communication quality.

WO2024228250A1PCT designated stage expired Publication Date: 2024-11-07NT T INC
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
PCT/JP2023/017128
Authority / Receiving Office
WO · WO
Patent Type
Applications
Current Assignee / Owner
Filing Date
2023-05-02
Publication Date
2024-11-07

AI Technical Summary

Technical Problem

Existing methods for optimizing tilt angles in cellular networks to improve communication quality face challenges such as increased calculations with the number of cells, varying results due to optimization order, and inadequate consideration of interference between adjacent areas, especially when dividing large areas into smaller clusters for combinatorial optimization.

Method used

An area division method using a graph partitioning approach that calculates small areas and optimizes tilt angles to minimize interference and coverage holes, employing a device with an input section for cell and area information, an area dividing section that applies graph division and tilt angle optimization, and an output section to provide optimized cell and area sets.

Benefits of technology

This method effectively reduces coverage holes and interference in large areas by optimizing tilt angles in smaller clusters, reducing calculation complexity and ensuring consistent results, thereby maintaining or improving wireless communication quality.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure JP2023017128_07112024_PF_FP_ABST
    Figure JP2023017128_07112024_PF_FP_ABST
Patent Text Reader

Abstract

The purpose of the present disclosure is to improve or maintain radio communication quality in a large-scale area. Accordingly, the present disclosure provides an area division method implemented by an area division device that divides a large-scale area, wherein the area division device carries out a graph partitioning method on the basis of cell information relating to each cell in each base station and large-scale area information relating to the large-scale area including each of said cells and calculates a set of small areas and each cell set that optimizes each of the small areas, thereby executing area division processing in the large-scale area.
Need to check novelty before this filing date? Find Prior Art

Description

Area division method, area division device, and program

[0001] The present disclosure relates to a technique for dividing a large area covered by a base station to improve or maintain communication quality in a cellular network.

[0002] A cellular network is generally composed of many wireless base stations. Each base station has a cell, and the coverage, or the communication range of each cell, is adjusted by the tilt angle of each cell's antenna. This coverage has a significant impact on the communication quality of a cellular network. For example, if the coverage is set too narrow, communication areas where communication is impossible or communication quality is very poor (hereinafter referred to as "coverage holes") will occur. Conversely, if the coverage is set too wide, radio wave interference (hereinafter sometimes simply referred to as "interference") with the coverage of other surrounding cells will occur, degrading communication quality. Therefore, to improve communication quality in a cellular network, it is important to appropriately set the tilt angle of each cell.

[0003] Various studies have been conducted on tilt angle optimization, including "greedy methods" that individually optimize the tilt angles of multiple cells, and "combinatorial optimization methods" that collectively optimize each tilt angle by combining the tilt angles of multiple cells (0°, 20°, 40°, 60°, etc.). Furthermore, combinatorial optimization methods include methods based on mathematical optimization, metaheuristic methods such as particle swarm optimization and genetic algorithms, and methods using reinforcement learning.

[0004] The greedy methods mentioned above can be divided into methods that simultaneously optimize the tilt angles of all cells (simultaneous optimization) and methods that sequentially optimize the tilt angles of all cells. Simultaneous optimization allows for parallel calculations of individual optimizations for all cells, allowing for calculations to be performed in approximately the same amount of time regardless of the number of cells being optimized. However, since optimization cannot be performed in coordination with neighboring cells, there are concerns about coverage holes and interference. On the other hand, sequential optimization optimizes the tilt angles of each cell in turn, which can reduce coverage holes and interference, but the results vary depending on the order of optimization, and the amount of calculation increases as the number of cells being optimized increases.

[0005] On the other hand, combinatorial optimization methods perform optimization in cooperation with neighboring cells, making it possible to suppress coverage holes and interference without considering the order of optimization. However, as the number of cells to be optimized increases, the number of combinations becomes enormous, making calculations difficult. Therefore, in order to optimize tilt angles to improve communication quality in a large area covered by hundreds of thousands of base station cells nationwide, it is desirable to divide the large area into small areas that can be applied to combinatorial optimization and perform simultaneous optimization within each small area across the entire area. This not only reduces the amount of calculation compared to sequential optimization, but also eliminates the need to consider the order of optimization.

[0006] Non-Patent Document 1 discloses a technology for optimizing the tilt angle for each cell included in a large-scale area by classifying cells into clusters made up of cells that do not interfere with each other, simultaneously optimizing each cell in the same cluster using a greedy method, sequentially optimizing each cluster, and repeating clustering and optimization until the results converge.

[0007] PAS Ordonez, S. Luna-Ramirez and M. Toril, "A Computationally Efficient Method for QoE-Driven Self-Planning of Antenna Tilts in a LTE Network," in IEEE Access, vol. 8, pp. 197005-197016, 2020

[0008] However, the technology disclosed in Non-Patent Document 1 assumes the application of a greedy method, and therefore is not appropriate for applying a combinatorial optimization method. This is because combinatorial optimization methods optimize in cooperation with neighboring cells, but since each cluster contains only cells that do not interfere with each other, the optimization ends up being coordinated with completely unrelated, distant cells. In addition, if combinatorial optimization is performed sequentially for each cluster, there is a concern that the amount of calculations will increase, and the optimization results will differ depending on the order in which the optimization is performed.

[0009] Furthermore, the technology disclosed in Non-Patent Document 1 cannot be said to divide the communication area because the scattered cells belong to the same cluster. A simple method of area division is to divide a large area into small areas consisting of a mesh of several kilometers square. It is also possible to optimize the tilt angle of the large area by treating each cell in the small area as the same cluster and applying combinatorial optimization, and optimizing each small area simultaneously. However, in this case, the following two points become an issue.

[0010] (1) To reduce coverage holes, the union of small areas should encompass the large area, and each small area should be covered by cells within the small area.

[0011] (2) The optimization of each small area does not take into account the state of cells in adjacent areas, so if there is interference with cells in adjacent areas, the interference will remain even after optimization. Therefore, in order to reduce interference across an entire large area, it is necessary to suppress interference with cells in adjacent areas at the area division stage.

[0012] The present disclosure has been made in consideration of the above circumstances, and aims to improve or maintain wireless communication quality in a large-scale area.

[0013] In order to achieve the above object, the invention of claim 1 is an area division method implemented by an area division device that divides a large area, in which the area division device performs area division processing in the large area by implementing a graph division method based on cell information regarding each cell in each base station and large area information regarding the large area including each cell, to calculate a set of each small area and each cell set that optimizes each small area.

[0014] As described above, the present disclosure provides an advantage of being able to improve or maintain wireless communication quality in a large-scale area.

[0015] Fig. 1 is a functional configuration diagram of an area dividing device according to an embodiment; Fig. 2 is an electrical hardware configuration diagram of an area dividing device according to an embodiment; Fig. 3 is a flowchart showing processing or operations of an area dividing device according to an embodiment; Fig. 4 is a flowchart showing processing of an area dividing unit; Fig. 5 is a flowchart showing processing of the area dividing unit; Fig. 6 is a flowchart showing processing for optimizing a tilt angle between labels; Fig. 7 is a flowchart showing processing for optimizing a tilt angle between labels.

[0016] Hereinafter, an embodiment of the present invention will be described with reference to the drawings.

[0017] [Functional Configuration of Area Dividing Apparatus] First, the functional configuration of the area dividing apparatus according to the embodiment will be described with reference to Fig. 1. Fig. 1 is a diagram showing the functional configuration of the area dividing apparatus according to the embodiment.

[0018] The area dividing device 10 is a device that divides a communication area by graph division and tilt angle optimization, and is configured with one or more computers. When the area dividing device 10 is configured with multiple computers, it may be referred to as an "area dividing device" or an "area dividing system."

[0019] As shown in FIG. 1, the area dividing device 10 of this embodiment has an input unit 11, an area dividing unit 12, and an output unit 13.

[0020] The input unit 11 inputs cell information and large-scale area information. The cell information includes the cell location (longitude, latitude) and information on the base station within the cell (transmission power, antenna height, azimuth angle, half-width, antenna tilt angle, frequency, bandwidth, etc.). The large-scale area information includes, for the large-scale area, center coordinates (longitude, latitude), north-south range, east-west range, overall area of ​​the large-scale area, mesh size, and the number of divisions into small areas. Table 1 shows an example of the cell information, and Table 2 shows an example of the large-scale area information.

[0021]

[0022] The area division unit 12 repeatedly performs graph division and tilt angle optimization based on the cell information and large-scale area information obtained from the input unit 11 (see S28; NO in FIG. 5 described below) to label (classify) each cell so as to reduce coverage holes and reduce interference with cells in adjacent areas. The area division unit 12 then calculates a cell set for each label and calculates a set of small areas divided within the large-scale area for each label. This allows the area division unit 12 to calculate each small area set and a cell set that optimizes each small area within the large-scale area. Note that detailed processing by the area division unit 12 will be described later.

[0023] The output unit 13 outputs information indicating the small area sets obtained by the area dividing unit 12 and each cell set that optimizes each small area. The output unit 13 may output these sets to any output destination. For example, the output unit 13 may output these sets to a server device or the like via a communication network such as the Internet, or may output them to a display or the like, or may output them to an auxiliary storage device or the like.

[0024] [Hardware Configuration] <Hardware Configuration of Area Dividing Device> Next, the electrical hardware configuration of the area dividing device 10 will be described with reference to Fig. 2. Fig. 2 is a diagram showing the electrical hardware configuration of the area dividing device.

[0025] As shown in FIG. 2, the area dividing device 10 is a computer and includes a CPU 101, a ROM 102, a RAM 103, an SSD 104, an external device connection I / F (Interface) 105, a network I / F 106, a display 107, an input device 108, a media I / F 109, and a bus line 110.

[0026] Of these, the CPU 101 controls the overall operation of the area dividing device 10. The ROM 102 stores programs such as IPL used to drive the CPU 101. The RAM 103 is used as a work area for the CPU 101.

[0027] The SSD 104 reads or writes various data under the control of the CPU 101. Note that instead of the SSD 104, a hard disk drive (HDD) may be used.

[0028] The external device connection I / F 105 is an interface for connecting various external devices, such as a display, a speaker, a keyboard, a mouse, a USB memory, and a printer.

[0029] The network I / F 106 is an interface for performing data communication via a communication network such as the Internet.

[0030] The display 107 is a type of display means such as a liquid crystal display or organic electroluminescence (EL) display that displays various images.

[0031] The input device 108 is a keyboard, a pointing device, or the like, and is an example of an input means for accepting input operations such as characters, numbers, and various instructions.

[0032] The media I / F 109 controls reading and writing (storing) of data from and to a recording medium 109m such as a flash memory, etc. The recording medium 109m includes DVDs and Blu-ray Discs (registered trademarks).

[0033] The bus line 110 is an address bus, a data bus, etc. for electrically connecting the components such as the CPU 101 shown in FIG.

[0034] [Processing or Operation of Area Dividing Device] Next, processing or operation executed by the area dividing device 10 will be described with reference to Fig. 3 to Fig. 7. Fig. 3 is a flowchart showing processing or operation of the area dividing device according to the embodiment.

[0035] S1: The input unit 11 inputs cell information and large-scale area information.

[0036] S2: The area division unit 12 calculates each small area set and each cell set that optimizes each small area based on the cell information and large area information input by the input unit 11. The process S2 will be described in detail later.

[0037] S3: The output unit 13 outputs information indicating the small area set calculated in step S2 and each cell set that optimizes each small area.

[0038] <Processing of Area Dividing Unit> Next, detailed processing of the area dividing unit will be explained. Note that (Table 3) shows the definitions of basic sets and variables.

[0039] S21: First, the area division unit 12 constructs a graph in which cells are nodes and values ​​corresponding to the interference between cells are used as edge weights. Table 4 shows the definitions of sets and variables involved in constructing the graph.

[0040] S22: The area division unit 12 applies a graph partitioning method to the graph constructed in step S21, and labels each cell according to the graph structure. The graph partitioning method to be applied may be any partitioning method that minimizes the weight of edges between labels, and may be partitioned using, for example, METIS (a set of serial programs for graph partitioning and finite element mesh creation).

[0041] S23: The area dividing section 12 determines whether the current process is the first loop of the process in FIG.

[0042] S24: In the case of the first loop, that is, in the case of n=0 (S23: YES), the area dividing unit 12 (0) To evaluate the accuracy of the division, (0) Calculate ε (0) is a variable that takes a larger value as the number of meshes with coverage holes and interference between labels increases. (Table 5) shows that ε (0) The definitions of the variables required for the calculation are shown below.

[0043] S25: Thereafter, the area dividing unit 12 optimizes the tilt angle based on the labeling performed in step S22. Here, the process of step S25 will be described with reference to Figures 6 and 7. Figures 6 and 7 are flowcharts showing the process of optimizing the tilt angle between labels.

[0044] S251: First, the area division unit 12 selects a cell set I to be optimized. optimized =I s ∪I r In order to extract the first cell, a cell with interference between labels (an example of the first cell) is extracted.

[0045] S252: The area division unit 12 also selects the cell set I to be optimized. optimized =I s ∪I r In order to extract the coverage hole, a cell (an example of the second cell) that can cover the mesh is extracted.

[0046] S253: Next, a cell set I consisting of at least one (union) of the first cell and the second cell is generated. optimized For each cell in, each cell i∈I optimized All tilt angles k∈K that can be set by i Score k The tilt angle with the highest score is calculated as the optimal tilt angle k i * The score is calculated based on whether or not there is interference in the meshes covered by the cell. Specifically, if there is no interference, +1 is added, and if there is interference with a cell with a different label, -1 is added. This operation is repeated for all meshes j∈J that can be covered by cell i with tilt angle k. i,kIt is calculated by performing the following on

[0047] As described above, the tilt angle is optimized in step S25.

[0048] S26, S27: Thereafter, the area dividing unit 12 calculates ε for the n-th loop based on the optimized tilt angle. (n) Evaluate.

[0049] S28: The area dividing unit 12 calculates ε (n) If the value of ε does not converge (S28; NO), the above steps S21 to S27 are repeated. (n) If the value of converges (S28; YES), the area division process ends.

[0050] As described above, in process S2, the area division unit 12 calculates a cell set for each label and a small area for each label based on the information input in process S1. Here, a small area refers to a set of meshes covered by all the cells in the cell set.

[0051] [Major Effects of the Embodiment] As described above, according to the present embodiment, it is possible to improve or maintain the quality of wireless communication in a large-scale area of ​​a cellular network.

[0052] Specifically, the area dividing unit 12 of the area dividing device 10 calculates a set of small areas that reduces coverage holes in the large area and interference with adjacent areas, and a set of cells that optimizes each small area. This not only makes it possible to optimize the large area using a tilt angle optimization method, which is a type of combinatorial optimization method, but also has the effect of reducing coverage holes and interference in the large area after optimization.

[0053] [Supplementary Note] The present invention is not limited to the above-described embodiment, and may have the following configurations or processes (operations), for example.

[0054] (1) The area dividing device 10 can be realized by a computer and a program, but this program can also be recorded on a (non-transitory) recording medium or provided via a communication network such as the Internet.

[0055] (2) The CPU 101 as a processor may be a single processor or multiple processors.

[0056] 10 Area dividing device 11 Input unit 12 Area dividing unit 13 Output unit

Claims

1. An area division method implemented by an area division device that divides a large-scale area, wherein the area division device performs area division processing in the large-scale area by implementing a graph partitioning method based on cell information for each cell in each base station and large-scale area information for the large-scale area including each cell, and calculating a set of small areas and each set of cells that optimizes each small area.

2. The area division method according to claim 1, wherein the area division process includes a process of labeling each cell so as to reduce coverage holes and radio wave interference with cells in adjacent areas, calculating the cell set for each label, and calculating a set of small areas divided within the large area for each label.

3. The area division method according to claim 2, wherein the area division process includes a process of constructing a graph in which each of the cells is a node and an edge weight is a value corresponding to radio wave interference between the cells, applying the graph division method that minimizes the edge weight between the labels to the graph, labeling each of the cells according to the graph structure of the graph, and optimizing the tilt angle of each of the base stations associated with each of the labeled cells.

4. The area division method according to claim 3, wherein the process of optimizing the tilt angle includes a process of extracting a first cell having radio wave interference between the labels and a second cell capable of covering a mesh that is the coverage hole, calculating a score for all tilt angles that can be set in each cell of the cell set of at least one of the first cell and the second cell, and determining the tilt angle that maximizes the score as the optimal tilt angle.

5. An area division device for dividing a large-scale area, comprising an area division unit that performs area division in the large-scale area by implementing a graph partitioning method based on cell information for each cell in each base station and large-scale area information for the large-scale area including each cell, and calculating a set of small areas and each set of cells that optimizes each small area.

6. A program for causing a computer to execute the method according to any one of claims 1 to 4.

Citation Information

Patent Citations

  • Cellular telecommunications network

    US20190014478A1

  • Dynamic sectorization in a system with multiple cloud radio access networks

    US20200162941A1