Next Article in Journal
An Anti-Collision Algorithm for RFID Based on an Array and Encoding Scheme
Next Article in Special Issue
Random Linear Network Coding for 5G Mobile Video Delivery
Previous Article in Journal
Online Learning of Discriminative Correlation Filter Bank for Visual Tracking
Previous Article in Special Issue
Efficient Delivery of Scalable Video Using a Streaming Class Model
Article Menu

Export Article

Open AccessArticle
Information 2018, 9(3), 62;

On the Performance of the Cache Coding Protocol

Institute for Advanced Studies in Basic Sciences (IASBS), Zanjan 45195, Iran
Department of Engineering, Aarhus University, 8000 Aarhus, Denmark
Author to whom correspondence should be addressed.
Received: 1 February 2018 / Revised: 7 March 2018 / Accepted: 8 March 2018 / Published: 10 March 2018
(This article belongs to the Special Issue Network and Rateless Coding for Video Streaming)
Full-Text   |   PDF [1768 KB, uploaded 12 March 2018]   |  


Network coding approaches typically consider an unrestricted recoding of coded packets in the relay nodes to increase performance. However, this can expose the system to pollution attacks that cannot be detected during transmission, until the receivers attempt to recover the data. To prevent these attacks while allowing for the benefits of coding in mesh networks, the cache coding protocol was proposed. This protocol only allows recoding at the relays when the relay has received enough coded packets to decode an entire generation of packets. At that point, the relay node recodes and signs the recoded packets with its own private key, allowing the system to detect and minimize the effect of pollution attacks and making the relays accountable for changes on the data. This paper analyzes the delay performance of cache coding to understand the security-performance trade-off of this scheme. We introduce an analytical model for the case of two relays in an erasure channel relying on an absorbing Markov chain and an approximate model to estimate the performance in terms of the number of transmissions before successfully decoding at the receiver. We confirm our analysis using simulation results. We show that cache coding can overcome the security issues of unrestricted recoding with only a moderate decrease in system performance. View Full-Text
Keywords: cache coding; source coding; absorbing Markov chain cache coding; source coding; absorbing Markov chain

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Share & Cite This Article

MDPI and ACS Style

Maboudi, B.; Sehat, H.; Pahlevani, P.; Lucani, D.E. On the Performance of the Cache Coding Protocol. Information 2018, 9, 62.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Information EISSN 2078-2489 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top