Algebraic Watchdog: Mitigating Misbehavior in Wireless Network Coding

We propose a secure scheme for wireless network coding, called the algebraic watchdog. By enabling nodes to detect malicious behaviors probabilistically and use overheard messages to police their downstream neighbors locally, the algebraic watchdog delivers a secure global self-checking network. Unl...

Full description

Bibliographic Details
Main Authors: Kim, MinJi (Contributor), Medard, Muriel (Contributor), Barros, Joao (Author)
Other Authors: Massachusetts Institute of Technology. Research Laboratory of Electronics (Contributor)
Format: Article
Language:English
Published: Institute of Electrical and Electronics Engineers (IEEE), 2012-09-27T19:42:12Z.
Subjects:
Online Access:Get fulltext
LEADER 02834 am a22002533u 4500
001 73449
042 |a dc 
100 1 0 |a Kim, MinJi  |e author 
100 1 0 |a Massachusetts Institute of Technology. Research Laboratory of Electronics  |e contributor 
100 1 0 |a Kim, MinJi  |e contributor 
100 1 0 |a Medard, Muriel  |e contributor 
700 1 0 |a Medard, Muriel  |e author 
700 1 0 |a Barros, Joao  |e author 
245 0 0 |a Algebraic Watchdog: Mitigating Misbehavior in Wireless Network Coding 
260 |b Institute of Electrical and Electronics Engineers (IEEE),   |c 2012-09-27T19:42:12Z. 
856 |z Get fulltext  |u http://hdl.handle.net/1721.1/73449 
520 |a We propose a secure scheme for wireless network coding, called the algebraic watchdog. By enabling nodes to detect malicious behaviors probabilistically and use overheard messages to police their downstream neighbors locally, the algebraic watchdog delivers a secure global self-checking network. Unlike traditional Byzantine detection protocols which are receiver-based, this protocol gives the senders an active role in checking the node downstream. The key idea is inspired by Marti et al.'s watchdog-pathrater, which attempts to detect and mitigate the effects of routing misbehavior. We first focus on a two-hop network. We present a graphical model to understand the inference process nodes execute to police their downstream neighbors; as well as to compute, analyze, and approximate the probabilities of misdetection and false detection. We also present an algebraic analysis of the performance using an hypothesis testing framework that provides exact formulae for probabilities of false detection and misdetection. We then extend the algebraic watchdog to a more general network setting, and propose a protocol in which we can establish trust in coded systems in a distributed manner. We develop a graphical model to detect the presence of an adversarial node downstream within a general multi-hop network. The structure of the graphical model (a trellis) lends itself to well-known algorithms (e.g. the Viterbi algorithm) which can compute the probabilities of misdetection and false detection. We show that as long as the min-cut is not dominated by the adversaries, upstream nodes can monitor downstream neighbors and allow reliable communication with certain probability. Finally, we present simulation results that support our analysis. 
520 |a MIT-Portugal Program (Award 014098-153) 
520 |a Bae Systems National Security Solutions Inc. (Subcontract 069145) 
520 |a NBC Universal Television (Award 018955-001) 
520 |a United States. Defense Advanced Research Projects Agency (Space and Naval Warfare Systems Center San Diego (U.S.) Contract 000151) 
546 |a en_US 
655 7 |a Article 
773 |t IEEE Journal on Selected Areas in Communications