Cooperative network coding is considered as a novel technology that integrates cooperative communications with network coding to improve the throughput and robustness of the network. In this paper, a network coding en...
详细信息
Cooperative network coding is considered as a novel technology that integrates cooperative communications with network coding to improve the throughput and robustness of the network. In this paper, a network coding enabled cooperative network with multiple relays is considered, under Rayleigh fading. The outage probability of this network is analyzed and showed to be superior to the traditional network with multiple relays.
Practical wireless network coding (e. g., COPE) is a promising technique that can enhance the throughput of wireless networks. However, such a technique also bears a serious security drawback: it breaks the current pr...
详细信息
Practical wireless network coding (e. g., COPE) is a promising technique that can enhance the throughput of wireless networks. However, such a technique also bears a serious security drawback: it breaks the current privacy-preserving protocols (e. g., Onion Routing), since their operations conflict each other. As user privacy in wireless networks is highly valued nowadays, a new privacy-preserving scheme that can function with wireless network coding becomes indispensable. To address such a challenge, we apply the idea of cooperative networking and design a novel anonymity scheme named ANOC, which can function in network-coding-based wireless mesh networks. ANOC is built upon the classic Onion Routing protocol, and resolves its conflict with network coding by introducing efficient cooperation among relay nodes. Using ANOC, we can perform network coding to achieve a higher throughput, while still preserving user privacy in wireless mesh networks. We formally show how ANOC achieves the property of relationship anonymity, and conduct extensive experiments via nsclick to demonstrates its feasibility and efficiency when integrated with network coding.
In this paper, we propose a distributed rate allocation algorithm for delay minimal data delivery in overlay networks where multiple sources compete simultaneously for the available network resources. In order to effi...
详细信息
In this paper, we propose a distributed rate allocation algorithm for delay minimal data delivery in overlay networks where multiple sources compete simultaneously for the available network resources. In order to efficiently utilize the network resources, we propose to use inter-session network coding. We devise a distributed algorithm that allows peers to determine the optimal coding combinations and the packet rates for each type of combinations to be requested from the parent peers. The rate allocation problem is formulated as a decoding delay minimization problem, where every peer seeks the rates that minimize the average expected delay of the peer and its children peers. To solve this non-convex optimization problem, we introduce the concept of equivalent packet flows, which permits to estimate the expected number of packets that every peer needs to collect for decoding. We then decompose our original rate allocation problem into a set of convex subproblems, which we eventually combine to obtain the solution to the delay minimization problem. The results demonstrate that the proposed scheme eliminates effectively the bottlenecks and reduces the delay time experienced by users with limited resources.
A relay selection method is one of popular approaches to overcome fading effects in wireless relay channel due to its simplicity. However, previous works were concentrated on the case of analog network coding systems....
详细信息
A relay selection method is one of popular approaches to overcome fading effects in wireless relay channel due to its simplicity. However, previous works were concentrated on the case of analog network coding systems. In this paper, we consider a relay selection scheme in two-way relaying systems with physical network coding. Since conventional schemes based on analog network coding does not provide effective performance in physical network coded systems, we propose new selection criteria which maximize the minimum distance at the multiple access phase to achieve full diversity. Moreover, through asymptotic error rate analysis, it is confirmed that the proposed scheme is able to attain full diversity. Simulations results are also provided to verify the analysis of the proposed scheme.
A communication scenario where a source communicates with a destination over a directed layered relay network is considered. Each relay performs analog network coding where it scales and forwards the signals received ...
详细信息
A communication scenario where a source communicates with a destination over a directed layered relay network is considered. Each relay performs analog network coding where it scales and forwards the signals received at its input. In this scenario, we address the question: What portion of the maximum end-to-end achievable rate can be maintained if only a fraction of relay nodes available at each layer are used? We consider, in particular, the Gaussian diamond network and a class of symmetric layered networks. For these networks we provide upper bounds on additive and multiplicative gaps between the optimal analog network coding performance when all N relays in each layer are used and when only k such relays are are used, k
Wireless network coding suffers the error propagation issues that may severely degrade the diversity performance. In this work, we develop two power scaling schemes at the relay side and two detection schemes at the r...
详细信息
ISBN:
(纸本)9781467309202
Wireless network coding suffers the error propagation issues that may severely degrade the diversity performance. In this work, we develop two power scaling schemes at the relay side and two detection schemes at the receiver side, respectively, to mitigate error propagation in network-coded uplink channel and thus achieve full diversity. For the soft power scaling based link adaptive relaying, we develop a virtual channel model and demonstrate that the relay power should be such to balance the signal-to-noise ratios of the source-relay channel and relay-destination channel. As for the hard power scaling based ON-OFF relaying, we first design a decision rule based on total pairwise error probability, and then simplifies it to the threshold-based relaying strategy. At the receiver side, we show that the weighted minimum distance detection with the weight being determined by the relative link quality of source-relay channel and relay-destination channel can achieve full diversity once the global channel state information is available, otherwise the maximum likelihood detection that explicitly takes into account relay decoding error should be employed to achieve full diversity.
The existing PNC scheme is with coherent detection at the receivers, where the perfect global CSI is needed. To ensure that PNC can be implemented in practical two-way relaying systems, two detection schemes are prese...
详细信息
The existing PNC scheme is with coherent detection at the receivers, where the perfect global CSI is needed. To ensure that PNC can be implemented in practical two-way relaying systems, two detection schemes are presented in this paper, which are named as non-coherent detection and partial-coherent detection for PNC respectively. Specifically non-coherent detection requires for no CSI at the receivers. To further improve the detection performance, partial-coherent detection for PNC is introduced, where imperfect partial CSI can be obtained at the receivers by channel estimation. The decision rules for both two detection schemes are given in the paper, and the simulation results show that our proposed detection schemes are practical and efficient for PNC in Rayleigh fading channels.
In this paper, we propose a novel fading correction and relaying scheme for physical layer network coding (PLNC) in the two-way relay (TWR) fading channel. The fading correction on the soft-bit level at nodes can elim...
详细信息
ISBN:
(纸本)9781457720529
In this paper, we propose a novel fading correction and relaying scheme for physical layer network coding (PLNC) in the two-way relay (TWR) fading channel. The fading correction on the soft-bit level at nodes can eliminate the effect of fading on the TWR channel. In order to broadcast the soft-bit in an optimal way, we design a quantize-and-forward scheme which is robust for the TWR fading channel. In addition, an optimized mapping is used to implement unequal error protection (UEP) for bits with different significance in the quantization index. The soft-bit correction and the robust quantize-and-forward scheme are fully compatible with one another. Both low complexity and good performance can be provided.
The analysis of modulation schemes for the physical layer network-coded two way relaying scenario is presented which employs two phases: Multiple access (MA) phase and Broadcast (BC) phase. Depending on the signal set...
详细信息
The analysis of modulation schemes for the physical layer network-coded two way relaying scenario is presented which employs two phases: Multiple access (MA) phase and Broadcast (BC) phase. Depending on the signal set used at the end nodes, the minimum distance of the effective constellation seen at the relay becomes zero for a finite number of channel fade states referred as the singular fade states. The singular fade states fall into the following two classes: (i) the ones which are caused due to channel outage and whose harmful effect cannot be mitigated by adaptive network coding called the non-removable singular fade states and (ii) the ones which occur due to the choice of the signal set and whose harmful effects can be removed called the removable singular fade states. In this paper, we derive an upper bound on the average end-to-end Symbol Error Rate (SER), with and without adaptive network coding at the relay, for a Rician fading scenario. It is shown that without adaptive network coding, at high Signal to Noise Ratio (SNR), the contribution to the end-to-end SER comes from the following error events which fall as SNR -1 : the error events associated with the removable and nonremovable singular fade states and the error event during the BC phase. In contrast, for the adaptive network coding scheme, the error events associated with the removable singular fade states fall as SNR -2 , thereby providing a coding gain over the case when adaptive network coding is not used. Also, it is shown that for a Rician fading channel, the error during the MA phase dominates over the error during the BC phase. Hence, adaptive network coding, which improves the performance during the MA phase provides more gain in a Rician fading scenario than in a Rayleigh fading scenario. Furthermore, it is shown that for large Rician factors, among those removable singular fade states which have the same magnitude, those which have the least absolute value of the phase angle alone contrib
The paper proposes a Random network coding based solution for data dissemination applications involving multiple unicast or multicast transmissions between a source and several destinations. The solution proposed is b...
详细信息
The paper proposes a Random network coding based solution for data dissemination applications involving multiple unicast or multicast transmissions between a source and several destinations. The solution proposed is based on a mathematical framework derived from the theory of Random network coding employed in multicast transmissions. This framework specifies the conditions allowing to each destination to decode only the flows of interest, when the total rate of the source flows is larger than the capacity of the network. A testbed, shortly described in the paper, was implemented for proof of concept and the performances of the coded transmissions were compared to that of uncoded transmissions. The results show the improvement brought by our solution in what concerns the packet loss rate obtained for different ratios between the source flows rates and the transfer rates of the test topology's bottleneck links.
暂无评论