A simple cooperative diversity method based on network path selection

DMCA

A simple cooperative diversity method based on network path selection (2006)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Aggelos Bletsas , Ashish Khisti , David P. Reed , Andrew Lippman

Venue:	IEEE J. SELECT. AREAS COMMUN
Citations:	452 - 14 self

BibTeX

@ARTICLE{Bletsas06asimple,
    author = {Aggelos Bletsas and Ashish Khisti and David P. Reed and Andrew Lippman},
    title = {A simple cooperative diversity method based on network path selection},
    journal = {IEEE J. SELECT. AREAS COMMUN},
    year = {2006},
    volume = {24},
    pages = {659--672}
}

OpenURL

Abstract

Cooperative diversity has been recently proposed as a way to form virtual antenna arrays that provide dramatic gains in slow fading wireless environments. However, most of the proposed solutions require distributed space–time coding algorithms, the careful design of which is left for future investigation if there is more than one cooperative relay. We propose a novel scheme that alleviates these problems and provides diversity gains on the order of the number of relays in the network. Our scheme first selects the best relay from a set of available relays and then uses this “best ” relay for cooperation between the source and the destination. We develop and analyze a distributed method to select the best relay that requires no topology information and is based on local measurements of the instantaneous channel conditions. This method also requires no explicit communication among the relays. The success (or failure) to select the best available path depends on the statistics of the wireless channel, and a methodology to evaluate performance for any kind of wireless channel statistics, is provided. Information theoretic analysis of outage probability shows that our scheme achieves the same diversity-multiplexing tradeoff as achieved by more complex protocols, where coordination and distributed space–time coding for relay nodes is required, such as those proposed by Laneman and Wornell (2003). The simplicity of the technique allows for immediate implementation in existing radio hardware and its adoption could provide for improved flexibility, reliability, and efficiency in future 4G wireless systems.

Keyphrases

simple cooperative diversity method network path selection cooperative diversity immediate implementation information theoretic analysis diversity-multiplexing tradeoff improved flexibility space time wireless system future investigation cooperative relay radio hardware local measurement distributed method outage probability dramatic gain available relay novel scheme available path wireless channel statistic relay node topology information virtual antenna complex protocol wireless channel instantaneous channel condition careful design slow fading wireless environment explicit communication distributed space time diversity gain

DMCA