Scheduling Algorithm for Low-Delay Wireless Transmissions
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
High-delay communication links in telecommunication systems are less effective due to increased data traffic and poor channel conditions, leading to reduced spectral and network efficiency, necessitating a channel-aware system that balances load and maintains high-quality service.
Innovation Solution
A scheduling algorithm is selected based on packet transmission delay data at a base band unit (BBU) to prioritize low-delay transmissions, using link identification and scheduling algorithms such as fair, data rate, or hybrid scheduling to optimize resource allocation among wireless devices.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If conventional scheduling algorithms are used without considering channel quality, then device complexity is reduced, but spectral efficiency and network efficiency deteriorate
Solution Approach 1:
The system changes the scheduling parameter from simple queue depth to a composite metric that incorporates channel quality indicators (CQI), packet transmission delay data, and link identification. This allows the scheduler to adapt to varying channel conditions and prioritize transmissions that will result in lowest overall delay, thereby improving spectral efficiency without requiring completely new scheduling architecture
Solution Approach 2:
The system implements feedback mechanisms by continuously monitoring packet transmission delay data and channel quality indicators, then using this information to adjust scheduling decisions. The BBU receives feedback about actual transmission performance and uses this to refine future scheduling algorithms, creating a closed-loop system that improves efficiency over time
2Adaptability or versatility
If high-delay communication links are used, then network coverage is expanded, but transmission quality and reliability deteriorate
Solution Approach 1:
The system applies local quality by treating different communication links differently based on their specific characteristics. Each link is assigned a link identification and monitored for its own channel quality conditions. The scheduler adjusts its behavior locally for each link, applying different scheduling algorithms or priority levels to links with poor channel conditions versus those with good conditions, thereby maintaining reliability across diverse network topologies
Solution Approach 2:
The system makes scheduling decisions dynamic by continuously adapting to changing channel conditions. When channel quality deteriorates on a particular link, the system can dynamically adjust transmission parameters, switch to alternative links, or modify scheduling priorities. This dynamic adaptation allows the system to maintain reliable transmissions even as network conditions change
3Productivity
If data traffic increases, then network capacity is utilized, but transmission delay increases and efficiency decreases
Solution Approach 1:
The system performs preliminary actions by proactively identifying packets that are likely to experience high delay based on channel quality predictions and link characteristics. These packets are pre prioritized or marked for special handling before transmission begins. This allows the system to prepare for potential congestion and delay issues in advance, rather than reacting after they occur
Solution Approach 2:
The system segments the data traffic into different classes or queues based on link identification, channel quality, and packet characteristics. This segmentation allows the scheduler to apply different handling strategies to different traffic types, ensuring that time-sensitive or high-priority packets receive preferential treatment during periods of high network capacity utilization
Data Source
AI summary
Systems and methods are described for scheduling low-delay transmissions from an access node. Packet transmission delay data associated with communication links is received at a base band unit (BBU). The communication links can be routed between pluralities of antennas of the BBU. A link identification can be assigned to each of the communication links and to each antenna in communication with the BBU. A scheduling algorithm in communication with one of the antennas is selected, at the BBU, from a plurality of scheduling algorithms based on the packet transmission delay data associated with at least one of the communication links. Packet data for at least one wireless device may be transmitted using the selected scheduling algorithm.