1,180 research outputs found
Multi-Antenna Cooperative Wireless Systems: A Diversity-Multiplexing Tradeoff Perspective
We consider a general multiple antenna network with multiple sources,
multiple destinations and multiple relays in terms of the
diversity-multiplexing tradeoff (DMT). We examine several subcases of this most
general problem taking into account the processing capability of the relays
(half-duplex or full-duplex), and the network geometry (clustered or
non-clustered). We first study the multiple antenna relay channel with a
full-duplex relay to understand the effect of increased degrees of freedom in
the direct link. We find DMT upper bounds and investigate the achievable
performance of decode-and-forward (DF), and compress-and-forward (CF)
protocols. Our results suggest that while DF is DMT optimal when all terminals
have one antenna each, it may not maintain its good performance when the
degrees of freedom in the direct link is increased, whereas CF continues to
perform optimally. We also study the multiple antenna relay channel with a
half-duplex relay. We show that the half-duplex DMT behavior can significantly
be different from the full-duplex case. We find that CF is DMT optimal for
half-duplex relaying as well, and is the first protocol known to achieve the
half-duplex relay DMT. We next study the multiple-access relay channel (MARC)
DMT. Finally, we investigate a system with a single source-destination pair and
multiple relays, each node with a single antenna, and show that even under the
idealistic assumption of full-duplex relays and a clustered network, this
virtual multi-input multi-output (MIMO) system can never fully mimic a real
MIMO DMT. For cooperative systems with multiple sources and multiple
destinations the same limitation remains to be in effect.Comment: version 1: 58 pages, 15 figures, Submitted to IEEE Transactions on
Information Theory, version 2: Final version, to appear IEEE IT, title
changed, extra figures adde
Distributed Space Time Coding for Wireless Two-way Relaying
We consider the wireless two-way relay channel, in which two-way data
transfer takes place between the end nodes with the help of a relay. For the
Denoise-And-Forward (DNF) protocol, it was shown by Koike-Akino et. al. that
adaptively changing the network coding map used at the relay greatly reduces
the impact of Multiple Access interference at the relay. The harmful effect of
the deep channel fade conditions can be effectively mitigated by proper choice
of these network coding maps at the relay. Alternatively, in this paper we
propose a Distributed Space Time Coding (DSTC) scheme, which effectively
removes most of the deep fade channel conditions at the transmitting nodes
itself without any CSIT and without any need to adaptively change the network
coding map used at the relay. It is shown that the deep fades occur when the
channel fade coefficient vector falls in a finite number of vector subspaces of
, which are referred to as the singular fade subspaces. DSTC
design criterion referred to as the \textit{singularity minimization criterion}
under which the number of such vector subspaces are minimized is obtained.
Also, a criterion to maximize the coding gain of the DSTC is obtained. Explicit
low decoding complexity DSTC designs which satisfy the singularity minimization
criterion and maximize the coding gain for QAM and PSK signal sets are
provided. Simulation results show that at high Signal to Noise Ratio, the DSTC
scheme provides large gains when compared to the conventional Exclusive OR
network code and performs slightly better than the adaptive network coding
scheme proposed by Koike-Akino et. al.Comment: 27 pages, 4 figures, A mistake in the proof of Proposition 3 given in
Appendix B correcte
Network-Level Performance Evaluation of a Two-Relay Cooperative Random Access Wireless System
In wireless networks relay nodes can be used to assist the users'
transmissions to reach their destination. Work on relay cooperation, from a
physical layer perspective, has up to now yielded well-known results. This
paper takes a different stance focusing on network-level cooperation. Extending
previous results for a single relay, we investigate here the benefits from the
deployment of a second one. We assume that the two relays do not generate
packets of their own and the system employs random access to the medium; we
further consider slotted time and that the users have saturated queues. We
obtain analytical expressions for the arrival and service rates of the queues
of the two relays and the stability conditions. We investigate a model of the
system, in which the users are divided into clusters, each being served by one
relay, and show its advantages in terms of aggregate and throughput per user.
We quantify the above, analytically for the case of the collision channel and
through simulations for the case of Multi-Packet Reception (MPR), and we
provide insight on when the deployment of a second relay in the system can
yield significant advantages.Comment: Submitted for journal publicatio
- …