Algebraic Watchdog: Mitigating Misbehavior in Wireless Network Coding
MinJi Kim, Muriel Medard, Joao Barros

TL;DR
The paper introduces the algebraic watchdog, a novel scheme for wireless network coding that enables nodes to probabilistically detect malicious behavior and ensure secure, self-checking communication in multi-hop networks.
Contribution
It presents a new proactive detection protocol for wireless network coding that uses algebraic and graphical models to identify adversarial nodes and improve network security.
Findings
Probabilistic detection of malicious nodes is effective in two-hop and multi-hop networks.
Graphical models and algorithms like Viterbi can compute detection probabilities.
Simulation results confirm the analytical performance predictions.
Abstract
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. As an initial building block of a such system, 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. In…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
