Show simple item record

AuthorRuby R.
AuthorMohamed A.
AuthorLeung V.
Available date2022-04-21T08:58:37Z
Publication Date2010
Publication NameProceedings - Conference on Local Computer Networks, LCN
ResourceScopus
Identifierhttp://dx.doi.org/10.1109/LCN.2010.5735768
URIhttp://hdl.handle.net/10576/30185
AbstractRelaying is one of the key techniques considered by the 3GPP LTE-Advanced as part of 4G cellular technologies, aiming to increase the coverage and capacity of the network especially for the edge nodes. In this work, we have considered the uplink scheduling of an LTE network with the help of positioned relay nodes. We have projected the entire problem as a constrained optimization problem. As a solution, we have considered sub-gradient based approach to divide the utility maximization of all nodes, including relay nodes, in the cell into sub-problems of utility optimization of each individual node. Based on this solution we have proposed a scheduling algorithm to allocate resource blocks across all nodes. Numerical calculations and results have been shown to justify that relay nodes can potentially achieve the trade-off between throughput and fairness. 2010 IEEE.
Languageen
PublisherIEEE
SubjectLTE networks
Proportional fairness
relaying
Throughput maximization
Uplink Scheduling
Constrained optimization
Internet
Mobile telecommunication systems
Throughput
Scheduling algorithms
TitleUtility-based uplink scheduling algorithm for enhancing throughput and fairness in relayed LTE networks
TypeConference Paper
Pagination520-527


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record