Concept

Cooperative diversity

Publications associées (43)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

REACA: an efficient protocol architecture for large scale sensor networks (corrected)

Ali H. Sayed

The emergence of wireless sensor networks has imposed many challenges on network design such as severe energy constraints, limited bandwidth and computing capabilities. This kind of networks necessitates network protocol architectures that are robust, ener ...

IEEE2007

REACA: An Efficient Protocol Architecture for Large Scale Sensor Networks

Ali H. Sayed

IEEE2007

Precoding for broadcasting with linear network codes

Ali H. Sayed

A technique based on linear precoding is introduced for broadcasting on linear networks. The precoding allows the different message components of a broadcast message to be separated and decoded at the desired sink nodes, thus providing a systematic design ...

2006

Node Cooperation in Hybrid Ad hoc Networks

Jean-Pierre Hubaux, Naouel Ben Salem, Levente Buttyan

A hybrid ad hoc network is a structure-based network that is extended using multi-hop communications. Indeed, in this kind of network, the existence of a communication link between the mobile station and the base station is not required: A mobile station t ...

2006

Cooperative strategies and capacity theorems for relay networks

Michael Christoph Gastpar

Coding strategies that exploit node cooperation are developed for relay networks. Two basic schemes are studied: the relays decode-and-forward the source message to the destination, or they compress-and-forward their channel outputs to the destination. The ...

2005

Cooperative strategies and capacity theorems for relay networks

Michael Christoph Gastpar

Institute of Electrical and Electronics Engineers2005

Achievable Diversity-Multiplexing-Delay Tradeoff in Half-Duplex ARQ Relay Channels

Sanket Dusad

In this paper, we present an efficient protocol for the delay-limited fading Automatic Retransmission reQuest single relay channel. The source is using an ARQ retransmission protocol to send data to the relay and the destination. When the relay is able to ...

2005

Single and Multi-Hop ARQ in Sensor Networks

Martin Vetterli, Henri Julien Dubois-Ferrière

We present a novel error-correction scheme for sensor networks called Multi-hop Hybrid ARQ (MHARQ). Rather than immediately discard a received corrupt packet, a node buffers it. When two corrupt versions of a packet have been received, a procedure attempts ...

2005

An uplink DS-CDMA receiver using a robust post-correlation Kalman structure

Ali H. Sayed

Kalman filtering has been proposed in the literature for wireless channel estimation, however, it is not sufficiently robust to uncertainties in the channel auto-correlation model as well as to multiple access interference (MAI). This paper presents a rece ...

IEEE2005

Concatenated codes for block-fading channels

Albert Guillén i Fàbregas

In this thesis we study coding strategies for single-user block-fading channels. The block-fading channel is a simplified model of slowly varying wireless communication channels with stringent delay constraints. This model is particularly important in prac ...

EPFL2004