Show simple item record

AuthorHajipour J.
AuthorMohamed A.
AuthorLeung V.C.M.
Available date2022-04-21T08:58:30Z
Publication Date2015
Publication NameIEEE Communications Letters
ResourceScopus
Identifierhttp://dx.doi.org/10.1109/LCOMM.2015.2443098
URIhttp://hdl.handle.net/10576/30130
AbstractIn this letter, we study throughput-optimal scheduling policies in single-path buffer-aided relay networks, where the packets of a user travel one fixed path from the source to the destination and do not require routing. We modify the well-known Max-Weight (MW) policy and propose a version of throughput-optimal algorithms, which we refer to as Modified MW (MMW). In MMW, by defining a suitably large threshold, a link's weight is proportional to just the corresponding local queue size either in the base station or the relay station, in most of the time slots. Moreover, a parameter can be adjusted for improving delay fairness between the relayed and direct users. MMW is suitable for use in both shared and independent channel scenarios and facilitates decentralized network implementations. Numerical results confirm that MMW is better able to provide similar performance for direct and relayed users in terms of queueing delay, compared with the existing algorithms. 1997-2012 IEEE.
Languageen
PublisherInstitute of Electrical and Electronics Engineers Inc.
SubjectRelay control systems
Throughput
Decentralized networks
delay fairness
Independent channels
Relay based cellular networks
Relay network
Throughput optimal scheduling
Throughput Optimality
Throughput-optimal
Scheduling
TitleEfficient and Fair Throughput-Optimal Scheduling in Buffer-Aided Relay-Based Cellular Networks
TypeArticle
Pagination1390-1393
Issue Number8
Volume Number19
dc.accessType Abstract Only


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