Distributed load aware relay selection algorithm for cooperative relay networks. (1st January 2015)

• Record Type: Journal Article
• Authors: Jiang, Fan; Wang, Benchao; Lu, Guangyue
• Is Part Of: International journal of communication networks and distributed systems. Volume 14:Number 3(2015)
• Page Start: 237
• Page End: 255
• Publication Date: 2015-01-01
• Subjects: 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; Computer networks -- Periodicals; Telecommunication systems -- Periodicals; Electronic data processing -- Distributed processing -- Periodicals; 004.6
• DOI: 10.1504/IJCNDS.2015.068659
• Languages: English
• ISSNs: 1754-3916

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.