Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userPerformance Analysis of Relay Selection With Enhanced Dynamic Decode-and-Forward and Network Coding in Two-Way Relay Channels
169
0
0.0
(
0
)
Added by
Wei-Cheng Liu
Publication date
2016
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
In this paper, we adopt the relay selection (RS) protocol proposed by Bletsas, Khisti, Reed and Lippman (2006) with Enhanced Dynamic Decode-and-Forward (EDDF) and network coding (NC) system in a two-hop two-way multi-relay network. All nodes are single-input single-output (SISO) and half-duplex, i.e., they cannot transmit and receive data simultaneously. The outage probability is analyzed and we show comparisons of outage probability with various scenarios under Rayleigh fading channel. Our results show that the relay selection with EDDF and network coding (RS-EDDF&NC) scheme has the best performance in the sense of outage probability upon the considered decode-and-forward (DF) relaying if there exist sufficiently relays. In addition, the performance loss is large if we select a relay at random. This shows the importance of relay selection strategies.
rate research
Read More
Molecular communication (MC) allows nanomachines to communicate and cooperate with each other in a fluid environment. The diffusion-based MC is popular but is easily constrained by the transmit distance due to the severe attenuation of molecule concentrations. In this letter, we present a decode-and-forward (DF) relay strategy for the reversible binding receptor in the diffusion-based MC system. The time-varying spatial distribution of the information molecules based on the reversible association and dissociation between ligand and receptor at the surface of receiver is characterized. An analytical expression for the evaluation of expected error probability is derived, and the key factors impacting on the performance are exploited. Results show that with a constant molecular budget, the proposal can improve the performance significantly, and the performance gain can be enhanced by optimizing the position of the relay node and the number of molecules assigned to the source node.
We reduce the problem of optimal beamforming for two-way relay (TWR) systems with perfect channel state infomation (CSI) that use analog network coding (ANC) to a pair of algebraic equations in two variables that can be solved inexpensively using numerical methods. The solution has greatly reduced complexity compared to previous exact solutions via semidefinite programming (SDP). Together with the linearized robust solution described in (Aziz and Thron, 2014), it provides a high-performance, low-complexity robust beamforming solution for 2-way relays.
We consider the opportunistic multiuser diversity in the multiuser two-way amplify-and-forward (AF) relay channel. The relay, equipped with multiple antennas and a simple zero-forcing beam-forming scheme, selects a set of two way relaying user pairs to enhance the degree of freedom (DoF) and consequently the sum throughput of the system. The proposed channel aligned pair scheduling (CAPS) algorithm reduces the inter-pair interference and keeps the signal to interference plus noise power ratio (SINR) of user pairs relatively interference free in average sense when the number of user pairs become very large. For ideal situations, where the number of user pairs grows faster than the system signal to noise ratio (SNR), the DoF of $M$ per channel use can be achieved when $M$ is the relay antenna size. With a limited number of pairs, the system is overloaded and the sum rates saturate at high signal to noise ratio (SNR) though modifications of CAPS can improve the performance to a certain amount. The performance of CAPS can be further enhanced by semi-orthogonal channel aligned pair scheduling (SCAPS) algorithm, which not only aligns the pair channels but also forms semi-orthogonal inter-pair channels. Simulation results show that we provide a set of approaches based on (S)CAPS and modified (S)CAPS, which provides system performance benefit depending on the SNR and the number of user pairs in the network.
We consider a multipair two-way relay communication network, where pairs of user devices exchange information via a relay system. The communication between users employs time division duplex, with all users transmitting simultaneously to relays in one time slot and relays sending the processed information to all users in the next time slot. The relay system consists of a large number of single antenna units that can form groups. Within each group, relays exchange channel state information (CSI), signals received in the uplink and signals intended for downlink transmission. On the other hand, per-group CSI and uplink/downlink signals (data) are not exchanged between groups, which perform the data processing completely independently. Assuming that the groups perform zero-forcing in both uplink and downlink, we derive a lower bound for the ergodic sumrate of the described system as a function of the relay group size. By close observation of this lower bound, it is concluded that the sumrate is essentially independent of group size when the group size is much larger than the number of user pairs. This indicates that a very large group of cooperating relays can be substituted by a number of smaller groups, without incurring any significant performance reduction. Moreover, this result implies that relay cooperation is more efficient (in terms of resources spent on cooperation) when several smaller relay groups are used in contrast to a single, large group.
Short message noisy network coding (SNNC) differs from long message noisy network coding (LNNC) in that one transmits many short messages in blocks rather than using one long message with repetitive encoding. Several properties of SNNC are developed. First, SNNC with backward decoding achieves the same rates as SNNC with offset encoding and sliding window decoding for memoryless networks where each node transmits a multicast message. The rates are the same as LNNC with joint decoding. Second, SNNC enables early decoding if the channel quality happens to be good. This leads to mixed strategies that unify the advantages of decode-forward and noisy network coding. Third, the best decoders sometimes treat other nodes signals as noise and an iterative method is given to find the set of nodes that a given node should treat as noise sources.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
