406,983 research outputs found
Labeling Diversity for 2x2 WLAN Coded-Cooperative Networks
Labelling diversity is an efficient technique recently proposed in the literature and aims to improve the bit error rate(BER) performance of wireless local area network (WLAN) systems with two transmit and two receive antennas without increasing the transmit power and bandwidth requirements. In this paper, we employ labelling diversity with different space-time channel codes such as convolutional, turbo and low density parity check (LDPC) for both point-to-point and coded-cooperative communication scenarios. Joint iterative decoding schemes for distributed turbo and LDPC codes are also presented. BER performance bounds at an error floor (EF) region are derived and verified with the help of numerical simulations for both cooperative and non-cooperative schemes. Numerical simulations show that the coded-cooperative schemes with labelling diversity achieve better BER performances and use of labelling diversity at the source node significantly lowers relay outage probability and hence the overall BER performance of the coded-cooperative scheme is improved manifolds
Diversity-Multiplexing Tradeoff of Asynchronous Cooperative Diversity in Wireless Networks
Synchronization of relay nodes is an important and critical issue in
exploiting cooperative diversity in wireless networks. In this paper, two
asynchronous cooperative diversity schemes are proposed, namely, distributed
delay diversity and asynchronous space-time coded cooperative diversity
schemes. In terms of the overall diversity-multiplexing (DM) tradeoff function,
we show that the proposed independent coding based distributed delay diversity
and asynchronous space-time coded cooperative diversity schemes achieve the
same performance as the synchronous space-time coded approach which requires an
accurate symbol-level timing synchronization to ensure signals arriving at the
destination from different relay nodes are perfectly synchronized. This
demonstrates diversity order is maintained even at the presence of asynchronism
between relay node. Moreover, when all relay nodes succeed in decoding the
source information, the asynchronous space-time coded approach is capable of
achieving better DM-tradeoff than synchronous schemes and performs equivalently
to transmitting information through a parallel fading channel as far as the
DM-tradeoff is concerned. Our results suggest the benefits of fully exploiting
the space-time degrees of freedom in multiple antenna systems by employing
asynchronous space-time codes even in a frequency flat fading channel. In
addition, it is shown asynchronous space-time coded systems are able to achieve
higher mutual information than synchronous space-time coded systems for any
finite signal-to-noise-ratio (SNR) when properly selected baseband waveforms
are employed
Cooperative Transmission Protocols with High Spectral Efficiency and High Diversity Order Using Multiuser Detection and Network Coding
Cooperative transmission is an emerging communication technique that takes
advantages of the broadcast nature of wireless channels. However, due to low
spectral efficiency and the requirement of orthogonal channels, its potential
for use in future wireless networks is limited. In this paper, by making use of
multiuser detection (MUD) and network coding, cooperative transmission
protocols with high spectral efficiency, diversity order, and coding gain are
developed. Compared with the traditional cooperative transmission protocols
with single-user detection, in which the diversity gain is only for one source
user, the proposed MUD cooperative transmission protocols have the merits that
the improvement of one user's link can also benefit the other users. In
addition, using MUD at the relay provides an environment in which network
coding can be employed. The coding gain and high diversity order can be
obtained by fully utilizing the link between the relay and the destination.
From the analysis and simulation results, it is seen that the proposed
protocols achieve higher diversity gain, better asymptotic efficiency, and
lower bit error rate, compared to traditional MUD and to existing cooperative
transmission protocols.Comment: to appear, in the proceedings of IEEE International Conference on
Communications, Glasgow, Scotland, 24-28 June 200
DMT Optimal On-Demand Relaying for Mesh Networks
This paper presents a new cooperative MAC (Medium Access Control) protocol called BRIAF (Best Relay based Incremental Amplify-and-Forward). The proposed protocol presents two features: on-demand relaying and selection of the best relay terminal. “On-demand relaying” means that a cooperative transmission is implemented between a source terminal and a destination terminal only when the destination terminal fails in decoding the data transmitted by the source terminal. This feature maximizes the spatial multiplexing gain r of the transmission. “Selection of the best relay terminal” means that a selection of the best relay among a set of (m-1) relay candidates is implemented when a cooperative transmission is needed. This feature maximizes the diversity order d(r) of the transmission. Hence, an optimal DMT (Diversity Multiplexing Tradeoff) curve is achieved with a diversity order d(r) = m(1-r) for 0 ≤ r ≤ 1
Quasi-orthogonal space-frequency coding in non-coherent cooperative broadband networks
© 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.So far, complex valued orthogonal codes have been used differentially in cooperative broadband networks. These codes however achieve less than unitary code rate when utilized in cooperative networks with more than two relays. Therefore, the main challenge is how to construct unitary rate codes for non-coherent cooperative broadband networks with more than two relays while exploiting the achievable spatial and frequency diversity. In this paper, we extend full rate quasi-orthogonal codes to differential cooperative broadband networks where channel information is unavailable. From this, we propose a generalized differential distributed quasi-orthogonal space-frequency coding (DQSFC) protocol for cooperative broadband networks. Our proposed scheme is able to achieve full rate, and full spatial and frequency diversity in cooperative networks with any number of relays. Through pairwise error probability analysis we show that the diversity gain of our scheme can be improved by appropriate code construction and sub-carrier allocation. Based on this, we derive sufficient conditions for the proposed code structure at the source node and relay nodes to achieve full spatial and frequency diversity.Peer reviewe
Wireless Network Code Design and Performance Analysis using Diversity-Multiplexing Tradeoff
Network coding and cooperative communication have received considerable
attention from the research community recently in order to mitigate the adverse
effects of fading in wireless transmissions and at the same time to achieve
high throughput and better spectral efficiency. In this work, we design and
analyze deterministic and random network coding schemes for a cooperative
communication setup with multiple sources and destinations. We show that our
schemes outperform conventional cooperation in terms of the
diversity-multiplexing tradeoff (DMT). Specifically, it achieves the
full-diversity order at the expense of a slightly reduced multiplexing rate. We
establish the link between the parity-check matrix for a
systematic MDS code and the network coding coefficients in a cooperative
communication system of source-destination pairs and relays. We present
two ways to generate the network coding matrix: using the Cauchy matrices and
the Vandermonde matrices, and establish that they both offer the maximum
diversity order
Energy Harvesting Cooperative Networks: Is the Max-Min Criterion Still Diversity-Optimal?
This paper considers a general energy harvesting cooperative network with M
source-destination (SD) pairs and one relay, where the relay schedules only m
user pairs for transmissions. For the special case of m = 1, the addressed
scheduling problem is equivalent to relay selection for the scenario with one
SD pair and M relays. In conventional cooperative networks, the max-min
selection criterion has been recognized as a diversity-optimal strategy for
relay selection and user scheduling. The main contribution of this paper is to
show that the use of the max-min criterion will result in loss of diversity
gains in energy harvesting cooperative networks. Particularly when only a
single user is scheduled, analytical results are developed to demonstrate that
the diversity gain achieved by the max-min criterion is only (M+1)/2, much less
than the maximal diversity gain M. The max-min criterion suffers this diversity
loss because it does not reflect the fact that the source-relay channels are
more important than the relay-destination channels in energy harvesting
networks. Motivated by this fact, a few user scheduling approaches tailored to
energy harvesting networks are developed and their performance is analyzed.
Simulation results are provided to demonstrate the accuracy of the developed
analytical results and facilitate the performance comparison.Comment: 30 pages, 7 figure
- …