PANDA: A protocol-assisted network decoding algorithm

Claudio Greco (1, 2, 3) , Michel Kieffer (1) , Cédric Adjih (3) , Beatrice Pesquet-Popescu (2)

1 L2S - Laboratoire des signaux et systèmes
2 LTCI - Laboratoire Traitement et Communication de l'Information
3 HIPERCOM2 - High PERformance COMmunications

With random linear network coding, mixed packets contain in their headers information about the coding operations performed on the original packets to allow their recovery by the receiver. This introduces an overhead that could be significant if the packet size is relatively small w.r.t. the size of the generation. In this paper, we propose to remove the part of the added header related to the network coding coefficients and to consider network decoding as a source separation problem. This problem is addressed using a maximum a posteriori estimation technique. It exploits some a priori information related to the content of the headers added to the original packets by the upper layers of the protocol stack, before network coding. Experiments show that, despite the fact that traditional source separation techniques are completely inadequate to handle this scenario, the proposed approach is able to recover all packets within streams of thousands of generations without a single decoding error

Domains: Mathematics [math]; Information Theory [math.IT]; Computer Science [cs]; Information Theory [cs.IT]

Claudio Greco, Michel Kieffer, Cédric Adjih, Beatrice Pesquet-Popescu. PANDA: A protocol-assisted network decoding algorithm. NetCod 2014, Jun 2014, Aalborg, Denmark. pp.1-6, ⟨10.1109/NETCOD.2014.6892124⟩. ⟨hal-01073686⟩