Showing papers by "Rituparna Chaki published in 2010"

A new cluster-based wormhole intrusion detection algorithm for mobile ad-hoc networks

Abstract: In multi-hop wireless systems, the need for cooperation among nodes to relay each other's packets exposes them to a wide range of security attacks. A particularly devastating attack is the wormhole attack, where a malicious node records control traffic at one location and tunnels it to another compromised node, possibly far away, which replays it locally. Routing security in ad hoc networks is often equated with strong and feasible node authentication and lightweight cryptography. Unfortunately, the wormhole attack can hardly be defeated by crypto graphical measures, as wormhole attackers do not create separate packets. They simply replay packets already existing on the network, which pass the cryptographic checks. Existing works on wormhole detection have often focused on detection using specialized hardware, such as directional antennas, etc. In this paper, we present a cluster based counter-measure for the wormhole attack, that alleviates these drawbacks and efficiently mitigates the wormhole attack in MANET. Simulation results on MATLab exhibit the effectiveness of the proposed algorithm in detecting wormhole attacks.

BHIDS: a new, cluster based algorithm for black hole IDS

Abstract: Mobile ad hoc networks (MANET) are highly vulnerable to attacks due to multiple factors including the open medium, dynamically changing network topology, cooperative algorithms, and lack of centralized monitoring. Besides slowing down the network, the traditional way of using firewalls and cryptography often fails to detect different types of attacks. The lack of infrastructures in MANETs makes the detection and control of security hazards all the more difficult. In this paper, we present a new, cluster based Black Hole Intrusion Detection System (BHIDS) for mobile, ad hoc networks. The features that are considered for BHIDS include mobility of nodes, variation in number of attacking nodes, packet delivery rate, density of the network, etc. The nodes in the network form a two-layered cluster. This helps splitting the processing and communication overhead between the cluster heads at Layer 1 and 2. The proposed IDS algorithm has been tested on a simulated network using the NS simulator. The performance graphs show marked improvement as far as packet dropping is concerned. Copyright © 2009 John Wiley & Sons, Ltd.

Intrusion detection: Ad-hoc networks to ambient intelligence framework

Abstract: The main advantage of the wireless ad hoc network lies in its ability to perform on a decentralized basis, without any base station However, the absence of centralized control makes it vulnerable to various threats from insiders such as unauthorized attempt to access and/or manipulate information An attacker has the ability to listen to all network traffic, and even make changes causing serious damages to confidentiality In the context of ambient inteligent systems, detection of intrusion is even more important There are numerous sensors, communicating among themselves in an unambiguous manner Attacks such as sleep deprivation, eavesdropping, etc have become all the more dangerous for heavy dependence on ad-hoc wireless communications The timeliness of data delivery is of utmost importance in systems like healthcare Intrusion of any kind may lead to a chaotic condition The focus of research is now on developing full-proof IDS for the AmI systems In this article, a study on the transformation of IDS from the primitive wireless ad hoc network to the ambient intteligent scenario has been presented

WACA: A New Weighted Adaptive Clustering Algorithm for MANET

Abstract: This paper aims towards a critical retrospection of some of the most bugging limitations of cluster formation and cluster head selection. Based on this, a new Weighted Adaptive Clustering Algorithm (WACA) has been proposed. The proposed methodology is aimed at reducing the transmission overhead, total required time and increasing the stability of the formed cluster. WACA can dynamically adapt itself to the frequently changing topology of ad-hoc network.

Systems and methods for determining routes in networks

Abstract: The disclosure describes systems and methods for determining a route in a network. A method according, to one embodiment includes determining a set of neighbor nodes that are within wireless communications range of a current node, determining that a route is needed from a source to a destination node, selecting a first neighbor node that is located closest to the destination node as the next hop in the route, and sending:a route-request message to the first neighbor node. The process continues on a hop-by-hop basis until reaching the destination node, whereupon a route-reply message is sent beck to the source node confirming that the route has been determined.