Efficient and Fair Throughput-Optimal Scheduling in Buffer-Aided Relay-Based Cellular Networks
Abstract
In 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.
Collections
- Computer Science & Engineering [2414 items ]
Related items
Showing items related by title, author, creator and subject.
-
All-to-all throughput maximization in wireless relay networks with multiple packet reception
(2012 , Conference)Network Coding (NC) has shown the promise of significant throughput improvement to wireless networks. Meanwhile, Multiple Packet Reception (MPR) has been proved as an efficient way to combat the Multiple Access Interference ... -
Buffer-aided relaying improves both throughput and end-to-end delay
( Springer International Publishing , 2015 , Article)Buffer-aided relaying has recently attracted a lot of attention due to the improvement in the system throughput. However, a side effect usually deemed is that buffering at relay nodes results in the increase of packet ... -
Cognitive Radio Networks with Probabilistic Relaying: Stable Throughput and Delay Tradeoffs
( Institute of Electrical and Electronics Engineers Inc. , 2015 , Article)This paper studies fundamental throughput and delay tradeoffs in cognitive radio systems with cooperative secondary users. We focus on randomized cooperative policies, whereby the secondary user (SU) serves either its own ...