This paper presents a complete framework for content discovery and retrieval in Information-Centric networks. For content discovery, we implement a method similar to our previously developed pull-based BFR [1], which ...
详细信息
ISBN:
(数字)9781728150895
ISBN:
(纸本)9781728150901
This paper presents a complete framework for content discovery and retrieval in Information-Centric networks. For content discovery, we implement a method similar to our previously developed pull-based BFR [1], which uses Bloom filter-based signaling to inform servers about the name prefixes of available requests. For content retrieval, we propose in this paper a feedback-based cooperative protocol implementing network coding-based forwarding. The proposed network coding-based protocol provides a distributed solution to control the multisession codeblock size, i.e., the number of variables that are combined into network coded packets, by setting a capacity constraint on each node and by piggybacking the available capacity as feedback on messages sent to neighbors. The network codes are decided using linear programming. We compare the proposed network coding-based protocol with push-based BFR [2] and pull-based BFR [1]. The results show that the proposed protocol outperforms both push-based BFR and pull-based BFR in terms of content discovery overhead and average content block retrieval delay.
The relays in random linear network coding (RLNC) approach recode and transmit the coded packets to boost the performance against packet loss. However, this can endanger the system to pollution attacks, which can be e...
详细信息
The relays in random linear network coding (RLNC) approach recode and transmit the coded packets to boost the performance against packet loss. However, this can endanger the system to pollution attacks, which can be eliminated by Homomorphic message authentication code (HMAC). Cache coding limits RLNC by coding only the decoded packets in the relays. In the other words, the relay node in cache coding first decodes the coded packets, then recodes and protects them by a MAC-based scheme that allows the next hop to discover the pollution in the network. This study provides analytical models for cache coding and RLNC to compare their communication overhead. First, we approximate the number of transmissions in a network consisting several relays. The approximation models are for the cases of a few and large number of relays. Then, we validate our analysis using simulation results and illustrate that cache coding can eliminate the pollution attack issue of RLNC with only a slight increase in the bandwidth usage when there are no malicious nodes in the network. Moreover, we conclude that it is more beneficial to employ the cache coding approach at the presence of malicious nodes in the network.
In this paper, we propose a network coding (NC) enabled transmission strategy in the User Plane (UP) of mobile backhaul for networks operators. In the proposed method, NC provides robustness against the transport netw...
详细信息
ISBN:
(数字)9783903176317
ISBN:
(纸本)9781665415477
In this paper, we propose a network coding (NC) enabled transmission strategy in the User Plane (UP) of mobile backhaul for networks operators. In the proposed method, NC provides robustness against the transport network failures, so that there will not be any more processing for re-transmission by the User Equipment (UE) in comparison to traditional approaches where re-transmissions are performed by UE applications. Our simulation results indicate that an average 1% loss ratio in the backhaul link creates 59.44% additional total transmission time compared to normal standard GPRS Tunneling Protocol - User Plane (GTP-U) transmission. On the other hand, applying NC at 1% and 2% rates reduces this amount to 52.99% and 56.26% respectively, which is also better than the total transmission time performance of some previously studied dynamic replication schemes as keeping bandwidth utilization at low ratios. Moreover, we also observe a trade-off between total transmission time and NC rate related to expected packet loss ratio such that minimum total transmission time is obtained when NC rate is equal to expected packet loss rate.
In peer-to-peer (P2P) content distribution systems, network coding is known as a helpful method for increasing the content availability, accelerating the download process, and robustness against churn. Originally, den...
详细信息
In peer-to-peer (P2P) content distribution systems, network coding is known as a helpful method for increasing the content availability, accelerating the download process, and robustness against churn. Originally, dense network coding (DNC) has been proposed and theoretically considered as an optimal solution. However, due to its huge computational overhead, it is not viable for real-world systems. Subsequently, sparse, generations, and overlapped generations network coding schemes are proposed as possible alternatives but at reduced performance compared to that provided by the DNC. Further in this article, an improved applicable network coding scheme for P2P content distribution systems referred to therein as Super Generation network coding (SGNC) is proposed. SGNC maximizes the generation size so that it is as close as possible to the optimal size without adding computational overhead. Theoretical analysis and experimental work show that SGNC outperforms classical and all previous coding based schemes for P2P content distribution systems in terms of content availability, download time, overhead, and decodability for all piece scheduling policies.
In this paper we study a class of multishot network codes given by families of nested subspaces (flags) of a vector space F-q(n), being q a prime power and F-q the finite field of q elements. In particular, we focus o...
详细信息
In this paper we study a class of multishot network codes given by families of nested subspaces (flags) of a vector space F-q(n), being q a prime power and F-q the finite field of q elements. In particular, we focus on flag codes having maximum distance (optimum distance flag codes). We explore the existence of these codes from spreads, based on the good properties of the latter ones. For n = 2k, we show that optimum distance full flag codes with the largest size are exactly those that can be constructed from a planar spread. We give a precise construction of them as well as a decoding algorithm. (C) 2020 Elsevier Inc. All rights reserved.
Device-to-device (D2D) communications have shown a huge potential in cellular offloading and become a potential technology in 5G and beyond. In D2D networks, the requested contents by user devices (UDs) can be deliver...
详细信息
Device-to-device (D2D) communications have shown a huge potential in cellular offloading and become a potential technology in 5G and beyond. In D2D networks, the requested contents by user devices (UDs) can be delivered via D2D links, thus offloading the content providers (CPs). In this work, we address the problem of minimizing the delay of delivering content in a decentralized and partially D2D connected network using network coding (NC) and cooperation among the UDs. The proposed optimization framework considers UDs' acquired and missing contents, their limited coverage zones, NC, and content's erasure probability. As such, the completion time for delivering all missing contents to all UDs is minimized. The problem is modeled as a coalition game with cooperative-players wherein the payoff function is derived so that increasing individual payoff results in the desired cooperative behavior. Given the intractability of the formulation, the coalition game is relaxed to a coalition formation game (CFG). A distributed coalition formation algorithm relying on merge-and-split rules is developed for solving the relaxed problem at each transmission. The effectiveness of the proposed solution is validated through computer simulation against existing schemes.
Downlink multiuser network coding (NC) automatic repeat request (ARQ) systems can provide significant throughput improvements over basic ARQ systems. In this paper, we consider the case of two-unicast flows and analyz...
详细信息
Downlink multiuser network coding (NC) automatic repeat request (ARQ) systems can provide significant throughput improvements over basic ARQ systems. In this paper, we consider the case of two-unicast flows and analyze their performance in terms of the effective capacity (EC) under retransmission schemes. We extend the derived EC of NC-ARQ for asymmetric channels where users have different data rates. For NC-ARQ two scenarios at the source are considered to handle the transmission. The EC expression for two-unicast flows using Alamouti space time block coding (STBC) is also derived. We also present a new scheme that combines both NC and STBC and, denoted by NC-STBC-ARQ, Our results show that the new NC-STBC-ARQ improves the EC over basic STBC in the low-to-moderate signal-to-noise ratio (SNR) regime. Besides, the new NC-STBC-ARQ improves the EC compared to basic NC-ARQ for a moderate-to-high SNR regime. (C) 2020 Elsevier Inc. All rights reserved.
Comparison with traditional network routing technology, multi-source network coding allows the routers to encode the received data and has the merits of large throughput, strong robustness and fast speed. In addition,...
详细信息
Comparison with traditional network routing technology, multi-source network coding allows the routers to encode the received data and has the merits of large throughput, strong robustness and fast speed. In addition, certificateless public key cryptosystem (CL-PKC) is both certificate-free and key escrow-free. From now, there is no certificateless signature suitable for multi-source network coding (MSNC-CLS). In view of its wide application in practice, we construct an MSNC-CLS by applying the technique of certificateless signature to the environments of multi-source network coding. In MSNC-CLS, the use of generation can defend the replay attacks and the homomorphism of hash function can simplify the verification process of intermediate nodes. Generation identifier can make the intermediate nodes judge the generation property of message, thus the intermediate nodes can decide whether they encode the message. Analysis shows MSNC-CLS can resist the pollution and forgery attacks;moreover, it has better computation performance than the existing schemes.
Well-known error detection and correction solutions in wireless communications are slow or incur high transmission overhead. Recently, notable solutions like PRAC and DAPRAC, implementing partial packet recovery with ...
详细信息
ISBN:
(纸本)9781728101170
Well-known error detection and correction solutions in wireless communications are slow or incur high transmission overhead. Recently, notable solutions like PRAC and DAPRAC, implementing partial packet recovery with network coding, could address these problems. However, they perform slowly when there are many errors. We propose S-PRAC, a fast scheme for partial packet recovery, particularly designed for very noisy wireless channels. S-PRAC improves on DAPRAC. It divides each packet into segments consisting of a fixed number of small RLNC-encoded symbols, and then attaches a CRC code to each segment and one to each coded packet. Extensive simulations show that SPRAC can detect and correct errors quickly. It also outperforms DAPRAC significantly when the number of errors is high.
Aiming at the problem of poor network performance in complex mobile environments, this paper proposes a concurrent multipath transmission algorithm based on network coding. This algorithm proposes a multipath concurre...
详细信息
ISBN:
(纸本)9781728121840
Aiming at the problem of poor network performance in complex mobile environments, this paper proposes a concurrent multipath transmission algorithm based on network coding. This algorithm proposes a multipath concurrent transmission architecture based on multiple 3G/4G networks. In order to overcome the impact of heterogeneity between links, a transmission mechanism based on network coding is proposed. This mechanism utilizes the redundancy of network coding to reduce the impact of timeout retransmission caused by link loss. In addition, the mechanism utilizes a data scheduling algorithm to achieve the goal of increasing network throughput. The simulation results show that the scheme can effectively improve the throughput of network transmission in a complex mobile environment.
暂无评论