Wireless Node Signal Relaying for IAB Network Delay Reduction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In integrated access and backhaul (IAB) wireless communication networks, the increasing number of hops leads to high decoding delay, complexity, and buffering costs due to shared radio resources, necessitating a reduction in end-to-end data transmission delay and implementation complexity while improving load balancing in AP-AP backhaul links.
Innovation Solution
A node in the wireless communication system employs signal relaying that estimates decoding error probabilities, sorts signals based on these probabilities, and requests re-transmissions for failed signals, optimizing resource allocation and spectrum usage to enhance throughput and reliability.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If the number of hops in IAB network is increased to support more CPEs and extend network coverage, then network capacity and coverage are improved, but decoding delay and implementation complexity increase significantly
Solution Approach 1:
The patent segments the aggregated data from multiple CPEs into separate individual data streams, allowing each stream to be decoded independently at intermediate APs rather than requiring joint decoding of all aggregated data. This segmentation reduces the computational complexity and decoding delay at each hop while maintaining the ability to support multiple CPEs across the network.
Solution Approach 2:
The patent performs preliminary decoding at intermediate APs before the data reaches the final destination. By decoding individual CPE streams at intermediate nodes along the multi-hop path, the system reduces the burden on the final AP and decreases overall end-to-end decoding delay, enabling support for more hops without proportionally increasing delay.
2Adaptability or versatility
If the number of hops is increased to support more CPEs per hop, then network flexibility and coverage are improved, but buffer size requirement and implementation complexity increase significantly
Solution Approach 1:
The patent divides the aggregated data from multiple CPEs into separate decodable streams at each intermediate AP. This segmentation allows each AP to independently decode and forward specific CPE streams without requiring large buffers to store all aggregated data, thereby reducing buffer size requirements and implementation complexity while maintaining network flexibility.
Solution Approach 2:
The patent implements partial decoding at intermediate APs rather than requiring complete decoding of all aggregated data from all CPEs. Each AP decodes only the portion of data it needs to forward, reducing the computational and buffering resources required at each node while still supporting a flexible multi-hop network configuration.
3Reliability
If conventional HARQ techniques are used in multi-hop IAB networks, then reliability is maintained, but end-to-end delay and buffer cost increase with the number of hops and CPEs per hop
Solution Approach 1:
The patent segments the HARQ process into independent per-CPE streams rather than requiring joint HARQ for all aggregated data. This allows individual CPE streams to be decoded and acknowledged independently at intermediate APs, reducing the end-to-end delay and buffer requirements while maintaining the reliability guarantees of HARQ for each individual stream.
Data Source
AI summary
The present disclosure relates to a first type node in a wireless communication system, wherein the first type node is adapted to: communicate with at least one other first type node in the wireless communication system over a corresponding channel receive a plurality of signals, each signal being associated with a corresponding decoding error probability, from the other first type node estimate the decoding error probability for each signal sort the signals in a decoding order according to the estimated decoding error probability, decode the signals one at the time from the lowest estimated decoding error probability to the highest estimated decoding error probability until decoding for a certain signal is determined to have failed, request re-transmission of the signal for which decoding has been determined to have failed, and to request re-transmission of all signals having higher decoding error probability than the signal for which decoding has been determined to have failed.