Cooperative Networks with Channel Uncertainty
type: Distribution
access URL: https://theses.hal.science/tel-00765429
format: HTML
issued: 2026-05-31T00:07:15.180500
modified: 2026-05-31T00:07:15.050130

test_moissonnage_selune
type: Agent

Cooperative Networks with Channel Uncertainty
type: Dataset
contact point: Organization
  fn: CCSD
keyword: infoeu-reposemanticsdoctoralthesis
keyword: simultaneous-relay-channel
keyword: relay-channel
keyword: codage-de-reseau-bruyant
keyword: reseau-composite-codage-de-reseau-bruyant-borne-flot-max-coupe-min-probabilite-derreur-de-reseau
keyword: borne-flot-max-coupe-min
keyword: max-flow-min-cut-bound
keyword: composite-networks
keyword: reseaux-cooperatifs
keyword: probabilite-derreur-de-reseau
keyword: noisy-network-coding
keyword: cooperative-networks
keyword: error-probability-of-the-network
keyword: canal-a-relais-simultane
keyword: theses
keyword: canal-a-relais
keyword: spiotherengineering-sciences-physicsother
keyword: canal-de-diffusion-a-relais
keyword: broadcast-relay-channel
landing page: https://theses.hal.science/tel-00765429
description: In this thesis, cooperative networks are studied under the assumption that the source is uncertain about the channel in operation. In the first chapter, cooperative strategies are developed for simultaneous relay channels (SRC) which consist of a set of two single relay channels out of which the channel in operation is chosen. This is equivalent to the broadcast relay channel (BRC). Bounds on the capacity region of the general BRC with two helper relays are derived. Capacity results are obtained for specific cases of semi-degraded and degraded Gaussian simultaneous relay channels. In the second chapter, the composite relay channel is considered where the channel is randomly drawn from a set of conditional distributions according to a given distribution. The transmission rate is fixed regardless of the current channel and the asymptotic error probability (EP) is characterized. A novel selective coding strategy (SCS) is introduced which enables relays to select –based on their channel measurement– the best coding scheme between Compress-and-Forward (CF) and Decode-and-Forward (DF). Generalized Noisy Network Coding theorems are shown for the case of unicast general networks where the relays use either DF or CF scheme. In the third chapter, the asymptotic behavior of EP is studied for composite multiterminal networks. The asymptotic spectrum of EP is introduced as a novel performance measure for composite networks. It is shown that every code with rate outside cut-set bound, yields EP equal to one and for the networks satisfying strong converse condition, the asymptotic spectrum of EP coincides with the outage probability.
identifier: NNT: 2012SUPL0008
issued: 2026-05-31T00:07:15.097826
language: fr
modified: 2026-05-31T00:07:15.097833