Robust Network Coding in the Presence of Untrusted Nodes
From MaRDI portal
Publication:5281307
DOI10.1109/TIT.2010.2054650zbMATH Open1366.94039arXiv0811.3475OpenAlexW2164881538WikidataQ59767715 ScholiaQ59767715MaRDI QIDQ5281307FDOQ5281307
Authors: Da Wang, Danilo Silva, Frank R. Kschischang 
Publication date: 27 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
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, we propose a family of networks 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.
Full work available at URL: https://arxiv.org/abs/0811.3475
This page was built for publication: Robust Network Coding in the Presence of Untrusted Nodes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281307)
