2,151 research outputs found

    Joint Relay Selection and Analog Network Coding using Differential Modulation in Two-Way Relay Channels

    Full text link
    In this paper, we consider a general bi-directional relay network with two sources and N relays when neither the source nodes nor the relays know the channel state information (CSI). A joint relay selection and analog network coding using differential modulation (RS-ANC-DM) is proposed. In the proposed scheme, the two sources employ differential modulations and transmit the differential modulated symbols to all relays at the same time. The signals received at the relay is a superposition of two transmitted symbols, which we call the analog network coded symbols. Then a single relay which has minimum sum SER is selected out of N relays to forward the ANC signals to both sources. To facilitate the selection process, in this paper we also propose a simple sub-optimal Min-Max criterion for relay selection, where a single relay which minimizes the maximum SER of two source nodes is selected. Simulation results show that the proposed Min-Max selection has almost the same performance as the optimal selection, but is much simpler. The performance of the proposed RS-ANC-DM scheme is analyzed, and a simple asymptotic SER expression is derived. The analytical results are verified through simulations.Comment: 20 pages, 7 figure

    Relay Selection for Two-way Relaying with Amplify-and-Forward Protocols

    Full text link
    In this paper, we propose a relay selection amplify-and-forward (RS-AF) protocol in general bi-directional relay networks with two sources and NN relays. In the proposed scheme, the two sources first transmit to all the relays simultaneously, and then a single relay with a minimum sum symbol error rate (SER) will be selected to broadcast the received signals back to both sources. To facilitate the selection process, we propose a simple sub-optimal Min-Max criterion for relay selection, where a single relay which minimizes the maximum SER of two source nodes will be selected. Simulation results show that the proposed Min-Max selection has almost the same performance as the optimal selection with lower complexity. We also present a simple asymptotic SER expression and make comparison with the conventional all-participate amplify-and-forward (AP-AF) relaying scheme. The analytical results are verified through simulations. To improve the system performance, optimum power allocation (OPA) between the sources and the relay is determined based on the asymptotic SER. Simulation results indicate that the proposed RS-AF scheme with OPA yields considerable performance improvement over an equal power allocation (EPA) scheme, specially with large number of relay nodes.Comment: 19 pages, 6 figure

    Pairwise Check Decoding for LDPC Coded Two-Way Relay Block Fading Channels

    Full text link
    Partial decoding has the potential to achieve a larger capacity region than full decoding in two-way relay (TWR) channels. Existing partial decoding realizations are however designed for Gaussian channels and with a static physical layer network coding (PLNC). In this paper, we propose a new solution for joint network coding and channel decoding at the relay, called pairwise check decoding (PCD), for low-density parity-check (LDPC) coded TWR system over block fading channels. The main idea is to form a check relationship table (check-relation-tab) for the superimposed LDPC coded packet pair in the multiple access (MA) phase in conjunction with an adaptive PLNC mapping in the broadcast (BC) phase. Using PCD, we then present a partial decoding method, two-stage closest-neighbor clustering with PCD (TS-CNC-PCD), with the aim of minimizing the worst pairwise error probability. Moreover, we propose the minimum correlation optimization (MCO) for selecting the better check-relation-tabs. Simulation results confirm that the proposed TS-CNC-PCD offers a sizable gain over the conventional XOR with belief propagation (BP) in fading channels.Comment: to appear in IEEE Trans. on Communications, 201

    Distributed MAC Protocol Supporting Physical-Layer Network Coding

    Full text link
    Physical-layer network coding (PNC) is a promising approach for wireless networks. It allows nodes to transmit simultaneously. Due to the difficulties of scheduling simultaneous transmissions, existing works on PNC are based on simplified medium access control (MAC) protocols, which are not applicable to general multi-hop wireless networks, to the best of our knowledge. In this paper, we propose a distributed MAC protocol that supports PNC in multi-hop wireless networks. The proposed MAC protocol is based on the carrier sense multiple access (CSMA) strategy and can be regarded as an extension to the IEEE 802.11 MAC protocol. In the proposed protocol, each node collects information on the queue status of its neighboring nodes. When a node finds that there is an opportunity for some of its neighbors to perform PNC, it notifies its corresponding neighboring nodes and initiates the process of packet exchange using PNC, with the node itself as a relay. During the packet exchange process, the relay also works as a coordinator which coordinates the transmission of source nodes. Meanwhile, the proposed protocol is compatible with conventional network coding and conventional transmission schemes. Simulation results show that the proposed protocol is advantageous in various scenarios of wireless applications.Comment: Final versio

    Achieving full diversity in multi-antenna two-way relay networks via symbol-based physical-layer network coding

    No full text
    This paper considers physical-layer network coding (PNC) with M-ary phase-shift keying (MPSK) modulation in two-way relay channel (TWRC). A low complexity detection technique, termed symbol-based PNC (SPNC), is proposed for the relay. In particular, attributing to the outer product operation imposed on the superposed MPSK signals at the relay, SPNC obtains the network-coded symbol (NCS) straightforwardly without having to detect individual symbols separately. Unlike the optimal multi-user detector (MUD) which searches over the combinations of all users’ modulation constellations, SPNC searches over only one modulation constellation, thus simplifies the NCS detection. Despite the reduced complexity, SPNC achieves full diversity in multi-antenna relay as the optimal MUD does. Specifically, antenna selection based SPNC (AS-SPNC) scheme and signal combining based SPNC (SC-SPNC) scheme are proposed. Our analysis of these two schemes not only confirms their full diversity performance, but also implies when SPNC is applied in multi-antenna relay, TWRC can be viewed as an effective single-input multiple-output (SIMO) system, in which AS-PNC and SC-PNC are equivalent to the general AS scheme and the maximal-ratio combining (MRC) scheme. Moreover, an asymptotic analysis of symbol error rate (SER) is provided for SC-PNC considering the case that the number of relay antennas is sufficiently large

    Distributed differential beamforming and power allocation for cooperative communication networks

    Get PDF
    Many coherent cooperative diversity techniques for wireless relay networks have recently been suggested to improve the overall system performance in terms of the achievable data rate or bit error rate (BER) with low decoding complexity and delay. However, these techniques require channel state information (CSI) at the transmitter side, at the receiver side, or at both sides. Therefore, due to the overhead associated with estimating CSI, distributed differential space-time coding techniques have been suggested to overcome this overhead by detecting the information symbols without requiring any (CSI) at any transmitting or receiving antenna. However, the latter techniques suffer from low performance in terms of BER as well as high latency and decoding complexity. In this paper, a distributed differential beamforming technique with power allocation is proposed to overcome all drawbacks associated with the later techniques without needing CSI at any antenna and to be used for cooperative communication networks. We prove through our analytical and simulation results that the proposed technique outperforms the state-of-the-art techniques in terms of BER with comparably low decoding complexity and latency
    corecore