Relay Cell List Compilation for Wireless Network Access
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In wireless communication systems, especially in fleet systems with mobile relays, user equipment (UE) experiences frequent reselections due to changing lists of neighboring relays, leading to inefficient network access and increased latency, as traditional methods do not provide an up-to-date neighbor list in idle mode.
Innovation Solution
A method and apparatus for dynamically updating and providing a relay cell list to UE based on path information from multiple relays, allowing the UE to efficiently search and select the best relay for network access, including a path server that compiles and provides this list based on geographic locations and times of relay operation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the UE always selects the best cell based on scanning in idle mode, then the UE can maintain connection to the strongest signal, but the UE experiences frequent reselections due to changing relay positions
Solution Approach 1:
The path server pre-compiles relay cell lists based on predicted relay paths and geographic locations before the UE needs them. This preliminary preparation allows the UE to acquire relay information faster and reduces the frequency of reselection operations, directly addressing the contradiction between connection stability and reselection frequency
2Loss of time
If a neighbor list is provided to the UE in idle mode, then the number of reselections can be reduced, but the neighbor list becomes outdated quickly due to relay mobility
Solution Approach 1:
The system transitions from static neighbor lists to dynamic relay cell lists that are continuously updated based on real-time relay path information and geographic locations. The path server generates updated lists as relays move, ensuring the information remains current while reducing reselection frequency
Solution Approach 2:
The system implements feedback mechanisms where the path server continuously monitors relay positions and path information, then updates the relay cell lists accordingly. This closed-loop approach ensures the neighbor list accuracy is maintained despite relay mobility, resolving the contradiction between reducing reselections and keeping information current
3Adaptability or versatility
If the UE performs frequent scanning to find the best relay, then the UE can adapt to relay mobility, but network access efficiency decreases and latency increases
Solution Approach 1:
The path server pre-calculates and provides relay cell lists with predicted relay positions and path information before the UE needs to make selection decisions. This preliminary action allows the UE to quickly acquire relevant relay information without extensive scanning, improving network access efficiency while maintaining adaptability to relay mobility
Solution Approach 2:
The path server acts as an intermediary between the mobile relays and the UE, processing relay path information and generating optimized relay cell lists. This intermediary function reduces the scanning burden on the UE while ensuring accurate relay selection, thereby improving network access efficiency without sacrificing adaptability
Data Source
AI summary
Disclosed are apparatuses and techniques for wireless communications. In an aspect, path information from a plurality of relays is received at a server. A relay cell list for an area of interest is compiled based on the received path information from the plurality of relays. The relay cell list is provided to a user equipment (UE). The UE can use the relay list to assist in the search and/or selection of relays in the wireless communications network.