Performance evaluation of multicast relay network using LDPC and convolutional channel codes along-with XOR network coding

In this paper,we have compared the performance of joint network channel coding(JNCC) for multicast relay network using low density parity check(LDPC) codes and Convolutional codes as channel codes while exclusive or(XOR) network coding used at the intermediate relay nodes.Multicast relay transmission is a type of transmission scheme in which two fixed relay nodes contribute in the second hop of end-to-end transmission between base transceiver station(BTS) and a pair of mobile stations.We have considered one way and two way multicast scenarios to evaluate the bit error rate(BER) and throughput performance.It has been shown that when using XOR network coding at the intermediate relay nodes,the same transmission becomes possible in less time slots hence throughput performance can be improved.Moreover we have also discussed two possible scenarios in the proposed system model,in which both diversity and multiplexing gain has been considered.It is worth notifying that BER and throughput achieved for LDPC codes is better than Convolutional codes for all the schemes discussed.     

Using network coding to achieve the capacity of deterministic relay networks with relay messages

In this paper, we derive the capacity of the deterministic relay networks with relay messages. We consider a network that consists of five nodes, four of which can only communicate via the fifth one. However, the fifth node is not merely a relay as it may exchange private messages with the other network nodes. First, we develop an upper bound on the capacity region based on the notion of a single‐sided genie. In the course of the achievability proof, we also derive the deterministic capacity of a four‐user relay network (without private messages at the relay). The capacity achieving schemes use a combination of two network coding techniques: the simple ordering scheme and detour scheme. In the simple ordering scheme, we order the transmitted bits at each user such that the bi‐directional messages will be received at the same channel level at the relay, while the basic idea behind the detour scheme is that some parts of the message follow an indirect paths to their respective destinations. This paper, therefore, serves to show that user cooperation and network coding can enhance throughput, even when the users are not directly connected to each other. Finally, we make a conjecture about the capacity region of the general K‐node relay network with relay messages. Copyright © 2016 John Wiley & Sons, Ltd.     

Differential space–time network coding in MIMO two‐way relay channel network

This paper focuses on noncoherent detection scheme for multiple‐input multiple‐output two‐way relay channel network with two two‐antennas source nodes and one single‐antenna relay node. An orthogonal differential space–time network coding (ODSTNC) scheme based on relay detection and forward protocol is proposed. The proposed scheme combines space–time coding with network coding, and the differential modulation and detection are used in both multiple access stage and broadcast stage. The multiple‐symbol differential detection is employed at the relay. The maximum likelihood decision and its low‐complexity sphere decoding decision are given. The upper and lower bounds on the average symbol error probability for this system under differential binary phase shift keying (DBPSK) are derived, and a diversity order of 2 is confirmed to be achieved. The simulation results show that the ODSTNC scheme has good performance, and it is available for the applications of far distance signal transmission between two terminals where channel state information is unknown. Copyright © 2014 John Wiley & Sons, Ltd.     

Transmission scheduling in a multi‐channel wireless network with bidirectional relaying links

Using network coding in a wireless network can potentially improve the network throughput. On the other hand, it increases the complexity of resource allocations as the quality of one transmission is affected by the link conditions of the transmitter to multiple receivers. In this work, we study time slot scheduling and channel allocations jointly for a network with bidirectional relaying links, where the two end nodes of each link can exchange data through a relay node. Two scenarios are considered when the relay node forwards packets to the end nodes. In the first scenario, the relay node always forwards network‐coded packets to both end nodes simultaneously; in the second scenario, the relay node opportunistically uses network coding for two‐way relaying and traditional one‐way relaying. For each scenario, an optimization problem is first formulated for maximizing the total network throughput. The optimum scheduling is not causal because it requires future information of channel conditions. We then propose heuristic scheduling schemes. The slot‐based scheduling maximizes the total transmission rate of all the nodes at each time slot, and the node‐based scheduling schedules transmissions based on achievable transmission rates of individual nodes at different channels. The node‐based one has lower complexity than the slot‐based one. Our results indicate that although the node‐based scheduling achieves slightly lower throughput than the slot‐based one, both the proposed scheduling schemes are very effective in the sense that the difference between their throughput and the optimum scheduling is relatively small in different network settings. Copyright © 2015 John Wiley & Sons, Ltd.     

Physical‐layer network coding with limited feedback using orthogonal space–time block codes

This paper introduces limited feedback technique into physical‐layer network coding (PLNC) scheme, which is the most spectrally efficient protocol in two‐way relay channels, consisted of one relay and two end nodes (sources). Decode‐and‐forward (DF) and partial‐decode‐and‐forward (PDF) strategies are considered for PLNC, and all nodes are assumed to have two antennas to allow transmission by Alamouti's orthogonal space–time block code to provide diversity. In DF, by limited feedback, one of the sources is informed about instantaneous channel state information (CSI) to increase the bit error rate (BER) performance at relay. The closed‐form upper and lower bounds on the bit error probability are derived for binary phase‐shift keying (BPSK) and quadrature PSK (QPSK) modulations and approved via computer simulations. In PDF strategy, each source has to know CSI between relay and the other source for decoding, which causes extra protocol complexity. Moreover, for the system in which all nodes have two antennas, classical PDF strategy does not satisfy orthogonality at the end nodes. Therefore, in this paper, a modified‐PDF (MPDF) strategy with limited feedback is proposed. In MPDF, for decoding at the end nodes, differential phase information between channel fading coefficients having maximum amplitudes is fed back to the sources by relay. This approach enables single‐symbol decoding, besides full diversity, and sources do not need to know CSI between relay and the other source. It is shown via computer simulations that MPDF strategy provides significantly better BER performance than the classical PDF for BPSK and QPSK modulations.Copyright © 2012 John Wiley & Sons, Ltd.     

Cooperative quadrature physical layer network coding in wireless relay networks

This paper proposes a cooperative quadrature physical layer network coding (CQPNC) scheme for a dual‐hop cooperative relay network, which consists of two source nodes, one relay node and one destination node. All nodes in the network have one antenna, and the two source nodes transmit their signals modulated with quadrature carriers. In this paper, a cooperative quadrature physical layer network coded decode‐and‐forward (DF) relay protocol (CQPNC‐DF) is proposed to transmit the composite information from the two source nodes via the relay node to the destination node simultaneously to reduce the number of time slots required for a transmission. The proposed CQPNC‐DF relay protocol is compared with time‐division multiple‐access amplify‐and‐forward (TDMA‐AF), TDMA‐DF, cooperative network coded DF (CNC‐DF) and cooperative analog network coded AF (CANC‐AF) relay protocols to demonstrate its effectiveness in terms of bit error rate (BER) and system throughput under different propagation conditions. The simulation results reveal that the proposed CQPNC‐DF relay protocol can significantly improve the network performance. Compared with two TDMA schemes and CNC‐DF, the proposal can provide up to 100% and 50% throughput gains, respectively. Moreover, no matter what the scene, the proposed scheme always has the lowest BER in the low SNR region. Copyright © 2013 John Wiley & Sons, Ltd.     

非正交多址中继系统复数域网络编码优化设计

无线中继与网络编码是提高通信系统数据可靠性和吞吐率的重要技术手段,重点研究了单中继非正交多址系统复数域网络编码的优化设计问题.首先,在限制源节点和中继节点的总发送功率并假设各个源节点发送功率相同的条件下,证明了当源节点与中继节点发送功率相等时基于复数域网络编码的单中继非正交多址系统误符号率(SEP)性能最佳.其次,以编码增益为目标函数,提出了一种复数域网络编码的优化设计方法.与已有的复数域网络编码系数设计方法相比,此方法能满足任意源节点个数条件下复数域网络编码系数的优化设计要求,同时可以有效地避免因为网络编码系数选择不当造成信号重叠的现象,提升和改进系统的SEP性能.     

Reliable relay assisted wireless multicast using network coding

We first consider a topology consisting of one source, two destinations and one relay. For such a topology, it is shown that a network coding based cooperative (NCBC) multicast scheme can achieve a diversity order of two. In this paper, we discuss and analyze NCBC in a systematic way as well as compare its performance with two other multicast protocols. The throughput, delay and queue length for each protocol are evaluated. In addition, we present an optimal scheme to maximize throughput subject to delay and queue length constraints. Numerical results will demonstrate that network coding can bring significant gains in terms of throughput.     

Optimised Joint Channel Network Coding for Sensor Network with Correlated Sources

In this paper, we consider a Generalized Joint Channel Network Coding (GJCNC) scheme applied to Physical Layer Network Coding (PLNC) for a sensor network. For this purpose, M correlated sources desire to send information to one receiver by the help of a relay. The main goal is to estimate the information being sent from the last source at the destination by using the informations from sources and relay. For this purpose, we propose firstly a classic joint channel network coding at the relay which consider each source signal separately. Then, an optimization of this scheme is done by grouping by pair the nodes in the sensor network. The GJCNC decoding algorithm for each pair of sources is performed at the relay to improve performance. So, an iterative decoding scheme is proposed at the destination to extract the information sent from the last source. Simulation results show that by exploiting the correlation between sources, a significant gain can be achieved.     

Multisource, Multidestination, Multirelay Wireless Networks

Networks with multiple source-destination pairs, involving possibly multicast, and where there are multiple nodes that can serve as potential relay nodes, are considered. A multisource, multirelay coding scheme is developed. In this scheme, each source's information is sent to its destination nodes via a multirelay route, with the multiple multirelay routes operating concurrently even when they intersect with each other, in the same spirit as code-division multiple access (CDMA). It is found that in the generalization to multiple sources, backward decoding achieves higher rates than sliding-window decoding. The routing structure where a joint backward decoding can be performed is characterized. The achievable rate region is found to combine aspects of both multiple relay and multiple access. Potential applications of this coding scheme to sensor networks are discussed. In particular, the exact capacity for the data downloading problem in sensor networks, where there are multiple sensor sources and one sink or collector node, is established for certain geometries when there is phase fading that is unknown to the transmitter.     

Optimization of layered multicast with network coding and genetic algorithm

This article studies the problem of constructing optimal layered multicast with network coding for heterogeneous networks.Based on the flexibility of layered source coding, a global-favorable optimization scheme is proposed, which maximizes the aggregate throughput of heterogeneous sink nodes for layered multicast with network coding by determining the optimal bit rates of the layers. To solve this global-favorable optimization scheme, especially in the large-scale heterogeneous networks, a new problem-specific genetic algorithm (GA) is further proposed. It not only searches efficiently for the optimal allocation of layer bit rates, but also guarantees the validity of candidate solutions in the whole evolutionary process. Simulation results demonstrate that this new GA-based optimization scheme could obtain efficiently the optimal or satisfactorily near-optimal bit rates for layered multicast with network coding, even in the large-scale heterogeneous networks.     

DNF-SC-PNC: a new physical-layer network coding scheme for two-way relay channels with asymmetric data length

To improve the bit error rate (BER) performance of physical-layer network coding (PNC) in data length asymmetric two-way relay channels (TWRC), a new PNC scheme named combined denoise-and-forward and superposition coded physical-layer network coding (DNF-SC-PNC) is proposed, and the decoding algorithm of the scheme is improved. In the new scheme, the mixed information is denoised and superposed at the relay node, which will be broadcasted to the destination nodes. The destination nodes can use successive interference cancellation (SIC) or likelihood rate (LLR) algorithm for decoding. Theoretical analysis and simulation results show that DNF-SC-PNC can provide better BER performance and better throughput rate performance when the data length is asymmetric. Furthermore, we also proved that LLR algorithm can provide better performance than SIC algorithm in data length asymmetric TWRC.

     

非对称速率的双向中继信道物理层网络编码

本文提出了基于非对称速率的双向中继信道的物理层网络编码方案。本文所提方案联系实际无线通信信道的差异性,不但考虑了较差链路的最大传输性能以保证其传输的可靠性,而且在较优链路采取较高速率进行传输,从而充分利用较优链路来传输更多信息,增加通信系统的信道容量。为实现不对称速率传输,其基本思想是在较差链路中加入已知信息,通过已知信息可减小中继节点接收到的叠加信号的星座图,使得通信系统的译码性能得到提升。在中继节点,根据叠加信号的星座图对叠加信号进行联合解调,在节省了系统工作时隙的同时也减小了系统的复杂度。仿真结果表明了采用非对称速率传输不但可保证信息传输的可靠性,还可提高通信系统的信道容量,充分利用系统资源。      

Wireless network coding in slotted aloha with two-hop unbalanced traffic

This paper deals with two representative unbalanced traffic cases for two-hop wireless relay access systems employing network coding and a slotted ALOHA protocol. Network coding is a recent and highly regarded technology for capacity enhancement with multiple unicast and multisource multicast networks. We have analyzed the performance of network coding on a two-hop wireless relay access system employing the slotted ALOHA under a balanced bidirectional traffic. The relay nodes will generally undergo this unbalanced multidirectional traffic but the impact of this unbalanced traffic on network coding has not been analyzed. This paper provides closed-form expressions for the throughput and packet delay for two-hop unbalanced bidirectional traffic cases both with and without network coding even if the buffers on nodes are unsaturated. The analytical results are mainly derived by solving queueing systems for the buffer behavior at the relay node. The results show that the transmission probability of the relay node is a design parameter that is crucial to maximizing the achievable throughput of wireless network coding in slotted ALOHA on two-hop unbalanced traffic cases. Furthermore, we show that the throughput is enhanced even if the traffic at the relay node is unbalanced.     

Multicast with network coding in application-layer overlay networks

All of the advantages of application-layer overlay networks arise from two fundamental properties: 1) the network nodes in an overlay network, as opposed to lower-layer network elements such as routers and switches, are end systems and have capabilities far beyond basic operations of storing and forwarding; 2) the overlay topology, residing above a densely connected Internet protocol-layer wide-area network, can be constructed and manipulated to suit one's purposes. We seek to improve end-to-end throughput significantly in application-layer multicast by taking full advantage of these unique characteristics. This objective is achieved with two novel insights. First, we depart from the conventional view that overlay nodes can only replicate and forward data. Rather, as end systems, these overlay nodes also have the full capability of encoding and decoding data at the message level using efficient linear codes. Second, we depart from traditional wisdom that the multicast topology from source to receivers needs to be a tree, and propose a novel and distributed algorithm to construct a two-redundant multicast graph (a directed acyclic graph) as the multicast topology, on which network coding is applied. We design our algorithm such that the costs of link stress and stretch are explicitly considered as constraints and minimized. We extensively evaluate our algorithm by provable analytical and experimental results, which show that the introduction of two-redundant multicast graph and network coding may indeed bring significant benefits, essentially doubling the end-to-end throughput in most cases.     

采用LDPC码的分布式联合信源信道网络编码

提出了采用低密度奇偶校验码的分布式联合信源信道网络编码方案,应用于两源一中继一目的节点的无线传感器网络中.在方案中,信源节点通过传输系统信道码的校验位与部分信息位,同时实现了信源压缩与信道纠错.中继节点有效利用数据的相关性进行译码,并进行部分数据比特删余,减少因中继端网络编码引起的错误传播,仿真验证了方案的有效性.应用了不等差错保护思想,更贴近实际应用场景,利于目的节点进行更好的低误差解码.     

A two‐way relay framework based on interference cancellation in wireless networks

The two‐way relay (TWR) protocols are efficient in providing appreciable throughput gains in wireless networks through the use of network coding to combine packets from multiple channels. The key determinant factor in driving the throughput improvement is the degree of simultaneity achieved in the relay scheme. In this paper, we propose a new TWR protocol named interference cancellation TWR (IC‐TWR), which combines network coding, spatial diversity, and IC techniques to arrive at high degree of simultaneity and in the meanwhile to relax the requirement on channel state information as compared with TWR schemes based on amplify‐and‐forward. Numerical analysis shows that the proposed IC‐TWR is uniformly advantageous over the traditional decode‐and‐forward scheme in terms of system throughput and end‐to‐end delay. The proposed scheme may be useful for system designers of high‐speed multimedia applications in wireless mobile networks, wireless cellular networks, wireless sensor networks, and so on. Copyright © 2015 John Wiley & Sons, Ltd.     

在无线双向通信中基于CRC-NC抵抗污染攻击方案

本文提出一种CRC-NC (Cyclic Redundancy Check-Network Coding）方案．在无线双向通信网络中,该方案通过结合网络编码和循环冗余校验码技术,对接收到的消息的进行可信度检测,能有效地降低目的节点解码误码率,并抵抗污染攻击．该方案中节点与节点在中继节点的辅助下相互发送消息,并利用对方节点和中继节点发送的消息解码．若节点直接从对方节点获得的消息中有S个消息正确,该节点将对方节点发送的消息和中继节点发送的消息进行组合,并计算组合消息的汉明重量,从中选择K-S个最小的汉明重量所对应的由中继节点发送的消息解码．通过仿真结果表明,与基于随机选取方案和加密方案相比,该方案能有效的降低节点解码差错概率．      

Optimal resource allocation for multiple network‐coded two‐way relay in orthogonal frequency division multiplexing systems

This paper studies optimal resource allocation for multiple network‐coded two‐way relay in orthogonal frequency division multiplexing systems. All the two‐way relay nodes adopt amplify‐and‐forward and operate with analog network coding protocol. A joint optimization problem considering power allocation, relay selection, and subcarrier pairing to maximize the sum capacity under individual power constraints at each transmitter or total network power constraint is first formulated. By applying dual method, we provide a unified optimization framework to solve this problem. With this framework, we further propose three low‐complexity suboptimal algorithms. The complexity of the proposed optimal resource allocation (ORA) algorithm and three suboptimal algorithms are analyzed, and it is shown that the complexity of ORA is only a polynomial function of the number of subcarriers and relay nodes under both individual and total power constraints. Simulation results demonstrate that the proposed ORA scheme yields substantial performance improvement over a baseline scheme, and suboptimal algorithms can achieve a trade‐off between performance and complexity. The results also indicate that with the same total network transmit power, the performance of ORA under total power constraint can outperform that under individual power constraints. Copyright © 2012 John Wiley & Sons, Ltd.     

Exact analysis of the multihop multibranch hybrid AF/DF relaying networks

In this paper, the exact analysis of a multihop multibranch (MHMB) relaying network is investigated wherein each relay can operate in amplify‐and‐forward (AF) or decode‐and‐forward (DF) modes depending upon the decoding result of its received signal. If a relay decodes the received signal correctly, it works in DF mode; otherwise, the relay operates in AF mode. Therefore, we name such relaying network as hybrid amplify‐and‐forward and decode‐and‐forward (hybrid AF/DF) relaying network. We first investigate the signal transmission from source to destination node via n number of relays in a hybrid AF/DF MHMB mode. Then, we obtained the statistical features and analyze the end‐to‐end signal‐to‐noise ratio (SNR). Finally, a comprehensive performance analysis is conducted by using maximal ratio combining (MRC) scheme at the destination node. For comparison, we also obtained the results using selection combining (SC) scheme at the destination node. To the best of our knowledge, very few works in the literature have considered a general system model of MHMB relaying network wherein each relay can operate in AF or DF modes, that is, a hybrid AF/DF relaying network. Accordingly, the analysis of our system model is not only novel and exact, but also is comprehensive and can be employed in the future works.