8 research outputs found
Relay Selection with Network Coding in Two-Way Relay Channels
In this paper, we consider the design of joint network coding (NC)and relay
selection (RS) in two-way relay channels. In the proposed schemes, two users
first sequentially broadcast their respective information to all the relays. We
propose two RS schemes, a single relay selection with NC and a dual relay
selection with NC. For both schemes, the selected relay(s) perform NC on the
received signals sent from the two users and forward them to both users. The
proposed schemes are analyzed and the exact bit error rate (BER) expressions
are derived and verified through Monte Carlo simulations. It is shown that the
dual relay selection with NC outperforms other considered relay selection
schemes in two-way relay channels. The results also reveal that the proposed NC
relay selection schemes provide a selection gain compared to a NC scheme with
no relay selection, and a network coding gain relative to a conventional relay
selection scheme with no NC.Comment: 11 pages, 5 figure
Opportunistic Relaying in Time Division Broadcast Protocol with Incremental Relaying
In this paper, we investigate the performance of time division broadcast protocol (TDBC) with incremental relaying (IR) when there are multiple available relays. Opportunistic relaying (OR), i.e., the “best” relay is select for transmission to minimize the system’s outage probability, is proposed. Two OR schemes are presented. The first scheme, termed TDBC-OIR-I, selects the “best” relay from the set of relays that can decode both flows of signal from the two sources successfully. The second one, termed TDBC-OIR-II, selects two “best” relays from two respective sets of relays that can decode successfully each flow of signal. The performance, in terms of outage probability, expected rate (ER), and diversity-multiplexing tradeoff (DMT), of the two schemes are analyzed and compared with two TDBC schemes that have no IR but OR (termed TDBC-OR-I and TDBC-OR-II accordingly) and two other benchmark OR schemes that have no direct link transmission between the two sources
Splitting Algorithms for Fast Relay Selection: Generalizations, Analysis, and a Unified View
Relay selection for cooperative communications promises significant
performance improvements, and is, therefore, attracting considerable attention.
While several criteria have been proposed for selecting one or more relays,
distributed mechanisms that perform the selection have received relatively less
attention. In this paper, we develop a novel, yet simple, asymptotic analysis
of a splitting-based multiple access selection algorithm to find the single
best relay. The analysis leads to simpler and alternate expressions for the
average number of slots required to find the best user. By introducing a new
`contention load' parameter, the analysis shows that the parameter settings
used in the existing literature can be improved upon. New and simple bounds are
also derived. Furthermore, we propose a new algorithm that addresses the
general problem of selecting the best relays, and analyze and
optimize it. Even for a large number of relays, the algorithm selects the best
two relays within 4.406 slots and the best three within 6.491 slots, on
average. We also propose a new and simple scheme for the practically relevant
case of discrete metrics. Altogether, our results develop a unifying
perspective about the general problem of distributed selection in cooperative
systems and several other multi-node systems.Comment: 20 pages, 7 figures, 1 table, Accepted for publication in IEEE
Transactions on Wireless Communication
An Energy-Based Comparison of Long-Hop and Short-Hop Routing in MIMO Networks
This paper considers the problem of selecting either routes that consist of
long hops or routes that consist of short hops in a network of multiple-antenna
nodes, where each transmitting node employs spatial multiplexing. This
distance-dependent route selection problem is approached from the viewpoint of
energy efficiency, where a route is selected with the objective of minimizing
the transmission energy consumed while satisfying a target outage criterion at
the final destination. Deterministic line networks and two-dimensional random
networks are considered. It is shown that when 1) the number of hops traversed
between the source and destination grows large or 2) when the target success
probability approaches one or 3) when the number of transmit and/or receive
antennas grows large, short-hop routing requires less energy than long-hop
routing. It is also shown that if both routing strategies are subject to the
same delay constraint, long-hop routing requires less energy than short-hop
routing as the target success probability approaches one. In addition,
numerical analysis indicates that given loose outage constraints, only a small
number of transmit antennas are needed for short-hop routing to have its
maximum advantage over long-hop routing, while given stringent outage
constraints, the advantage of short-hop over long-hop routing always increases
with additional transmit antennas.Comment: 27 pages, 12 figures, submitted to IEEE Transactions on Vehicular
Technology in March 2009, revised in July 200