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.

Abort-Free STM: A Non-blocking Concurrency Control Approach Using Software Transactional Memory

Abstract: Software transactional memory (STM) is a promising approach for concurrency control in parallel computing environment. The non-blocking progress implementations for STM forces transactions to abort. Although this is primarily done to ensure block-freedom, it may lead to poor system performance. This paper proposes a new Abort-Free STM methodology (AFTM) to achieve abort-free execution so that a group of processes, which are contending for a common set of concurrent objects can commit in finite number of steps. The proposed STM allows wait-free, non-blocking execution of multiple read and write transactions on shared data object without aborting any of the transactions. The important properties of AFTM have been proved towards establishing its advantages.

Congestion Control for IoT Using Channel Trust Based Approach

Abstract: Nowadays in the area of Internet of Things (IoT), congestion control has become an essential research area because of people and devices are progressively get connected over the network. The idea behind congestion control mechanisms originated from the point of network bandwidth, node processing ability, server capacities, channel capacity, flow of the link, number and size of distinct flow and channel reliability. Here we have used the concept of different RED, AMID and COAP based congestion control mechanisms. We have measure two level of congestion control that is node level and channel trustability. In this paper we have presented literature review of some of existing congestion control mechanisms. A congestion control model has also been proposed, which uses the measure of node level congestion and channel-trust for decision making.

Localization based Anti-Void Clustering Approach (LAVCA) for Energy Efficient Routing in Wireless Sensor Network

Abstract: Energy efficient routing is the main challenge of the researchers in the field of wireless sensor network for a long decade Resource constrained sensor nodes demand energy consumption as less as possible Energy efficiency can be achieved by localization and clustering technique Localization is used to find out the location of sensor nodes without the help of GPS and avoids broadcasting of too many messages to save energy Event based clustering approach can reduce data redundancy in order to avoid wastage of energy The proposed approach LAVCA has used both of the techniques in order to diminish energy consumption and increase network lifetime up to a great extent Packet loss has also been reduced by involving an anti-void approach, called rolling ball technique Simulation results show that the energy efficiency has been enhanced with compare to CASER, EEHC and DEEC

Cluster Based Framework for Alleviating Buffer Based Congestion for Wireless Sensor Network

Abstract: In wireless sensor networks, event based applications prone to traffic congestion and unforeseen event detection produce an unremitting generation of traffic throughout the network. The congestion control procedure is used to monitor the process of adapting the total amount of data and concerns to control the network traffic levels to an acceptable value. The performance control mechanism can be conceded through robust congestion control techniques to uphold the operational networks under different conditions. Congestion in sensor networks has to be controlled to achieve high energy efficiency, to prolong the life of the system, improve equity, the quality of service in terms of throughput, packet loss and delay. The information gleaned from an extensive review is shared to reinforce the knowledge base to design a scalable distributed cluster based framework for alleviating buffer based congestion in WSNs and evenly dispense the energy usage among all nodes within the networks. The results show that the proposed technique is simple, efficient and capable of successful dealing with congestion in WSN while preserving the performance characteristics of the network.

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.