Wireless Broadcast Scheduling Algorithm for Stream Multiplexing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current digital broadcast networks face challenges with high terminal power usage and large channel switching delays due to periodic bursts and limited flexibility in multiplexing streams with different rates, especially in OFDMA networks.
Innovation Solution
A novel scheduling algorithm that divides broadcast data streams into frames, each containing data from only one stream, with optional next frame information, allowing terminals to sleep during irrelevant frames and adjust data rates to minimize power usage and channel switching delays, while maintaining high broadcast channel utilization.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If multiple streams are multiplexed in each transmitted burst in a cellular based network, then broadcast channel utilization is improved, but terminal power usage increases and signaling overhead becomes large
Solution Approach 1:
The patent segments the multiplexing structure by assigning only one broadcast stream per burst, dividing the transmission into single-stream units. This allows terminals to selectively receive only their desired stream without processing multiple multiplexed streams, reducing power consumption while maintaining efficient channel utilization through the scheduling algorithm.
2Use of energy by moving object
If periodic bursts are allocated to each stream in a digital broadcast network, then terminal power usage is reduced, but channel switching delay increases and flexibility in multiplexing streams with different rates is limited
Solution Approach 1:
The patent implements dynamic scheduling that adapts burst allocation based on stream characteristics and terminal requirements. The base station dynamically determines which stream receives each burst, allowing flexible accommodation of different stream rates and reducing channel switching delays while maintaining low terminal power usage through selective reception.
Solution Approach 2:
The scheduling algorithm performs preliminary planning of burst allocations, anticipating future stream requirements and pre-arranging burst assignments. This reduces channel switching delays by preparing the transmission schedule in advance, allowing terminals to know when to wake and receive their desired streams without experiencing switching penalties.
3Use of energy by moving object
If periodic bursts are allocated to each stream, then terminal power usage is reduced, but flexibility in multiplexing streams with different rates is limited
Solution Approach 1:
The scheduling algorithm dynamically adapts burst allocations to accommodate streams with different data rates. By flexibly assigning bursts based on real-time stream requirements rather than fixed periodic schedules, the system maintains low terminal power usage while achieving high versatility in supporting diverse stream types and rates.
Data Source
AI summary
A method of broadcasting data is disclosed. A plurality of broadcast data streams are received and divided into a plurality of frames. Each frame includes data from only one of the broadcast data streams. The frames can then be broadcast wirelessly.