Node Ranking via Transition Matrix for Wireless Handover Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In wireless cellular telecommunication networks, dual connectivity scenarios face significant signaling overhead and resource shortages due to frequent handovers between home base stations, particularly in high-density areas, which can lead to congestion and quality of service degradation.
Innovation Solution
A method and device that determine a ranking of nodes within a group of nodes to identify alternative nodes for mobile terminals, using a neighborhood graph and transition matrix to optimize handover performance and reduce signaling congestion, by expressing uniform random mobility and selecting nodes with the lowest expected handovers for alternative service.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If frequent handovers are performed between home base stations in high-density areas, then mobile terminal connectivity is maintained, but signaling overhead increases and network congestion occurs
Solution Approach 1:
The patent pre-calculates and stores transition matrices and node rankings before handover events occur. By analyzing historical handover data and mobility patterns in advance, the system prepares optimal handover targets and routing paths, reducing the need for real-time signaling exchanges during actual handovers, thus decreasing signaling overhead while maintaining connectivity reliability
Solution Approach 2:
The patent introduces a core network entity that acts as an intermediary to manage and optimize handover signaling. This intermediary consolidates handover decisions, pre-determines alternative home base stations, and manages the transition matrices, reducing the signaling burden on individual home base stations and the overall network by centralizing the optimization function
2Reliability
If multiple home base stations serve a mobile terminal in dual connectivity scenario, then service quality is improved, but control resource shortage occurs due to frequent handovers
Solution Approach 1:
The patent pre-identifies and ranks alternative home base stations before they are needed for handover. By calculating transition matrices and determining optimal routing paths in advance, the system prepares control resource allocation strategies ahead of time, ensuring that when handovers occur in dual connectivity scenarios, control resources are already optimized and available, preventing resource shortages
Solution Approach 2:
The patent dynamically adjusts routing parameters and control signal paths based on pre-calculated transition matrices. By changing the parameters of control signal routing (such as selecting different alternative home base stations based on ranked lists), the system optimizes control resource utilization while maintaining dual connectivity service quality, avoiding resource exhaustion from frequent handovers
3Reliability
If dynamic switch coordinated multipoint is established, then quality of service is maintained during handovers, but important signaling overhead is introduced over the core network
Solution Approach 1:
The patent pre-determines the optimal set of alternative home base stations and their rankings using transition matrices before DS-CoMP is activated. By having these rankings and alternative node lists prepared in advance, the core network does not need to perform real-time calculations and signaling exchanges when establishing DS-CoMP during handovers, thus maintaining QoS while significantly reducing the signaling overhead over the core network
Data Source
Figure 1~2
Figure 3~4
Figure 5~6
AI summary
The present invention concerns a method for determining a ranking of nodes of a group of nodes a centralizing device being in charge of, the ranking being intended to be used for determining a list of alternative nodes that may serve a mobile terminal located in the area covered by the group of nodes, the mobile terminal being served simultaneously by plural nodes. The method comprises the steps, executed by the centralizing device, of: - determining a neighbourhood graph of the group of nodes, - determining a transition matrix from the determined neighbourhood graph, the transition matrix being a matrix that expresses uniform random mobility in the group of nodes, -ranking the nodes according to the determined transition matrix.