A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf
.
User scheduling and relay selection with fairness concerns in multi-source cooperative networks
2013
International Symposium on Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks
In this paper, we consider user scheduling and relay selection with fairness concerns in a multi-source cooperative network, where sources take turns to deliver their information to the base station and then relays help to forward their corresponding source's message under system scheduling decision. We investigate the maximum achievable rate as the system objective and propose a suboptimal algorithm to solve the optimization problems by distributing source time slots using perfect matching
dblp:conf/wiopt/WangZD13
fatcat:7szgkl3swzbjpmzc4targpndie