Group Diversity on the Uplink of a Dense Coded-Cooperation Network

Multiuser diversity has been extensively studied to enhance wireless system capacity by always scheduling the strongest user for transmission. In this extended abstract, we propose an extension of this concept termed as ´group diversity´, applied to a large coded cooperation network. Specifically, we examine the problem of partner selection, and which cooperative group to schedule for cooperation with a fixed common destination, when there are multiple groups competing for a cooperative time slot. A coalitional game theory approach is formulated to examine how cooperative groups can form in a distributed manner, as well as possible group scheduling methods. Simulation results are presented for the case of self-interested, rational users with an utility function based on the coded-cooperation capacity.