Optimal Repair for Distributed Storage Codes in Vehicular Networks
Yaning Xu, Qiyuan He, Yuan Luo · 2016
Erasure codes are introduced to reduce file downloaded latency for content distribution in vehicle networks. Since node failure happens frequently, naive repair will lead to network traffic (bandwidth) congestion. In this work, we employ a mutual information based approach to improve the minimal repair bandwidth by considering the relative generalized Hamming weight. Compared with naive repair, this approach improves about 30% repair bandwidth. Although the approach is in the form of recovering one single node, it can be extended to any failed nodes. Finally, simulations are conducted to support our results.