Elements of information theory
Elements of information theory
Symbol error probabilities for general Cooperative links
IEEE Transactions on Wireless Communications
Distributed Space-Time Coding in Wireless Relay Networks
IEEE Transactions on Wireless Communications
Space-time block codes from orthogonal designs
IEEE Transactions on Information Theory
Square-matrix embeddable space-time block codes for complex signal constellations
IEEE Transactions on Information Theory
Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks
IEEE Transactions on Information Theory
Cooperative diversity in wireless networks: Efficient protocols and outage behavior
IEEE Transactions on Information Theory
Finite-SNR Diversity–Multiplexing Tradeoff for Correlated Rayleigh and Rician MIMO Channels
IEEE Transactions on Information Theory
A simple transmit diversity technique for wireless communications
IEEE Journal on Selected Areas in Communications
Fading relay channels: performance limits and space-time signal design
IEEE Journal on Selected Areas in Communications
A Distributed Cooperative MAC Protocol for QoS Improvement and Mobility Support in WiMedia Networks
Wireless Personal Communications: An International Journal
A Cooperative MAC Protocol for QoS Enhancement in Wireless USB Networks
Wireless Personal Communications: An International Journal
Hi-index | 0.02 |
In resource limited, large scale sensor networks, cooperative communication over multiple hops offers opportunities to save power: intermediate nodes between source and destination act as cooperative relays. In order to exploit spatial diversity, protocols coupled with space-time coding strategies are proposed herein and analyzed for distributed cooperative communication. In contrast to prior work, multi-hop (versus two-hop) schemes are developed and analyzed for amplify-and-forward type of communication protocols. First, the Alamouti-based two-hop scheme proposed by Hua et al and analyzed by Jing & Hassibi is generalized to an arbitrary number of hops L, and a general approximation for the pairwise error probability (PEP) at high SNR is obtained. This expression is used to provide a close approximation to the achievable diversity gain of the scheme. It is further shown that the diversity decreases with L, for large, but finite signal-to-noise ratio (SNR). This motivates the subsequent development of new distributed multi-hop protocols to mitigate the diversity losses and, hence, yield improved performance. This work presents two such strategies as well as their diversity characterization, which are analyzed for the specific case of L = 3 hops and shown to exhibit improved performance at high SNR. These schemes are based on the structure of the rate-half codes proposed by Tarokh and the square-matrix embeddable codes of Tirkkonen & Hottinen.