An Algebraic Watchdog for Wireless Network Coding

Details An Algebraic Watchdog for Wireless Network Coding An Algebraic Watchdog for Wireless Network Coding

2009-01-19

arxiv.org/abs/0901.2913v2

Computer Science

Networking and Internet Architecture

5 pages, 4 figures, submitted to IEEE International Symposium on Information Theory (ISIT) 2009. This is the final version. Th

Scientific paper

In this paper, we propose a scheme, called the "algebraic watchdog" for wireless network coding, in which nodes can detect malicious behaviors probabilistically, police their downstream neighbors locally using overheard messages, and, thus, provide 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. This work is inspired by Marti et. al.'s watchdog-pathrater, which attempts to detect and mitigate the effects of routing misbehavior. As the first building block of a such system, we 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 addition, we present an algebraic analysis of the performance using an hypothesis testing framework, that provides exact formulae for probabilities of false detection and misdetection.

Affiliated with

Also associated with

No associations

Rating

An Algebraic Watchdog for Wireless Network Coding does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Algebraic Watchdog for Wireless Network Coding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Algebraic Watchdog for Wireless Network Coding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-567110