Content-Centric networking (CCN) naturally supports multi-path communication, as it allows the simultaneous use of multiple interfaces (e.g. LTE and WiFi). When multiple sources and multiple clients are considered, th...
详细信息
ISBN:
(纸本)9781467399531
Content-Centric networking (CCN) naturally supports multi-path communication, as it allows the simultaneous use of multiple interfaces (e.g. LTE and WiFi). When multiple sources and multiple clients are considered, the optimal set of distribution trees should be determined in order to optimally use all the available interfaces. This is not a trivial task, as it is a computationally intense procedure that should be done centrally. The need for central coordination can be removed by employing network coding, which also offers improved resiliency to errors and large throughput gains. In this paper, we propose NetCodCCN, a protocol for integrating network coding in CCN. In comparison to previous works proposing to enable network coding in CCN, NetCodCCN permits Interest aggregation and Interest pipelining, which reduce the data retrieval times. The experimental evaluation shows that the proposed protocol leads to significant improvements in terms of content retrieval delay compared to the original CCN. Our results demonstrate that the use of network coding adds robustness to losses and permits to exploit more efficiently the available network resources. The performance gains are verified for content retrieval in various network scenarios.
One of the most important issues in multicast is how to achieve a balanced traffic load within a communications network. This paper formulates a load balancing optimization problem in the context of multicast with net...
详细信息
ISBN:
(纸本)9783319421087
One of the most important issues in multicast is how to achieve a balanced traffic load within a communications network. This paper formulates a load balancing optimization problem in the context of multicast with network coding and proposes a modified population based incremental learning (PBIL) algorithm for tackling it. A novel probability vector update scheme is developed to enhance the global exploration of the stochastic search by introducing extra flexibility when guiding the search towards promising areas in the search space. Experimental results demonstrate that the proposed PBIL outperforms a number of the state-of-the-art evolutionary algorithms in terms of the quality of the best solution obtained.
A code equivalence between index coding and network coding was established, which shows that any index-coding instance can be mapped to a network-coding instance, for which any index code can be translated to a networ...
详细信息
network coding can significantly enhance throughput and reliability in loss prone wireless networks. Adapting network coding redundancy is critical, since over-redundancy wastes network resources and hurts performance...
详细信息
ISBN:
(纸本)9781509017010
network coding can significantly enhance throughput and reliability in loss prone wireless networks. Adapting network coding redundancy is critical, since over-redundancy wastes network resources and hurts performance and under-estimated redundancy prevents decoding at destination. In this paper, we study the tradeoff between application tolerated loss rate and network overhead introduced by network coding redundancy. We first propose an analytic model that determines a simple redundancy bound to adapt network coding redundancy according to the measured packet loss rate and the targeted maximum application loss rate. Then, we propose a distributed algorithm with adaptive redundancy for reliable data delivery in wireless meshes. In the algorithm, each node opportunistically makes use of multiple paths available in the network to deliver data to the destination. We demonstrate the benefits of our schemes through simulation in various network scenarios.
Previously, the distributed coding aware routing (DCAR) mechanism was proposed as a network coding aware routing protocol. However, DCAR is inefficient in handling real-time multimedia flows because it prefers nodes w...
详细信息
ISBN:
(纸本)9781509017249
Previously, the distributed coding aware routing (DCAR) mechanism was proposed as a network coding aware routing protocol. However, DCAR is inefficient in handling real-time multimedia flows because it prefers nodes with longer queues in determining routes so that network coding opportunities can be increased. We propose a distributed coding aware routing protocol that can maximize throughput and minimize delay of real-time multimedia flows in wireless multi hop networks. Simulation results show that our proposed scheme achieves higher throughput and reduces the average end-to-end delay compared to the traditional distributed coding-aware routing protocols.
This work considers the smart repeater network where a single source s wants to send two independent packet streams to destinations {d(1), d(2)} with the help of relay r. The transmission from s or r is modeled by pac...
详细信息
ISBN:
(纸本)9781509018062
This work considers the smart repeater network where a single source s wants to send two independent packet streams to destinations {d(1), d(2)} with the help of relay r. The transmission from s or r is modeled by packet erasure channels: For each time slot, a packet transmitted by s may be received, with some probabilities, by a random subset of {d(1), d(2), r};and those transmitted by r will be received by a random subset of {d(1), d(2)}. Interference is avoided by allowing at most one of {s, r} to transmit in each time slot. One example of this model is any cellular network that supports two cell-edge users when a relay in the middle uses the same downlink resources for throughput/safety enhancement. In this setting, we study the capacity region of (R-1, R-2) when allowing linear network coding (LNC). The proposed LNC inner bound introduces more advanced packing-mixing operations other than the previously well-known butterfly-style XOR operation on overheard packets of two co-existing flows. A new LNC outer bound is derived by exploring the inherent algebraic structure of the LNC problem. Numerical results show that, with more than 85% of the experiments, the relative sum-rate gap between the proposed outer and inner bounds is smaller than 0.08%, thus effectively bracketing the LNC capacity of the smart repeater problem.
This work studies the benefits of using opportunistic routing, implicit acknowledgments, and network coding on a linear broadcast packet network. Nodes are arranged in a line, and the first node wishes to communicate ...
详细信息
ISBN:
(纸本)9781509024827
This work studies the benefits of using opportunistic routing, implicit acknowledgments, and network coding on a linear broadcast packet network. Nodes are arranged in a line, and the first node wishes to communicate with the end node. When node i transmits, it is received at node j with a probability Pi, j. Several communication protocols are proposed and their performance studied using the mean and variance of the completion time as metrics. The protocols studied use end-to-end coding and link-by-link retransmission with network coding both with and without opportunistic routing. Simulation and analytical results are presented. The link-by-link protocols significantly outperform end-to-end coding using both metrics, especially when the packet loss probability is high. Opportunistic routing shows a mixed benefit over link-by-link protocols without it. When using opportunistic routing, the variance of the completion time is higher, and the mean is either similar or lower, depending on the channel conditions. When the loss probabilities are higher, opportunistic routing shows little benefit, whereas with a lower probability of packet loss, opportunistic routing shows a significant reduction in mean completion time.
This paper proposes an underwater environment acoustic signal detection scheme employing dual-loop adaptive noise canceling (ANC) based on analog network coding. For example, the proposed scheme can detect underwater ...
详细信息
ISBN:
(纸本)9784885523090
This paper proposes an underwater environment acoustic signal detection scheme employing dual-loop adaptive noise canceling (ANC) based on analog network coding. For example, the proposed scheme can detect underwater environment acoustic signals in the presence of underwater acoustic communications (UWAC), where the UWAC communicate their information at the same frequency band in order to save frequency resources. The first loop of the proposed scheme adaptively cancels the transmitted signals of the UWAC based on analog network coding. The second loop of the proposed scheme adaptively cancels the received signals of the UWAC by means of the inverse modulated signals of the decisions for the received signals. Finally, computer simulation results confirm that the proposed dual-loop scheme outputs the detected signals of the underwater environment acoustic signals at high signal to noise power ratio (SNR).
All-optical two-way relaying is an advanced techniques that helps to improve the data-rate and throughput of free-space optical (FSO) communication systems. In this paper, we propose to implement all-optical two-way r...
详细信息
ISBN:
(纸本)9781509027118
All-optical two-way relaying is an advanced techniques that helps to improve the data-rate and throughput of free-space optical (FSO) communication systems. In this paper, we propose to implement all-optical two-way relaying in dual-hop FSO systems using network coding. The relay node that is based on optical regenerate-and-forward relaying is equipped with an all-optical XOR gate and optical hard-limiters. Performance of the proposed system is analyzed under the effect of atmospheric turbulence and noise induced by the background light. Based on the closed-form expression for bit-error-rate (BER) derived in this paper, the numerical results demonstrate the feasibility of the proposed systems. In addition, the numerical results provide the useful information for system design such as optimum range of threshold power, required transmitted power, and supportable transmission distance.
The Internet of Things (IoT) is an emerging network that integrates the physical world and cyberspace through wireless technologies. Due to the ever-growing number of connected devices in IoT, the generated data traff...
详细信息
ISBN:
(纸本)9781509028894
The Internet of Things (IoT) is an emerging network that integrates the physical world and cyberspace through wireless technologies. Due to the ever-growing number of connected devices in IoT, the generated data traffic grows exponentially, so do the bad signal-to-noise-ratio and packets collision. For the past decade, such issue is answered with the deployment of rateless erasure code (REC) and network coding (NC), where promising network throughput is obtained with the trade-off in the computational intensive algorithm, namely Gaussian elimination (GE). Many papers, which have attempted to accelerate the computing speed of GE with graphics processing unit (GPU), have neglected the fact that majority of the network traffic are short messages of tens packets in their studies. This paper has found that GPU can further be utilised to decode many messages in parallel, leading to significant speedup. In this paper, we parallelise the GE in terms of XOR row operations, matrix multiplication and bulk decoding of thousand of messages. Our experimental results demonstrated that a speedup of factor of 6 is achievable with the state-of-the-art GPU as compared to XEON E3 CPU.
暂无评论