Distributed two‐hop proportional fair resource allocation in Long Term Evolution Advanced networks. Issue 3 (12th August 2014)
- Record Type:
- Journal Article
- Title:
- Distributed two‐hop proportional fair resource allocation in Long Term Evolution Advanced networks. Issue 3 (12th August 2014)
- Main Title:
- Distributed two‐hop proportional fair resource allocation in Long Term Evolution Advanced networks
- Authors:
- Sun, Chen
Wang, Weidong
Zhang, Yinghai
Wang, Xiaojun - Abstract:
- Abstract: In Long Term Evolution Advanced networks with Type I in‐band half‐duplex decode‐and‐forward relay nodes, proportional fair (PF) resource allocation is aiming at guaranteeing two‐hop match and optimising global proportional fairness. The two‐hop match is defined as equal data rates in the access links and the corresponding backhaul links. The global proportional fairness is between all the user equipments served by the evolved nodes B and the relay nodes. Existing centralised schemes achieve these targets at the cost of enormous channel state information (CSI) exchange. Existing distributed schemes focus on resource partitioning and employ a traditional single‐hop PF scheduling algorithm in access links, with less CSI exchange. The traditional PF scheduling algorithm maximises single‐hop proportional fairness between the data rates in the access links rather than two‐hop proportional fairness between the end‐to‐end data rates in the two hops. In order to reduce CSI exchange and at the same time to maximise the two‐hop proportional fairness, a distributed two‐hop PF resource allocation scheme is proposed. The proposed scheme includes two‐hop PF resource scheduling algorithms and adaptive resource partitioning algorithms, applied in different two‐hop transmission protocols. Simulation results demonstrate the proposed scheme is better than the existing distributed schemes in obtaining better proportional fairness and larger cell‐edge user equipment throughputs.Abstract: In Long Term Evolution Advanced networks with Type I in‐band half‐duplex decode‐and‐forward relay nodes, proportional fair (PF) resource allocation is aiming at guaranteeing two‐hop match and optimising global proportional fairness. The two‐hop match is defined as equal data rates in the access links and the corresponding backhaul links. The global proportional fairness is between all the user equipments served by the evolved nodes B and the relay nodes. Existing centralised schemes achieve these targets at the cost of enormous channel state information (CSI) exchange. Existing distributed schemes focus on resource partitioning and employ a traditional single‐hop PF scheduling algorithm in access links, with less CSI exchange. The traditional PF scheduling algorithm maximises single‐hop proportional fairness between the data rates in the access links rather than two‐hop proportional fairness between the end‐to‐end data rates in the two hops. In order to reduce CSI exchange and at the same time to maximise the two‐hop proportional fairness, a distributed two‐hop PF resource allocation scheme is proposed. The proposed scheme includes two‐hop PF resource scheduling algorithms and adaptive resource partitioning algorithms, applied in different two‐hop transmission protocols. Simulation results demonstrate the proposed scheme is better than the existing distributed schemes in obtaining better proportional fairness and larger cell‐edge user equipment throughputs. Copyright © 2014 John Wiley & Sons, Ltd. Abstract : In this paper, we focus on a distributed resource allocation problem for maximising the global end‐to‐end proportional fairness in LTE‐Advanced networks with Type 1 relay nodes. A distributed resource allocation scheme is proposed to solve this problem in different two‐hop transmission protocols, including two‐hop proportional fair resource scheduling algorithms and adaptive resource partitioning algorithms. Simulation results demonstrate the effectiveness of the proposed scheme, compared with the traditional proportional fair resource scheduling algorithm and adaptive resource partitioning algorithm. … (more)
- Is Part Of:
- Wireless communications and mobile computing. Volume 16:Issue 3(2016)
- Journal:
- Wireless communications and mobile computing
- Issue:
- Volume 16:Issue 3(2016)
- Issue Display:
- Volume 16, Issue 3 (2016)
- Year:
- 2016
- Volume:
- 16
- Issue:
- 3
- Issue Sort Value:
- 2016-0016-0003-0000
- Page Start:
- 264
- Page End:
- 278
- Publication Date:
- 2014-08-12
- Subjects:
- LTE‐advanced -- relay -- proportional fair -- resource allocation
Wireless communication systems -- Periodicals
Mobile communication systems -- Periodicals
621.38205 - Journal URLs:
- https://onlinelibrary.wiley.com/journal/15308677 ↗
https://www.hindawi.com/journals/wcmc/ ↗
http://onlinelibrary.wiley.com/ ↗ - DOI:
- 10.1002/wcm.2517 ↗
- Languages:
- English
- ISSNs:
- 1530-8669
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - 9323.860000
British Library DSC - BLDSS-3PM
British Library HMNTS - ELD Digital store - Ingest File:
- 2723.xml