Joint scheduling and relay selection in one- and two-way relay networks with buffering

Authors:
Lianghui Ding;Meixia Tao;Fan Yang;Wenjun Zhang
Affiliations:
Department of Electronic Engineering, Shanghai Jiao Tong University, China;Department of Electronic Engineering, Shanghai Jiao Tong University, China;Department of Electronic Engineering, Shanghai Jiao Tong University, China;Department of Electronic Engineering, Shanghai Jiao Tong University, China
Venue:
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Year:
2009

Citing 6
Cited 1

Improving amplify-and-forward relay networks: optimal power allocation versus selection

IEEE Transactions on Wireless Communications
Cooperative Communications with Outage-Optimal Opportunistic Relaying

IEEE Transactions on Wireless Communications
Bidirectional regenerative half-duplex relaying using relay selection

IEEE Transactions on Wireless Communications - Part 2
Cooperative communication in wireless networks

IEEE Communications Magazine
A simple Cooperative diversity method based on network path selection

IEEE Journal on Selected Areas in Communications
Spectral efficient protocols for half-duplex fading relay channels

IEEE Journal on Selected Areas in Communications

Decode-and-forward two-way relaying with network coding and opportunistic relay selection

IEEE Transactions on Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In most wireless relay networks, the source and relay nodes transmit successively via fixed time division (FTD) and each relay forwards a packet immediately upon receiving. In this paper we enable the buffering capability of relay nodes and propose a framework for joint scheduling and relay selection. The goal is to maximize the system long-term throughput by fully exploiting multi-user diversity in the network. We develop two joint scheduling and relay selection (JSRS) algorithms for unidirectional and bidirectional traffic, respectively. The novel cross-layer relay selection metrics which our algorithms are based upon take into account both instantaneous channel conditions and the queuing status. We also demonstrate that the proposed JSRS can be realized in a distributed way without explicit coordination among the network nodes. Extensive simulation is carried out to evaluate the performance of the proposed JSRS with buffering in comparison with traditional FTD without buffering. Typical throughput enhancements up to 101% and 110% are observed in one-way and two-way relay networks respectively, at low signal-to-noise ratio (0 dB).