Non-consecutive Subframe Scheduling for Wireless Latency Reduction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current scheduling mechanisms in wireless communications networks, particularly in LTE, face limitations in dynamic resource allocation and flexibility, leading to increased latency and reduced adaptability due to constraints imposed by scheduling restrictions, especially in scenarios with interference coordination and heterogeneous deployments.
Innovation Solution
Implementing a method in network nodes and wireless devices for dynamic allocation of non-consecutive subframes, where multi-TTI scheduling messages indicate the allocation of specific subframes for data transmission or reception, allowing for more flexible and efficient resource utilization.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Stability of the object's composition
If consecutive subframes are allocated for data transmission, then resource allocation continuity is improved, but scheduling flexibility and adaptability deteriorate
Solution Approach 1:
The patent segments the resource allocation into non-consecutive subframes, allowing the network to allocate specific subframes independently rather than as a continuous block. This segmentation enables flexible selection of subframes based on channel conditions, interference patterns, and traffic requirements, resolving the contradiction between continuity and flexibility.
Solution Approach 2:
The patent implements dynamic scheduling where the set of subframes allocated for data transmission can change adaptively based on current network conditions. The network can dynamically adjust which non-consecutive subframes are allocated, transforming the static continuous allocation into a dynamic flexible structure that responds to changing conditions.
2Reliability
If scheduling restrictions are imposed for interference coordination, then network stability is improved, but latency increases
Solution Approach 1:
The patent applies preliminary scheduling actions by pre-configuring sets of non-consecutive subframes that are suitable for interference coordination. This allows the network to establish stable patterns in advance while maintaining the ability to switch between different pre-configured sets, reducing the need for frequent re-scheduling and thereby reducing latency.
Solution Approach 2:
The patent changes the scheduling parameters by allowing allocation of non-consecutive subframes with varying patterns and densities. This enables the network to adjust the degree of restriction dynamically - using more restrictive patterns when interference coordination is critical and less restrictive patterns when latency is the primary concern, thus resolving the contradiction.
3Adaptability or versatility
If dynamic resource allocation is implemented, then scheduling flexibility is improved, but system complexity increases
Solution Approach 1:
The patent creates a universal scheduling framework that can handle both consecutive and non-consecutive subframe allocations through a unified mechanism. The same scheduling entity and message structures are used regardless of whether subframes are consecutive or not, reducing the need for separate complex handling logic and thereby managing system complexity while maintaining flexibility.
Solution Approach 2:
The patent introduces an intermediary scheduling mechanism that mediates between the network's resource allocation decisions and the actual transmission. The multi-TTI scheduling message acts as an intermediary carrier that conveys the allocation information, simplifying the interface between scheduling logic and execution while enabling complex non-consecutive allocations.
4Productivity
If multi-TTI scheduling messages are used for non-consecutive subframes, then resource allocation efficiency is improved, but message complexity increases
Solution Approach 1:
The patent merges multiple resource allocation decisions into a single multi-TTI scheduling message. Instead of sending separate scheduling messages for each subframe or small group of subframes, the system combines allocations for multiple non-consecutive subframes into one message, improving resource allocation efficiency by reducing signaling overhead while managing message complexity through structured encoding.
Solution Approach 2:
The patent changes the parameters of the scheduling message to efficiently represent non-consecutive subframe allocations. By using compact encoding schemes and optimized message structures that can represent arbitrary non-consecutive patterns with minimal bits, the system achieves high resource allocation efficiency without proportionally increasing message complexity.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
The embodiments herein relate to method in a network node (301) for handling scheduling of a wireless device (305) in a communications network (300). The network node (301) is adapted to communicate with the wireless device (305) over a radio channel (310). The network node (301) dynamically allocates a set of non-consecutive subframes in which the network node (301) is to transmit data to the wireless device (305) or receive data from the wireless device (305). The network node (301) transmits a multi-Time Transmission Interval, TTI, scheduling message to the wireless device (305), which multi-TTI scheduling message comprises information indicating the dynamically allocated non-consecutive subframes.