Reports (Research Report) Year : 2012

Achievable Common Rate and Power Allocation in Cooperative Multiple Access Channels

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.
Fichier principal
Vignette du fichier
isit.pdf (207) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-00690407 , version 1 (23-04-2012)

Identifiers

  • HAL Id : hal-00690407 , version 1

Cite

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

Share

More