Ma, Zhangchao and Xiang, Wei and Long, Hang and Wang, Wenbo (2011) Proportional fair resource partition for LTE-advanced networks with Type I relay nodes. In: ICC 2011: Source of Innovation: Back to the Origin, 5-9 Jun 2011 , Kyoto, Japan.
In 3GPP LTE-Advanced networks deployed with type I relay nodes (RNs), resource partition is required to support in-band relaying. This paper focuses on how to partition system resources in order to attain improved fairness and efficiency. We first formulate the generalized proportional fair (GPF) resource allocation problem to provide fairness for all users served by the evolved node B (eNB) and its subordinate RNs. Assuming traditional proportional fair scheduling is executed independently at the eNB and each RN to achieve local fairness, we propose the proportional fair resource partition algorithm to tackle the GPF problem and ensure global fairness. Through system level simulations, the proposed algorithm is evaluated and compared with both non-relaying and relaying systems with the fixed resource partition approach. Simulation results demonstrate that the proposed algorithm can achieve a good trade-off between system throughput and fairness performance.
|Item Type:||Conference or Workshop Item (Commonwealth Reporting Category E) (Paper)|
|Additional Information:||Permanent restricted access to publisher version due to publisher copyright policy.|
|Uncontrolled Keywords:||fairness performance; in-band; partition algorithms; partition systems; proportional fair scheduling; relay node; relaying systems; resource allocation problem; simulation result; system level simulation; system throughput|
|Depositing User:||Dr Wei Xiang|
|Date Deposited:||25 Jun 2012 03:07|
|Last Modified:||03 Jul 2013 01:06|
Actions (login required)
|Archive Repository Staff Only|