|
Hokkaido University Collection of Scholarly and Academic Papers >
Graduate School of Information Science and Technology / Faculty of Information Science and Technology >
Peer-reviewed Journal Articles, etc >
Effective resource block allocation procedure for quality of service provisioning in a single-operator heterogeneous LTE-A network
This item is licensed under:Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
| Title: | Effective resource block allocation procedure for quality of service provisioning in a single-operator heterogeneous LTE-A network |
| Authors: | Asheralieva, Alia Browse this author | | Miyanaga, Yoshikazu Browse this author →KAKEN DB |
| Keywords: | Heterogeneous networks | | LTE-A | | Resource allocation |
| Issue Date: | 25-Oct-2016 |
| Publisher: | Elsevier |
| Journal Title: | Computer networks |
| Volume: | 108 |
| Start Page: | 1 |
| End Page: | 14 |
| Publisher DOI: | 10.1016/j.comnet.2016.07.012 |
| Abstract: | We consider the problem of resource block (RB) allocation in the integrated pico/macrocell Long Term Evolution - Advanced (LTE-A) network. It is assumed that the network is controlled by a single service provider (SP) and all the operation of the picocells is coordinated with a macro-network. To improve the quality of service (QoS) for end-to-end applications, we take into account the individual traffic demands of the users and allocate the RBs to minimize the sum of user utilities which are expressed in terms of the size of their queues. The formulated RB allocation problem belongs to the family of the multiple knapsack problems (MKPs) and, therefore, it is non-deterministic polynomial time (NP) hard in the strong sense. To reduce the complexity of this problem, we propose a simple heuristic technique to find the suitable (but not necessarily optimal) solution. The proposed RB allocation procedure requires only two additional signalling steps (necessary to maintain the coordination among different cells) and, therefore, its impact of the control signalling overhead is neglectable. It was shown (using OPNET-based simulations) that the proposed technique has low complexity, fast solution time, and shows improved performance when compared to other relevant schemes. (C) 2016 Elsevier B.V. All rights reserved. |
| Rights: | © 2016. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/ | | https://creativecommons.org/licenses/by-nc-nd/4.0/ |
| Type: | article (author version) |
| URI: | http://hdl.handle.net/2115/71735 |
| Appears in Collections: | 情報科学院・情報科学研究院 (Graduate School of Information Science and Technology / Faculty of Information Science and Technology) > 雑誌発表論文等 (Peer-reviewed Journal Articles, etc)
|
Submitter: Asheralieva Alia
|
