Differentiated Neighbor List for QoS Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current cellular networks face challenges in maintaining quality of service (QoS) during handovers and idle re-selection of cells due to the lack of differentiated neighbor lists tailored to specific service requirements, such as varying latency and throughput needs across different user equipment types.
Innovation Solution
A framework for generating and dynamically updating differentiated neighbor lists based on service requirements, including UE group identifiers, network slicing, and QoS flow, which characterizes neighbors by service types, distance, transport costs, and latency, allowing for optimized neighbor selection for each type of service.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a single unified neighbor list is used for all user equipment, then the system complexity is reduced and ease of operation is improved, but the quality of service for different service types (e.g., massive IoT, UAVs) cannot be optimized
Solution Approach 1:
The patent segments the unified neighbor list into multiple differentiated neighbor lists, each tailored to specific service types (e.g., massive IoT, UAVs, critical communications). This segmentation allows each service type to have optimized neighbor selection criteria, improving QoS reliability without requiring complete system redesign, as each segment can be managed independently based on its specific requirements.
Solution Approach 2:
The patent applies local quality by creating neighbor lists with service-specific characteristics and optimization criteria. Each differentiated neighbor list contains neighbors selected and weighted according to the particular requirements of that service type (e.g., latency-critical for UAVs, connectivity density for massive IoT), allowing localized optimization without affecting other service types.
2Reliability
If differentiated neighbor lists are generated for specific service types, then the quality of service is improved, but the complexity of neighbor list management and processing increases
Solution Approach 1:
The patent implements self-service mechanisms where the system automatically generates, updates, and manages differentiated neighbor lists based on service type identification. The network infrastructure autonomously performs the complex tasks of neighbor selection, filtering, and optimization for each service type without requiring manual intervention, thereby maintaining ease of operation despite the increased differentiation.
Solution Approach 2:
The patent applies preliminary action by pre-generating and storing differentiated neighbor lists for various service types before actual handover or reselection events occur. This allows the system to have optimized neighbor lists ready in advance for different service scenarios, reducing real-time processing complexity during critical handover moments while maintaining high QoS.
3Adaptability or versatility
If neighbor lists are dynamically updated based on service requirements, then the adaptability to different service types is improved, but the processing time and network overhead increase
Solution Approach 1:
The patent implements periodic action by updating differentiated neighbor lists at predetermined intervals or triggered by specific events (e.g., service type changes, mobility events) rather than continuously. This periodic update mechanism maintains adaptability to different service types while reducing unnecessary processing time and network overhead by avoiding constant updates when service requirements remain stable.
Solution Approach 2:
The patent applies dynamics by making the neighbor list structure and update frequency adaptive to the specific service type and current network conditions. Different service types can have different update dynamics (e.g., more frequent updates for mobile UAVs, less frequent for stationary IoT devices), allowing the system to balance adaptability with processing efficiency based on actual service requirements rather than using a fixed update schedule for all services.
Data Source
AI summary
Disclosed are systems and methods for providing a differentiated neighbor list that can be individually generated for a specific service (e.g., per service) based on network service information, which can include, but is not limited to, a user equipment (UE) group identifier (ID), network slicing and/or quality of service (QoS) flow, and the like. Neighbors within the differentiated list can be characterized based on, but not limited to, service types, distance to devices, transport costs, service locations, and the like, or some combination thereof. The disclosed framework can generate and dynamically update a differentiated neighbor list for specific types of services so that optimal neighbor selection is performed for the type of service a UE is operating within to ensure that a network connection is maintained at a threshold satisfying QoS.


