On the Performance of the Cache Coding Protocol
How to cite: Maboudi, B..; Sehat, H..; Pahlevani, P..; Lucani, D.E.. On the Performance of the Cache Coding Protocol. Preprints 2018, 2018020009 (doi: 10.20944/preprints201802.0009.v1). Maboudi, B..; Sehat, H..; Pahlevani, P..; Lucani, D.E.. On the Performance of the Cache Coding Protocol. Preprints 2018, 2018020009 (doi: 10.20944/preprints201802.0009.v1).
in the relay nodes for increased 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
was proposed. This protocol only allows recoding at the relays when the relay has received enough
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 for the system to detect and minimize the
effect of pollution attacks and make 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 a 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 security issues of unrestricted
recoding with only a moderate decrease in system performance.
Copyright: 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.
Readers' Comments and Ratings (0)Leave a public comment
Send a private comment to the author(s)
Rate this article