This paper addresses the fundamental characteristics of information exchange via multihop network coding over two-way relaying in a wireless ad hoc network. The end-to-end rate regions achieved by time-division multihop (TDMH), MAC-layer network coding (MLNC) and PHY-layer network coding (PLNC) are first characterized. It is shown that MLNC does not always achieve better rates than TDMH, time sharing between TDMH and MLNC is able to achieve a larger rate region, and PLNC dominates the rate regions achieved by TDMH and MLNC. An opportunistic scheduling algorithm for MLNC and PLNC is then proposed to stabilize the two-way relaying system for Poisson arrivals whenever the rate pair is within the Shannon rate regions of MLNC and PLNC. To understand the two-way transmission limits of multihop network coding, the sum-rate optimization with or without certain traffic pattern and the end-to-end diversity-multiplexing tradeoffs (DMTs) of two-way transmission over multiple relay nodes are also analyzed.
Traditionally (pre-network coding), information exchange between two users via a relay has been accomplished by a time-division multihop (TDMH) protocol in four time slots Frequency-division could be used as well. In this paper the comparisons focus on time-division systems only, and comparisons can be applied to frequency-division systems similarly. , as shown in Fig. (a). Intuitively, the MLNC and PLNC protocols save one time slot. In @cite_12 , two-way relaying for cellular systems was considered, while @cite_21 and @cite_28 proposed an MLNC algorithm effective for wireless mesh networks in heavy traffic. The network coding protocol in Fig. (b) can be further reduced to two slots if advanced joint coding decoding -- i.e. analog network coding (ANC) -- is allowed. In this case, both source nodes send their packets to the relay node simultaneously during the first slot; then the relay node either amplifies and broadcasts the signals, or broadcasts the XOR-ed packets after decoding by successive interference cancellation @cite_7 @cite_24 @cite_9 @cite_30 . The achievable rates for analog network coding were studied in @cite_17 @cite_9 .
@cite_30 @cite_7 @cite_28 @cite_9 @cite_21 @cite_24 @cite_12 @cite_17
2203527323 2293741284 2066938847 2949343062
In this paper we consider physical-layer network coding (PLNC) in OFDM-based two-way relaying systems. Practically, a key impairment for the application of PLNC is the carrier frequency offset (CFO) mismatch between the sources and the relay, which can not be compensated completely in the multiple-access (MA) phase. As this CFO mismatch results in inter-carrier interference (ICI) for OFDM transmissions, practical CFO compensation and ICI cancelation strategies are investigated to mitigate the impairment for a-posterior probability (APP) based PLNC decoders at the relay. Furthermore, we perform hardware implementation of the two-way relaying network employing an long term evolution (LTE) near parametrization adapted to PLNC. The APP-based decoding schemes with CFO compensation and ICI cancelation are applied on this real-time transmission platform to verify the analytical results. Abstract This paper presents the first implementation of a two-way relay network based on the principle of physical-layer network coding (PNC). To date, only a simplified version of PNC, called analog network coding (ANC), has been successfully implemented. The advantage of ANC is that it is simple to implement; the disadvantage, on the other hand, is that the relay amplifies the noise along with the signal before forwarding the signal. PNC systems in which the relay performs XOR or other denoising PNC mappings of the received signal have the potential for significantly better performance. However, the implementation of such PNC systems poses many challenges. For example, the relay in a PNC system must be able to deal with symbol and carrier-phase asynchronies of the simultaneous signals received from multiple nodes, and the relay must perform channel estimation before detecting the signals. We investigate a PNC implementation in the frequency domain, referred to as FPNC, to tackle these challenges. FPNC is based on OFDM. In FPNC, XOR mapping is performed on the OFDM samples in each subcarrier rather than on the samples in the time domain. We implement FPNC on the universal soft radio peripheral (USRP) platform. Our implementation requires only moderate modifications of the packet preamble design of 802.11a g OFDM PHY. With the help of the cyclic prefix (CP) in OFDM, symbol asynchrony and the multi-path fading effects can be dealt with simultaneously in a similar fashion. Our experimental results show that symbol-synchronous and symbol-asynchronous FPNC have essentially the same BER performance, for both channel-coded and non-channel-coded FPNC systems. This paper presents the first real-time physical-layer network coding (PNC) prototype for the two-way relay wireless channel (TWRC). Theoretically, PNC could boost the throughput of TWRC by a factor of 2 compared with traditional scheduling (TS) in the high signal-to-noise (SNR) regime. Although there have been many theoretical studies on PNC performance, there have been few experimental and implementation efforts. We built the first prototype of PNC about a year ago. It was, however, an offline system in which an offline PNC decoder was used at the relay. For a real-time PNC system, there are many additional challenges, including the needs for tighter coordination of the transmissions by the two end nodes, fast real-time PNC decoding at the relay, and a PNC-compatible retransmission scheme (i.e., an ARQ protocol) to ensure reliability of packet delivery. In this paper, we describe a real-time PNC prototype, referred to as RPNC, that provides practical solutions to these challenges. Indoor environment experimental results show that RPNC boosts the throughput of TWRC by a factor of 2 compared with TS, as predicted theoretically. RPNC prototype provides an interface to the application layer, with which we demonstrate the exchange of two image data files between the two end nodes. In this paper, collocated and distributed space-time block codes (DSTBCs) which admit multi-group maximum likelihood (ML) decoding are studied. First the collocated case is considered and the problem of constructing space-time block codes (STBCs) which optimally tradeoff rate and ML decoding complexity is posed. Recently, sufficient conditions for multi-group ML decodability have been provided in the literature and codes meeting these sufficient conditions were called Clifford Unitary Weight (CUW) STBCs. An algebraic framework based on extended Clifford algebras is proposed to study CUW STBCs and using this framework, the optimal tradeoff between rate and ML decoding complexity of CUW STBCs is obtained for few specific cases. Code constructions meeting this tradeoff optimally are also provided. The paper then focuses on multi-group ML decodable DSTBCs for application in synchronous wireless relay networks and three constructions of four-group ML decodable DSTBCs are provided. Finally, the OFDM based Alamouti space-time coded scheme proposed by Li-Xia for a 2 relay asynchronous relay network is extended to a more general transmission scheme that can achieve full asynchronous cooperative diversity for arbitrary number of relays. It is then shown how differential encoding at the source can be combined with the proposed transmission scheme to arrive at a new transmission scheme that can achieve full cooperative diversity in asynchronous wireless relay networks with no channel information and also no timing error knowledge at the destination node. Four-group decodable DSTBCs applicable in the proposed OFDM based transmission scheme are also given.