JPIET

Meerut, India
Meerut, India

Time filter

Source Type

Bijalwan D.C.,Tehri Garhwal | Aggarwal A.,JPIET
Proceedings of 2014 3rd International Conference on Parallel, Distributed and Grid Computing, PDGC 2014 | Year: 2014

In recent year's availability of economical image capturing devices in low cost products like mobile phones has led a significant attention of researchers to the problem of recognizing text in images. Recognition of scene text is a challenging problem compared to the recognition of printed documents. In this work a novel approach is proposed to recognize text in complex background natural scene, word formation from recognized text, spelling checking and word translation into user defined language and finally overlay translated word onto the image. The proposed approach is robust to different kinds of text appearances, including font size, font style, color, and background. Combining the respective strengths of different complementary techniques and overcoming their shortcomings, the proposed method uses efficient character detection and localization technique and multiclass classifier to recognize the text accurately. The proposed approach successfully recognizes text on natural scene images and does not depend on a particular alphabet, text background. It works with a wide variety in size of characters and can handle up to 20 degree skewness efficiently. © 2014 IEEE.


Basavala S.R.,CMJ University | Agarrwal A.,JPIET
Proceedings of 2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing, PDGC 2012 | Year: 2012

In the recent day's web applications usage is increasing by banking, financial institutes and health or hospital management systems such as online or net banking and mobile banking, e-commerce applications, news feeds, inpatient and outpatient information etc. All these online applications require support for security properties like authentication, authorization, data confidentiality, and sensitive information leakage. The most widely accepted common method of authentication for an online application is to use a combination of alphanumeric with special characters usernames and passwords. Net or online applications should support a strong password (such as a combination of Alphanumeric with special characters). In the past recent studies reveal that the end users today have on an average approximately 10 to 15 passwords to protect their online accounts to do their actual transactions. In general, a common web (internet) user having one password may be easy to remember, but controlling many passwords for different web or internet applications is time-consuming task and a security threat. Usually passwords are not secured at all as they can be guessable or somebody (a malicious user) can be stolen. To overcome this, passwords need to be stronger authentication solutions. © 2012 IEEE.


Goyal M.K.,Sharda University | Aggarwal A.,JPIET | Gupta P.,ABES | Kumar P.,JIIT University
Proceedings of 2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing, PDGC 2012 | Year: 2012

Trust Models are used to enhance secure and reliable scheduling in Distributed, Grid and Cloud environment. Trust models that are being proposed or implemented in Distributed and Grid environment, does not fully fit in cloud computing environment. Since the parameters that have being taken into consideration in these trust models, does not fit in the cloud Infrastructure As A Service, a suitable trust model is proposed based on the existing model that is suitable for trust value management for the cloud IaaS parameters. Based on the above achieved trust values, a scheduling is done for better allocation of resources and further enhance the QOS of services been provided to the users. In this paper, an approach for managing trust in Cloud IaaS is proposed. © 2012 IEEE.


Rathi A.,JPIET | Rathi D.,JPIET | Astya R.,IILM | Nand P.,Galgotias University
International Conference on Computing, Communication and Automation, ICCCA 2015 | Year: 2015

: Biometric systems are the system which have an automated method to measure or analyze biological data, extracting features from the acquired data and comparing it against the templates set in the database. Many authentication schemes involving different biometric system initialized several identification and verification based security methods and this paper discusses the system which provide secure verification to incorporate the method with elliptical curve cryptography that work on following two points i.e. preventing elliptic curve and key using elliptical curve cryptography and blending of biometric modality. The paper also discusses different approaches on multi model biometric system, the level of fusion that are plausible and the integration of strategies that can be adopted to consolidate information. Unimodal biometric system faces many difficulties like spooling, attack, noisy data etc but combination of two or more biometric modalities recognizes anything in a single identification. © 2015 IEEE.


Kumar N.,Thapar University | Tyagi S.,JPIET | Deng D.-J.,National Changhua University of Education
Journal of Network and Computer Applications | Year: 2014

Wireless sensor networks (WSNs) consist of many sensor nodes (SNs) which may be deployed at different geographical locations to perform multiple tasks such as monitoring, data aggregation, and data processing. During all these operations, energy of the SNs continuously depleted which results in the creation of energy holes in some regions. As SNs are battery operated and it is difficult to replace the battery of the SNs each time, so energy conservation is a paramount concern to increase the lifetime of the WSNs. It has been proved in the literature that clustering of SNs can be used for energy saving during various operations in WSNs. Keeping in view of the above issues, in this paper, we propose a new learning automata-based energy efficient heterogeneous selective clustering (LA-EEHSC) scheme for WSNs. Automaton is assumed to be located on each SN with two types of SNs, namely, normal and advanced are considered in the proposed scheme. Based upon the weighted election probability (WEP) of each group of SNs, Cluster Heads (CHs) are selected among the group of SNs by the automaton. Automaton at each SN receives reward or penalty from the environment based upon WEP of different SNs. An efficient learning automata-based energy efficient clustering algorithm is also proposed. Finally, first node die (FND) and last node alive (LNA) are selected as the key parameters for the measurement of lifetime of network field. Using these parameters, we have evaluated the performance of the proposed scheme in different network scenarios in comparison with the well-known existing protocols such as LEACH, LEACH-SC and SEP. The results obtained show that proposed scheme yields 5.89% improvement in lifetime and 21.14% improvement in stability in comparison to LEACH, LEACH-SC, and SEP. © 2014 Elsevier Ltd.


Tyagi S.,JPIET | Tanwar S.,Bharat Institute of Technology | Kumar N.,Thapar University
Proceedings - 2015 2nd IEEE International Conference on Advances in Computing and Communication Engineering, ICACCE 2015 | Year: 2015

Now days Wireless Sensor Networks (WSNs) are very popular due to their uses in potential range of applications. A set of either random or predefined distributed tiny sensor nodes could perform the desired task as per need. A huge list of different parameters is available in the litrature that must required special attention while designing the WSN system. Energy saving of each node is one of the key issue as nodes are battery operated and replacement of battery is almost impossible. Network coverage partially or completely is also required to meet out the quality of sensing information. To address these issues, we propose a new Hybrid Hterrogeneous LEACH (HHE-LEACH) protocol for sensor nodes in WSNs. We have used the concepts of learning automata (LA) for the WSN in which every node has LA. Direct or indirect communication with base station (BS) will depends upon the distance-based thresholds which makes a partition of WSN. During this process, each LA may get a reward or penalty with respect to finite number of actions performed. Performance of the HHE-LEACH is evaluated using extensive simulations by selecting various metrics. The results obtained show that proposed scheme achieved better stability, network lifetime and partial network coverage in comparison to other existing protocols such as DD, LEACH and SEP. © 2015 IEEE.


Tyagi S.,JPIET | Tanwar S.,Bharat Institute of Technology | Kumar N.,Thapar University | Rodrigues J.J.P.C.,Saint Petersburg State University of Information Technologies, Mechanics and Optics
Pervasive and Mobile Computing | Year: 2015

In recent times, Cognitive radio (CR)-based wireless sensor networks (WSNs) have been widely used for opportunistic access of the shared spectrum. In WSNs, deployment of sensor nodes (SN) may be random, or it may follow an optimized approach-based upon the application in which it is to be used. Energy efficient route selection for transferring data from a SN to the base station (BS) is the key issue to increase the lifetime of WSN. Therefore, hierarchical cluster-based data transmission from a SN to BS using multi-hop communication can be one of the effective solutions, as the transmission operation consumes more energy compared to sensing or computation. Several mechanisms have been proposed in the literature for an improvement of network lifetime. Motivated from the above, in this paper, we propose a Distance-Based Multihop Clustering and Routing (DB-MCR) protocol for heterogeneous environment to improve stability, and network lifetime of WSNs. By fixing the node densities, network region is segmented into different subregions with a specific shape. Boundaries of the segmented regions are estimated using the node densities. Segment-wise data transmissions are used for data collection at BS which provides separate bands for the nodes in different regions. A distance-based algorithm is used for election of cluster heads (CH) in which a weighted election probability (WEP) is computed to reduce the interference among the nodes. The performance of the proposed scheme is evaluated using extensive simulations with respect to network lifetime, and stability. The results obtained at initial energy E0=0.25J with BS located at corner show that DB-MCR improves the lifetime by 13% & 17%, and stability by 8% & 16% in comparison to MCR and SEP respectively. © 2015 Elsevier B.V.


Tyagi S.,JPIET | Kumar N.,Thapar University
Journal of Network and Computer Applications | Year: 2013

In recent years, Wireless Sensor Networks (WSNs) have emerged as a new powerful technology used in many applications such as military operations, surveillance system, Intelligent Transport Systems (ITS) etc. These networks consist of many Sensor Nodes (SNs), which are not only used for monitoring but also capturing the required data from the environment. Most of the research proposals on WSNs have been developed keeping in view of minimization of energy during the process of extracting the essential data from the environment where SNs are deployed. The primary reason for this is the fact that the SNs are operated on battery which discharges quickly after each operation. It has been found in literature that clustering is the most common technique used for energy aware routing in WSNs. The most popular protocol for clustering in WSNs is Low Energy Adaptive Clustering Hierarchy (LEACH) which is based on adaptive clustering technique. This paper provides the taxonomy of various clustering and routing techniques in WSNs based upon metrics such as power management, energy management, network lifetime, optimal cluster head selection, multihop data transmission etc. A comprehensive discussion is provided in the text highlighting the relative advantages and disadvantages of many of the prominent proposals in this category which helps the designers to select a particular proposal based upon its merits over the others. © 2012 Elsevier Ltd.


Rajput I.S.,JPIET | Sharma S.K.,JPIET | Aggarwal A.,JPIET | Thapliyal M.P.,Hemwati Nandan Bahuguna Garhwal University
Proceedings of 2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing, PDGC 2012 | Year: 2012

In the information age, the huge amount of data and information are exchanged which requires fast and efficient searching mechanisms for effective use of this information. There are various sequential searching algorithms to search an element in an unsorted array or sorted array of elements. A number of researchers have explored methods for improving the efficiency and speedup of search using parallel hardware, for eg. A 2-D Mesh of Processors can be used to solve various searching problems in O(n1/2) time regardless of any assumption about wire delay. We proposed an algorithm for searching on Hypercube Interconnection network that solves the basic query problem, namely given an integer x, it is required to search a file of records on the s field for x. Proposed algorithm produces a yes or no answer to such a query in O(log n) time. © 2012 IEEE.


Johri T.,JPIET | Johri I.,JPIET
Proceedings of the World Congress on Engineering 2011, WCE 2011 | Year: 2011

A mathematical model is constructed with an aim to assist the design engineers for the making of various structure used in the satellite and aeronautical engineering. In this paper effect of exponential variation in temperature is premeditated on an orthotropic rectangular plate whose thickness varies linearly in both directions. Rayleigh Ritz approach is applied for the solution of the problem. Fundamental frequencies and deflection functions are calculated for first mode of vibration of a clamped plate with diverse values of temperature gradient, taper constants and non-homogeneity constants.

Loading JPIET collaborators
Loading JPIET collaborators