network coding, which can combine various traffic flows or packets via algebraic operations, has the potential of achieving substantial throughput and power efficiency gains in wireless networks. As such, it is consid...
详细信息
network coding, which can combine various traffic flows or packets via algebraic operations, has the potential of achieving substantial throughput and power efficiency gains in wireless networks. As such, it is considered as a powerful solution to meet the stringent demands and requirements of next-generation wireless systems. However, because of the random and asynchronous packet arrivals, network coding may result in severe delay and packet loss because packets need to wait to be network-coded with each others. To overcome this and guarantee quality of service (QoS), we present a novel cross-layer approach, which we shall refer to as Buffer-Aware network coding, or BANC, which allows transmission of some packets without network coding to reduce the packet delay. We shall derive the average delay and power consumption of BANC by presenting a random mapping description of BANC and Markov models of buffer states. A cross-layer optimization problem that minimizes the average delay under a given power constraint is then proposed and analyzed. Its solution will not only demonstrate the fundamental performance limits of BANC in terms of the achievable delay region and delay-power tradeoff, but also obtains the delay-optimal BANC schemes. Simulation results will show that the proposed approach can strike the optimal tradeoff between power efficiency and QoS.
In this paper, we investigate a hybrid network coding technique to be used at a wireless base station (BS) or access point (AP) to increase the throughput efficiency of single-hop wireless networks. Traditionally, to ...
详细信息
In this paper, we investigate a hybrid network coding technique to be used at a wireless base station (BS) or access point (AP) to increase the throughput efficiency of single-hop wireless networks. Traditionally, to provide reliability, lost packets from different flows (applications) are retransmitted separately, leading to inefficient use of wireless bandwidth. Using the proposed hybrid network coding approach, the BS encodes these lost packets, possibly from different flows together before broadcasting them to all wireless users. In this way, multiple wireless receivers can recover their lost packets simultaneously with a single transmission from the BS. Furthermore, simulations and theoretical analysis showed that when used in conjunction with an appropriate channel coding technique under typical channel conditions, this approach can increase the throughput efficiency up to 3.5 times over the Automatic Repeat reQuest (ARQ), and up to 1.5 times over the HARQ techniques.
In this paper, we propose a new linear vector physical-layer network coding (NC) scheme for spatial multiplexing multiple-input multiple-output (MIMO) two-way relay channel (TWRC) where the channel state information (...
详细信息
In this paper, we propose a new linear vector physical-layer network coding (NC) scheme for spatial multiplexing multiple-input multiple-output (MIMO) two-way relay channel (TWRC) where the channel state information (CSI) is not available at the transmitters. In this scheme, each user transmits M independent quadrature amplitude modulation signal streams respectively from its M antennas to the relay. Based on the receiver-side CSI, the relay determines a NC generator matrix for linear vector network coding, and reconstructs the associated M linear combinations of all messages. We present an explicit solution for the generator matrix that minimizes the error probability at a high SNR, as well as an efficient algorithm to find the optimized solution. We propose a novel typical error event analysis that exploits a new characterization of the deep fade events for the TWRC. We derive a new closed-form expression for the average error probability of the proposed scheme over a Rayleigh fading MIMO TWRC. Our analysis shows that the proposed scheme achieves the optimal error rate performance at a high SNR. Numerical results show that the proposed scheme significantly outperforms existing schemes, and match well with our analytical results.
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, a...
详细信息
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 and 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. In this paper, we seek to significantly improve end-to-end throughput 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 data can only be replicated and forwarded by overlay nodes. 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.
In infrastructure-lacking environments, like military areas of operation, the intermittent availability of backhaul networks leads to greater reliance on peer to peer data exchange. In such settings, mobile nodes use ...
详细信息
ISBN:
(纸本)9781479966646
In infrastructure-lacking environments, like military areas of operation, the intermittent availability of backhaul networks leads to greater reliance on peer to peer data exchange. In such settings, mobile nodes use Delay Tolerant network (DTN) protocols for exchanging location specific data. High transmission delay, packet loss and intermittent connectivity increases the need for efficient data transmission in such scenarios. In this paper, we evaluate network coding for efficient data exchange between mobile wireless nodes under the presence of an intermittent backhaul network, like a satellite or cellular link. We analyze the upper bound of savings achievable with network coding for single-hop packet transmission, and introduce a network coding algorithm focused on reducing the required number of packet transmissions in such a setting. Evaluation of our proposed data exchange protocol shows how network coding can be applied to reduce transmission delay and minimize the dependency on an intermittent backhaul network in a communication scenario typical of a military environment.
The applications in the critical infrastructure systems pose simultaneous resilience and performance requirements to the underlying computer network. To meet such requirements, the networks that use the store-and-forw...
详细信息
ISBN:
(纸本)9781538660430
The applications in the critical infrastructure systems pose simultaneous resilience and performance requirements to the underlying computer network. To meet such requirements, the networks that use the store-and-forward paradigm poses stringent conditions on the redundancy in the network topology and results in problems that becoming computationally challenging to solve at scale. However, with the advent of programmable data-planes, it is now possible to use linear network coding (NC) at the intermediate network nodes to meet resilience requirements of the applications. To that end, we propose an architecture that realizes linear NC in programmable networks by decomposing the linear NC functions into the atomic coding primitives. We designed and implemented the primitives using the features offered by the P4 ecosystem. Using an empirical evaluation, we show that the theoretical gains promised by linear network coding can be realized with a per-packet processing cost.
network coding opportunistic routing (NCOR) offers a promising solution for efficient data transmission in delay tolerant networks. Due to the multi-copy strategy and network coding nature, NCOR inevitably brings abou...
详细信息
network coding opportunistic routing (NCOR) offers a promising solution for efficient data transmission in delay tolerant networks. Due to the multi-copy strategy and network coding nature, NCOR inevitably brings about a large number of heterogeneous copies, leading to over-consumption of limited network resources. To alleviate this situation, it is imperative to study how to reduce redundant copies in the network. In this paper, we propose a pre-decoding recovery mechanism (PDRM) that removes residual copies after the destination node obtains the original packet information. The PDRM consists of three operations: generating pre-decoding elements, maintaining immune-lists, and deleting redundant copies. In particular, the destination node generates a pre-decoding element, and then, sends it to other nodes in the network via an immune-list to help remove the residual copies. Here, the pre-decoding element is an acknowledgement indicating that the destination node has the necessary information to decode the corresponding original packet. As the core of the PDRM, the first operation enables the destination node to generate a pre-decoding element for each innovative packet without waiting for decoding the generation. Simulation results demonstrate that the PDRM achieves excellent results in improving network performance, and outperforms the existing recovery mechanism.
Robust video multicast in erasure networks using network coding (NC) to reduce the impact of packet loss is studied in this paper. In our proposed solution, random linear network coding (RLNC) is adopted at intermedia...
详细信息
Robust video multicast in erasure networks using network coding (NC) to reduce the impact of packet loss is studied in this paper. In our proposed solution, random linear network coding (RLNC) is adopted at intermediate nodes of the network. RLNC linearly combines a group of packets by randomly selecting weighting coefficients on a finite field, and the loss of an RLNC-coded packet is equivalent to the loss of one constraint in a linear system of equations required for RLNC decoding. Unless the global coding coefficient matrix, or simply called the global coding matrix (GCM), is of full rank, a receive node cannot reconstruct all source packets. To address this rank deficiency problem, we propose to construct a special-structured GCM, called the ladder-shaped GCM (LGCM), for layered H.264/SVC (scalable video coding) video multicast. The ladder shape of the sparse coding matrix is maintained throughout the RLNC process to achieve two objectives: (1) to enable partial decoding of a block;and (2) to provide unequal erasure protection for H.264/SVC priority layers. Furthermore, quality degradation is minimized by optimizing the amount of redundancy assigned to each layer, and graceful quality degradation is achieved by error concealment (EC). Simulation results are given to demonstrate the superior performance of the proposed RLNC-LGCM scheme over the traditional RLNC with a general GCM. (C) 2010 Elsevier Inc. All rights reserved.
Multimedia services distribution is very dependent on the quality of the communications link. Due to the nature of the related services, these are usually very sensitive to packet loss, delay and jitter, and hence ser...
详细信息
ISBN:
(纸本)9781479958665
Multimedia services distribution is very dependent on the quality of the communications link. Due to the nature of the related services, these are usually very sensitive to packet loss, delay and jitter, and hence service quality is immediately worsen in harsh scenarios. This paper proposes an OSI-Layer2 cooperative link layer scheme (known as GalaReS) that remarkably improves the multimedia content distribution in realistic scenarios (under interferences, packet loss and time-varying channel conditions). To that end, the proposed scheme takes the advantage of a network coding based link layer scheme, where the cooperation among networked nodes provides a remarkable link stability under lossy conditions. Experimentation phase compares the performance achieved by the proposed scheme, compared to the legacy ones, under different interference patterns. Results demonstrate the validity of the network coding based scheme to distribute high quality multimedia services in realistic harsh scenarios.
We investigate the timeliness in delivering updates within a multisource multihop Internet of Things (IoT) network via multicast transmissions with or without employing network coding, using a completely probabilistic...
详细信息
We investigate the timeliness in delivering updates within a multisource multihop Internet of Things (IoT) network via multicast transmissions with or without employing network coding, using a completely probabilistic model. Age of Information (AoI) is adopted to quantify the timeliness of packets. Extensive simulation results, which corroborate the theoretical findings, demonstrate that in scenarios where the number of sources is high, the number of intermediate nodes relaying to monitors is low, there are multiple monitors, the transmission success probability is low, and computational resources are sufficient, the utilization of network coding has a great potential to improve the data-freshness in multisource multihop IoT networks which closely represent the spine of the real-life scenarios.
暂无评论