Cell Tier Determination via Delaunay Triangulation Edge Removal
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current Self-Organizing Network (SON) algorithms face challenges in accurately determining cell tier relationships, especially in irregularly deployed cellular networks, due to the complexity of obtaining cell coverage information and the inefficiency of existing methods for neighbor list optimization.
Innovation Solution
The method involves using Delaunay triangulation to establish neighbor tier relationships between cells by removing edges based on distance and angle criteria, thereby improving tier counts and updating neighbor lists for efficient handover processes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Extent of automation
If Delaunay triangulation is used to establish neighbor relationships, then the automated determination of cell tier relationships is improved, but the accuracy in irregularly deployed networks deteriorates due to long edges connecting non-adjacent cells
Solution Approach 1:
The patent extracts and removes edges from the Delaunay triangulation that do not represent true first-tier neighbor relationships. By identifying and eliminating these spurious long edges, the method retains the automated benefit of Delaunay triangulation while correcting its accuracy缺陷 in irregular network deployments
Solution Approach 2:
The patent introduces additional parameters (distance thresholds, angle criteria) to modify the edge selection process. By changing the criteria for edge inclusion from purely geometric to incorporating network-specific parameters, the method adapts to irregular deployments while maintaining automation
2Device complexity
If a single distance threshold is applied to all cells, then the algorithm simplicity is improved, but the performance in varying cell density environments deteriorates
Solution Approach 1:
The patent applies different distance thresholds to different cells based on their local environment and deployment characteristics. Instead of a uniform threshold, each cell can have a customized threshold that reflects its specific density context, improving reliability without significantly increasing complexity
Solution Approach 2:
The patent makes the distance threshold dynamic rather than static. Thresholds can be adjusted based on network conditions, cell type, and deployment scenario, allowing the algorithm to adapt to varying densities while maintaining reasonable simplicity through automated parameter selection
3Measurement precision
If manual inspection is used to determine cell tiers, then the accuracy of neighbor relationships is improved, but the time consumption and error potential increase
Solution Approach 1:
The patent creates a system that performs automated tier determination with accuracy comparable to manual inspection. By combining Delaunay triangulation with edge removal algorithms and configurable criteria, the system serves itself by automatically identifying and correcting its own limitations without requiring manual intervention
Solution Approach 2:
The patent incorporates feedback mechanisms where the automated algorithm can be validated and refined against manual inspection results. This feedback loop allows the system to learn from manual corrections and improve its automated determination accuracy over time, reducing both time consumption and error potential
Data Source
Figure 1
Figure 2~4
Figure 5A~5B
AI summary
A process for determining neighbor tier relationships between cells in a wireless telecommunications network includes establishing a plurality of cell points, each cell point representing a cell of a plurality of cells in the wireless telecommunications network, forming a plurality of triangles, the vertices of each triangle of the plurality of triangles corresponding to respective cell points of the plurality of cell points, removing edges from a portion of the plurality of triangles, determining neighbor tier relationships between the plurality of cells using remaining triangle edges between the plurality of cell points, storing the neighbor tier relationships in a first memory, and using the neighbor tier relationships for handovers between the plurality of cells.