| | |
Summary: Fractional Cooperation and the Max-Min Rate in a
Multi-Source Cooperative Network
Ehsan Karamad and Raviraj Adve
The Edward S. Rogers Sr. Department of Electrical and Computer Engineering, University of Toronto
10 King's College Road, Toronto, ON M5S 3G4, Canada
Email: {ekaramad, rsadve}@comm.utoronto.ca
Abstract--We maximize the minimum rate of each information
flow in a multi-source, multi-relay, single destination cooperative
network. The relays use the the decode-and-forward protocol
while all transmissions use OFDM. The key to our approach
is fractional cooperation wherein not all source subcarriers are
relayed. There may, therefore, be fewer relays than sources.
Finding the optimal allocation relay subcarriers to sources is
combinatorial and has exponential complexity. We develop an
upper bound on the max-min rate and present an algorithm
which performs very close to this upper bound. Our simulation
results show that, accounting for the overhead due to relaying,
there is an optimal number of relays which is, in general, less
than the number of sources.
I. INTRODUCTION
|
