2,525 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
Trust-based security for the OLSR routing protocol
International audienceThe trust is always present implicitly in the protocols based on cooperation, in particular, between the entities involved in routing operations in Ad hoc networks. Indeed, as the wireless range of such nodes is limited, the nodes mutually cooperate with their neighbors in order to extend the remote nodes and the entire network. In our work, we are interested by trust as security solution for OLSR protocol. This approach fits particularly with characteristics of ad hoc networks. Moreover, the explicit trust management allows entities to reason with and about trust, and to take decisions regarding other entities. In this paper, we detail the techniques and the contributions in trust-based security in OLSR. We present trust-based analysis of the OLSR protocol using trust specification language, and we show how trust-based reasoning can allow each node to evaluate the behavior of the other nodes. After the detection of misbehaving nodes, we propose solutions of prevention and countermeasures to resolve the situations of inconsistency, and counter the malicious nodes. We demonstrate the effectiveness of our solution taking different simulated attacks scenarios. Our approach brings few modifications and is still compatible with the bare OLSR
Improving the Performance of Mobile Ad Hoc Network Using a Combined Credit Risk and Collaborative Watchdog Method
In mobile ad hoc networks nodes can move freely and link node failures occur frequently This leads to frequent network partitions which may significantly degrade the performance of data access in ad hoc networks When the network partition occurs mobile nodes in one network are not able to access data hosted by nodes in other networks In mobile ad hoc network some nodes may selfishly decide only to cooperate partially or not at all with other nodes These selfish nodes could then reduce the overall data accessibility in the network In this work the impact of selfish nodes in a mobile ad hoc network from the perspective of replica allocation is examined We term this selfish replica allocation A combined credit risk method collaborative watchdog is proposed to detect the selfish node and also apply the SCF tree based replica allocation method to handle the selfish replica allocation appropriately The proposed method improves the data accessibility reduces communication cost and average query delay and also to reduce the detection time and to improve the accuracy of watchdogs in the collaborative metho
Resilient networking in wireless sensor networks
This report deals with security in wireless sensor networks (WSNs),
especially in network layer. Multiple secure routing protocols have been
proposed in the literature. However, they often use the cryptography to secure
routing functionalities. The cryptography alone is not enough to defend against
multiple attacks due to the node compromise. Therefore, we need more
algorithmic solutions. In this report, we focus on the behavior of routing
protocols to determine which properties make them more resilient to attacks.
Our aim is to find some answers to the following questions. Are there any
existing protocols, not designed initially for security, but which already
contain some inherently resilient properties against attacks under which some
portion of the network nodes is compromised? If yes, which specific behaviors
are making these protocols more resilient? We propose in this report an
overview of security strategies for WSNs in general, including existing attacks
and defensive measures. In this report we focus at the network layer in
particular, and an analysis of the behavior of four particular routing
protocols is provided to determine their inherent resiliency to insider
attacks. The protocols considered are: Dynamic Source Routing (DSR),
Gradient-Based Routing (GBR), Greedy Forwarding (GF) and Random Walk Routing
(RWR)
- …