Motivated by streaming applications with stringent delay constraints, we consider the design of online network coding algorithms with timely delivery guarantees. Assuming that the sender is providing the same data to ...
详细信息
ISBN:
(纸本)9781424435128
Motivated by streaming applications with stringent delay constraints, we consider the design of online network coding algorithms with timely delivery guarantees. Assuming that the sender is providing the same data to multiple receivers over independent packet erasure channels, we focus on the case of perfect feedback and heterogeneous erasure probabilities. Based on a general analytical framework for evaluating the decoding delay, we show that existing ARQ schemes fail to ensure that receivers with weak channels are able to recover from packet losses within reasonable time. To overcome this problem, we re-define the encoding rules in order to break the chains of linear combinations that cannot be decoded after one of the packets is lost. Our results show that sending uncoded packets at key times ensures that all the receivers are able to meet specific delay requirements with very high probability.
Broadcast nature of wireless networks can be exploited to provide a flexible transmission, especially in multicast service. The potential relay then is capable to participate in message forwarding. This paper presents...
详细信息
Broadcast nature of wireless networks can be exploited to provide a flexible transmission, especially in multicast service. The potential relay then is capable to participate in message forwarding. This paper presents a network coding based cooperative (NCBC) multicast scheme exploiting limited feedback. In the developed NCBC multicast scheme, the source transmits two separate signals to multiple destinations in two successive half slots. The relay may combine the signals if it received two signals correctly and forward it to destinations in the next half slot. The destinations, therefore, can recover signals either from direct transmission or the relay forwarding. In this paper, performance analysis is presented in terms of outage probability and diversity order. It is demonstrated that the NCBC multicast scheme can work better than direct source multicast in terms of outage probability. Meanwhile, the NCBC multicast scheme can achieve full diversity gain (diversity two for one relay case). Comparisons with amplify-and-forward (AF) and selection decode-and-forward cooperation schemes shows that the NCBC multicast scheme achieves almost the same outage performance as AF and selection decode and forward while consuming less bandwidth and energy resources.
In this paper, we combine network coding and tomographic techniques for topology inference. Our goal is to infer the topology of a network by sending probes between a given set of multiple sources and multiple receive...
详细信息
In this paper, we combine network coding and tomographic techniques for topology inference. Our goal is to infer the topology of a network by sending probes between a given set of multiple sources and multiple receivers and by having intermediate nodes perform network coding operations. We combine and extend two ideas that have been developed independently. On one hand, network coding introduces topology-dependent correlation, which can then be exploited at the receivers to infer the topology. On the other hand, it has been shown that a traditional (i.e., without network coding) multiple source, multiple receiver tomography problem can be decomposed into multiple two source, two receiver subproblems. Our first contribution is to show that, when intermediate nodes perform network coding, topological information contained in network coded packets allows to accurately distinguish among all different 2-by-2 subnetwork components, which was not possible with traditional tomographic techniques. Our second contribution is to use this knowledge to merge the subnetworks and accurately reconstruct the general topology. Our approach is applicable to any general Internet-like topology, and is robust to the presence of delay variability and packet loss.
We introduce algorithms to design robust network codes in the presence of link failures for multicast in a directed acyclic network. Robustness is achieved through diversity provided by the network links and flows, wh...
详细信息
We introduce algorithms to design robust network codes in the presence of link failures for multicast in a directed acyclic network. Robustness is achieved through diversity provided by the network links and flows, while the maximum multicast rate due to max-flow min-cut bound is maintained. The proposed scheme is a receiver-based robust network coding, which exploits the diversity due to the possible gap of the specific receivers min-cut with respect to the network multicast capacity. An improved version of this scheme guarantees multicast capacity for a certain level of failures. In a multicast session, failure of a flow may not necessarily reduce the capacity of the network as other useful branches within the network could still facilitate back up routes (flows) from the source to the sinks. We introduce a scheme to employ backup flows in addition to the main flows to multicast data at maximum rate h , when possible. In a limiting case, the scheme guarantees the rate h , for all link failure patterns, which do not decrease the maximum rate below h . Here, the number of link failures may in general exceed the refined singleton bound.
In cooperative communication system, mobile users are constantly transmitting and relaying data. On the other hand, network coding has been widely investigated in communication system. In this paper, we aim to combine...
详细信息
In cooperative communication system, mobile users are constantly transmitting and relaying data. On the other hand, network coding has been widely investigated in communication system. In this paper, we aim to combine network coding with the conventional cooperative communication system, however, we face certain problems. The main property of cooperative system is diversity; however, when network coding operation is introduced, it violates the rules of diversity. The new signals transmitted by relays are no longer like those sent from the transmitters. In order to fix this problem, in this paper we introduce a method using a multiplier rather than the binary sum operation, which is normally used in network coding. Numerical analyses using maximum ratio combining (MRC), for performance analysis, show that the proposed method improves diversity, i.e. reliability, without deterioration of the average probability of error. Cooperative communication is widely used in consumer wireless communication.
The problem of characterizing the optimal rate achievable with analog network coding (ANC) for a unicast communication over general wireless relay networks is computationally hard. A relay node performing ANC scales a...
详细信息
The problem of characterizing the optimal rate achievable with analog network coding (ANC) for a unicast communication over general wireless relay networks is computationally hard. A relay node performing ANC scales and forwards its input signals. The source-destination channel in such communication scenarios is, in general, an intersymbol interference (ISI) channel which leads to the single-letter characterization of the optimal rate in terms of an optimization problem with nonconvex, non closed-form objective function and non-convex constraints. For a special class of such networks, called layered networks, a few key results and insights are however available. To gain insights into the nature of the optimal solution and to construct low-complexity schemes to characterize the optimal rate for general wireless relay networks, we need (1) network topologies that are regular enough for analysis, yet general enough to capture essential characteristics of general wireless relay networks, and (2) schemes to approximate the objective function in closed-form without significantly compromising the performance. Towards these two goals, this work proposes (1) nonlinear chain networks, and (2) two approximation schemes. We show that their combination allows us to tightly characterize the optimal ANC rate with low computational complexity for a much larger class of general wireless relay networks than possible with existing schemes.
We propose a combined channel-network coding solution for efficient user cooperation in wireless ad-hoc networks that comprise a host of terminals communicating to a common destination. The proposed framework, termed ...
详细信息
ISBN:
(纸本)142440505X
We propose a combined channel-network coding solution for efficient user cooperation in wireless ad-hoc networks that comprise a host of terminals communicating to a common destination. The proposed framework, termed generalized adaptive network coded cooperation or GANCC, addresses the challenge of inter-user outage, which widely persists in practical cooperation scenarios, by adaptively matching code graphs to instantaneous network graphs (topologies). Additionally, GANCC treats channel codes as an integral part of the network code, and in doing so not only extracts the most benefit from these codes but also provides a live example supporting the notion that network codes are generalization of channel codes (as well as source codes)
We propose a physical layer approach to detect the relay node that injects false data or adds channel errors into the network encoder in multiple access relay networks. The misbehaving relay is detected by using the m...
详细信息
We propose a physical layer approach to detect the relay node that injects false data or adds channel errors into the network encoder in multiple access relay networks. The misbehaving relay is detected by using the maximum a posteriori (MAP) detection rule which is optimal in the sense of minimizing the probability of incorrect decision (false alarm and miss detection). The proposed scheme does not require sending extra bits at the source, such as hash function or message authentication check bits, and hence there is no transmission overhead. The side information regarding the presence of forwarding misbehavior is exploited at the decoder to enhance the reliability of decoding. We derive the probability of false alarm and miss detection and the probability of bit error, taking into account the lossy nature of wireless links. We show that the proposed decoding with the aid of the MAP detection of misbehaving relay is within 1dB away from the genie-aided decoding.
In this paper, we propose two novel physical layer aware adaptive network coding schemes for time variant channels, one aiming to maximize the energy efficiency, the other exploiting also the variable modulation order...
详细信息
In this paper, we propose two novel physical layer aware adaptive network coding schemes for time variant channels, one aiming to maximize the energy efficiency, the other exploiting also the variable modulation order, in an adaptive way. The proposed schemes have been applied to different satellite communications scenarios with different Round Trip Times (RTT). Compared to adaptive network coding, and classical non-adaptive network coding schemes for time variant channels, used as benchmarks, the proposed schemes demonstrate that adaptation of packet transmission based on the channel variation and corresponding erasures allows for significant gains in terms of throughput, delay and energy efficiency. We shed light on the trade-off between energy efficiency and delay-throughput gains, demonstrating that conservative adaptive approaches that favor less transmission under high erasures, might cause higher delay and less throughput gains in comparison to non-conservative approaches that favor more transmission to account for high erasures.
Based on an information model that classifies intermediate nodes in multicast networks into network coding, routing and replicating nodes, multicast max-flow and minimum cost optimization frameworks are formulated to ...
详细信息
Based on an information model that classifies intermediate nodes in multicast networks into network coding, routing and replicating nodes, multicast max-flow and minimum cost optimization frameworks are formulated to solve optimization problems in wireless networks with or without network coding. Two special properties of wireless transmissions are taken into consideration, i.e., multi-hop cooperation and mutual interference among nodes. Using maximal ratio combining (MRC) for node cooperation and successive interference cancellation (SIC) for interference mitigation, signal-to-interference-plus-noise ratio (SINR) expressions for wireless nodes are derived. Such expressions are then used to modify the edge capacity in the optimization frameworks. The proposed method is helpful to the study of node cooperation and competition in multi-hop wireless communication networks.
暂无评论