Skip to Main content Skip to Navigation

Achievable Common Rate and Power Allocation in Cooperative Multiple Access Channels

Paul Ferrand 1 Claire Goursaud 1 Jean-Marie Gorce 1 
1 SOCRATE - Software and Cognitive radio for telecommunications
Inria Grenoble - Rhône-Alpes, CITI - CITI Centre of Innovation in Telecommunications and Integration of services
Abstract : In this paper, we aim at obtaining usable bounds on the performance of the cooperative multiple access channel (CMAC) under a Gaussian model. We first show that the problem can be transformed into a convex optimization problem which makes it easily solvable using numerical tools. We propose, as a line of study, to consider the maximal achievable common rate by every node in the network. We then proceed to express closed-form bounds on the capacity region of the CMAC in that common rate scenario. We study simple cooperation schemes based on existing results in relay channels and compare them to other medium sharing approaches. In the end, we show that using the relay-channel based protocols can be efficient for some parameters, but gets less interesting in the Gaussian case if the source-destination links are good enough.
Complete list of metadata
Contributor : Paul Ferrand Connect in order to contact the contributor
Submitted on : Monday, April 23, 2012 - 2:24:29 PM
Last modification on : Thursday, March 10, 2022 - 3:09:04 AM
Long-term archiving on: : Tuesday, July 24, 2012 - 2:31:00 AM


Files produced by the author(s)


  • HAL Id : hal-00690407, version 1



Paul Ferrand, Claire Goursaud, Jean-Marie Gorce. Achievable Common Rate and Power Allocation in Cooperative Multiple Access Channels. [Research Report] 2012. ⟨hal-00690407⟩



Record views


Files downloads