Distributed Scheduling Using Proportional Fairness Link Classes
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In wireless communication systems, there is a trade-off between fairness and maximum system throughput in distributed scheduling, where focusing on one aspect often compromises the other, leading to resource starvation or degraded system efficiency.
Innovation Solution
The implementation of a Proportional Fairness (PF) value-based algorithm that determines a link class for nodes, adjusting contention metrics such as backoff offset or resource location to ensure fair channel occupation while maximizing system throughput, by prioritizing nodes with higher PF values.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If distributed scheduling adopts contention-based method to maximize system throughput, then system throughput is improved, but fairness between nodes deteriorates causing resource starvation
Solution Approach 1:
The patent changes the contention parameter from uniform random selection to PF-value-based selection. Each node is assigned a PF value that reflects its channel conditions and historical performance, and nodes with higher PF values get prioritized in contention. This parameter change transforms the contention mechanism from purely random to fairness-aware, resolving the contradiction between throughput and fairness.
Solution Approach 2:
The patent implements feedback mechanisms where nodes continuously report their PF values and channel occupancy information. The system uses this feedback to dynamically adjust contention priorities and allocate resources more fairly. The feedback loop ensures that nodes with better channel conditions or higher priority can secure resources more effectively, maintaining both throughput and fairness.
2Reliability
If distributed scheduling prioritizes fairness to ensure fair resource occupation, then fairness is improved, but system throughput deteriorates
Solution Approach 1:
The patent introduces PF value as a new parameter that combines fairness considerations with throughput optimization. By calculating PF values based on channel conditions, historical occupancy patterns, and node priorities, the system achieves fair resource distribution without sacrificing overall throughput. The PF value serves as a balancing parameter that reconciles fairness and efficiency goals.
3Device complexity
If nodes randomly select radio resources in distributed scheduling, then device complexity is reduced, but fairness and throughput performance deteriorate
Solution Approach 1:
The patent enables nodes to autonomously determine their PF values and make self-based contention decisions without requiring complex centralized scheduling algorithms. Each node independently calculates its PF value based on local channel conditions and historical data, then uses this information to make optimal contention decisions. This self-service approach maintains low complexity while significantly improving throughput and fairness performance.
Data Source
AI summary
An apparatus and a method for transmitting data according to distributed scheduling by guaranteeing fairness and considering system throughput at same time in a wireless communication system are provided. The method for operations of a terminal for transmitting the data include determining a Proportional Fairness (PF) value, determining a link class of a link to a peer terminal using the PF value, determining a variable which is used to determine whether the terminal wins or loses a contention according to the link class, and transmitting a request message requesting channel occupation based on the contention according to the variable.