OFDMA Relay Scheduling via Linear Relaxation and Bisection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing OFDMA relay networks face challenges in optimizing adaptive frame segmentation and access hop reuse, leading to suboptimal utilization of resources and throughput performance, particularly in next-generation broadband access technologies like WiMAX.
Innovation Solution
A scheduling method that formulates integer programs for adaptive resource usage, employing linear programming relaxation and bisection approaches to optimize frame segmentation and access hop reuse, providing near-optimal performance and efficient resource allocation across relay and access hops.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If adaptive frame segmentation and access hop reuse are implemented to maximize network flow, then throughput performance is improved, but scheduling complexity increases due to the need to optimize resource allocation across two hops
Solution Approach 1:
The scheduling problem is segmented into two independent parts: relay hop resource allocation and access hop resource allocation. The relay hop scheduling optimizes resource allocation to maximize network flow, while the access hop scheduling independently optimizes frame segmentation and reuse. This segmentation allows each sub-problem to be solved separately, reducing overall scheduling complexity while maintaining high throughput performance.
Solution Approach 2:
The system dynamically adjusts frame segmentation and access hop reuse based on real-time channel conditions and traffic demands. The scheduler adapts the number of frames, frame lengths, and resource allocation decisions dynamically to maximize throughput under varying network conditions, resolving the complexity-performance tradeoff through adaptive rather than static scheduling.
2Productivity
If integer programming is used to formulate scheduling optimization, then resource allocation optimality is improved, but computational complexity and processing time increase
Solution Approach 1:
Instead of solving the complete integer programming problem exactly, the system uses linear programming relaxation to obtain a fractional solution that provides near-optimal resource allocation. This partial action approach sacrifices some computational exactness for significantly reduced processing time and complexity, achieving sufficient optimality for practical throughput maximization without the heavy computational burden of exact integer programming.
Solution Approach 2:
The formulation changes from integer programming with binary variables to linear programming with continuous variables. This parameter change allows the use of more efficient linear programming algorithms that can handle the relaxed problem faster and with lower computational complexity, while the fractional solutions can be effectively rounded or used directly for resource allocation decisions.
3Productivity
If frame segmentation is optimized to maximize network flow, then throughput is improved, but the difficulty of detecting and measuring optimal segmentation increases
Solution Approach 1:
The scheduler incorporates feedback mechanisms that monitor network conditions, throughput performance, and channel quality in real-time. This feedback information is used to dynamically adjust frame segmentation parameters and resource allocation decisions, making the system self-optimizing without requiring complex external measurement and analysis. The feedback loop enables automatic adaptation to changing conditions while maintaining high network flow capacity.
Data Source
AI summary
A method for scheduling transmissions in wireless network includes receiving information ranging from conventional data to real-time streaming applications into a basestation of an OFDMA wireless relay network and scheduling transmission of the information from the basestation by influencing adaptive frame segmentation and access hop reuse in the transmission of the information for achieving higher transmission flow of the information, Where the scheduling is formulated as an integer program, the scheduling includes solving a linear programming relaxation of the integer program and rounding to integral allocations with allocation to at least one of a subset of wireless users and subsets of relays in the network for obtaining frame segmentation and reuse. Where the scheduling is formulated by following a bisection approach to guide adaptation of the frame segmentation, the scheduling determines a subset of users with maximum flow per unit resource for a given frame segmentation and the resulting flow from current and previous scheduling being used to guide adaptation of frame segmentation towards convergence.