Title :
Robust Network Coding in the Presence of Untrusted Nodes
Author :
Wang, Da ; Silva, Danilo ; Kschischang, Frank R.
Abstract :
While network coding can be an efficient means of information dissemination in networks, it is highly susceptible to “pollution attacks,” as the injection of even a single erroneous packet has the potential to corrupt each and every packet received by a given destination. Even when suitable error-control coding is applied, an adversary can, in many interesting practical situations, overwhelm the error-correcting capability of the code. To limit the power of potential adversaries, a broadcast transformation is introduced, in which nodes are limited to just a single (broadcast) transmission per generation. Under this broadcast transformation, the multicast capacity of a network is changed (in general reduced) from the number of edge-disjoint paths between source and sink to the number of internally disjoint paths. Exploiting this fact, a family of networks is proposed whose capacity is largely unaffected by a broadcast transformation. This results in a significant achievable transmission rate for such networks, even in the presence of adversaries.
Keywords :
error correction codes; network coding; broadcast transformation; edge-disjoint paths; error-control coding; information dissemination; pollution attacks; robust network coding; untrusted nodes; Broadcasting; Computational modeling; Computers; Decoding; Delay; Encoding; Error correction codes; Network coding; Pollution; Power generation; Robustness; Routing; Strontium; Switches; Adversarial nodes; JLC networks; broadcast transformation; error correction; multicast capacity; network coding;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2010.2054650