Papers by Matangini Chattopadhyay
Advances in Intelligent Systems and Computing, 2018
Secure routing is an integral part of MANET for protecting the network operations from malicious ... more Secure routing is an integral part of MANET for protecting the network operations from malicious behaviour. However, the dynamic nature of MANET demands some stringent mechanism that can ensure security in routing. We have redefined an existing trust model by forming a 3-dimensional metric in order to deal with the dynamic topology of MANET. In this paper, we have proposed a trust based routing protocol named Enhanced Average Encounter Rate-AODV (EAER-AODV) that employs the trust model based on nodes’ opinion. In EAER-AODV, opinion represents the trust among nodes which is updated frequently according to the protocol specification. Trust based on recommendation is also used to exchange the trust information among nodes. In this protocol, a node selects a routing path according to the trust values of its neighbour nodes. Extensive simulation analysis shows that EAER-AODV can effectively avoid the malicious nodes and nodes having frequent mobility while selecting the routes. It is also shown that EAER-AODV is compared with existing methods to prove its efficacy.
The distributed storage allocation problem is an important optimization problem in reliable distr... more The distributed storage allocation problem is an important optimization problem in reliable distributed storage, which aims to minimize storage cost while maximizing error recovery probability by optimal storage of data in distributed storage nodes. A key characteristics of distributed storage is that data are stored in remote servers across a network. Thus, network resources especially communication links are an expensive and non-trivial resource which should be optimized as well. In this paper, we present a simulation based study of the network characteristics of a distributed storage network in the light of several allocation patterns. By varying the allocation patterns we have demonstrated the interdependence between network bandwidth, defined in terms of link capacity and allocation pattern using network throughput as a metric. Recognizing the importance of network resources as an important cost metric, we intend to solve an optimization problem based on minimizing both the sto...
Classification of text based datasets has many applications in the field of Computer Science. Som... more Classification of text based datasets has many applications in the field of Computer Science. Some of the key application areas include scientific article recommendation, news article tagging, multimedia content search assistance, etc. We are interested in the problem of data placement of text based datasets in a distributed storage system. Distributed data placement entails placing related data together at a local site. Thus, classifying related data from the unrelated ones is a pre-requisite for any such data placement system. Classification of datasets can be accomplished using information provided to the system about the relatedness of a pair of dataset. However, when such information are not available, the relatedness of pairs of dataset need to be inferred from content of the dataset itself. In literature, topic modeling has been used to find similarity between text documents and in classifying these documents according to the similarity between them. We intend to develop a no...
Information and Communication Technology for Sustainable Development, 2019
Student assessment in terms of ‘assignment tracking’ is essentially needed in order to understand... more Student assessment in terms of ‘assignment tracking’ is essentially needed in order to understand students’ cognition level in a learning process. Students are asked to write programs to solve problems, and then, those are evaluated. The traditional offline method of this formative assessment by pen-and-paper mode is time-consuming and tedious. There are many online assessment methodologies too. Android OS-based smartphones becoming so popular are being effectively used in the domain of education. Online formative assessment process for Java programming on android platform is proposed in this paper. The ‘Assignment Tracker’ application is developed and designed using official IDE, Android Studio 3.1. Android OS supports the Dalvik bytecode instead of traditional JVM. So, a client–server architecture is proposed. The students on client side can execute Java programming on their android mobiles and request the server for compiling and execution. A third-party Web server is utilized to build up the connection between client and server. On implementation, the overall system proves fruitful and effective as an advanced formative assessment technique.
International Journal of Cloud Applications and Computing, 2018
A MapReduce design with Cellular Automata (CA) is presented in this research article to facilitat... more A MapReduce design with Cellular Automata (CA) is presented in this research article to facilitate load-reduced independent data processing and cost-efficient physical implementation in heterogeneous Cloud architecture. Equal Length Cellular Automata (ELCA) are considered for the design. This article explores ELCA rules and presents an ELCA based MapReduce design in cloud. New algorithms are presented for i) synthesis, ii) classification of ELCA rules, and iii) ELCA based MapReduce design in Cloud. Shuffling and efficient reduction of data volume are ensured in proposed MapReduce design.
Journal of Computer Networks and Communications, 2016
In wireless communication, wormhole attack is a crucial threat that deteriorates the normal funct... more In wireless communication, wormhole attack is a crucial threat that deteriorates the normal functionality of the network. Invasion of wormholes destroys the network topology completely. However, most of the existing solutions require special hardware or synchronized clock or long processing time to defend against long path wormhole attacks. In this work, we propose a wormhole detection method using range-based topology comparison that exploits the local neighbourhood subgraph. The Round Trip Time (RTT) for each node pair is gathered to generate neighbour information. Then, the network is reconstructed by ordinal Multidimensional Scaling (MDS) followed by a suspicion phase that enlists the suspected wormholes based on the spatial reconstruction. Iterative computation of MDS helps to visualize the topology changes and can localize the potential wormholes. Finally, a verification phase is used to remove falsely accused nodes and identify real adversaries. The novelty of our algorithm i...
Current Bioinformatics, 2017
Journal of Industrial Information Integration, 2017
One time password (OTP) scheme has been suggested as an efficient and simple solution for authent... more One time password (OTP) scheme has been suggested as an efficient and simple solution for authentication in cloud computing. This paper investigates the nature of characteristics polynomials of Equal Length Cellular Automata (ELCA) and its application in OTP generation for authentication in cloud computing. In this work, primitive characteristics polynomial is identified as a crucial criterion for pseudo-randomness of ELCA cycles generated with linear rules. Novel algorithms are also designed for (i) cost effective generation of OTPs, (ii) flexible generation of equally populated OTP sets, and (iii) generation of controllable number of passwords in OTP sets. Application of linear rules in synthesis of OTPs ensures easy implementation using only modular arithmetic, which makes the proposed method truly cost efficient.
2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), 2016
Game-theory based carrier sense multiple access (CSMA) protocols for wireless networks have recen... more Game-theory based carrier sense multiple access (CSMA) protocols for wireless networks have recently emerged as a competitive alternative to classical CSMA based medium access control designs. The advantage of game-theory based approaches lies in the scope of precise mathematical analysis and hence predictable performance compared to approaches based on ad-hoc arguments and heuristics. In this poster, we take up a game-theory based design of wireless contention based medium access control (MAC) and implement it in an indoor IEEE 802.11 wireless testbed with 22 programmable wireless nodes. Our measurements show a remarkably good performance of the design (at the unique Nash equilibrium) in terms of aggregate throughput and short-term fairness vis-a-vis the standard DCF algorithm. To the best of our knowledge, this is the first detailed study of game theory-inspired MAC protocols in a wireless network testbed.
The 8th International Conference on Software, Knowledge, Information Management and Applications (SKIMA 2014), 2014
Mobile Ad-hoc NETwork (MANET) devices are generally powered by battery, and hence are energy cons... more Mobile Ad-hoc NETwork (MANET) devices are generally powered by battery, and hence are energy constrained. In such a scenario, overloading nodes with forwarding data packets from other nodes leads to quick depletion of energy in the nodes and ultimately leading to its death, and hence network partitioning. Thus, in case of MANETs energy metrics like network lifetime, have to be given its due importance. However, the routing protocol must be flexible enough to allow network administrator to switch priorities between energy saving routing and least delay routing. Some papers have been written to cater to this need, like ESAR [19], EEAODR [20] etc. This paper proposes an improvement to the ESAR protocol, by replacing its energy metric with lifetime prediction. This improves the overall efficiency of ESAR protocol, while retaining the flexibility in regards to choosing between energy efficiency and least delay metric. Simulation results have shown improvement in performance in terms of energy efficiency in our proposed protocol.
Lecture Notes in Computer Science, 2013
Selective forwarding or dropping of packets is a serious threat to multi hop communication in a W... more Selective forwarding or dropping of packets is a serious threat to multi hop communication in a Wireless Sensor Network (WSN). There are various schemes to induce cooperation in a WSN to overcome this problem. In this paper, we have introduced a novel adversary model and have proposed an incentive based scheme to inspire cooperation among nodes in a WSN. The scheme has been formally analyzed. The efficacy of the scheme is also established through various simulation experiments.
Lecture Notes in Electrical Engineering, 2009
This chapter illustrates the use of non-cooperative games to optimize the performance of protocol... more This chapter illustrates the use of non-cooperative games to optimize the performance of protocols for contention-prone shared medium access in wireless networks. Specifically, it proposes and analyses a set of new utility functions conforming to a recently proposed generic game-theoretic model of contention control in wireless networks [5]. The functions ensure that the game has a unique non-trivial Nash equilibrium.
2011 2nd International Conference on Wireless Communication, Vehicular Technology, Information Theory and Aerospace & Electronic Systems Technology (Wireless VITAE), 2011
Abstract There are many challenges involving WSN design such as the energy resources optimization... more Abstract There are many challenges involving WSN design such as the energy resources optimization, the robustness and the network coverage. We address here the problem of energy-efficient topology design. A well designed dynamic topology and efficient routing algorithms may allow a large reduction on the energy consumption. As such type of network, the sensors are connected in an ad-hoc manner, without any deterministic way. This paper is concerned with applying standard routing protocols into wireless sensor network by ...
Communications in Computer and Information Science, 2011
The ubiquity of multimedia applications and its sustenance with more traditional data services de... more The ubiquity of multimedia applications and its sustenance with more traditional data services demand a Quality of Service (QoS) differentiation mechanism in telecommunications networks. This paper takes up a novel access method called Idle Sense developed to provide short-term fair high aggregate throughput to wireless stations in an IEEE 802.11 WLAN. We use a game-theoretic interpretation of the algorithm to determine how to incorporate QoS in the game. We show how the parameters in the algorithm may be tuned in order to achieve proportional throughput differentiation at the Nash equilibrium point of the game. Extensive numerical simulations performed for both IEEE 802.11b and 802.11g indicate that the traffic classes are indeed differentiated in terms of throughput.
Protocols, Routing and Management
Abstract Topology management is a key component of network management of wireless sensor networks... more Abstract Topology management is a key component of network management of wireless sensor networks. The primary goal of topology management is to conserve energy while maintaining network connectivity. Topology management consists of knowing the physical connections and logical relationships among the sensors and at the same time creating a subset of nodes actively participating in the network, thus creating less communication and conserving energy in nodes. Networks require constant monitoring in order to ensure ...
Lecture Notes in Computer Science, 2002
Modeling of constraints in Object Oriented Data Model has been the focus of attention of many res... more Modeling of constraints in Object Oriented Data Model has been the focus of attention of many researchers in recent times [1, 2, 8, 13, 14]. In this paper, we attempt to further formalize the constraint model described in [3]. First, necessary extensions of UML meta-model is examined to express the constraint-model of [3]. The motivation behind expressing constraint models in UML is formalization. It is expected that such formalization effort would lead to the development of sound software tools for analysis and synthesis. The second objective is to establish the correspondence between the extended model and a standard Object database model developed by ODMG. This correspondence is established in ODL by extending the standard specified by ODMG. Such formalizations not only shows the expressive power of the model but these correspondences do also enhance the portability of the schema of object oriented databases across different vendors.
Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 2012
Uploads
Papers by Matangini Chattopadhyay