Distributed load aware relay selection algorithm for cooperative relay networks
by Fan Jiang; Benchao Wang; Guangyue Lu
International Journal of Communication Networks and Distributed Systems (IJCNDS), Vol. 14, No. 3, 2015

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.

Online publication date: Wed, 08-Apr-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Communication Networks and Distributed Systems (IJCNDS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com