Core Network Neighbor Relationship Detection for LTE Paging Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In LTE networks, the lack of a method to obtain neighbor relationships between eNodeBs leads to inefficient paging processes, resulting in high pressure on eNodeBs and suboptimal success rates due to the need to page all base stations in a tracking area, rather than targeting specific neighboring cells.
Innovation Solution
A method and apparatus that receive and parse messages to identify neighbor relationships between network nodes, using messages related to handover requests, extension information, or user-defined messages, allowing the core network to learn and confirm neighbor relationships between eNodeBs, thereby optimizing paging ranges and improving service efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the MME pages users in all eNodeB base stations in a tracking area list area, then the paging coverage is comprehensive, but the quantity of eNodeBs involved in paging is large causing great pressure to processing of the eNodeBs
Solution Approach 1:
The patent segments the tracking area list into multiple paging ranges based on neighbor relationships between eNodeBs. Instead of paging all eNodeBs in the TA list, the system divides them into hierarchical paging ranges (first paging range, second paging range, etc.), allowing selective paging of relevant subsets of eNodeBs while maintaining comprehensive coverage through multiple ranges.
Solution Approach 2:
The patent applies local quality by creating paging ranges with different scopes and priorities. The first paging range includes eNodeBs with stronger neighbor relationships (higher priority), while the second paging range includes eNodeBs with weaker relationships (lower priority). This allows the system to apply different paging strategies to different local areas based on their neighbor relationship characteristics.
2Productivity
If the MME pages a user only in a range of an eNodeB on which the user camps last time and a neighboring eNodeB, then the processing pressure on eNodeBs is reduced, but the paging success rate may only be 65% to 70%
Solution Approach 1:
The patent makes the paging process dynamic by implementing a hierarchical paging mechanism. The system first pages users in the first paging range (higher priority), and if unsuccessful, dynamically expands to the second paging range (lower priority). This dynamic expansion allows the system to adapt to different scenarios and achieve higher overall success rates while maintaining reduced processing pressure compared to paging all eNodeBs.
Solution Approach 2:
The patent applies partial action by performing paging in stages rather than all at once. The first paging range covers the most likely locations (partial coverage), and the second paging range provides additional coverage if needed. This staged approach achieves better than 90% success rate by combining partial coverage with conditional expansion, avoiding the need to page all eNodeBs simultaneously.
3Productivity
If the MME learns information about neighbor relationship between network nodes, then the paging efficiency is improved by targeting specific neighboring cells, but the device complexity increases due to the need to parse messages and obtain neighbor relationships
Solution Approach 1:
The patent implements self-service by having eNodeBs automatically generate and send neighbor relationship information to the MME without requiring complex external configuration. The MME automatically parses these messages and builds the paging range information. This self-service mechanism reduces the need for manual configuration and external intervention, making the system easier to deploy and maintain despite the added functionality.
Data Source
AI summary
The present invention discloses a method and an apparatus for obtaining a neighbor relationship between network nodes, and a network device. The method includes: receiving a message sent by a network node; and parsing the message, to obtain a neighbor relationship between at least two network nodes involved in the message. The present invention further discloses a corresponding apparatus for obtaining a neighbor relationship between network nodes, and network device. According to the message sent by the network node, a core network learns the neighbor relationship between network nodes, and efficiency of performing a service between neighboring network nodes may be improved by using the neighbor relationship.