Rituparna Chaki

Bio: Rituparna Chaki is an academic researcher from University of Calcutta. The author has contributed to research in topics: Routing protocol & Wireless sensor network. The author has an hindex of 16, co-authored 131 publications receiving 1514 citations. Previous affiliations of Rituparna Chaki include Calcutta Institute of Engineering and Management & Information Technology University.

MALBACO - a new Multi-Agent Load Balanced Ant Colony Optimization algorithm for MANETs

Abstract: Mobile ad hoc networks do not have any fixed topology. Routing in such network is very challenging and difficult due to the mobility of the nodes. Ant colony optimization is an efficient optimization technique used to find the optimum shortest route in the adhoc network. This paper describes a new routing algorithm for MANETs using Ant Colony Optimization technique. Special attention has been given to the load balancing and congestion control in network. Simulation work is presently being undertaken to evaluate the performance of the model.

Application of Data mining in Protein sequence Classification

Abstract: Protein sequence classification involves feature selection for accurate classification. Popular protein sequence classification techniques involve extraction of specific features from the sequences. Researchers apply some well-known classification techniques like neural networks, Genetic algorithm, Fuzzy ARTMAP,Rough Set Classifier etc for accurate classification. This paper presents a review is with three different classification models such as neural network model, fuzzy ARTMAP model and Rough set classifier model. This is followed by a new technique for classifying protein sequences. The proposed model is typically implemented with an own designed tool and tries to reduce the computational overheads encountered by earlier approaches and increase the accuracy of classification

State of the art analysis of network traffic anomaly detection

Abstract: In the present age of pervasive computing, network anomaly detection has become an essential research area. The idea behind anomaly detection originated from the perspective of network monitoring and security As more and more people and devices get connected over the net, the need for security of information being exchanged increases.. In network monitoring, the monitoring device observes such network features like flow and capacity of a link in network, number and size of distinct flows. Where as in network security the monitoring node monitors the anomalous behavior of the nodes. In this paper we present a review of some of the existing research works on anomaly detection.

A New Scalable Topology for Multihop Optical Networks

Abstract: A new scalable logical topology for multihop optical networks has been presented in this paper based on de-Bruijn graph. The de-Bruijn graph having simple routing property is a regular non-scalable logical topology having diameter to be of logarithmic value of number of nodes. The proposed topology adds the advantage of scalability over those in de-Bruijn graph, keeping perturbation in the network to a very low level during insertion of nodes, at the cost of marginal variance in degree of the network.

Handling Write Lock Assignment in Cloud Computing Environment

Abstract: Cloud Computing is a newly developed technology for complex system with large scale resource, information, software sharing with the help of agents. The persisting problem is in the assignment of data locks to the users in case of conflicts. This paper deals with a technique of handling data locks by providing a novel architecture lest a conflict occurs between the users. The architecture uses multiple agents including mobile agents and fixed agent. The proposed scheme enhances the speed of write lock assignment in the SaaAS (Software as an Agent Service) Environment quite efficiently with the help of passing few messages. It also takes a glance into the portability and interoperability of agents in a Cloud computing environment.

PORs: Proofs of Retrievability for Large Files

Abstract: In this paper, we define and explore proofs of retrievability (PORs). A POR scheme enables an archive or back-up service (prover) to produce a concise proof that a user (verifier) can retrieve a target file F, that is, that the archive retains and reliably transmits file data sufficient for the user to recover F in its entirety.A POR may be viewed as a kind of cryptographic proof of knowledge (POK), but one specially designed to handle a large file (or bitstring) F. We explore POR protocols here in which the communication costs, number of memory accesses for the prover, and storage requirements of the user (verifier) are small parameters essentially independent of the length of F. In addition to proposing new, practical POR constructions, we explore implementation considerations and optimizations that bear on previously explored, related schemes.In a POR, unlike a POK, neither the prover nor the verifier need actually have knowledge of F. PORs give rise to a new and unusual security definition whose formulation is another contribution of our work.We view PORs as an important tool for semi-trusted online archives. Existing cryptographic techniques help users ensure the privacy and integrity of files they retrieve. It is also natural, however, for users to want to verify that archives do not delete or modify files prior to retrieval. The goal of a POR is to accomplish these checks without users having to download the files themselves. A POR can also provide quality-of-service guarantees, i.e., show that a file is retrievable within a certain time bound.