scispace - formally typeset
Search or ask a question
Author

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.


Papers
More filters
Book ChapterDOI
01 Jan 2012
TL;DR: A new clustering algorithm named HCBQRP: Hierarchical Cluster Based Query-Driven Routing Protocol for Wireless Sensor Networks is presented and the main goal of this routing protocol is to evenly distribute the energy load among the entire sensor nodes in the network.
Abstract: Wireless Sensor Networks require robust wireless communication that are energy efficient and provide low latency. Various routing schemes have been presented in order to improve the life time of these wireless sensor networks and to overcome the energy constraint of sensor nodes. One of the effective schemes is based on clustering of sensor nodes and as well as to improve the network life time, decreases the communication latency and to reduce the energy consumption of whole Wireless Sensor Networks as much as possible. In this paper we include a brief survey of the state-of-the-art of various existing cluster based routing algorithms for sensor networks and present a new clustering algorithm named HCBQRP: Hierarchical Cluster Based Query-Driven Routing Protocol for Wireless Sensor Networks. The main goal of this routing protocol is to evenly distribute the energy load among the entire sensor nodes in the network so that there are no overly utilized sensor nodes that will run out of energy before the others.

8 citations

Proceedings ArticleDOI
23 Jun 2016
TL;DR: Many of the existing biometric techniques like Iris or finger-print recognition are effective only when the person to be authenticated or verified is physically accessible and fall short of the requirements for IoT applications like an integrated remote-healthcare.
Abstract: Authenticating users in a continual manner has become extremely critical for a wide range of applications in the domain of pervasive computing and Internet of Things (IoT). In these days, it’s also an accepted fact that user authentication based on biometric features is often more efficient than the traditional means of password-based authentication. However, many of the existing biometric techniques like Iris or finger-print recognition are effective only when the person to be authenticated or verified is physically accessible. Thus such technologies are good for applications like Passport Control and fall short of the requirements for IoT applications like an integrated remote-healthcare where different types of users like Doctors, patients, hospitals, insurance companies, other care-givers and even authorized civic-body administrators are to be continually authenticated from remote locations. It is important to ensure that the desired services are accessed only by a legitimate user and no one else. In this paper, we address these issues by proposing a modular solution using key-stroke based biometrics.

8 citations

Book ChapterDOI
19 Sep 2019
TL;DR: This work proposes an approach to optimize the timing of traffic light dynamically by using scheduling algorithm to reduce the congestion in various junction points in urban area network by using V2I connectivity system via road side unit (RSU).
Abstract: Nowadays vehicular ad hoc network (VANET) is a promising area of research. One of the aspects of this area is traffic congestion control. Due to the limited capacity of road networks, road traffic congestions are becoming a vital problem in most of the metropolitan cities or large cities throughout the world. That creates the chances of casualties and other types of losses related to time, fuel, finance etc. Congestion also causes a considerable amount of pollution. In this paper, we concentrate on traffic light scheduling in the intersection or junction point of road network for congestion control. We propose an approach to optimize the timing of traffic light dynamically by using scheduling algorithm to reduce the congestion in various junction points in urban area network. The proposed mechanism is used for connected intersection system where every objects and traffic lights will be connected with each other and can share information. We use V2I connectivity system via road side unit (RSU) for our methodology. The Traffic Management controller (TMC) is able to collect the traffic related information of an intersection from RSU. Several researchers worked on this problem. But the performance of the proposed method is simulated and the results show that the proposed method performing better in terms of queue length and the waiting time of vehicle in intersection area with respect to other methodologies.

7 citations

Journal ArticleDOI
TL;DR: Performance of this routing protocol is compared with non-secure routing protocols, secure routing scheme using secret sharing, security routing protocol using ZRP and SEAD depending on basic characteristics of these protocols and shows that RSRP shows better performance in terms of computational cost, end-to-end delay and packet dropping in presence of malicious nodes in the MANET.
Abstract: Abstract In this paper, we propose a novel algorithm RSRP to build a robust secure routing protocol in mobile ad-hoc networks (MANETs). This algorithm is based on some basic schemes such as RSA_CRT for encryption and decryption of messages; CRT for safety key generation, Shamir’s secret sharing principle for generation of secure routes. Those routes which are free from any malicious node and which belong to the set of disjoint routes between a source-destination pair are considered as probable routes. Shamir’s secret sharing principle is applied on those probable routes to obtain secure routes. Finally, most trustworthy and stable route is selected among those secure routes. Selection of the final route depends on some criteria of the nodes present in a route e.g.: battery power, mobility and trust value. In addition, complexity of key generation is reduced to a large extent by using RSA-CRT instead of RSA. In turn, the routing becomes less expensive and most secure and robust one. Performance of this routing protocol is then compared with non-secure routing protocols (AODV and DSR), secure routing scheme using secret sharing, security routing protocol using ZRP and SEAD depending on basic characteristics of these protocols. All such comparisons show that RSRP shows better performance in terms of computational cost, end-to-end delay and packet dropping in presence of malicious nodes in the MANET, keeping the overhead in terms of control packets same as other secure routing protocols.

7 citations

Proceedings ArticleDOI
20 Oct 2003
TL;DR: A new logical topology SBS-net is presented, a scalable barrel shifter network to be used as a logicalTopology over an all-optical network using WDM to improve upon the scalability issue.
Abstract: This paper presents a new logical topology SBS-net, a scalable barrel shifter network to be used as a logical topology over an all-optical network using WDM. The major emphasis of the present work is to improve upon the scalability issue. This SBS-net connects any arbitrary numbers of nodes as opposed to the barrel shifter, de Bruijn graph and Shufflenet. The average hopping distance between two nodes using this topology is smaller compared to that in de Bruijn graph, Shufflenet & GEM net.

7 citations


Cited by
More filters
01 Jan 2003

3,093 citations

Journal ArticleDOI
TL;DR: This paper provides an up-to-date picture of CloudIoT applications in literature, with a focus on their specific research challenges, and identifies open issues and future directions in this field, which it expects to play a leading role in the landscape of the Future Internet.

1,880 citations

Posted Content
TL;DR: This paper defines and explores proofs of retrievability (PORs), a POR scheme that enables an archive or back-up service to produce a concise proof that a user 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.
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.

1,783 citations

Journal ArticleDOI
TL;DR: It is discussed, how blockchain, which is the underlying technology for bitcoin, can be a key enabler to solve many IoT security problems.

1,743 citations

Journal ArticleDOI
TL;DR: Through the extensive survey and sophisticated organization, this work proposes the taxonomy to outline modern IDSs and tries to give a more elaborate image for a comprehensive review.

1,102 citations