Cellular Network Management via Triangulation Diagram Ranking
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The exponential growth in cellular device usage and data traffic overcomes existing cellular networks, leading to performance issues and costly, time-consuming base station installations, with conventional methods being computationally expensive and inefficient for managing large-scale cellular network configurations and topology changes.
Innovation Solution
A method involving the generation of a triangulation diagram using location coordinates of coverage cells, identifying neighboring cells with shared boundaries, ranking them based on boundary length, and creating a selected neighbor list to efficiently manage and maintain cellular networks, including determining proximal antennas and base stations.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If the number of base stations is increased to handle higher data traffic, then network capacity is improved, but installation cost and time increase
Solution Approach 1:
The system pre-calculates and stores distance matrices between all base stations and antennas before they are physically installed. This preliminary computational action allows the network to be configured and activated immediately after installation without requiring time-consuming distance calculations during deployment
Solution Approach 2:
The patent creates a virtual representation (distance matrix) of the physical base station network. This copied data structure allows the system to manage and analyze network topology without requiring direct physical measurements, enabling rapid deployment and configuration
2Measurement precision
If conventional methods are used to determine distances between base stations through simulations and on-site measurements, then accurate network mapping is achieved, but computational cost and time increase
Solution Approach 1:
Distance matrices are pre-calculated and stored in databases before network operations begin. This preliminary computation eliminates the need for real-time simulations and on-site measurements during network configuration and fault diagnosis
Solution Approach 2:
The patent replaces physical measurement methods (on-site distance measurements and heavy simulations) with a computational approach using pre-stored distance matrices. This substitution eliminates the need for repeated mechanical measurements while maintaining mapping accuracy
3Adaptability or versatility
If the network topology changes during operation, then network adaptability is improved, but the distance matrix must be recalculated increasing computational burden
Solution Approach 1:
When network topology changes occur, the system extracts only the affected portions of the distance matrix rather than recalculating the entire matrix. This selective extraction and update approach maintains network adaptability while minimizing computational overhead
Solution Approach 2:
The distance matrix is designed to be dynamically updatable, allowing the system to adapt to topology changes by modifying only the necessary entries. This dynamic approach enables the network to respond to changes without requiring complete recalculation, maintaining both adaptability and computational efficiency
Data Source
Figure 1
Figure 2
Figure 3A
AI summary
Disclosed is a method (100) for managing a cellular network (300). The method comprises receiving information about a plurality of coverage cells (302, 302X) in the cellular network and location coordinates of each coverage cell; generating a triangulation diagram (304) corresponding to the location coordinates of each coverage cell; identifying for a target mapped cell (312X), corresponding to a target coverage cell (302X), neighbouring mapped cells (312A-312G) having a shared boundary in the triangulation diagram; determining a length (L1-L7) of the shared boundary between the target mapped cell (312X) and each one of the neighbouring mapped cells; assigning a ranking to each one of the neighbouring mapped cells based on the corresponding length of the shared boundary with the target mapped cell; and generating a selected neighbour list for the target coverage cell based on the ranking of the corresponding neighbouring mapped cells.