for Journals by Title or ISSN
for Articles by Keywords
help
Followed Journals
Journal you Follow: 0
 
Sign Up to follow journals, search in your chosen journals and, optionally, receive Email Alerts when new issues of your Followed Jurnals are published.
Already have an account? Sign In to see the journals you follow.
International Journal of Research in Computer and Communication Technology
   [4 followers]  Follow    
  This is an Open Access Journal Open Access journal
     ISSN (Print) 2320-5156
     Published by Suryansh Publications Homepage  [2 journals]
  • A Efficient QOS based User selection in Secure and Distributed
           Reprogramming Protocol for Wireless Sensor Networks

    • Authors: R. Semparuthi, R. Yuvaraj
      Abstract: A wireless sensor network (WSN) consists of spatially distributed autonomous sensors to monitor physical or environmental conditions. Wireless reprogramming in a wireless sensor network (WSN) is the process of propagating a new code image or relevant commands to sensor nodes. As a WSN is usually deployed in hostile environments, secure reprogramming is and will continue to be a major concern. In SDRP preprocessing phase, Users are selected based on the node categorization algorithm in the current work. This does not provide reliability to the network as the potential of the users are not considered during the user-preprocessing phase. The consequence of selecting users that do not lack the potential to reprogram the other nodes is poor network performance during delivery of data. This might ruin the entire purpose why reprogramming needs to be performed in a WSN. In this paper we propose, The Users need to be selected according to the Quality of Service provided by the nodes. All nodes that try to register as a user will be evaluated based on the QoS parameters like Delivery rate, loss rate and delay rate. Based on the evaluation results, they will be registered as users before giving the reprogramming authorization. Simulation results prove the efficiency of the proposed system.
      PubDate: 2014-05-04
      Issue No: Vol. 3 (2014)
       
  • Mobile Banking Services on Data Protection Analysis In Networking

    • Authors: P. Selvapriyavadhana
      Abstract: Mobile banking operations is one of the popular business application areas. Several applications are developed to support bank focused application such as internet banking and mobile banking applications. In this project it is proposed to develop a mobile banking application using J2ME (Java 2 micro-edition) technology such that java enabled devices can use standalone mobile banking application developed for the bank. Accessing to customer accounts, making transactions and accessing direct debit accounts are takes as important features of the mobile bank application developed. This application also discusses about various other mobile banking technologies other than standalone applications such as IVR (Interactive voice response) technologies and SMS (Short message service) technologies.
      PubDate: 2014-05-04
      Issue No: Vol. 3 (2014)
       
  • Addressing MDX Injection issue in Big Data using ASCII Based String
           Matching

    • Authors: Y Meena Priyadarshini
      Abstract: MDX injection is one of the most threats for application written for Web. Big data is the ability of providing exponential growth and availability of data. Since the data in here are unstructured and therefore normal Query language prevention techniques are not enough for preventing MDX injection attack. Here I proposed a new technique that can address the issue efficiently using ASCII based String Matching algorithm. In this technique Detect Spiteful character, Constraint Validation, Query length validation and Text based Key Generator are the four types of filtration technique used to detect and prevent the Injection Attacks from accessing the database
      PubDate: 2014-05-04
      Issue No: Vol. 3 (2014)
       
  • Dynamic Traffic Congestion Control Scheme in MANET with Cooperative
           Communication

    • Authors: P Deepa, P.S.K Patra
      Abstract: Cooperative communications enables efficient utilization of system communication resources, thereby allowing nodes or terminals participating in a communication network to collaborate with each other during information transmission. Cooperative communication schemes have advantageous in improving node capacity and diversity Cooperative Communication (CC) is a technology that allows multiple nodes to simultaneously transmit the same data. It is also used in improving enhancing power, network connectivity, improving communication reliability and spectrum efficiency. The three basic cooperation protocols in cooperative relaying are decode-and-forward (DF) and compress-and-forward (CF) and amplify-and-forward (AF). But these existing works on cooperative communications are mainly focused on the link level physical layer issues. In this paper a brief analyze is made on Capacity-Optimized Cooperative (COCO) a novel topology scheme to improve the network capacity in MANET by considering both the upper layer network capacity and the physical layer cooperative communications.
      PubDate: 2014-05-04
      Issue No: Vol. 3 (2014)
       
  • Comparative Study of Hand Gesture Recognition Algorithms

    • Authors: Rajesh H, Manjunath A E, Vijaya Kumar B P
      Abstract: Gesture recognition is the technique which is employed for the interaction between human and computer or any auto. In this paper, different types of gesture recognition algorithm is being proposed.  Hand detection and edge detection algorithm that gives, the detection of hand in the given frame. CAMSHIFT algorithm that is applied to locate the mean location of the hand. Relief techniques are used to compare with the hand gestures with the specified vocabulary of predefined gestures.
      PubDate: 2014-05-03
      Issue No: Vol. 3 (2014)
       
  • A Survey on Routing Protocols for Wireless Sensor Networks

    • Authors: Sarah Prithvika, R. Kingsly Stephen, P.S.K Patra
      Abstract: A wireless sensor network is a specialized wireless network consisting of a large number of sensors and at least one base station. The most important difference between the wireless sensor network and the traditional wireless network is that sensors are extremely sensitive to energy consumption. Energy saving is the main issue in designing the wireless sensor network. So it is necessary to design effective and energy aware protocols in order to improve the network lifetime. This paper surveys routing protocols for wireless sensor networks. The three main categories explored in this paper are data-centric, hierarchical and location-based.
      PubDate: 2014-05-03
      Issue No: Vol. 3 (2014)
       
  • Security in Web Application

    • Authors: P Shopa, N Sumitha, P.S.K Patra
      Abstract: Internet services and applications have become a part of daily life, enabling communications from anywhere. To accommodate this increase in applications and data complexity, web services has moved to multi-tiered design wherein the webserver runs the application as the front end logic and data are outsourced to a database. Existing, request from user directly access to main server which connected to database. So there is a possibility of hacking the request also attacks plays a key role in this situation. In order to overcome this drawback, double guard is proposed for the user session across both the front-end logic and back-end database. By monitoring both web and subsequent database request, paved for detecting the attacks that an intrusion detection system would not able to identify. Double guard achieved by using a technique named Light Weight Virtualization, in which a container is maintained for detecting attacks. Here the web container acts as intermediate server between user and main server. Furthermore, technique has been enhanced by not only detecting the attacks also for security purpose.
      PubDate: 2014-05-03
      Issue No: Vol. 3 (2014)
       
  • An Approach to Identify Node Cloness in Wireless Sensor Networks

    • Authors: M Gowthami, Jessy Nirmal.A.G, P.S.K Patra
      Abstract: Sensor nodes that are deployed in hostile environments are susceptible to capture and compromise. An adversary may gain private information from these sensors, clone and logically deploy them in the network to launch a variety of insider attacks. This attack process is generally termed as a clone attack. Currently, the defenses against clone attacks are not only very few, but also suffer from selective interruption of detection and high overhead (computation and memory). In this paper, we propose a new effective and proficient scheme, called SET, to identify such clone attacks. The key idea of SET is to identify clones by computing set operations (intersection and union) of exclusive subsets in the network. First, SET securely forms exclusive unit subsets among one-hop neighbors in the network in a distributed way. This secure subset formation also provides the authentication of nodes’ subset membership. SET then employs a tree structure to compute non overlapped set operations and incorporates interleaved authentication to prevent unauthorized falsification of subset information during forwarding. Randomization is used to further make the exclusive subset and tree formation unpredictable to an adversary
      PubDate: 2014-05-03
      Issue No: Vol. 3 (2014)
       
  • Feedback Driven Load Profile for Software Applications

    • Authors: C Prathiba, S Jayanthi, P.S.K Patra, N.Ezhil Arasu
      Abstract: Running a Preproduction system load testing with a feedback from Production system is a vital for the strength of the Production system against Performance Failures. During Performance Testing Lifecycle in  two important phases we will be getting feedback from the existing production system to make the performance testing lifecycle flexible and responsible for production load / Response time changes.

      PubDate: 2014-05-03
      Issue No: Vol. 3 (2014)
       
  • CLASSIFICATION METHODS IN DATA MINING:A DETAILED SURVEY

    • Authors: Mariammal D, S Jayanthi, P.S.K Patra
      Abstract: Classification is a data mining (machine learning) technique and a model finding process that is used for assigning the data into different classes according to specific constrains. In other words we can say that classification is used to predict group membership for data instances. There are several major kinds of classification algorithms including Genetic algorithm C4.5, Naïve Bayes, SVM, KNN, decision tree, Neural Network and CART. The goal of this survey is to provide a detailed review of two classification techniques and its applications in various emerging fields. This paper also presents the comparison of these techniques that are being widely used.
      PubDate: 2014-05-03
      Issue No: Vol. 3 (2014)
       
  • RECENT ISSUES AND ITS QUICK FIXES FOR VARIOUS DATA REPOSITORIES

    • Authors: Sindhujaa N, Anees M, P.S.K Patra
      Abstract: The aim of this study was to assess the issues and their quick fixes of databases. But the database accuracy has a trickle down effect in most implementations. This paper proposes the overall guidance about the techniques for improving the accuracy in various data repositories. Particularly, the detailed description about each databases and the classic problem associated with each databases are discussed and demonstrated. The paper mainly focus on the recently proposed techniques for each problem which are used to improve the accuracy of the repositories.
      PubDate: 2014-05-03
      Issue No: Vol. 3 (2014)
       
  • Road Crosser Warning Signal System Using Digital Video Image Processing

    • Authors: Supriya T, Selvakumar R.K, P.S.K Patra
      Abstract: Object detection is the fundamental step in video analysis in many applications. Existing motion based methods are limited to detect the moving object when coping with dynamic background and non rigid foreground motion. In this we optimize the object detection and background learning into a single process. This work is on people tracking followed by their face recognition. Face recognition presents a challenging problem in the field of image analysis and computer vision especially when it is dealt with video sequences. Also in this project, we propose a system for identify the road crosser either human or animal through videos, based on shape analysis method. This project helps to prevent the accidents happening in India.
      PubDate: 2014-05-03
      Issue No: Vol. 3 (2014)
       
  • A Secured Load Balanced Clustering Algorithm for Wireless Sensor Network

    • Authors: Anju Sebastian, Kingsly Stephen R., Dr. P.S.K Patra
      Abstract: Wireless sensor networks are composed of large number of power constrained nodes, which needs an energy conservation protocols to reduce the energy consumption as much as possible. Clustering is a standard approach for achieving efficient and scalable performance in wireless sensor networks. Motivated by the former research of clustering algorithm, the objective of this project is to study a Balanced Clustering Algorithm with Distributed Self-Organization for Wireless Sensor Networks (DSBCA), which can deal with stochastic distribution of sensor nodes. The purpose of DSBCA is to generate clusters with more balanced energy and avoid creating clusters with many nodes, since, too many members in a cluster may bring about excessive energy consumption in management and communication. The clusters near the base station also forward the data from further clusters, because all clusters need to communicate with the base station, but long-distance wireless communication consumes more energy. In DSBCA a Cluster Head is selected based on the connection density, residual energy and times of being elected as Cluster Head. Thus this algorithm can enhance the network lifetime.
      PubDate: 2014-05-03
      Issue No: Vol. 3 (2014)
       
  • Performance Comparison of Multi-resolution Wavelet Transforms to Hybrid
           Transforms for Image Compression

    • Authors: Prachi Jayant Natu, H. B. Kekre
      Abstract: This paper proposes multi-resolution based image compression method. Wavelets have ability to analyze the signal at different resolutions to give different levels of details in the image. This property has been used in image compression and performance is compared with hybrid transform and hybrid wavelets generated using respective component transforms. Kekre transform (DKT) is paired with Hartley transform, Discrete Sine Transform and Real Fourier Transform to obtain respective hybrid wavelet transforms. Experiments show that DKT-Real DFT gives better image compression than DKT-Hartley and DKT-DST pair. Performance is evaluated using Root Mean Square Error (RMSE), Mean Absolute Error (MAE) and Average Fractional Change in Pixel Value (AFCPV). It has been observed that hybrid wavelet transform proves better than its multi-resolution analysis and hybrid transform. DKT (32x32) -RealDFT (8x8) hybrid wavelet gives the best performance with lowest values of all error metrics.
      PubDate: 2014-05-02
      Issue No: Vol. 3 (2014)
       
  • Improving QOS Using Virtual Topology Design for OBS Switching Network

    • Authors: Jaslin Sheeja, Dr.K Chitra
      Abstract: In WDM Networks, OPS and OBS provides efficient communications for many internet applications such as high performance scientific computations, video conferencing by combining hundreds of high speed wavelength channels onto a single fibre for parallel transmission.OBS uses control messages for reserving resources and configuring switches which lead to packet loss and delay. In this paper we address the issue like packet loss, delay and network diameter by designing virtual topology for Optical burst switching. We also propose shortest path algorithm to reduce the number of intermediate nodes and to reduce packet loss and delay, P-routing algorithm is implemented.
      PubDate: 2014-05-02
      Issue No: Vol. 3 (2014)
       
  • MULTI BIOMETRIC MODEL FOR AUTHENTICATION METHOD

    • Authors: Rajesh Kanna, Dr.R.K.Selva kumar, Dr.P.S.K Patra
      Abstract: In recent years, biometric authentication has seen considerable improvements in reliability and accuracy,with some biometrics contribute reasonably good overall performance. In biometric based systems for identity verification, static ,(and/or) dynamic biometric measures may be used as personal passwords. However, even the most advanced biometric systems are still facing numerous problems, some inherent to the type of data and some to the methodology itself. Each biometric system must perform four basic tasks i.e. acquisition, feature extraction, matching and decision making. Multimodal systems can significantly improve the recognition and authentication performance in addition to improving population coverage, preventing spoof attacks, increasing the degrees of freedom, and decreasing the failure-to-enroll rate. A Multimodal Biometric Authentication Method is proposed that fuses results from both the RS (Reference Subject) and the user’s biometric data to generate a BioCapsule based on secure fusion and employing Biometric Cryptosystems for authentication. The proposed authentication system uses the face and iris image for authenticating a user to access the system. The proposed multimodal biometric authentication method possesses a number of unique qualities, such a user-centric model, privacy-preserving, identity bearing, revocability, cancellable biometrics, non-intrusive authentication and resilient to attacks. It also supports “one-click sign-on” across systems by fusing the user’s biometrics with a distinct RS on each system. The secure fusion based approach is secure against various attacks and it is formally proved.
      PubDate: 2014-05-02
      Issue No: Vol. 3 (2014)
       
  • Integrated Data Mining Approach For Security Alert System

    • Authors: Saisudha Dorbala, Dr. Rakesh Nayak
      Abstract: The need for automatic detection of deceptive Emails is increasing due to the rapid usage of Email communication in the Internet world. The proposed “Security Alert System” provides a way to identify the future terrorist events and criminal activities. It detects the suspicious Emails indicating future attacks by applying the integrated data mining technique called “Classification based on Predictive Association Rules (CPAR)”. CPAR generates a smaller set of high-quality predictive rules from which best k rules of each class are used to predict the class label of unknown class. This Security Alert System sends an alert Email message to the investigators that helps in analyzing mistrustful Emails and act in time. The CPAR approach achieves a good accuracy for detecting emails containing suspicious content than traditional classification methods. Our experiments show that the accuracy of CPAR is more than the simple associative classifier Apriori.
      PubDate: 2014-05-02
      Issue No: Vol. 3 (2014)
       
  • A Survey of Signcryption Its Type and Techniques

    • Authors: Shailee Namdev, Piyush Singh
      Abstract: Signcryption is a combinational method of performing signatures of the encrypted data so that the data can be made secure and authenticated during the access of the data. Since there are various techniques are implemented for the signcryption of the data, such as identity based signcryption, threshold based signcryption. Here in this paper a complete survey of all such techniques implemented for the signcryption are discussed here such that a new and efficient technique can be implemented in the future having more secure features as compared to the other existing techniques.
      PubDate: 2014-05-02
      Issue No: Vol. 3 (2014)
       
  • Design of Asynchronous Viterbi Decoder using VHDL for Low Power
           Consumption

    • Authors: Gaurav Someshwar Rao Wairagade, Surekha K. Tadse
      Abstract: In today’s digital communication systems, Convolutional codes are widely utilized in channel coding techniques. The Viterbi decoder due to its efficient performance is broadly used for decoding the convolution codes. Developments in the communication field have created a demand for high speed and low power Viterbi decoders with long battery life, low power dissipation and low weight. This paper describes the design of an asynchronous l∕3 rate frequency 5MHz and constraint length K=3 Viterhi decoder using VHDL and power analysis on FPGA
      PubDate: 2014-05-01
      Issue No: Vol. 3 (2014)
       
  • Distributed Streaming Based Decision Tree Learning For Mining Big Data
           Streams

    • Authors: Dinesh P
      Abstract: In this paper distributed streaming based decision tree analyze for mining big data streams in order to enhance the experiences of their users. They need to have systems that are capable of handling big data streams in term of three dimensions: volume as data keeps growing, variety as the type of data is diverse and velocity as there is continuously arriving very fast into the systems. However, most of the existing systems have addressed at most only two out of the three dimensions such as Mahout, a distributed machine learning framework that addresses the volume and Variety dimensions and Massive Online Analysis (MOA), a streaming machine learning framework that handles the variety and velocity dimensions. We propose and develop Scalable Advanced Massive Online Analysis (SAMOA), a distributed streaming based decision tree machine learning framework to address the challenge. SAMOA provides flexible application programming interfaces (APIs) to allow rapid development of new ML algorithms for dealing with variety. Moreover, we integrate SAMOA with Storm, a state-of-the-art stream processing engine (SPE), which allows SAMOA to inherit Storm's scalability to address velocity and volume. We develop a distributed online classification algorithm on parallelism top of SAMOA features.
      PubDate: 2014-05-01
      Issue No: Vol. 3 (2014)
       
  • Efficient and Reliable Transmission Mechanism For Wireless Nodes

    • Authors: Jaya Varughese, Feba Grace George, Nithya Mol Antony
      Abstract: In wireless networks the traffic from the source to the destination which is often routed through a number of nodes are often subject to a number of attacks ,where intermediate nodes claim to transmit packets which were no transmitted .These nodes gain higher preferences or priorities the next time they act as the source. In order to tackle such threats a TP is assigned the task of gathering reports and evaluating whether they are genuine or not. This is accomplished in this paper by certain security techniques (hashing, signatures). The reports size is negligible thus large storage spaces are not required. Cheating nodes once detected are barred from the process of transmission. Reports are collected on a periodic basis  A good transmission scheme should be secure, and require low overhead. However, the existing receipt-based schemes impose significant processing and communication overhead and implementation complexity. Since a trusted party may not be involved in communication sessions, the nodes compose proofs of relaying others’ packets, called receipts, and submit them to an offline accounting centre (AC) to clear the payment. The receipts ‘size is large because they carry security proofs, e.g. Signatures, to secure the payment, which significantly consumes the nodes’ resources and the available bandwidth in submitting them. The AC has to apply a large number of cryptographic operations to verify the receipts, which may require impractical computational power and make the practical implementation of these schemes complex or inefficient. Moreover, since a transaction (relaying packets)value may be very low, the scheme uses micropayment, and thus a transaction’s overhead in terms of submitting and clearing the receipts should be much less than its value. Therefore, reducing the communication and the payment processing overhead is essential for the effective implementation of the payment scheme and to avoid creating a bottleneck at the AC and exhausting the nodes’ resources
      PubDate: 2014-05-01
      Issue No: Vol. 3 (2014)
       
  • A Fast Middleware For Massively Parallel And Distributed Computing

    • Authors: Youssfi Mohamed, Bouattane Omar, Benchara Fatéma Zahra, Bensalah Mohammed Ouadi
      Abstract: In this paper we present the design of a fast middleware for high performance computing on distributed systems. The proposed model allows us to build a polymorphic grid computing assigned to solve fine grained parallel problems over different well known, SIMD (Single Instruction Multiple Data), SPMD (Single Program Multiple Data), MIMD (Multiple Instruction Multiple Data) ) and MPMD (Multiple Program Multiple Data) machine structures. This model is built using dynamic distributed Virtual Processors Elements (VPE). Each physical processing unit is assigned to a node of the considered distributed system. These units may be heterogeneous machines such supercomputers, simple desktop or smart phones etc. The VPEs are designed to communicate with each other by exchanging, in local or remote ports, messages containing data, instructions or any task to be performed. The life cycle of VPEs, the load balancing system and the parallel application to be run, are managed by the VPE Manager which represent the virtual host of this model. At runtime VPEs can migrate from overloaded to under loaded nodes in order to keep the system in a perfect balancing state. The parallel application based in this middleware can be implemented in different languages. In this paper, we present the java implementation. To valid the performance of this Middleware, the paper presents two examples of parallel filtering and segmentation c-means algorithms, using program code and flow sheet
      PubDate: 2014-05-01
      Issue No: Vol. 3 (2014)
       
  • Analyzing Mel Frequency Cepstral Coefficient for Recognition of Isolated
           English Word using DTW Matching

    • Authors: Nitin Goyal, R.K. Purwar
      Abstract: In this paper we proposed Mel-frequency cepstrum coefficients feature extraction and Dynamic Time Warping matching algorithm for speech recognition. Feature vector (Mel-frequency cepstrum coefficients) obtained from speech frame by using Fast Fourier Transform and Discrete Cosine Transform. DTW matching algorithm was applied on feature vector thus obtained by varying number of MFCC coefficients. Clustered database was prepared for template matching.  The effectiveness of varying vector size over matching was considered
      PubDate: 2014-05-01
      Issue No: Vol. 3 (2014)
       
 
 
JournalTOCs
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Email: journaltocs@hw.ac.uk
Tel: +00 44 (0)131 4513762
Fax: +00 44 (0)131 4513327
 
About JournalTOCs
API
Help
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-2014