Title: Distributed load aware relay selection algorithm for cooperative relay networks

Authors: Fan Jiang; Benchao Wang; Guangyue Lu

Addresses: School of Communications and Information Engineering, Xian University of Posts and Telecommunications, Xi'an, 710121, China ' Shaanxi Radio Monitoring Station, State Radio Regulatory of China, Xi'an 710200, China ' School of Communications and Information Engineering, Xian University of Posts and Telecommunications, Xi'an, 710121, China

Abstract: Cooperative relaying is accepted as a promising solution to achieve high data rates over large areas in the 4G wireless system. This paper presents a two-step distributed load aware relay selection algorithm (LA-RS) for relay-based cooperative networks. According to current user channel conditions as well as the user numbers that relay serves, LA-RS chooses the optimal relay node for each user in a distributed way. More specifically, in the first step each mobile station (MS) constructs relay selection functions for candidate relay node (RN), and selects the appropriate RN accordingly. Furthermore, in the second step RNs also adopt a weighted channel dependent scheduling algorithm for resource allocation, so as to provide a flexible tradeoff between per-user fairness and aggregate throughput in each cell. Simulation results demonstrate that compared with other relay selection schemes, LA-RS achieves load balancing through effective relay selection method, so as to obtain a tradeoff between the system throughput and the user equity.

Keywords: distributed relay selection; relay-based cellular networks; load balancing; cooperative relaying; load awareness; cooperative relay networks; 4G wireless networks; resource allocation; per-user fairness; aggregate throughput; simulation; user equity.

DOI: 10.1504/IJCNDS.2015.068659

International Journal of Communication Networks and Distributed Systems, 2015 Vol.14 No.3, pp.237 - 255

Received: 14 Sep 2013
Accepted: 25 May 2014

Published online: 30 Mar 2015 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article