Showing papers by "Rituparna Chaki published in 2008"
26 Jun 2008
TL;DR: A new honest-rate base collaborative intrusion detection system (HIDS) has been proposed for mobile, ad-hoc networks that uses promiscuous mode of working along with rating and collaborative decision making based on multiple threshold values.
Abstract: In this paper, a new honest-rate base collaborative intrusion detection system (HIDS) has been proposed for mobile, ad-hoc networks. The method uses promiscuous mode of working along with rating and collaborative decision making based on multiple threshold values. All nodes join the network with an initial value of 1 for an honesty rate index, termed as h-rate. The h-rate of a node dynamically increases or decreases depending on its behavior. A node is rewarded when it forwards packets for other nodes. It is penalized when it does some malicious act like dropping packets, etc. The h-rate for a node NX is recomputed based on its current h-rate, and the rewards or penalty points that it has accrued. The proposed rule-based scheme reduces the h-rate of a node gradually, if it behaves abnormally. This provides an inherent mechanism against phantom intrusion detection. The h-rate may also be used for secure routing in MANET.
28 citations
01 Dec 2008
TL;DR: The Ant colony optimization technique has been used in this paper to find the optimum in terms of the shortest route in a MANET to improve the load balancing and congestion control in the network.
Abstract: Designing efficient, cost-effective routing solutions for the infrastructure-less MANETs remains a daunting task till date. A proven optimization technique, the Ant colony optimization has been used in this paper to find the optimum in terms of the shortest route in a MANET. Special attention has been given to the load balancing and congestion control in the network. The simulated performance graphs show an improved congestion control for the proposed routing protocol.
5 citations
26 Jun 2008
TL;DR: A new secure routing protocol, named secure optimal reactive routing protocol (SORRP) for mobile ad-hoc networks, based on ORRP, which endorses security to protect the end-to-end confidentiality, integrity, authenticity and non-repudiation on the shortest route of communication for MANETs.
Abstract: This paper proposes a new secure routing protocol, named secure optimal reactive routing protocol (SORRP) for mobile ad-hoc networks. The work is based on ORRP, reported in one of our earlier works. In spite of being a reactive protocol, SORRP does not use flooding and at the same time finds the optimal path in terms of minimal routing distance. The current work improves ORRP in a two-fold approach. While it removes some of the limitations of the original protocol, the most significant contribution is in incorporating the security mechanism in route detection and data transmission. The SORRP endorses security to protect the end-to-end confidentiality, integrity, authenticity and non-repudiation on the shortest route of communication for MANETs.
5 citations