Wireless Resource Allocation via Dynamic Delivery Time Estimation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current wireless packet-data networks with centralized control face challenges in effectively prioritizing uplink transmission resource allocation between mobile terminals due to predetermined threshold-based triggering mechanisms for scheduling requests and buffer status reports, which do not account for the probability of successful transmission within a given time frame.
Innovation Solution
A method that estimates the time needed to deliver data units with a predetermined probability of success, allowing for the generation of resource signals when the estimated time exceeds a threshold, incorporating statistical analysis of past transmission history and HARQ retransmissions to determine more flexible and efficient triggering criteria.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If predetermined threshold-based triggering mechanisms are used for scheduling requests and buffer status reports, then the resource allocation process is simple to implement, but the resource allocation efficiency deteriorates because the mechanisms do not account for the probability of successful transmission within a given time frame
Solution Approach 1:
The patent changes the triggering parameter from a fixed predetermined threshold to a dynamic threshold based on estimated delivery time and probability of success. The secondary station estimates the time needed to deliver data units with a predetermined probability of success, and triggers scheduling requests or buffer status reports when this estimated time exceeds a threshold, thereby improving resource allocation efficiency while maintaining manageable complexity through standardized estimation procedures
Solution Approach 2:
The patent introduces feedback mechanisms where the secondary station continuously monitors transmission history, HARQ retransmission outcomes, and channel conditions to update its delivery time estimates. This feedback loop allows the system to adapt triggering decisions based on actual transmission performance, improving efficiency without requiring overly complex centralized control
2Reliability
If statistical analysis of past transmission history and HARQ retransmissions is incorporated to determine triggering criteria, then the probability of successful transmission is improved, but the computational complexity increases
Solution Approach 1:
The patent applies preliminary action by having the secondary station pre-estimate the delivery time for queued data units before actual transmission attempts. This estimation is performed using stored transmission history and HARQ statistics, allowing the station to proactively determine when triggering is needed rather than reacting to failures after they occur, thereby improving reliability while keeping computational complexity manageable through efficient historical data utilization
Solution Approach 2:
The secondary station performs self-service by autonomously estimating delivery times and making triggering decisions based on its own transmission history and buffer status. This self-service capability improves reliability through localized adaptive decision-making while avoiding the need for complex centralized computation, as each station independently manages its own triggering based on locally available information
Data Source
AI summary
The present invention relates to a method for operating a network comprising a primary station communicating with a plurality of secondary stations, the method comprising the primary station communicating with a secondary station in a discontinuous mode; the secondary station transmitting to the primary station a control message based on the current status of the secondary station; and the primary station changing a parameter of the discontinuous mode based on the control message.