Name
Abstract | ||
|---|---|---|
AbstractAbstractThe 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 thenetwork.This figure is an example that shows the concept of network coding in butterfly network where S1 and S2 are sources, d1 and d2 are destinations, r1 and r2 are relays. A and B are packets that are transmitted to both of d1 and d2. When the traditional forwarding is used the number of transmissions is 4. However, by using network coding in relay nodes, the number of transmissions is reduced to 3. View Figure |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1002/ett.3974 | Periodicals |
DocType | Volume | Issue |
Journal | 31 | 7 |
ISSN | Citations | PageRank |
2161-3915 | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Behnaz Maboudi | 1 | 0 | 0.34 |
| Peyman Pahlevani | 2 | 62 | 6.98 |