Effective resource block allocation procedure for quality of service provisioning in a single-operator heterogeneous LTE-A network

Asheralieva, A; Miyanaga, Y

Effective resource block allocation procedure for quality of service provisioning in a single-operator heterogeneous LTE-A network

Asheralieva, A Miyanaga, Y

Permalink

Publisher:: ELSEVIER SCIENCE BV
Publication Type:: Journal Article
Citation:: Computer Networks, 2016, 108, pp. 1-14
Issue Date:: 2016-10-24

Closed Access

	Filename	Description	Size
	COMNET-D-15-823-DCV.R1.pdf	Accepted version	1.15 MB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Asheralieva, A
dc.contributor.author	Miyanaga, Y https://orcid.org/0000-0002-2795-2234
dc.date.accessioned	2022-08-21T22:18:14Z
dc.date.available	2022-08-21T22:18:14Z
dc.date.issued	2016-10-24
dc.identifier.citation	Computer Networks, 2016, 108, pp. 1-14
dc.identifier.issn	1389-1286
dc.identifier.issn	1872-7069
dc.identifier.uri	http://hdl.handle.net/10453/160632
dc.description.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.
dc.language	English
dc.publisher	ELSEVIER SCIENCE BV
dc.relation.ispartof	Computer Networks
dc.relation.isbasedon	10.1016/j.comnet.2016.07.012
dc.rights	info:eu-repo/semantics/closedAccess
dc.subject	08 Information and Computing Sciences, 09 Engineering, 10 Technology
dc.subject.classification	Networking & Telecommunications
dc.title	Effective resource block allocation procedure for quality of service provisioning in a single-operator heterogeneous LTE-A network
dc.type	Journal Article
utslib.citation.volume	108
utslib.for	08 Information and Computing Sciences
utslib.for	09 Engineering
utslib.for	10 Technology
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
utslib.copyright.status	closed_access	*
dc.date.updated	2022-08-21T22:18:13Z
pubs.publication-status	Published
pubs.volume	108

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.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/160632