Paramartha Dutta
VISVA BHARTI UNIVERSITY, Computer Science, Faculty Member
Quantum-Dot Cellular Automata (QCA) is a well accepted for the next generation computer technology as it is capable of overcoming certain technical limitations of existing CMOS technology. We have designed the Gray code counter using... more
Quantum-Dot Cellular Automata (QCA) is a well accepted for the next generation computer technology as it is capable of overcoming certain technical limitations of existing CMOS technology. We have designed the Gray code counter using two-dot one-electron QCA. As the Set-Reset flipflop is the building block of the Gray code counter, we also designed the Set-Reset flipflop. Computing the potential energies we have substantiated and analyzed the proposed design and calculated the energy and power related parameters. We have also compared our work with the four-dot two-electron QCA architecture and found that the proposed designs are superior to the existing ones in terms of space utilization, energy and power dissipation.
Research Interests:
Abstract In mobile ad-hoc networks, traditional multi-path routing techniques elect multiple good paths based on metrics like hop count, delay, or energy consumption, and are not suitable for multipath scenario, especially when the data... more
Abstract In mobile ad-hoc networks, traditional multi-path routing techniques elect multiple good paths based on metrics like hop count, delay, or energy consumption, and are not suitable for multipath scenario, especially when the data transmission is supposed to take place simultaneously through all the selected paths. The present multi-path routing protocol EMR-PL estimates the life of routes depending upon the energy-oriented lifespan and velocity-oriented lifespan of links. Among all the discovered routes, the collection consuming minimum energy and having required lifespan is elected for communication. To the best of authors’ knowledge, the present article is the first one to focus on the single nodemulti-path problem and give solution to it. The data transfer is multi-track that is, all the routes belonging to the selected collection, simultaneously forward data packets. The protocol performance is evaluated in terms of data packet delivery ratio, message cost, average node lifetime, consumed energy and end-to-end delay.
Research Interests:
Mobile ad hoc networks (MANETs) is an infrastructure less network where topology is very dynamic and nodes are energy constrained. Therefore, scheduling for data packets transfer is very important. We can classify all the data packets... more
Mobile ad hoc networks (MANETs) is an infrastructure less network where topology is very dynamic and nodes are energy constrained. Therefore, scheduling for data packets transfer is very important. We can classify all the data packets into two categories — real time and non-real time. Scheduling of non-real time data packets should be different from real time data packet. Here timely delivery is not an important criterion to be met. The main intention here is to reduce the number of route request messages, as much as possible, through the scheduling policy. Therefore, high priorities are given to those packets which are travelling along fragile paths compared to those traveling along the stable paths. Moreover, when a communication session is on the verge of completion, its packets should be forwarded urgently. This scheduling algorithm FSNRP is designed to consider all these factors. The performance improvement it produces is very significant compared to other scheduling protocols.
Research Interests:
Research Interests:
Research Interests:
A mobile ad hoc network is an infrastructure less network where the nodes can move freely in any direction. Since the nodes have limited battery power, energy efficient route discovery mechanisms are critical for proper performance of... more
A mobile ad hoc network is an infrastructure less network where the nodes can move freely in any direction. Since the nodes have limited battery power, energy efficient route discovery mechanisms are critical for proper performance of this kind of networks. Experience-based Energy-efficient Routing Protocol (EXERP) [1] is one such protocol that intelligently addresses this issue and it requires two caches, namely, history cache (H-cache) and packet cache (P-cache). These two caches are dependent upon one another. In this article, we propose a fuzzy controlled cache management (FCM) technique for EXERP in ad hoc networks. Simulation results establish that the proposed scheme achieves a high hit ratio at low complexity than other cache management schemes.
Research Interests:
Mobile ad hoc networks largely suffer from the constraint of battery power. A node continuously senses the information about the network by sending the HELLO packet and receiving the Acknowledgment packet. It consumes huge energy that... more
Mobile ad hoc networks largely suffer from the constraint of battery power. A node continuously senses the information about the network by sending the HELLO packet and receiving the Acknowledgment packet. It consumes huge energy that affects each node based on battery power. This article proposed an optimized HELLO devoid version of the FAIR protocol that intelligently reduces the requirement of continuous HELLO packets, and as a result, provides huge energy preservation that leads to significant performance improvement in terms of energy consumption, lifetime of network, end-to-end delay, and network throughput.
Research Interests:
In civilian data communication using mobile ad hoc networks (MANETs), all mobile nodes cannot be of homogeneous type and these nodes do not do one specific job or communication. Therefore, cooperation among these nodes is a big issue,... more
In civilian data communication using mobile ad hoc networks (MANETs), all mobile nodes cannot be of homogeneous type and these nodes do not do one specific job or communication. Therefore, cooperation among these nodes is a big issue, which is very essential to successfully run a MANET for this type of data communication. Denial of service and malicious behavior of a node are the main obstacles to a secure and successful communication in this type of a network. This scheme proposed a generic idea to avoid and prevent selfish behavior of a node as well as encourage to increase cooperation among nodes by the cluster head using a single-hop clustering strategy.
Research Interests:
Mobile Ad hoc Networks (MANETs) is rapidly gaining popularity due to its infrastructureless and self-configured capabilities. In MANETs, a group of nodes make a network where every node, individually can play sender, receiver or router... more
Mobile Ad hoc Networks (MANETs) is rapidly gaining popularity due to its infrastructureless and self-configured capabilities. In MANETs, a group of nodes make a network where every node, individually can play sender, receiver or router and the communication is either single hop or multi-hops. So, scheduling is an important part to this kind of network for either route discovery or data packet transfer within this network. All scheduling algorithms in MANETs are either packet scheduling in term of QoS or MAC access. Packet scheduling algorithm is more important than MAC access. Packets are also two types, control packet which are used for route establishment and data packet. Scheduling algorithms can be priority based or non-priority based. We can broadly classify the entire scheduling schemes into two types: Non-real-time scheduling or Real-time scheduling. This paper makes a survey of all kind of scheduling algorithms in Mobile Ad hoc Networks in chronological order with classifica...
Research Interests:
The mobile ad hoc network (MANET) is a wireless network based on a group of mobile nodes without any centralised infrastructure. In civilian data communication, all nodes cannot be homogeneous-type and not do a specific data... more
The mobile ad hoc network (MANET) is a wireless network based on a group of mobile nodes without any centralised infrastructure. In civilian data communication, all nodes cannot be homogeneous-type and not do a specific data communication. Therefore, node co-operation and cheat-proof are essential characteristics for successfully running MANETs in civilian data communication. Denial of service and malicious behaviour of the node are the main concerns in securing successful communication in MANETs. This scheme proposed a generic solution to preventing malicious behaviour of the node by the cluster head through the single hop node clustering strategy.
Research Interests:
Research Interests:
This book chapter proposes use of Ant Colony Optimization (ACO), a novel computational intelligence technique for balancing loads of virtual machine in cloud computing. Computational intelligence(CI), includes study of designing... more
This book chapter proposes use of Ant Colony Optimization (ACO), a novel computational intelligence technique for balancing loads of virtual machine in cloud computing. Computational intelligence(CI), includes study of designing bio-inspired artificial agents for finding out probable optimal solution. So the central goal of CI can be said as, basic understanding of the principal, which helps to mimic intelligent behavior from the nature for artifact systems. Basic strands of ACO is to design an intelligent multi-agent systems imputed by the collective behavior of ants. From the perspective of operation research, it's a meta-heuristic. Cloud computing is a one of the emerging technology. It's enables applications to run on virtualized resources over the distributed environment. Despite these still some problems need to be take care, which includes load balancing. The proposed algorithm tries to balance loads and optimize the response time by distributing dynamic workload in t...
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Research Interests:
Abstract. Ad hoc networks are collections of mobile nodes communicating us-ing wireless media without any fixed infrastructure. Existing multicast proto-cols fall short in a harsh ad hoc mobile environment, since node mobility causes... more
Abstract. Ad hoc networks are collections of mobile nodes communicating us-ing wireless media without any fixed infrastructure. Existing multicast proto-cols fall short in a harsh ad hoc mobile environment, since node mobility causes conventional multicast tree to rapidly become ...
Research Interests:
ABSTRACT In the paper, real coded multi objective genetic algorithm (MOGA) based K-clustering method has been studied where K represents the number of clusters known a priori. Proposed method has the capability to deal with continuous and... more
ABSTRACT In the paper, real coded multi objective genetic algorithm (MOGA) based K-clustering method has been studied where K represents the number of clusters known a priori. Proposed method has the capability to deal with continuous and categorical features (mixed features) of data set. Commonly means and modes of features represents clusters for continuous and categorical features respectively. For this reason, K-means and K-modes are most popular clustering algorithm for continuous and categorical features respectively. The searching power of Genetic Algorithm (GA) is exploited to search for suitable clusters and cluster centroids (means or modes) so that intra-cluster distance (Homogeneity, H) and inter-cluster distances (Separation, S) are simultaneously optimized. It is achieved by measuring H and S using a special distance per feature metric, suitable for continuous and categorical features both. We have selected four benchmark data sets from UCI Machine Learning Repository containing continuous and categorical features both. Here, K-means and K-modes is hybridized with GA to combine global searching capabilities of GA with local searching capabilities of K-means and K-modes. Considering context sensitivity, we have used a special crossover operator called “pairwise crossover” and “substitution”.
Research Interests:
Research Interests:
ABSTRACT This paper proposes a weighted (W) k-prototype (KP) Multi Objective Genetic Algorithm (MOGA) (W-KP-MOGA) that can automatically evolve feature weights (based on importance of features in cluster) and clustering solutions. Here we... more
ABSTRACT This paper proposes a weighted (W) k-prototype (KP) Multi Objective Genetic Algorithm (MOGA) (W-KP-MOGA) that can automatically evolve feature weights (based on importance of features in cluster) and clustering solutions. Here we are hybridizing KP with MOGA. Minimization of Homogeneity (H) and maximization of Separation (S) are two measures of optimization. For comparison purpose we have also implemented KP and KP-MOGA. Testing by different real world data set with different clustering validity indices shows the superiority of W-KP-MOGA.
Research Interests:
Research Interests:
Research Interests:
Human emotion reflected in facial expression is generated by coordinated operation of muscular movement of facial tissue which associates with the emotional state of the human subject. Facial expression is one of the most significant... more
Human emotion reflected in facial expression is generated by coordinated operation of muscular movement of facial tissue which associates with the emotional state of the human subject. Facial expression is one of the most significant non-articulated forms of social communication and it is highly adopted by scientific community for the purpose of automated emotion analysis. In the present scope, a triangular structure is induced with three points, viz., circumcenter, incenter, and centroid are considered as the geometric primitive for extraction of relevant features. Information extracted from such features is utilized for the purpose of discrimination of one expression from another using MultiLayer Perceptron (MLP) classifier in images containing facial expressions available in various benchmark databases. Results obtained by applying this method found to be extremely encouraging.
Research Interests:
In company with immense popularity of social network, modern business houses are using it extensively for branding and advertising of their products. One of the preferred media for the advertisement is the animated Graphics Interchanged... more
In company with immense popularity of social network, modern business houses are using it extensively for branding and advertising of their products. One of the preferred media for the advertisement is the animated Graphics Interchanged Format (GIF). The advantage of using GIF is adding emotions in the advertisement which makes a direct impact on the consumers. A novel steganography scheme has been put forwarded here on GIF format for secure message passing. Pixel-Value-Differencing (PVD) has been one of the popular method for steganography implemented mostly on images and videos. In this work, a modified PVD based steganographic blueprint has been brought in where an animated Graphics Interchanged Format (GIF) file is considered as the cover media. Here, an extra hash function has been employed which estimates the number of bits, in contrast to the original PVD, to be concealed in a pair of pixel. The proposed improvement affords to embed an extensive volume of concealed information by maintaining the imperceptibility of human eye. Moreover, the proposed method guarantees more security compared to the original PVD method.
Research Interests:
simplest and commonly used mechanism for broadcasting in ad hoc networks is flooding, where each node transmits every uniquely received message exactly once. Despite its simplicity, it can result in highly redundant retransmission,... more
simplest and commonly used mechanism for broadcasting in ad hoc networks is flooding, where each node transmits every uniquely received message exactly once. Despite its simplicity, it can result in highly redundant retransmission, contention, collision in the network i.e. a phenomenon referred to as the broadcast storm problem. Several probabilistic approaches have been proposed to mitigate this problem. However, majority of these schemes use fixed rebroadcast probability, which is quite unlikely to be optimal. In this article, we propose a fuzzy-controlled rebroadcast probability function, which takes into account network density, maximum hop count, remaining energy of the current node, its rebroadcast responsibility as far as its downlink neighbors are concerned, and its radio-range compared to the minimum and maximum radio-range of the network.
This paper presents a high capacity steganographic approach with secret message validation scheme at the receiver end. The proposed idea develops specifically for animated GIF, the cover media, to conceal secret text messages where Least... more
This paper presents a high capacity steganographic approach with secret message validation scheme at the receiver end. The proposed idea develops specifically for animated GIF, the cover media, to conceal secret text messages where Least Significant Digit (LSD) method is employed to embed secret information in the form of ASCII value. To validate the secret information at the receiver end, the secret text is encoded with Secure Hash Algorithm-1(SHA1) which is subsequently embedded in certain pre-defined portion of the cover media. The proposed algorithm is experimented on a large set of colored animated image sequences by varying text messages which produces satisfactory results. The proposed method also maintains good visual perceptibility while securing high embedding capacity
Research Interests:
In MANETs, the route or path is the sequence of mobile nodes, which data packets pass through, in order to reach the intended destination node of a given source node. Due to the mobility of the nodes, mobile ad hoc networks have... more
In MANETs, the route or path is the sequence of mobile nodes, which data packets pass through, in order to reach the intended destination node of a given source node. Due to the mobility of the nodes, mobile ad hoc networks have inherently dynamic topologies. Therefore the routes are prone to frequent breaks resulting in reduction of throughput of the network compared to wired or cellular networks. Consequently, the route followed by packets to reach the destination varies frequently. This is a crucial factor that affects the performance of the network. The hop count specifies the number of hops on the path between source and destination nodes. The analysis of the hop count in multi-hop networks is very important because it can provide design guidelines for ad hoc networks.
Research Interests:
Among the emerging technologies in the nanotechnology domain, quantum-dot cellular automata (QCA) is an important name. It overcomes the serious technical limitations of CMOS. In this article, we have used two-dimensional 2-dot 1-electron... more
Among the emerging technologies in the nanotechnology domain, quantum-dot cellular automata (QCA) is an important name. It overcomes the serious technical limitations of CMOS. In this article, we have used two-dimensional 2-dot 1-electron QCA cells, a variant of two-dimensional 4-dot 2-electron QCA cells, to design a logically reversible half adder. Potential energies have been computed to substantiate and analyse the proposed design. The issues related to energy and power dissipation have also been discussed. Finally, our proposed architecture using 2-dot 1-electron QCA cells has been compared with the architecture using 4-dot 2-electron QCA cells.
Research Interests:
In mobile ad-hoc networks, nodes have to transmit HELLO or Route Request messages at regular intervals, and all nodes residing within its radio range, reply with an acknowledgment message informing their node identifier, current location... more
In mobile ad-hoc networks, nodes have to transmit HELLO or Route Request messages at regular intervals, and all nodes residing within its radio range, reply with an acknowledgment message informing their node identifier, current location and radio-range. Transmitting these messages consume a significant amount of battery power in nodes, especially when the set of down-link neighbors does not change over time and the radio-range of the sender node is large. The present article focuses on this aspect and tries to reduce the number of HELLO messages in existing state-of-art protocols. Also, it shortens radio-ranges of nodes whenever possible. Simulation results show that the average lifetime of nodes greatly increases in proposed minus HELLO embedded routing protocols along with a great increase in network throughput. Also, the required number of route re-discovery reduces.
Research Interests:
In this article, we present a binary location search based scalable routing protocol (BinLS) for ad hoc networks. It is completely distributed and based on a location management strategy that keeps the overhead of routing packets... more
In this article, we present a binary location search based scalable routing protocol (BinLS) for ad hoc networks. It is completely distributed and based on a location management strategy that keeps the overhead of routing packets significantly small. The network is divided into some equal sized rectangular grid cells. Each node is assigned a home grid cell from where it starts its activity (transmission, reception and forwarding of messages). Nodes residing near the periphery of respective grid cells store information about all nodes present in the cell. Simulation results and detailed mathematical analysis of BinLS emphasize its merit compared to other schemes addressing the issue of scalability in ad hoc networks.
Fuzzy rule base design for image segmentation and subsequent extraction becomes a popular one in the field of image processing. It is important to find visual attention regions with the help of low cost solutions. The aim of image... more
Fuzzy rule base design for image segmentation and subsequent extraction becomes a popular one in the field of image processing. It is important to find visual attention regions with the help of low cost solutions. The aim of image segmentation is the domain-independent partition of the image into a set of regions, which are visually distinct and uniform with respect to some property, such as grey level, texture or colour. The color fundamental process followed by the human brain in perceiving color is a physio-psychological phenomenon that is not yet fully understood, the physical nature of color can be expressed on a formal basis supported by experimental and theoretical results. Basically, the colors we perceive in an object are determined by the nature of the light reflected from the object. Due to the structure of human eye, all colors are seen as variable combinations of the three so-called Primary colors Red, Green and Blue (RGB). Most of the times, acquiring spurious free pre...
Research Interests:
A new emerging state-of-the-art challenging research area has been found in cloud computing. Cloud Computing is an idea, rely on service and delivery, it is distributed over the Internet and governed by appropriate set of protocol. In... more
A new emerging state-of-the-art challenging research area has been found in cloud computing. Cloud Computing is an idea, rely on service and delivery, it is distributed over the Internet and governed by appropriate set of protocol. In last few decades, Internet is growing rapidly as a result cloud computing and also expanded exponentially. Cloud computing is said to provide resoruces such as Software, Platform, and Infrastructure as services, namely, Software as a Service (SaaS), Platform as a Service (PaaS), and Infrastructure as a Service (IaaS). Cloud profaned the infrastructure resources like CPU, bandwidth, and memory to its end users as a part of its IaaS service. To meet the end users’ heterogeneous needs for resources it profaned and unprofane the resources dynamically, with minimal management effort of the service providers over the Internet. Thus, eliminating the need to manage the expensive hardware resources by companies and institutes. However, to satisfy the need for resources of the users on time, Cloud Service Provider (CSP) must have to maintain the Quality of Service (QoS). Service Level Agreement (SLA) is done between the Datacenters and its end users. Minimization of the violation of the SLA ensures better QoS. Research fraternity has proposed that one of the main reasons for violation of SLA is inefficient load balancing approaches in hosts that fail to ensure QoS, without missing the deadline by the distribution of dynamic workload evenly. In this paper, we propose to extend our previous work of simulated annealing-based optimized load balancing [1] by adding VM migration policy from one host to another on the basis of linear regression-based prediction policy for futuristic resource utilization. In our approach, we are going to predict short-time future resource utilization using linear regression based on the history of the previous utilization of resources by each host. We further use it in migration process to predict the overloaded hosts to underloaded ones. Experiments were simulated in CloudAnalyst and the results are quite encouraging and outperform some previous existing strategies of load balancing for ensuring QoS.
Research Interests:
Research Interests:
Computer Science and IEEE
Research Interests:
Research Interests:
Research Interests:
We can classify clustering into two categories. In K Clustering, we know the number of clusters or K. In other category of clustering, K in unknown. In this paper we have considered the first category only. We can broadly classify... more
We can classify clustering into two categories. In K Clustering, we know the number of clusters or K. In other category of clustering, K in unknown. In this paper we have considered the first category only. We can broadly classify features within a data set into continuous and categorical. Here we have considered data set with continuous features only. Clustering can be done by all features or by relevant features only. Researches had commonly used some feature selection techniques to select relevant features for clustering and then did clustering by some clustering algorithm. Here we have used Multi Objective Genetic Algorithm (MOGA) for simultaneous feature selection and clustering. Here, K-means is hybridized with GA. We have used hybridized GA to combine global searching abilities of GA with local searching abilities of K-means. Considering context sensitivity, we have used a special crossover operator called “pairwise crossover” and “substitution”. Elimination of redundant, irr...
In the present scope, new design methodologies for reversible flip flops are proposed and the results are analyzed by the QCADesigner tool. To the best of our knowledge such methodologies are reported for the first time in the literature.... more
In the present scope, new design methodologies for reversible flip flops are proposed and the results are analyzed by the QCADesigner tool. To the best of our knowledge such methodologies are reported for the first time in the literature. In this paper, we provide few formalisms also. The first one is for the system energy derived using Hamiltonian paradigm and provides internal energy of cell electrons. The second formalism provides the minimum energy requirement for execution of a QCA architecture. This procedure reduces wastage of clock energy. Two very interesting parameters are identified playing crucial role in this context: (i) The electron quantum number n which indicates quantum energy level and (ii) intermediate quantum number for an electron lying between 1 and (n-1). It is established that the incident energy frequency is directly proportional to the number of cells and quadratic function of electron quantum number and intermediate quantum number. The dissipated energy frequency is also directly proportional to the product of number of cells and quadratic function of electron quantum number. This paper, reports some remarkable results. The relaxation time is observed being inversely proportional to the product of number of cells in the architecture and quadratic function of quantum number as well as intermediate quantum number. Apart from these, differential frequency is found directly proportional to the number of cells in the architecture and quadratic function of intermediate quantum number. Few major observations are also indicated: (i) There is always a probability of reflection even if the system energy exceeds barrier energy. (ii) On the contrary, there is always a probability of transmission even though system energy is dominated by the barrier energy.