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, UCBL - Université Claude Bernard Lyon 1, 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.
Type de document :
[Research Report] 2012
Liste complète des métadonnées
Contributeur : Paul Ferrand <>
Soumis le : lundi 23 avril 2012 - 14:24:29
Dernière modification le : mercredi 28 février 2018 - 15:20:22
Document(s) archivé(s) le : mardi 24 juillet 2012 - 02:31:00


Fichiers produits par l'(les) auteur(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〉



Consultations de la notice


Téléchargements de fichiers