2,574 research outputs found
An Effective Approach for Mobile ad hoc Network via I-Watchdog Protocol
Mobile ad hoc network (MANET) is now days become very famous due to their
fixed infrastructure-less quality and dynamic nature. They contain a large
number of nodes which are connected and communicated to each other in wireless
nature. Mobile ad hoc network is a wireless technology that contains high
mobility of nodes and does not depend on the background administrator for
central authority, because they do not contain any infrastructure. Nodes of the
MANET use radio wave for communication and having limited resources and limited
computational power. The Topology of this network is changing very frequently
because they are distributed in nature and self-configurable. Due to its
wireless nature and lack of any central authority in the background, Mobile ad
hoc networks are always vulnerable to some security issues and performance
issues. The security imposes a huge impact on the performance of any network.
Some of the security issues are black hole attack, flooding, wormhole attack
etc. In this paper, we will discuss issues regarding low performance of
Watchdog protocol used in the MANET and proposed an improved Watchdog
mechanism, which is called by I-Watchdog protocol that overcomes the
limitations of Watchdog protocol and gives high performance in terms of
throughput, delay
An Effective Approach for Mobile ad hoc Network via I-Watchdog Protocol
Mobile ad hoc network (MANET) is now days become very famous due to their fixed infrastructure-less quality and dynamic nature. They contain a large number of nodes which are connected and communicated to each other in wireless nature. Mobile ad hoc network is a wireless technology that contains high mobility of nodes and does not depend on the background administrator for central authority, because they do not contain any infrastructure. Nodes of the MANET use radio wave for communication and having limited resources and limited computational power. The Topology of this network is changing very frequently because they are distributed in nature and self-configurable. Due to its wireless nature and lack of any central authority in the background, Mobile ad hoc networks are always vulnerable to some security issues and performance issues. The security imposes a huge impact on the performance of any network. Some of the security issues are black hole attack, flooding, wormhole attack etc. In this paper, we will discuss issues regarding low performance of Watchdog protocol used in the MANET and proposed an improved Watchdog mechanism, which is called by I-Watchdog protocol that overcomes the limitations of Watchdog protocol and gives high performance in terms of throughput, delay
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. 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
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.
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, such
as the Viterbi algorithm, which can compute the probabilities of misdetection
and false detection. We show analytically that as long as the min-cut is not
dominated by the Byzantine adversaries, upstream nodes can monitor downstream
neighbors and allow reliable communication with certain probability. Finally,
we present simulation results that support our analysis.Comment: 10 pages, 10 figures, Submitted to IEEE Journal on Selected Areas in
Communications (JSAC) "Advances in Military Networking and Communications
- …