Scheduling for dual-hop block-fading channels with two source-user pairs sharing one relay

In this paper, we maximize the achievable rate region of a dual-hop network with two sources serving two users independently through a single shared relay. We formulate the problem as maximizing the sum of the weighted long term average throughputs of the two users under stability constraints on the long term throughputs of the source-user pairs. In order to solve the problem, we propose a joint user-and-hop scheduling scheme, which schedules the first or second hop opportunistically based on instantaneous channel state information, in order to exploit multiuser diversity and multihop diversity gains. Numerical results show that the proposed joint scheduling scheme enhances the achievable rate region as compared to a scheme that employs multi-user scheduling on the second-hop alone. Copyright © 2013 by the Institute of Electrical and Electronic Engineers, Inc.