33,851 research outputs found
On the Performance of Selection Relaying
Interest in selection relaying is growing. The recent developments in this
area have largely focused on information theoretic analyses such as outage
performance. Some of these analyses are accurate only at high SNR regimes. In
this paper error rate analyses that are sufficiently accurate over a wide range
of SNR regimes are provided. The motivations for this work are that practical
systems operate at far lower SNR values than those supported by the high SNR
analysis. To enable designers to make informed decisions regarding network
design and deployment, it is imperative that system performance is evaluated
with a reasonable degree of accuracy over practical SNR regimes. Simulations
have been used to corroborate the analytical results, as close agreement
between the two is observed.Comment: Proceedings of the 2008 IEEE Vehicular Technology Conference,
Calgary, Alberta, September 21-24, 200
A Comparative Study of Relaying Schemes with Decode-and-Forward over Nakagami-m Fading Channels
Utilizing relaying techniques to improve performance of wireless systems is a
promising avenue. However, it is crucial to understand what type of relaying
schemes should be used for achieving different performance objectives under
realistic fading conditions. In this paper, we present a general framework for
modelling and evaluating the performance of relaying schemes based on the
decode-and-forward (DF) protocol over independent and not necessarily
identically distributed (INID) Nakagami-m fading channels. In particular, we
present closed-form expressions for the statistics of the instantaneous output
signal-to-noise ratio of four significant relaying schemes with DF; two based
on repetitive transmission and the other two based on relay selection (RS).
These expressions are then used to obtain closed-form expressions for the
outage probability and the average symbol error probability for several
modulations of all considered relaying schemes over INID Nakagami-m fading.
Importantly, it is shown that when the channel state information for RS is
perfect, RS-based transmission schemes always outperform repetitive ones.
Furthermore, when the direct link between the source and the destination nodes
is sufficiently strong, relaying may not result in any gains and in this case
it should be switched-off.Comment: Submitted to Journal of Computer Systems, Networks, and
Communication
Splitting algorithm for DMT optimal cooperative MAC protocols in wireless mesh networks
A cooperative protocol for wireless mesh networks is proposed in this paper. The protocol implements both on-demand relaying and a selection of the best relay terminal so only one terminal is relaying the source message when cooperation is needed. Two additional features are also proposed. The best relay is selected with a splitting algorithm. This approach allows fast relay selection within less than three time-slots, on average. Moreover, a pre-selection of relay candidates is performed prior to the splitting algorithm. Only terminals that are able to improve the direct path are pre-selected. So efficient cooperation is now guaranteed. We prove that this approach is optimal in terms of diversity-multiplexing trade-off. The protocol has been designed in the context of Nakagami-mfading channels. Simulation results show that the performance of the splitting algorithm does not depend on channel statistics
Recommended from our members
Relay Selection in Cooperative Networks with Frequency Selective Fading
In this article, we consider the diversity-multiplexing tradeoff (DMT) of relay-assisted communication through correlated frequency selective fading channels. Recent results for relays in flat fading channels demonstrate a performance and implementation advantage in using relay selection as opposed to more complicated distributed space-time coding schemes. Motivated by these results, we explore the use of relay selection for the case when all channels have intersymbol interference. In particular, we focus on the performance of relaying strategies when multiple decode-and-forward relays share a single channel orthogonal to the source. We derive the DMT for several relaying strategies: best relay selection, random relay selection, and the case when all decoding relays participate. the best relay selection method selects the relay in the decoding set with the largest sum-squared relay-to-destination channel coefficients. This scheme can achieve the optimal DMT of the system under consideration and generally dominates the other two relaying strategies which do not always exploit the spatial diversity offered by the relays. Different from flat fading, we found special cases when the three relaying strategies have the same DMT. We further present a transceiver design which is proven to asymptotically achieve the optimal DMT. Monte Carlo simulations are presented to corroborate the theoretical analysis and to provide a detailed performance comparison of the three relaying strategies in channels encountered in practice
Power Allocation for Conventional and Buffer-Aided Link Adaptive Relaying Systems with Energy Harvesting Nodes
Energy harvesting (EH) nodes can play an important role in cooperative
communication systems which do not have a continuous power supply. In this
paper, we consider the optimization of conventional and buffer-aided link
adaptive EH relaying systems, where an EH source communicates with the
destination via an EH decode-and-forward relay. In conventional relaying,
source and relay transmit signals in consecutive time slots whereas in
buffer-aided link adaptive relaying, the state of the source-relay and
relay-destination channels determines whether the source or the relay is
selected for transmission. Our objective is to maximize the system throughput
over a finite number of transmission time slots for both relaying protocols. In
case of conventional relaying, we propose an offline and several online joint
source and relay transmit power allocation schemes. For offline power
allocation, we formulate an optimization problem which can be solved optimally.
For the online case, we propose a dynamic programming (DP) approach to compute
the optimal online transmit power. To alleviate the complexity inherent to DP,
we also propose several suboptimal online power allocation schemes. For
buffer-aided link adaptive relaying, we show that the joint offline
optimization of the source and relay transmit powers along with the link
selection results in a mixed integer non-linear program which we solve
optimally using the spatial branch-and-bound method. We also propose an
efficient online power allocation scheme and a naive online power allocation
scheme for buffer-aided link adaptive relaying. Our results show that link
adaptive relaying provides performance improvement over conventional relaying
at the expense of a higher computational complexity.Comment: Submitted to IEEE Transactions on Wireless Communication
Exploiting Outage Performance of Wireless Powered NOMA
Considering a dual-hop energy-harvesting (EH) non-orthogonal multiple access (NOMA) relaying system, this paper considers novel relaying protocol based on time power switching-based relaying (TPSR) and power switching-based relaying (PSR) schemes for two kinds of gain factors regarding amplify-and-forward mode. We introduce novel system model relaying network with impacts of energy harvesting fractions and derive analytical expressions for outage probability for the information transmission link. It confirmed that right selection of power allocation for NOMA to obtain optimal performance as compared study in two considered schemes. We also explore impacts of other key parameters of system to outage performance evaluation for different channel models. Simulation results are presented to corroborate the proposed methodology
Buffer-Aided Relaying with Adaptive Link Selection - Fixed and Mixed Rate Transmission
We consider a simple network consisting of a source, a half-duplex DF relay
with a buffer, and a destination. We assume that the direct source-destination
link is not available and all links undergo fading. We propose two new
buffer-aided relaying schemes. In the first scheme, neither the source nor the
relay have CSIT, and consequently, both nodes are forced to transmit with fixed
rates. In contrast, in the second scheme, the source does not have CSIT and
transmits with fixed rate but the relay has CSIT and adapts its transmission
rate accordingly. In the absence of delay constraints, for both fixed rate and
mixed rate transmission, we derive the throughput-optimal buffer-aided relaying
protocols which select either the source or the relay for transmission based on
the instantaneous SNRs of the source-relay and the relay-destination links. In
addition, for the delay constrained case, we develop buffer-aided relaying
protocols that achieve a predefined average delay. Compared to conventional
relaying protocols, which select the transmitting node according to a
predefined schedule independent of the link instantaneous SNRs, the proposed
buffer-aided protocols with adaptive link selection achieve large performance
gains. In particular, for fixed rate transmission, we show that the proposed
protocol achieves a diversity gain of two as long as an average delay of more
than three time slots can be afforded. Furthermore, for mixed rate transmission
with an average delay of time slots, a multiplexing gain of
is achieved. Hence, for mixed rate transmission, for
sufficiently large average delays, buffer-aided half-duplex relaying with and
without adaptive link selection does not suffer from a multiplexing gain loss
compared to full-duplex relaying.Comment: IEEE Transactions on Information Theory. (Published
- …