University of Toledo
Over the last decade, the development of resource allocation algorithms for cooperative communication networks has focused on optimal, or acceptable suboptimal, solutions assuming full knowledge of Channel State Information (CSI) in the network. This assumption is, unfortunately, unlikely to be satisfied in practice. Here, the authors turn their attention to the effects of limited CSI on the performance of a cooperative network. They show that the performance gap between the fully centralized approaches and fully distributed algorithms falls exponentially with the number of CSI bits per link available at the central node.