Home
Videos uploaded by user “jpinfotechprojects”
Online Payment System using Steganography and Visual Cryptography
 
02:41
To get this project in ONLINE or through TRAINING Sessions, Contact:JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Pillar, Chennai -83. Landmark: Next to Kotak Mahendra Bank. Pondicherry Office: JP INFOTECH, #45, Kamaraj Salai, Thattanchavady, Puducherry -9. Landmark: Next to VVP Nagar Arch. Mobile: (0) 9952649690 , Email: jpinfotechprojects@gmail.com, web: www.jpinfotech.org Blog: www.jpinfotech.blogspot.com Online Payment System using Steganography and Visual Cryptography A rapid growth in E-Commerce market is seen in recent time throughout the world. With ever increasing popularity of online shopping, Debit or Credit card fraud and personal information security are major concerns for customers, merchants and banks specifically in the case of CNP (Card Not Present). This paper presents a new approach for providing limited information only that is necessary for fund transfer during online shopping thereby safeguarding customer data and increasing customer confidence and preventing identity theft. The method uses combined application of steganography and visual cryptography for this purpose.
Views: 5266 jpinfotechprojects
An Energy Efficient Algrithm Based on LEACH Protocol 2012 IEEE MATLAB
 
04:57
An Energy Efficient Algorithm Based on LEACH Protocol TO GET THIS PROJECT IN ONLINE OR THROUGH TRAINING SESSIONS CONTACT: Chennai Office: JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Pillar, Chennai – 83. Landmark: Next to Kotak Mahendra Bank / Bharath Scans. Landline: (044) - 43012642 / Mobile: (0)9952649690 Pondicherry Office: JP INFOTECH, #45, Kamaraj Salai, Thattanchavady, Puducherry – 9. Landmark: Opp. To Thattanchavady Industrial Estate & Next to VVP Nagar Arch. Landline: (0413) - 4300535 / Mobile: (0)8608600246 / (0)9952649690 Email: jpinfotechprojects@gmail.com, Website: http://www.jpinfotech.org, Blog: http://www.jpinfotech.blogspot.com In this paper, we analyse the effectiveness of LEACH protocol in extending the lifetime for energy-constrained wireless sensor networks. An improved protocol LEACH-R is proposed based on LEACH protocol. LEACH-R improves the selection of cluster-head and proposes to choose relaying node compare to LEACH. Residual energy of the nodes is conisdered during selection of cluster-head, possibility of low-energy nodes being selected as cluster-head is reduced. Based on both residual energy and distance to base station, relaying node is chosen from cluster heads to become the relay node between base station and other cluster-heads. The simulation result suggests LEACH-R protocol could balance network energy consumption and extend the network life cycle more effectively.
Views: 15045 jpinfotechprojects
How to Pay Pondicherry EB Bill Online Payment Step by Step Easy Procedure in Tamil
 
06:58
This Video is about How to make Electricity Board (EB) Consumer bill through Online in Pondicherry as step by step easy procedure explained in Tamil for Puducherry People for EB Bill payment procedure. Bill Payment URL: http://electricity.puducherry.gov.in/notice/ht_sbi.htm Kindly subscribe to JP INFOTECH channel and get more videos updated and support us.
Views: 2708 jpinfotechprojects
Effective Pattern Discovery for Text Mining 2012 IEEE JAVA
 
04:17
Effective Pattern Discovery for Text Mining 2012 IEEE JAVA TO GET THIS PROJECT IN ONLINE OR THROUGH TRAINING SESSIONS CONTACT: Chennai Office: JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Pillar, Chennai – 83. Landmark: Next to Kotak Mahendra Bank / Bharath Scans. Landline: (044) - 43012642 / Mobile: (0)9952649690 Pondicherry Office: JP INFOTECH, #45, Kamaraj Salai, Thattanchavady, Puducherry – 9. Landmark: Opp. To Thattanchavady Industrial Estate & Next to VVP Nagar Arch. Landline: (0413) - 4300535 / Mobile: (0)8608600246 / (0)9952649690 Email: jpinfotechprojects@gmail.com, Website: http://www.jpinfotech.org, Blog: http://www.jpinfotech.blogspot.com Many data mining techniques have been proposed for mining useful patterns in text documents. However, how to effectively use and update discovered patterns is still an open research issue, especially in the domain of text mining. Since most existing text mining methods adopted term-based approaches, they all suffer from the problems of polysemy and synonymy. Over the years, people have often held the hypothesis that pattern (or phrase)-based approaches should perform better than the term-based ones, but many experiments do not support this hypothesis. This paper presents an innovative and effective pattern discovery technique which includes the processes of pattern deploying and pattern evolving, to improve the effectiveness of using and updating discovered patterns for finding relevant and interesting information. Substantial experiments on RCV1 data collection and TREC topics demonstrate that the proposed solution achieves encouraging performance.
Views: 3750 jpinfotechprojects
GPS Location Alarm System in ANDROID
 
04:58
To get this project in ONLINE or through TRAINING Sessions, Contact: JP INFOTECH, 45, KAMARAJ SALAI, THATTANCHAVADY, PUDUCHERRY-9 Landmark: Opposite to Thattanchavady Industrial Estate, Next to VVP Nagar Arch. Mobile: (0) 9952649690 , Email: jpinfotechprojects@gmail.com, web: www.jpinfotech.org Blog: www.jpinfotech.blogspot.com Title: Safety Alarm by Using GPS in Android or Title: GPS Location Alarm System In this project: 1) Track the user Location in Android 2) Record the user location in Android 3) View the user location in Android 4) Can give Safety alarm to your friends, if you struck with any problem
Views: 4719 jpinfotechprojects
Progressive Duplicate Detection
 
09:30
Progressive Duplicate Detection To get this project in ONLINE or through TRAINING Sessions, Contact: JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Pillar, Chennai -83.Landmark: Next to Kotak Mahendra Bank. Pondicherry Office: JP INFOTECH, #45, Kamaraj Salai,Thattanchavady, Puducherry -9.Landmark: Next to VVP Nagar Arch. Mobile: (0) 9952649690, Email: jpinfotechprojects@gmail.com, web: www.jpinfotech.org, Blog: www.jpinfotech.blogspot.com Duplicate detection is the process of identifying multiple representations of same real world entities. Today, duplicate detection methods need to process ever larger datasets in ever shorter time: maintaining the quality of a dataset becomes increasingly difficult. We present two novel, progressive duplicate detection algorithms that significantly increase the efficiency of finding duplicates if the execution time is limited: They maximize the gain of the overall process within the time available by reporting most results much earlier than traditional approaches. Comprehensive experiments show that our progressive algorithms can double the efficiency over time of traditional duplicate detection and significantly improve upon related work.
Views: 3420 jpinfotechprojects
How to Use Tez App and Make Transfer, Receive Money easily (Tamil)
 
19:06
Tez Application by Google is A New Payments App by Google‎ where can easily send, receive, transfer money at Free of cost and earn money using Tez app also possible. Download Tez free from the following links: Tez for Android: https://tez.app.goo.gl/topcta Tez for iOS: https://tez.app.goo.gl/topcta Click the link https://goo.gl/cFcNZ7 and Kindly Subscribe to JP INFOTECH Channel and get more technical updates.
Views: 1485 jpinfotechprojects
MATLAB  Active Visual Segmentation
 
02:31
Active Visual Segmentation TO GET THIS PROJECT IN ONLINE OR THROUGH TRAINING SESSIONS CONTACT: Chennai Office: JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Pillar, Chennai – 83. Landmark: Next to Kotak Mahendra Bank / Bharath Scans. Landline: (044) - 43012642 / Mobile: (0)9952649690 Pondicherry Office: JP INFOTECH, #45, Kamaraj Salai, Thattanchavady, Puducherry – 9. Landmark: Opp. To Thattanchavady Industrial Estate & Next to VVP Nagar Arch. Landline: (0413) - 4300535 / Mobile: (0)8608600246 / (0)9952649690 Email: jpinfotechprojects@gmail.com, Website: http://www.jpinfotech.org, Blog: http://www.jpinfotech.blogspot.com Attention is an integral part of the human visual system and has been widely studied in the visual attention literature. The human eyes fixate at important locations in the scene, and every fixation point lies inside a particular region of arbitrary shape and size, which can either be an entire object or a part of it. Using that fixation point as an identification marker on the object, we propose a method to segment the object of interest by finding the "optimal" closed contour around the fixation point in the polar space, avoiding the perennial problem of scale in the Cartesian space. The proposed segmentation process is carried out in two separate steps: First, all visual cues are combined to generate the probabilistic boundary edge map of the scene; second, in this edge map, the "optimal" closed contour around a given fixation point is found. Having two separate steps also makes it possible to establish a simple feedback between the mid-level cue (regions) and the low-level visual cues (edges). In fact, we propose a segmentation refinement process based on such a feedback process. Finally, our experiments show the promise of the proposed method as an automatic segmentation framework for a general purpose visual system.
Views: 4211 jpinfotechprojects
Defending Against Collaborative Attacks by Malicious Nodes in MANETs
 
06:05
To get this project in ONLINE or through TRAINING Sessions, Contact:JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Pillar, Chennai -83. Landmark: Next to Kotak Mahendra Bank. Pondicherry Office: JP INFOTECH, #45, Kamaraj Salai, Thattanchavady, Puducherry -9. Landmark: Next to VVP Nagar Arch. Mobile: (0) 9952649690 , Email: jpinfotechprojects@gmail.com, web: www.jpinfotech.org Blog: www.jpinfotech.blogspot.com Defending Against Collaborative Attacks by Malicious Nodes in MANETs: A Cooperative Bait Detection Approach in ns2
Views: 936 jpinfotechprojects
Fine-Grained Two-Factor Access Control for Web-Based Cloud Computing Services
 
15:10
Fine-Grained Two-Factor Access Control for Web-Based Cloud Computing Services To get this project in ONLINE or through TRAINING Sessions, Contact: JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Pillar, Chennai -83.Landmark: Next to Kotak Mahendra Bank. Pondicherry Office: JP INFOTECH, #45, Kamaraj Salai,Thattanchavady, Puducherry -9.Landmark: Next to VVP Nagar Arch. Mobile: (0) 9952649690, Email: jpinfotechprojects@gmail.com, web: http://www.jpinfotech.org, Blog: http://www.jpinfotech.blogspot.com In this paper, we introduce a new fine-grained two-factor authentication (2FA) access control system for web-based cloud computing services. Specifically, in our proposed 2FA access control system, an attribute-based access control mechanism is implemented with the necessity of both a user secret key and a lightweight security device. As a user cannot access the system if they do not hold both, the mechanism can enhance the security of the system, especially in those scenarios where many users share the same computer for web-based cloud services. In addition, attribute-based control in the system also enables the cloud server to restrict the access to those users with the same set of attributes while preserving user privacy, i.e., the cloud server only knows that the user fulfills the required predicate, but has no idea on the exact identity of the user. Finally, we also carry out a simulation to demonstrate the practicability of our proposed 2FA system.
Views: 1893 jpinfotechprojects
Query Aware Determinization of Uncertain Objects
 
07:16
Query Aware Determinization of Uncertain Objects To get this project in ONLINE or through TRAINING Sessions, Contact: JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Pillar, Chennai -83.Landmark: Next to Kotak Mahendra Bank. Pondicherry Office: JP INFOTECH, #45, Kamaraj Salai,Thattanchavady, Puducherry -9.Landmark: Next to VVP Nagar Arch. Mobile: (0) 9952649690, Email: jpinfotechprojects@gmail.com, web: www.jpinfotech.org, Blog: www.jpinfotech.blogspot.com This paper considers the problem of determinizing probabilistic data to enable such data to be stored in legacy systems that accept only deterministic input. Probabilistic data may be generated by automated data analysis/enrichment techniques such as entity resolution, information extraction, and speech processing. The legacy system may correspond to pre-existing web applications such as Flickr, Picasa, etc. The goal is to generate a deterministic representation of probabilistic data that optimizes the quality of the end-application built on deterministic data. We explore such a determinization problem in the context of two different data processing tasks—triggers and selection queries. We show that approaches such as thresholding or top-1 selection traditionally used for determinization lead to suboptimal performance for such applications. Instead, we develop a query-aware strategy and show its advantages over existing solutions through a comprehensive empirical evaluation over real and synthetic datasets.
Views: 493 jpinfotechprojects
Fault Node Recovery Algorithm for a Wireless Sensor Network
 
06:24
To get this project in ONLINE or through TRAINING Sessions, Contact: JP INFOTECH, 45, KAMARAJ SALAI, THATTANCHAVADY, PUDUCHERRY-9 Landmark: Opposite to Thattanchavady Industrial Estate, Next to VVP Nagar Arch. Mobile: (0) 9952649690 , Email: jpinfotechprojects@gmail.com, web: www.jpinfotech.org Blog: www.jpinfotech.blogspot.com Fault Node Recovery Algorithm for a Wireless Sensor Network This paper proposes a fault node recovery algorithm to enhance the lifetime of a wireless sensor network when some of the sensor nodes shut down. The algorithm is based on the grade diffusion algorithm combined with the genetic algorithm. The algorithm can result in fewer replacements of sensor nodes and more reused routing paths. In our simulation, the proposed algorithm increases the number of active nodes up to 8.7 times, reduces the rate of data loss by approximately 98.8%, and reduces the rate of energy consumption by approximately 31.1%.
Views: 3458 jpinfotechprojects
On the Node Clone Detection in Wireless Sensor Networks
 
08:00
To get this project in ONLINE or through TRAINING Sessions, Contact: JP INFOTECH, 45, KAMARAJ SALAI, THATTANCHAVADY, PUDUCHERRY-9 Landmark: Opposite to Thattanchavady Industrial Estate, Next to VVP Nagar Arch. Mobile: (0) 9952649690 , Email: jpinfotechprojects@gmail.com, web: www.jpinfotech.org Blog: www.jpinfotech.blogspot.com On the Node Clone Detection in Wireless Sensor Networks Wireless sensor networks are vulnerable to the node clone, and several distributed protocols have been proposed to detect this attack. However, they require too strong assumptions to be practical for large-scale, randomly deployed sensor networks. In this paper, we propose two novel node clone detection protocols with different tradeoffs on network conditions and performance. The first one is based on a distributed hash table (DHT), by which a fully decentralized, key-based caching and checking system is constructed to catch cloned nodes effectively. The protocol performance on efficient storage consumption and high security level is theoretically deducted through a probability model, and the resulting equations, with necessary adjustments for real application, are supported by the simulations. Although the DHT-based protocol incurs similar communication cost as previous approaches, it may be considered a little high for some scenarios. To address this concern, our second distributed detection protocol, named randomly directed exploration, presents good communication performance for dense sensor networks, by a probabilistic directed forwarding technique along with random initial direction and border determination. The simulation results uphold the protocol design and show its efficiency on communication overhead and satisfactory detection probability
Views: 1524 jpinfotechprojects
A Hybrid Cloud Approach for Secure Authorized Deduplication
 
15:35
To get this project in ONLINE or through TRAINING Sessions, Contact:JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Pillar, Chennai -83. Landmark: Next to Kotak Mahendra Bank. Pondicherry Office: JP INFOTECH, #45, Kamaraj Salai, Thattanchavady, Puducherry -9. Landmark: Next to VVP Nagar Arch. Mobile: (0) 9952649690 , Email: jpinfotechprojects@gmail.com, web: www.jpinfotech.org Blog: www.jpinfotech.blogspot.com A Hybrid Cloud Approach for Secure Authorized Deduplication in java
Views: 6541 jpinfotechprojects
Packet-Hiding Methods for Preventing Selective Jamming Attacks 2012 IEEE JAVA
 
13:05
Packet-Hiding Methods for Preventing Selective Jamming Attacks TO GET THIS PROJECT IN ONLINE OR THROUGH TRAINING SESSIONS CONTACT: Chennai Office: JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Pillar, Chennai – 83. Landmark: Next to Kotak Mahendra Bank / Bharath Scans. Landline: (044) - 43012642 / Mobile: (0)9952649690 Pondicherry Office: JP INFOTECH, #45, Kamaraj Salai, Thattanchavady, Puducherry – 9. Landmark: Opp. To Thattanchavady Industrial Estate & Next to VVP Nagar Arch. Landline: (0413) - 4300535 / Mobile: (0)8608600246 / (0)9952649690 Email: jpinfotechprojects@gmail.com, Website: http://www.jpinfotech.org, Blog: http://www.jpinfotech.blogspot.com The open nature of the wireless medium leaves it vulnerable to intentional interference attacks, typically referred to as jamming. This intentional interference with wireless transmissions can be used as a launch pad for mounting Denial-of-Service attacks on wireless networks. Typically, jamming has been addressed under an external threat model. However, adversaries with internal knowledge of protocol specifications and network secrets can launch low-effort jamming attacks that are difficult to detect and counter. In this work, we address the problem of selective jamming attacks in wireless networks. In these attacks, the adversary is active only for a short period of time, selectively targeting messages of high importance. We illustrate the advantages of selective jamming in terms of network performance degradation and adversary effort by presenting two case studies; a selective attack on TCP and one on routing. We show that selective jamming attacks can be launched by performing real-time packet classification at the physical layer. To mitigate these attacks, we develop three schemes that prevent real-time packet classification by combining cryptographic primitives with physical-layer attributes. We analyze the security of our methods and evaluate their computational and communication overhead.
Views: 5108 jpinfotechprojects
Learn to Personalized Image Search from the Photo Sharing Websites 2012 IEEE
 
00:56
Learn to Personalized Image Search from the Photo Sharing Websites 2012 IEEE ANDROID PROJECT TO GET THIS PROJECT IN ONLINE OR THROUGH TRAINING SESSIONS CONTACT: Chennai Office: JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Pillar, Chennai – 83. Landmark: Next to Kotak Mahendra Bank / Bharath Scans. Landline: (044) - 43012642 / Mobile: (0)9952649690 Pondicherry Office: JP INFOTECH, #45, Kamaraj Salai, Thattanchavady, Puducherry – 9. Landmark: Opp. To Thattanchavady Industrial Estate & Next to VVP Nagar Arch. Landline: (0413) - 4300535 / Mobile: (0)8608600246 / (0)9952649690 Email: jpinfotechprojects@gmail.com, Website: http://www.jpinfotech.org, Blog: http://www.jpinfotech.blogspot.com 2012 ieee projects, 2012 ieee java projects, 2012 ieee dotnet projects, 2012 ieee android projects, 2012 ieee matlab projects, 2012 ieee embedded projects, 2012 ieee robotics projects, 2012 IEEE EEE PROJECTS, 2012 IEEE POWER ELECTRONICS PROJECTS, ieee 2012 android projects, ieee 2012 java projects, ieee 2012 dotnet projects, 2012 ieee mtech projects, 2012 ieee btech projects, 2012 ieee be projects, ieee 2012 projects for cse, 2012 ieee cse projects, 2012 ieee it projects, 2012 ieee ece projects, 2012 ieee mca projects, 2012 ieee mphil projects, pondicherry ieee projects, best project centre in pondicherry, bulk ieee projects, jpinfotech ieee projects, jp infotech pondicherry, latest ieee projects, ieee projects for mtech, ieee projects for btech, ieee projects for mphil, ieee projects for be, ieee projects, student projects, students ieee projects, ieee proejcts india, ms projects, bits pilani ms projects, uk ms projects, ms ieee projects, ieee android real time projects, 2012 mtech projects, 2012 mphil projects, 2012 ieee projects with source code, pondicherry mtech projects, jpinfotech ieee projects, ieee projects, 2012 ieee project source code, journal paper publication guidance, conference paper publication guidance, ieee project, free ieee project, ieee projects for students., 2012 ieee omnet++ projects, ieee 2012 oment++ project, innovative ieee projects, latest ieee projects, 2012 latest ieee projects, ieee cloud computing projects, 2012 ieee cloud computing projects, 2012 ieee networking projects, ieee networking projects, 2012 ieee data mining projects, ieee data mining projects, 2012 ieee network security projects, ieee network security projects, 2012 ieee image processing projects, ieee image processing projects, ieee parallel and distributed system projects, ieee information security projects, 2012 wireless networking projects ieee, 2012 ieee web service projects, 2012 ieee soa projects, ieee 2012 vlsi projects
Views: 841 jpinfotechprojects
Mining Competitors from Large Unstructured Datasets
 
09:25
Mining Competitors from Large Unstructured Datasets To get this project in ONLINE or through TRAINING Sessions, Contact: JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Pillar, Chennai -83.Landmark: Next to Kotak Mahendra Bank. Pondicherry Office: JP INFOTECH, #37, Kamaraj Salai,Thattanchavady, Puducherry -9.Landmark: Next to VVP Nagar Arch. Mobile: (0) 9952649690, Email: jpinfotechprojects@gmail.com, web: http://www.jpinfotech.org In any competitive business, success is based on the ability to make an item more appealing to customers than the competition. A number of questions arise in the context of this task: how do we formalize and quantify the competitiveness between two items? Who are the main competitors of a given item? What are the features of an item that most affect its competitiveness? Despite the impact and relevance of this problem to many domains, only a limited amount of work has been devoted toward an effective solution. In this paper, we present a formal definition of the competitiveness between two items, based on the market segments that they can both cover. Our evaluation of competitiveness utilizes customer reviews, an abundant source of information that is available in a wide range of domains. We present efficient methods for evaluating competitiveness in large review datasets and address the natural problem of finding the top-k competitors of a given item. Finally, we evaluate the quality of our results and the scalability of our approach using multiple datasets from different domains.
Views: 1180 jpinfotechprojects
Mobile Data Gathering with Load Balanced Clustering and Dual Data Uploading in WSN
 
05:51
Mobile Data Gathering with Load Balanced Clustering and Dual Data Uploading in Wireless Sensor Networks TO GET THIS PROJECT IN ONLINE OR THROUGH TRAINING SESSIONS CONTACT: Chennai Office: JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Pillar, Chennai – 83. Landmark: Next to Kotak Mahendra Bank / Bharath Scans. Landline: (044) - 43012642 / Mobile: (0)9952649690 Pondicherry Office: JP INFOTECH, #45, Kamaraj Salai, Thattanchavady, Puducherry – 9. Landmark: Opp. To Thattanchavady Industrial Estate & Next to VVP Nagar Arch. Landline: (0413) - 4300535 / Mobile: (0)8608600246 / (0)9952649690 Email: jpinfotechprojects@gmail.com, Website: www.jpinfotech.org, Blog: www.jpinfotech.blogspot.com In this paper, a three-layer framework is proposed for mobile data collection in wireless sensor networks, which includes the sensor layer, cluster head layer, and mobile collector (called SenCar) layer. The framework employs distributed load balanced clustering and dual data uploading, which is referred to as LBC-DDU. The objective is to achieve good scalability, long network lifetime and low data collection latency. At the sensor layer, a distributed load balanced clustering (LBC) algorithm is proposed for sensors to self-organize themselves into clusters. In contrast to existing clustering methods, our scheme generates multiple cluster heads in each cluster to balance the work load and facilitate dual data uploading. At the cluster head layer, the inter-cluster transmission range is carefully chosen to guarantee the connectivity among the clusters. Multiple cluster heads within a cluster cooperate with each other to perform energy-saving inter-cluster communications. Through inter-cluster transmissions, cluster head information is forwarded to SenCar for its moving trajectory planning. At the mobile collector layer, SenCar is equipped with two antennas, which enables two cluster heads to simultaneously upload data to SenCar in each time by utilizing multi-user multiple-input and multiple-output (MU-MIMO) technique. The trajectory planning for SenCar is optimized to fully utilize dual data uploading capability by properly selecting polling points in each cluster. By visiting each selected polling point, SenCar can efficiently gather data from cluster heads and transport the data to the static data sink. Extensive simulations are conducted to evaluate the effectiveness of the proposed LBC-DDU scheme. The results show that when each cluster has at most two cluster heads, LBC-DDU achieves over 50 percent energy saving per node and 60 percent energy saving on cluster heads comparing with data collection through multi-hop relay to the static data sink, and 20 percent shorter data collection time compared to traditional mobile data gathering.
Views: 924 jpinfotechprojects
Packet Hiding Methods for Preventing Selective Jamming Attacks 2012 IEEE PROJECT
 
02:12
Packet-Hiding Methods for Preventing Selective Jamming Attacks | 2012 IEEE PROJECT| TO GET THIS PROJECT IN ONLINE OR THROUGH TRAINING SESSIONS CONTACT: Chennai Office: JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Pillar, Chennai – 83. Landmark: Next to Kotak Mahendra Bank / Bharath Scans. Landline: (044) - 43012642 / Mobile: (0)9952649690 Pondicherry Office: JP INFOTECH, #45, Kamaraj Salai, Thattanchavady, Puducherry – 9. Landmark: Opp. To Thattanchavady Industrial Estate & Next to VVP Nagar Arch. Landline: (0413) - 4300535 / Mobile: (0)8608600246 / (0)9952649690 Email: jpinfotechprojects@gmail.com, Website: http://www.jpinfotech.org, Blog: http://www.jpinfotech.blogspot.com 2012 ieee projects, 2012 ieee java projects, 2012 ieee dotnet projects, 2012 ieee android projects, 2012 ieee matlab projects, 2012 ieee embedded projects, 2012 ieee robotics projects, 2012 IEEE EEE PROJECTS, 2012 IEEE POWER ELECTRONICS PROJECTS, ieee 2012 android projects, ieee 2012 java projects, ieee 2012 dotnet projects, 2012 ieee mtech projects, 2012 ieee btech projects, 2012 ieee be projects, ieee 2012 projects for cse, 2012 ieee cse projects, 2012 ieee it projects, 2012 ieee ece projects, 2012 ieee mca projects, 2012 ieee mphil projects, pondicherry ieee projects, best project centre in pondicherry, bulk ieee projects, jpinfotech ieee projects, jp infotech pondicherry, latest ieee projects, ieee projects for mtech, ieee projects for btech, ieee projects for mphil, ieee projects for be, ieee projects, student projects, students ieee projects, ieee proejcts india, ms projects, bits pilani ms projects, uk ms projects, ms ieee projects, ieee android real time projects, 2012 mtech projects, 2012 mphil projects, 2012 ieee projects with source code, pondicherry mtech projects, jpinfotech ieee projects, ieee projects, 2012 ieee project source code, journal paper publication guidance, conference paper publication guidance, ieee project, free ieee project, ieee projects for students., 2012 ieee omnet++ projects, ieee 2012 oment++ project, innovative ieee projects, latest ieee projects, 2012 latest ieee projects, ieee cloud computing projects, 2012 ieee cloud computing projects, 2012 ieee networking projects, ieee networking projects, 2012 ieee data mining projects, ieee data mining projects, 2012 ieee network security projects, ieee network security projects, 2012 ieee image processing projects, ieee image processing projects, ieee parallel and distributed system projects, ieee information security projects, 2012 wireless networking projects ieee, 2012 ieee web service projects, 2012 ieee soa projects, ieee 2012 vlsi projects
Views: 4069 jpinfotechprojects
DEFENSES AGAINST LARGE SCALE ONLINE PASSWORD GUESSING ATTACKS BY USING PERSUASIVE CLICK POINTS
 
02:40
ANDROID PROJECT - DEFENSES AGAINST LARGE SCALE ONLINE PASSWORD GUESSING ATTACKS BY USING PERSUASIVE CLICK POINTS TO GET THIS PROJECT IN ONLINE OR THROUGH TRAINING SESSIONS CONTACT: Chennai Office: JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Pillar, Chennai – 83. Landmark: Next to Kotak Mahendra Bank / Bharath Scans. Landline: (044) - 43012642 / Mobile: (0)9952649690 Pondicherry Office: JP INFOTECH, #45, Kamaraj Salai, Thattanchavady, Puducherry – 9. Landmark: Opp. To Thattanchavady Industrial Estate & Next to VVP Nagar Arch. Landline: (0413) - 4300535 / Mobile: (0)8608600246 / (0)9952649690 Email: jpinfotechprojects@gmail.com, Website: http://www.jpinfotech.org, Blog: http://www.jpinfotech.blogspot.com Usable security has unique usability challenges because the need for security often means that standard human-computer-interaction approaches cannot be directly applied. An important usability goal for authentication systems is to support users in selecting better passwords. Users often create memorable passwords that are easy for attackers to guess, but strong system-assigned passwords are difficult for users to remember. So researchers of modern days have gone for alternative methods wherein graphical pictures are used as passwords. Graphical passwords essentially use images or representation of images as passwords. Human brain is good in remembering picture than textual character. There are various graphical password schemes or graphical password software in the market. However, very little research has been done to analyze graphical passwords that are still immature. There for, this project work merges persuasive cued click points and password guessing resistant protocol. The major goal of this work is to reduce the guessing attacks as well as encouraging users to select more random, and difficult passwords to guess. Well known security threats like brute force attacks and dictionary attacks can be successfully abolished using this method.
Views: 2083 jpinfotechprojects
Efficient Fuzzy Type-Ahead Search in XML Data 2012 IEEE JAVA PROJECT
 
04:20
Efficient Fuzzy Type-Ahead Search in XML Data 2012 IEEE JAVA PROJECT TO GET THIS PROJECT IN ONLINE OR THROUGH TRAINING SESSIONS CONTACT: Chennai Office: JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Pillar, Chennai – 83. Landmark: Next to Kotak Mahendra Bank / Bharath Scans. Landline: (044) - 43012642 / Mobile: (0)9952649690 Pondicherry Office: JP INFOTECH, #45, Kamaraj Salai, Thattanchavady, Puducherry – 9. Landmark: Opp. To Thattanchavady Industrial Estate & Next to VVP Nagar Arch. Landline: (0413) - 4300535 / Mobile: (0)8608600246 / (0)9952649690 Email: jpinfotechprojects@gmail.com, Website: http://www.jpinfotech.org, Blog: http://www.jpinfotech.blogspot.com In a traditional keyword-search system over XML data, a user composes a keyword query, submits it to the system, and retrieves relevant answers. In the case where the user has limited knowledge about the data, often the user feels "left in the dark" when issuing queries, and has to use a try-and-see approach for finding information. In this paper, we study fuzzy type-ahead search in XML data, a new information-access paradigm in which the system searches XML data on the fly as the user types in query keywords. It allows users to explore data as they type, even in the presence of minor errors of their keywords. Our proposed method has the following features: 1) Search as you type: It extends Autocomplete by supporting queries with multiple keywords in XML data. 2) Fuzzy: It can find high-quality answers that have keywords matching query keywords approximately. 3) Efficient: Our effective index structures and searching algorithms can achieve a very high interactive speed. We study research challenges in this new search framework. We propose effective index structures and top-k algorithms to achieve a high interactive speed. We examine effective ranking functions and early termination techniques to progressively identify the top-k relevant answers. We have implemented our method on real data sets, and the experimental results show that our method achieves high search efficiency and result quality.
Views: 1652 jpinfotechprojects
Multibiometric Cryptosystems Based on Feature-Level Fusion 2012 IEEE DOTNET
 
03:13
Multibiometric Cryptosystems Based on Feature-Level Fusion 2012 IEEE DOTNET TO GET THIS PROJECT IN ONLINE OR THROUGH TRAINING SESSIONS CONTACT: Chennai Office: JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Pillar, Chennai – 83. Landmark: Next to Kotak Mahendra Bank / Bharath Scans. Landline: (044) - 43012642 / Mobile: (0)9952649690 Pondicherry Office: JP INFOTECH, #45, Kamaraj Salai, Thattanchavady, Puducherry – 9. Landmark: Opp. To Thattanchavady Industrial Estate & Next to VVP Nagar Arch. Landline: (0413) - 4300535 / Mobile: (0)8608600246 / (0)9952649690 Email: jpinfotechprojects@gmail.com, Website: http://www.jpinfotech.org, Blog: http://www.jpinfotech.blogspot.com 2012 ieee projects, 2012 ieee java projects, 2012 ieee dotnet projects, 2012 ieee android projects, 2012 ieee matlab projects, 2012 ieee embedded projects, 2012 ieee robotics projects, 2012 IEEE EEE PROJECTS, 2012 IEEE POWER ELECTRONICS PROJECTS, ieee 2012 android projects, ieee 2012 java projects, ieee 2012 dotnet projects, 2012 ieee mtech projects, 2012 ieee btech projects, 2012 ieee be projects, ieee 2012 projects for cse, 2012 ieee cse projects, 2012 ieee it projects, 2012 ieee ece projects, 2012 ieee mca projects, 2012 ieee mphil projects, pondicherry ieee projects, best project centre in pondicherry, bulk ieee projects, jpinfotech ieee projects, jp infotech pondicherry, latest ieee projects, ieee projects for mtech, ieee projects for btech, ieee projects for mphil, ieee projects for be, ieee projects, student projects, students ieee projects, ieee proejcts india, ms projects, bits pilani ms projects, uk ms projects, ms ieee projects, ieee android real time projects, 2012 mtech projects, 2012 mphil projects, 2012 ieee projects with source code, pondicherry mtech projects, jpinfotech ieee projects, ieee projects, 2012 ieee project source code, journal paper publication guidance, conference paper publication guidance, ieee project, free ieee project, ieee projects for students., 2012 ieee omnet++ projects, ieee 2012 oment++ project, innovative ieee projects, latest ieee projects, 2012 latest ieee projects, ieee cloud computing projects, 2012 ieee cloud computing projects, 2012 ieee networking projects, ieee networking projects, 2012 ieee data mining projects, ieee data mining projects, 2012 ieee network security projects, ieee network security projects, 2012 ieee image processing projects, ieee image processing projects, ieee parallel and distributed system projects, ieee information security projects, 2012 wireless networking projects ieee, 2012 ieee web service projects, 2012 ieee soa projects, ieee 2012 vlsi projects
Views: 1124 jpinfotechprojects
Efficient Algorithms for Neighbor Discovery in Wireless Networks
 
02:48
To get this project in ONLINE or through TRAINING Sessions, Contact: JP INFOTECH, 45, KAMARAJ SALAI, THATTANCHAVADY, PUDUCHERRY-9 Landmark: Opposite to Thattanchavady Industrial Estate, Next to VVP Nagar Arch. Mobile: (0) 9952649690 , Email: jpinfotechprojects@gmail.com, web: www.jpinfotech.org Blog: www.jpinfotech.blogspot.com Efficient Algorithms for Neighbor Discovery in Wireless Networks Neighbor discovery is an important first step in the initialization of a wireless ad hoc network. In this paper, we design and analyze several algorithms for neighbor discovery in wireless networks. Starting with a single-hop wireless network of nodes, we propose a ALOHA-like neighbor discovery algorithm when nodes cannot detect collisions, and an order-optimal receiver feedback-based algorithm when nodes can detect collisions. Our algorithms neither require nodes to have a priori estimates of the number of neighbors nor synchronization between nodes. Our algorithms allow nodes to begin execution at different time instants and to terminate neighbor discovery upon discovering all their neighbors. We finally show that receiver feedback can be used to achieve a running time, even when nodes cannot detect collisions. We then analyze neighbor discovery in a general multihop setting. We establish an upper bound of on the running time of the ALOHA-like algorithm, where denotes the maximum node degree in the network and the total number of nodes. We also establish a lower bound of on the running time of any randomized neighbor discovery algorithm. Our result thus implies that the ALOHA-like algorithm is at most a factor worse than optimal.
Views: 531 jpinfotechprojects
Content Sharing over Smartphone-Based Delay-Tolerant Networks
 
08:22
To get this project in ONLINE or through TRAINING Sessions, Contact: JP INFOTECH, 45, KAMARAJ SALAI, THATTANCHAVADY, PUDUCHERRY-9 Landmark: Opposite to Thattanchavady Industrial Estate, Next to VVP Nagar Arch. Mobile: (0) 9952649690 , Email: jpinfotechprojects@gmail.com, web: www.jpinfotech.org Blog: www.jpinfotech.blogspot.com Content Sharing over Smartphone-Based Delay-Tolerant Networks With the growing number of smartphone users, peer-to-peer ad hoc content sharing is expected to occur more often. Thus, new content sharing mechanisms should be developed as traditional data delivery schemes are not efficient for content sharing due to the sporadic connectivity between smartphones. To accomplish data delivery in such challenging environments, researchers have proposed the use of store-carry-forward protocols, in which a node stores a message and carries it until a forwarding opportunity arises through an encounter with other nodes. Most previous works in this field have focused on the prediction of whether two nodes would encounter each other, without considering the place and time of the encounter. In this paper, we propose discover-predict-deliver as an efficient content sharing scheme for delay-tolerant smartphone networks. In our proposed scheme, contents are shared using the mobility information of individuals. Specifically, our approach employs a mobility learning algorithm to identify places indoors and outdoors. A hidden Markov model is used to predict an individual's future mobility information. Evaluation based on real traces indicates that with the proposed approach, 87 percent of contents can be correctly discovered and delivered within 2 hours when the content is available only in 30 percent of nodes in the network. We implement a sample application on commercial smartphones, and we validate its efficiency to analyze the practical feasibility of the content sharing application. Our system approximately results in a2 percent CPU overhead and reduces the battery lifetime of a smartphone by 15 percent at most.
Views: 779 jpinfotechprojects
Ranking Model Adaptation for Domain-Specific Search 2012 IEEE JAVA
 
10:43
Ranking Model Adaptation for Domain-Specific Search 2012 IEEE JAVA TO GET THIS PROJECT IN ONLINE OR THROUGH TRAINING SESSIONS CONTACT: Chennai Office: JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Pillar, Chennai – 83. Landmark: Next to Kotak Mahendra Bank / Bharath Scans. Landline: (044) - 43012642 / Mobile: (0)9952649690 Pondicherry Office: JP INFOTECH, #45, Kamaraj Salai, Thattanchavady, Puducherry – 9. Landmark: Opp. To Thattanchavady Industrial Estate & Next to VVP Nagar Arch. Landline: (0413) - 4300535 / Mobile: (0)8608600246 / (0)9952649690 Email: jpinfotechprojects@gmail.com, Website: http://www.jpinfotech.org, Blog: http://www.jpinfotech.blogspot.com 2012 ieee projects, 2012 ieee java projects, 2012 ieee dotnet projects, 2012 ieee android projects, 2012 ieee matlab projects, 2012 ieee embedded projects, 2012 ieee robotics projects, 2012 IEEE EEE PROJECTS, 2012 IEEE POWER ELECTRONICS PROJECTS, ieee 2012 android projects, ieee 2012 java projects, ieee 2012 dotnet projects, 2012 ieee mtech projects, 2012 ieee btech projects, 2012 ieee be projects, ieee 2012 projects for cse, 2012 ieee cse projects, 2012 ieee it projects, 2012 ieee ece projects, 2012 ieee mca projects, 2012 ieee mphil projects, pondicherry ieee projects, best project centre in pondicherry, bulk ieee projects, jpinfotech ieee projects, jp infotech pondicherry, latest ieee projects, ieee projects for mtech, ieee projects for btech, ieee projects for mphil, ieee projects for be, ieee projects, student projects, students ieee projects, ieee proejcts india, ms projects, bits pilani ms projects, uk ms projects, ms ieee projects, ieee android real time projects, 2012 mtech projects, 2012 mphil projects, 2012 ieee projects with source code, pondicherry mtech projects, jpinfotech ieee projects, ieee projects, 2012 ieee project source code, journal paper publication guidance, conference paper publication guidance, ieee project, free ieee project, ieee projects for students., 2012 ieee omnet++ projects, ieee 2012 oment++ project, innovative ieee projects, latest ieee projects, 2012 latest ieee projects, ieee cloud computing projects, 2012 ieee cloud computing projects, 2012 ieee networking projects, ieee networking projects, 2012 ieee data mining projects, ieee data mining projects, 2012 ieee network security projects, ieee network security projects, 2012 ieee image processing projects, ieee image processing projects, ieee parallel and distributed system projects, ieee information security projects, 2012 wireless networking projects ieee, 2012 ieee web service projects, 2012 ieee soa projects, ieee 2012 vlsi projects
Views: 2041 jpinfotechprojects
A Privacy Leakage Upper Bound Constraint-Based Approach for Cost-Effective Privacy Preserving
 
13:27
To get this project in ONLINE or through TRAINING Sessions, Contact: JP INFOTECH, 45, KAMARAJ SALAI, THATTANCHAVADY, PUDUCHERRY-9 Landmark: Opposite to Thattanchavady Industrial Estate, Next to VVP Nagar Arch. Mobile: (0) 9952649690 , Email: jpinfotechprojects@gmail.com, web: www.jpinfotech.org Blog: www.jpinfotech.blogspot.com A Privacy Leakage Upper Bound Constraint-Based Approach for Cost-Effective Privacy Preserving of Intermediate Data Sets in Cloud Cloud computing provides massive computation power and storage capacity which enable users to deploy computation and data-intensive applications without infrastructure investment. Along the processing of such applications, a large volume of intermediate data sets will be generated, and often stored to save the cost of recomputing them. However, preserving the privacy of intermediate data sets becomes a challenging problem because adversaries may recover privacy-sensitive information by analyzing multiple intermediate data sets. Encrypting ALL data sets in cloud is widely adopted in existing approaches to address this challenge. But we argue that encrypting all intermediate data sets are neither efficient nor cost-effective because it is very time consuming and costly for data-intensive applications to en/decrypt data sets frequently while performing any operation on them. In this paper, we propose a novel upper bound privacy leakage constraint-based approach to identify which intermediate data sets need to be encrypted and which do not, so that privacy-preserving cost can be saved while the privacy requirements of data holders can still be satisfied. Evaluation results demonstrate that the privacy-preserving cost of intermediate data sets can be significantly reduced with our approach over existing ones where all data sets are encrypted.
Views: 830 jpinfotechprojects
Automated Human Identification Using Ear Imaging
 
04:18
Automated Human Identification Using Ear Imaging To get this project in ONLINE or through TRAINING Sessions, Contact: JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Pillar, Chennai -83.Landmark: Next to Kotak Mahendra Bank. Pondicherry Office: JP INFOTECH, #37, Kamaraj Salai,Thattanchavady, Puducherry -9.Landmark: Next to VVP Nagar Arch. Mobile: (0) 9952649690, Email: jpinfotechprojects@gmail.com, web: http://www.jpinfotech.org Reliability in human authentication is the important aspect for the security requirements in various applications ranging from airport surveillance to electronic banking. Many physical characteristics of humans, i.e., biometrics, are usually don't change over time, unique to every person and easy to capture. Currently research in biometrics is focused on iris, fingerprint, gait, signature, face, palm print, or hand-geometry. Ear of the human is best source of data for human identification in various applications. The ear is quite efficient biometric candidate because it’s a) Stable and appropriate structure that is preserved from birth and is unique in individuals b) Facial expressions can vary with time but this is not case with ear, c) Relatively immune from hygiene issues and privacy with several other biometric elements. This system investigates a unique approach for the automated human ident ification using 2D ear imaging. Multiple geometrical feature extraction such as identification of shape a person using ear biometrics.
Views: 633 jpinfotechprojects
Learning Fingerprint Reconstruction: From Minutiae to Image
 
04:25
Learning Fingerprint Reconstruction: From Minutiae to Image TO GET THIS PROJECT IN ONLINE OR THROUGH TRAINING SESSIONS CONTACT: Chennai Office: JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Pillar, Chennai – 83. Landmark: Next to Kotak Mahendra Bank / Bharath Scans. Landline: (044) - 43012642 / Mobile: (0)9952649690 Pondicherry Office: JP INFOTECH, #45, Kamaraj Salai, Thattanchavady, Puducherry – 9. Landmark: Opp. To Thattanchavady Industrial Estate & Next to VVP Nagar Arch. Landline: (0413) - 4300535 / Mobile: (0)8608600246 / (0)9952649690 Email: jpinfotechprojects@gmail.com, Website: www.jpinfotech.org, Blog: www.jpinfotech.blogspot.com The set of minutia points is considered to be the most distinctive feature for fingerprint representation and is widely used in fingerprint matching. It was believed that the minutiae set does not contain sufficient information to reconstruct the original fingerprint image from which minutiae were extracted. However, recent studies have shown that it is indeed possible to reconstruct fingerprint images from their minutiae representations. Reconstruction techniques demonstrate the need for securing fingerprint templates, improving the template interoperability, and improving fingerprint synthesis. But, there is still a large gap between the matching performance obtained from original fingerprint images and their corresponding reconstructed fingerprint images. In this paper, the prior knowledge about fingerprint ridge structures is encoded in terms of orientation patch and continuous phase patch dictionaries to improve the fingerprint reconstruction. The orientation patch dictionary is used to reconstruct the orientation field from minutiae, while the continuous phase patch dictionary is used to reconstruct the ridge pattern. Experimental results on three public domain databases (FVC2002 DB1_A, FVC2002 DB2_A, and NIST SD4) demonstrate that the proposed reconstruction algorithm outperforms the state-of-the-art reconstruction algorithms in terms of both: 1) spurious minutiae and 2) matching performance with respect to type-I attack (matching the reconstructed fingerprint against the same impression from which minutiae set was extracted) and type-II attack (matching the reconstructed fingerprint against a different impression of the same finger).
Views: 2857 jpinfotechprojects
Leveraging Data Deduplication to Improve the Performance of Primary Storage Systems in the Cloud
 
11:52
Leveraging Data Deduplication to Improve the Performance of Primary Storage Systems in the Cloud To get this project in ONLINE or through TRAINING Sessions, Contact: JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Pillar, Chennai -83.Landmark: Next to Kotak Mahendra Bank. Pondicherry Office: JP INFOTECH, #45, Kamaraj Salai,Thattanchavady, Puducherry -9.Landmark: Next to VVP Nagar Arch. Mobile: (0) 9952649690, Email: jpinfotechprojects@gmail.com, web: http://www.jpinfotech.org, Blog: http://www.jpinfotech.blogspot.com With the explosive growth in data volume, the I/O bottleneck has become an increasingly daunting challenge for big data analytics in the Cloud. Recent studies have shown that moderate to high data redundancy clearly exists in primary storage systems in the Cloud. Our experimental studies reveal that data redundancy exhibits a much higher level of intensity on the I/O path than that on disks due to relatively high temporal access locality associated with small I/O requests to redundant data. Moreover, directly applying data deduplication to primary storage systems in the Cloud will likely cause space contention in memory and data fragmentation on disks. Based on these observations, we propose a performance-oriented I/O deduplication, called POD, rather than a capacity oriented I/O deduplication, exemplified by iDedup, to improve the I/O performance of primary storage systems in the Cloud without sacrificing capacity savings of the latter. POD takes a two-pronged approach to improving the performance of primary storage systems and minimizing performance overhead of deduplication, namely, a request-based selective deduplication technique, called Select-Dedupe, to alleviate the data fragmentation and an adaptive memory management scheme, called iCache, to ease the memory contention between the bursty read traffic and the bursty write traffic. We have implemented a prototype of POD as a module in the Linux operating system. The experiments conducted on our lightweight prototype implementation of POD show that POD significantly outperforms iDedup in the I/O performance measure by up to 87.9% with an average of 58.8%. Moreover, our evaluation results also show that POD achieves comparable or better capacity savings than iDedup.
Views: 834 jpinfotechprojects
Cost-Effective Authentic and Anonymous Data Sharing with Forward Security
 
12:14
Cost-Effective Authentic and Anonymous Data Sharing with Forward Security To get this project in ONLINE or through TRAINING Sessions, Contact:JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Pillar, Chennai -83. Landmark: Next to Kotak Mahendra Bank. Pondicherry Office: JP INFOTECH, #45, Kamaraj Salai, Thattanchavady, Puducherry -9. Landmark: Next to VVP Nagar Arch. Mobile: (0) 9952649690 , Email: jpinfotechprojects@gmail.com, web: www.jpinfotech.org Blog: www.jpinfotech.blogspot.com Data sharing has never been easier with the advances of cloud computing, and an accurate analysis on the shared data provides an array of benefits to both the society and individuals. Data sharing with a large number of participants must take into account several issues, including efficiency, data integrity and privacy of data owner. Ring signature is a promising candidate to construct an anonymous and authentic data sharing system. It allows a data owner to anonymously authenticate his data which can be put into the cloud for storage or analysis purpose. Yet the costly certificate verification in the traditional public key infrastructure (PKI) setting becomes a bottleneck for this solution to be scalable. Identity-based (ID-based) ring signature, which eliminates the process of certificate verification, can be used instead. In this paper, we further enhance the security of ID-based ring signature by providing forward security: If a secret key of any user has been compromised, all previous generated signatures that include this user still remain valid. This property is especially important to any large scale data sharing system, as it is impossible to ask all data owners to reauthenticate their data even if a secret key of one single user has been compromised. We provide a concrete and efficient instantiation of our scheme, prove its security and provide an implementation to show its practicality.
Views: 1395 jpinfotechprojects
Restaurant Table Order Management System in Android App | Hotel Menu Order App
 
07:36
Restaurant Table Order Management System in Android App | Hotel Menu Order App To get this project in ONLINE or through TRAINING Sessions, Contact: JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Pillar, Chennai -83.Landmark: Next to Kotak Mahendra Bank. Pondicherry Office: JP INFOTECH, #45, Kamaraj Salai,Thattanchavady, Puducherry -9.Landmark: Next to VVP Nagar Arch. Mobile: (0) 9952649690, Email: jpinfotechprojects@gmail.com, web: http://www.jpinfotech.org, Blog: http://www.jpinfotech.blogspot.com The concept of restaurant table order management system, since it is android application, I will keep everything as simple as possible. The project consists in an Android application that can be used by employees in a restaurant to handle the clients, their orders and can help them easily find free tables or place orders. This application, created mainly for proof of proper user-mobile interaction. The restaurant menu is organized by categories (appetizers, soups, salads, entrees, sides and drinks) of menu items. Each menu item has a name (e.g., fried rice), price and associated recipe. A recipe for a menu item has a chef, preparation instruction sand associated ingredients. The ingredients are identified by their ingredient id and the quantity of the ingredient needed to prepare a particular recipe, the unit of measure and a name. “Restaurant Table Management System (RTMS)" is android application to restaurant management. This system wake to provide service facility to restaurant and also to the customer. The services that are provided is food ordering and reservation table management by the customer through the system , customer information management and waiter information management, menu information management and report. Main objective build the system this is to provide ordering and reservation service to the customer. With this system, ordering and reservation management will become easier and systematic to replace traditional system
Views: 5442 jpinfotechprojects
Connecting Social Media to E-Commerce: Cold-Start Product Recommendation
 
11:33
Connecting Social Media to E-Commerce: Cold-Start Product Recommendation Using Microblogging Information To get this project in ONLINE or through TRAINING Sessions, Contact: JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Pillar, Chennai -83.Landmark: Next to Kotak Mahendra Bank. Pondicherry Office: JP INFOTECH, #45, Kamaraj Salai,Thattanchavady, Puducherry -9.Landmark: Next to VVP Nagar Arch. Mobile: (0) 9952649690, Email: jpinfotechprojects@gmail.com, web: http://www.jpinfotech.org, Blog: http://www.jpinfotech.blogspot.com In recent years, the boundaries between e-commerce and social networking have become increasingly blurred. Many e-commerce websites support the mechanism of social login where users can sign on the websites using their social network identities such as their Facebook or Twitter accounts. Users can also post their newly purchased products on microblogs with links to the e-commerce product web pages. In this paper, we propose a novel solution for cross-site cold-start product recommendation, which aims to recommend products from e-commerce websites to users at social networking sites in “cold-start” situations, a problem which has rarely been explored before. A major challenge is how to leverage knowledge extracted from social networking sites for cross-site cold-start product recommendation. We propose to use the linked users across social networking sites and e-commerce websites (users who have social networking accounts and have made purchases on e-commerce websites) as a bridge to map users’ social networking features to another feature representation for product recommendation. In specific, we propose learning both users’ and products’ feature representations (called user embeddings and product embeddings, respectively) from data collected from e-commerce websites using recurrent neural networks and then apply a modified gradient boosting trees method to transform users’ social networking features into user embeddings. We then develop a feature-based matrix factorization approach which can leverage the learnt user embeddings for cold-start product recommendation. Experimental results on a large dataset constructed from the largest Chinese microblogging service SINA WEIBO and the largest Chinese B2C e-commerce website JINGDONG have shown the effectiveness of our proposed framework.
Views: 2401 jpinfotechprojects
CAM: Cloud-Assisted Privacy Preserving Mobile Health Monitoring 2013 ieee
 
01:14
To get this project in ONLINE or through TRAINING Sessions, Contact: JP INFOTECH, 45, KAMARAJ SALAI, THATTANCHAVADY, PUDUCHERRY-9 Landmark: Opposite to Thattanchavady Industrial Estate, Next to VVP Nagar Arch. Mobile: (0) 9952649690 , Email: jpinfotechprojects@gmail.com, web: www.jpinfotech.org Blog: www.jpinfotech.blogspot.com CAM: Cloud-Assisted Privacy Preserving Mobile Health Monitoring 2013 ieee Cloud-assisted mobile health (mHealth) monitoring, which applies the prevailing mobile communications and cloud computing technologies to provide feedback decision support, has been considered as a revolutionary approach to improving the quality of healthcare service while lowering the healthcare cost. Unfortunately, it also poses a serious risk on both clients' privacy and intellectual property of monitoring service providers, which could deter the wide adoption of mHealth technology. This paper is to address this important problem and design a cloud assisted privacy preserving mobile health monitoring system to protect the privacy of the involved parties and their data. Moreover, the outsourcing decryption technique and a newly proposed key private proxy re-encryption are adapted to shift the computational complexity of the involved parties to the cloud without compromising clients' privacy and service providers' intellectual property. Finally, our security and performance analysis demonstrates the effectiveness of our proposed design.
Views: 1374 jpinfotechprojects
CloudArmor: Supporting Reputation-based Trust Management for Cloud Services
 
13:37
CloudArmor: Supporting Reputation-based Trust Management for Cloud Services To get this project in ONLINE or through TRAINING Sessions, Contact:JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Pillar, Chennai -83. Landmark: Next to Kotak Mahendra Bank. Pondicherry Office: JP INFOTECH, #45, Kamaraj Salai, Thattanchavady, Puducherry -9. Landmark: Next to VVP Nagar Arch. Mobile: (0) 9952649690 , Email: jpinfotechprojects@gmail.com, web: www.jpinfotech.org Blog: www.jpinfotech.blogspot.com Trust management is one of the most challenging issues for the adoption and growth of cloud computing. The highly dynamic, distributed, and non-transparent nature of cloud services introduces several challenging issues such as privacy, security, and availability. Preserving consumers’ privacy is not an easy task due to the sensitive information involved in the interactions between consumers and the trust management service. Protecting cloud services against their malicious users (e.g., such users might give misleading feedback to disadvantage a particular cloud service) is a difficult problem. Guaranteeing the availability of the trust management service is another significant challenge because of the dynamic nature of cloud environments. In this article, we describe the design and implementation of CloudArmor, a reputation-based trust management framework that provides a set of functionalities to deliver Trust as a Service (TaaS), which includes i) a novel protocol to prove the credibility of trust feedbacks and preserve users’ privacy, ii) an adaptive and robust credibility model for measuring the credibility of trust feedbacks to protect cloud services from malicious users and to compare the trustworthiness of cloud services, and iii) an availability model to manage the availability of the decentralized implementation of the trust management service. The feasibility and benefits of our approach have been validated by a prototype and experimental studies using a collection of real-world trust feedbacks on cloud services.
Views: 1846 jpinfotechprojects
Using Fuzzy Logic Control to Provide Intelligent Traffic Management Service for High-Speed Networks
 
04:16
To get this project in ONLINE or through TRAINING Sessions, Contact: JP INFOTECH, 45, KAMARAJ SALAI, THATTANCHAVADY, PUDUCHERRY-9 Landmark: Opposite to Thattanchavady Industrial Estate, Next to VVP Nagar Arch. Mobile: (0) 9952649690 , Email: jpinfotechprojects@gmail.com, web: www.jpinfotech.org Blog: www.jpinfotech.blogspot.com Using Fuzzy Logic Control to Provide Intelligent Traffic Management Service for High-Speed Networks In view of the fast-growing Internet traffic, this paper propose a distributed traffic management framework, in which routers are deployed with intelligent data rate controllers to tackle the traffic mass. Unlike other explicit traffic control protocols that have to estimate network parameters (e.g., link latency, bottleneck bandwidth, packet loss rate, or the number of flows) in order to compute the allowed source sending rate, our fuzzy-logic-based controller can measure the router queue size directly; hence it avoids various potential performance problems arising from parameter estimations while reducing much consumption of computation and memory resources in routers. As a network parameter, the queue size can be accurately monitored and used to proactively decide if action should be taken to regulate the source sending rate, thus increasing the resilience of the network to traffic congestion. The communication QoS (Quality of Service) is assured by the good performances of our scheme such as max-min fairness, low queueing delay and good robustness to network dynamics. Simulation results and comparisons have verified the effectiveness and showed that our new traffic management scheme can achieve better performances than the existing protocols that rely on the estimation of network parameters.
Views: 2593 jpinfotechprojects
Secure Auditing and Deduplicating Data in Cloud
 
14:39
Secure Auditing and Deduplicating Data in Cloud To get this project in ONLINE or through TRAINING Sessions, Contact: JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Pillar, Chennai -83.Landmark: Next to Kotak Mahendra Bank. Pondicherry Office: JP INFOTECH, #45, Kamaraj Salai,Thattanchavady, Puducherry -9.Landmark: Next to VVP Nagar Arch. Mobile: (0) 9952649690, Email: jpinfotechprojects@gmail.com, web: www.jpinfotech.org, Blog: www.jpinfotech.blogspot.com As the cloud computing technology develops during the last decade, outsourcing data to cloud service for storage becomes an attractive trend, which benefits in sparing efforts on heavy data maintenance and management. Nevertheless, since the outsourced cloud storage is not fully trustworthy, it raises security concerns on how to realize data deduplication in cloud while achieving integrity auditing. In this work, we study the problem of integrity auditing and secure deduplication on cloud data. Specifically, aiming at achieving both data integrity and deduplication in cloud, we propose two secure systems, namely SecCloud and SecCloud+. SecCloud introduces an auditing entity with a maintenance of a MapReduce cloud, which helps clients generate data tags before uploading as well as audit the integrity of data having been stored in cloud. Compared with previous work, the computation by user in SecCloud is greatly reduced during the file uploading and auditing phases. SecCloud+ is designed motivated by the fact that customers always want to encrypt their data before uploading, and enables integrity auditing and secure deduplication on encrypted data.
Views: 3292 jpinfotechprojects
Discovery of Ranking Fraud for Mobile Apps
 
12:14
Discovery of Ranking Fraud for Mobile Apps To get this project in ONLINE or through TRAINING Sessions, Contact: JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Pillar, Chennai -83.Landmark: Next to Kotak Mahendra Bank. Pondicherry Office: JP INFOTECH, #45, Kamaraj Salai,Thattanchavady, Puducherry -9.Landmark: Next to VVP Nagar Arch. Mobile: (0) 9952649690, Email: jpinfotechprojects@gmail.com, web: www.jpinfotech.org, Blog: www.jpinfotech.blogspot.com Ranking fraud in the mobile App market refers to fraudulent or deceptive activities which have a purpose of bumping up the Apps in the popularity list. Indeed, it becomes more and more frequent for App developers to use shady means, such as inflating their Apps’ sales or posting phony App ratings, to commit ranking fraud. While the importance of preventing ranking fraud has been widely recognized, there is limited understanding and research in this area. To this end, in this paper, we provide a holistic view of ranking fraud and propose a ranking fraud detection system for mobile Apps. Specifically, we first propose to accurately locate the ranking fraud by mining the active periods, namely leading sessions, of mobile Apps. Such leading sessions can be leveraged for detecting the local anomaly instead of global anomaly of App rankings. Furthermore, we investigate three types of evidences, i.e., ranking based evidences, rating based evidences and review based evidences, by modeling Apps’ ranking, rating and review behaviors through statistical hypotheses tests. In addition, we propose an optimization based aggregation method to integrate all the evidences for fraud detection. Finally, we evaluate the proposed system with real-world App data collected from the iOS App Store for a long time period. In the experiments, we validate the effectiveness of the proposed system, and show the scalability of the detection algorithm as well as some regularity of ranking fraud activities.
Views: 5586 jpinfotechprojects
Energy and Memory Efficient Clone Detection in Wireless Sensor Networks in Java
 
10:07
Energy and Memory Efficient Clone Detection in Wireless Sensor Networks in Java To get this project in Online or through training sessions Contact: Chennai Office: JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Pillar, Chennai – 83. Landmark: Next to Kotak Mahendra Bank / Bharath Scans. Landline: (044) - 43012642 / Mobile: (0)9952649690 Pondicherry Office: JP INFOTECH, #45, Kamaraj Salai, Thattanchavady, Puducherry – 9. Landline: (0413) - 4300535 / (0)9952649690 Email: jpinfotechprojects@gmail.com, Website: http://www.jpinfotech.org, Blog: http://www.jpinfotech.blogspot.com In this paper, we propose an energy-efficient location-aware clone detection protocol in densely deployed WSNs, which can guarantee successful clone attack detection and maintain satisfactory network lifetime. Specifically, we exploit the location information of sensors and randomly select witnesses located in a ring area to verify the legitimacy of sensors and to report detected clone attacks. The ring structure facilitates energy-efficient data forwarding along the path towards the witnesses and the sink. We theoretically prove that the proposed protocol can achieve 100 percent clone detection probability with trustful witnesses. We further extend the work by studying the clone detection performance with untrustful witnesses and show that the clone detection probability still approaches 98 percent when 10 percent of witnesses are compromised. Moreover, in most existing clone detection protocols with random witness selection scheme, the required buffer storage of sensors is usually dependent on the node density, i.e., Oð ffiffiffinpÞ, while in our proposed protocol, the required buffer storage of sensors is independent of n but a function of the hop length of the network radius h, i.e., OðhÞ. Extensive simulations demonstrate that our proposed protocol can achieve long network lifetime by effectively distributing the traffic load across the network.
Views: 829 jpinfotechprojects
Secure Data Sharing in Cloud Computing Using Revocable-Storage Identity-Based Encryption
 
11:03
Secure Data Sharing in Cloud Computing Using Revocable-Storage Identity-Based Encryption To get this project in ONLINE or through TRAINING Sessions, Contact: JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Pillar, Chennai -83.Landmark: Next to Kotak Mahendra Bank. Pondicherry Office: JP INFOTECH, #45, Kamaraj Salai,Thattanchavady, Puducherry -9.Landmark: Next to VVP Nagar Arch. Mobile: (0) 9952649690, Email: jpinfotechprojects@gmail.com, web: http://www.jpinfotech.org, Blog: http://www.jpinfotech.blogspot.com Cloud computing provides a flexible and convenient way for data sharing, which brings various benefits for both the society and individuals. But there exists a natural resistance for users to directly outsource the shared data to the cloud server since the data often contain valuable information. Thus, it is necessary to place cryptographically enhanced access control on the shared data. Identity-based encryption is a promising cryptographical primitive to build a practical data sharing system. However, access control is not static. That is, when some user’s authorization is expired, there should be a mechanism that can remove him/her from the system. Consequently, the revoked user cannot access both the previously and subsequently shared data. To this end, we propose a notion called revocable-storage identity-based encryption (RS-IBE), which can provide the forward/backward security of ciphertext by introducing the functionalities of user revocation and ciphertext update simultaneously. Furthermore, we present a concrete construction of RS-IBE, and prove its security in the defined security model. The performance comparisons indicate that the proposed RS-IBE scheme has advantages in terms of functionality and efficiency, and thus is feasible for a practical and cost-effective data-sharing system. Finally, we provide implementation results of the proposed scheme to demonstrate its practicability.
Views: 3483 jpinfotechprojects
Automatic Test Packet Generation
 
09:32
To get this project in ONLINE or through TRAINING Sessions, Contact:JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Pillar, Chennai -83. Landmark: Next to Kotak Mahendra Bank. Pondicherry Office: JP INFOTECH, #45, Kamaraj Salai, Thattanchavady, Puducherry -9. Landmark: Next to VVP Nagar Arch. Mobile: (0) 9952649690 , Email: jpinfotechprojects@gmail.com, web: www.jpinfotech.org Blog: www.jpinfotech.blogspot.com Automatic Test Packet Generation | ieee project in 2014
Views: 3214 jpinfotechprojects
Persuasive Cued Click-Points Design, Implementation & Evaluation of a Knowledge-Based Authentication
 
05:34
DOTNET Persuasive Cued Click-Points Design, Implementation, and Evaluation of a Knowledge-Based Authentication Mechanism To get this project in Online or through training sessions Contact: Chennai Office: JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Pillar, Chennai – 83. Landmark: Next to Kotak Mahendra Bank / Bharath Scans. Landline: (044) - 43012642 / Mobile: (0)9952649690 Pondicherry Office: JP INFOTECH, #45, Kamaraj Salai, Thattanchavady, Puducherry – 9. Landline: (0413) - 4300535 / (0)9952649690 Email: jpinfotechprojects@gmail.com, Website: http://www.jpinfotech.org, Blog: http://www.jpinfotech.blogspot.com This paper presents an integrated evaluation of the Persuasive Cued Click-Points graphical password scheme, including usability and security evaluations, and implementation considerations. An important usability goal for knowledge-based authentication systems is to support users in selecting passwords of higher security, in the sense of being from an expanded effective security space. We use persuasion to influence user choice in click-based graphical passwords, encouraging users to select more random, and hence more difficult to guess, click-points.
Views: 4548 jpinfotechprojects
Search Rank Fraud and Malware Detection in Google Play
 
10:43
Search Rank Fraud and Malware Detection in Google Play To get this project in ONLINE or through TRAINING Sessions, Contact: JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Pillar, Chennai -83.Landmark: Next to Kotak Mahendra Bank. Pondicherry Office: JP INFOTECH, #37, Kamaraj Salai,Thattanchavady, Puducherry -9.Landmark: Next to VVP Nagar Arch. Mobile: (0) 9952649690, Email: jpinfotechprojects@gmail.com, web: http://www.jpinfotech.org Fraudulent behaviors in Google Play, the most popular Android app market, fuel search rank abuse and malware proliferation. To identify malware, previous work has focused on app executable and permission analysis. In this paper, we introduce FairPlay, a novel system that discovers and leverages traces left behind by fraudsters, to detect both malware and apps subjected to search rank fraud. FairPlay correlates review activities and uniquely combines detected review relations with linguistic and behavioral signals gleaned from Google Play app data (87K apps, 2.9M reviews, and 2.4M reviewers, collected over half a year), in order to identify suspicious apps. FairPlay achieves over 95% accuracy in classifying gold standard datasets of malware, fraudulent and legitimate apps. We show that 75% of the identified malware apps engage in search rank fraud. FairPlay discovers hundreds of fraudulent apps that currently evade Google Bouncer’s detection technology. FairPlay also helped the discovery of more than 1,000 reviews, reported for 193 apps, that reveal a new type of “coercive” review campaign: users are harassed into writing positive reviews, and install and review other apps.
Views: 1555 jpinfotechprojects
ns2 projects VSPN: VANET-Based Secure and Privacy-Preserving Navigation
 
10:07
VSPN: VANET-Based Secure and Privacy-Preserving Navigation To get this project in ONLINE or through TRAINING Sessions, Contact: JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Pillar, Chennai -83.Landmark: Next to Kotak Mahendra Bank. Pondicherry Office: JP INFOTECH, #45, Kamaraj Salai,Thattanchavady, Puducherry -9.Landmark: Next to VVP Nagar Arch. Mobile: (0) 9952649690, Email: jpinfotechprojects@gmail.com, web: www.jpinfotech.org, Blog: www.jpinfotech.blogspot.com In this paper, we propose a navigation scheme that utilizes the online road information collected by a vehicular ad hoc network (VANET) to guide the drivers to desired destinations in a real-time and distributed manner. The proposed scheme has the advantage of using real-time road conditions to compute a better route and at the same time, the information source can be properly authenticated. To protect the privacy of the drivers, the query (destination) and the driver who issues the query are guaranteed to be unlinkable to any party including the trusted authority. We make use of the idea of anonymous credential to achieve this goal. In addition to authentication and privacy preserving, our scheme fulfills all other necessary security requirements. Using the real maps of New York and California, we conducted a simulation study on our scheme showing that it is effective in terms of processing delay and providing routes of much shorter traveling time.
Views: 1646 jpinfotechprojects
My Privacy My Decision: Control of Photo Sharing on Online Social Networks
 
10:40
My Privacy My Decision: Control of Photo Sharing on Online Social Networks To get this project in ONLINE or through TRAINING Sessions, Contact: JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Pillar, Chennai -83.Landmark: Next to Kotak Mahendra Bank. Pondicherry Office: JP INFOTECH, #37, Kamaraj Salai,Thattanchavady, Puducherry -9.Landmark: Next to VVP Nagar Arch. Mobile: (0) 9952649690, Email: jpinfotechprojects@gmail.com, web: http://www.jpinfotech.org Photo sharing is an attractive feature which popularizes Online Social Networks (OSNs). Unfortunately, it may leak users’ privacy if they are allowed to post, comment, and tag a photo freely. In this paper, we attempt to address this issue and study the scenario when a user shares a photo containing individuals other than himself/herself (termed co-photo for short). To prevent possible privacy leakage of a photo, we design a mechanism to enable each individual in a photo be aware of the posting activity and participate in the decision making on the photo posting. For this purpose, we need an efficient facial recognition (FR) system that can recognize everyone in the photo. However, more demanding privacy setting may limit the number of the photos publicly available to train the FR system. To deal with this dilemma, our mechanism attempts to utilize users’ private photos to design a personalized FR system specifically trained to differentiate possible photo co-owners without leaking their privacy. We also develop a distributed consensus based method to reduce the computational complexity and protect the private training set. We show that our system is superior to other possible approaches in terms of recognition ratio and efficiency. Our mechanism is implemented as a proof of concept Android application on Facebook’s platform.
Views: 857 jpinfotechprojects
Continuous and Transparent User Identity Verification for Secure Internet Services
 
12:46
Continuous and Transparent User Identity Verification for Secure Internet Services To get this project in ONLINE or through TRAINING Sessions, Contact:JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Pillar, Chennai -83. Landmark: Next to Kotak Mahendra Bank. Pondicherry Office: JP INFOTECH, #45, Kamaraj Salai, Thattanchavady, Puducherry -9. Landmark: Next to VVP Nagar Arch. Mobile: (0) 9952649690 , Email: jpinfotechprojects@gmail.com, web: www.jpinfotech.org Blog: www.jpinfotech.blogspot.com Session management in distributed Internet services is traditionally based on username and password, explicit logouts and mechanisms of user session expiration using classic timeouts. Emerging biometric solutions allow substituting username and password with biometric data during session establishment, but in such an approach still a single verification is deemed sufficient, and the identity of a user is considered immutable during the entire session. Additionally, the length of the session timeout may impact on the usability of the service and consequent client satisfaction. This paper explores promising alternatives offered by applying biometrics in the management of sessions. A secure protocol is defined for perpetual authentication through continuous user verification. The protocol determines adaptive timeouts based on the quality, frequency and type of biometric data transparently acquired from the user. The functional behavior of the protocol is illustrated through Matlab simulations, while model-based quantitative analysis is carried out to assess the ability of the protocol to contrast security attacks exercised by different kinds of attackers. Finally, the current prototype for PCs and Android smartphones is discussed.
Views: 2613 jpinfotechprojects
Defending Against Collaborative Attacks by Malicious Nodes in MANETs: A Cooperative Bait Detection
 
01:02
To get this project in ONLINE or through TRAINING Sessions, Contact:JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Pillar, Chennai -83. Landmark: Next to Kotak Mahendra Bank. Pondicherry Office: JP INFOTECH, #45, Kamaraj Salai, Thattanchavady, Puducherry -9. Landmark: Next to VVP Nagar Arch. Mobile: (0) 9952649690 , Email: jpinfotechprojects@gmail.com, web: www.jpinfotech.org Blog: www.jpinfotech.blogspot.com Defending Against Collaborative Attacks by Malicious Nodes in MANETs: A Cooperative Bait Detection Approach In mobile ad hoc networks (MANETs), a primary requirement for the establishment of communication among nodes is that nodes should cooperate with each other. In the presence of malevolent nodes, this requirement may lead to serious security concerns; for instance, such nodes may disrupt the routing process. In this context, preventing or detecting malicious nodes launching grayhole or collaborative blackhole attacks is a challenge. This paper attempts to resolve this issue by designing a dynamic source routing (DSR)-based routing mechanism, which is referred to as the cooperative bait detection scheme (CBDS), that integrates the advantages of both proactive and reactive defense architectures. Our CBDS method implements a reverse tracing technique to help in achieving the stated goal. Simulation results are provided, showing that in the presence of malicious-node attacks, the CBDS outperforms the DSR, 2ACK, and best-effort fault-tolerant routing (BFTR) protocols (chosen as benchmarks) in terms of packet delivery ratio and routing overhead (chosen as performance metrics).
Views: 654 jpinfotechprojects
Discovering Emerging Topics in Social Streams via Link-Anomaly Detection
 
10:01
To get this project in ONLINE or through TRAINING Sessions, Contact:JP INFOTECH, Old No.31, New No.86, 1st Floor, 1st Avenue, Ashok Pillar, Chennai -83. Landmark: Next to Kotak Mahendra Bank. Pondicherry Office: JP INFOTECH, #45, Kamaraj Salai, Thattanchavady, Puducherry -9. Landmark: Next to VVP Nagar Arch. Mobile: (0) 9952649690 , Email: jpinfotechprojects@gmail.com, web: www.jpinfotech.org Blog: www.jpinfotech.blogspot.com Discovering Emerging Topics in Social Streams via Link-Anomaly Detection using JAVA. We have used Real time Twitter data and Twitter account with Trends and Tweets made.
Views: 925 jpinfotechprojects
PACK: Prediction-Based Cloud Bandwidth and Cost Reduction System
 
08:10
To get this project in ONLINE or through TRAINING Sessions, Contact: JP INFOTECH, 45, KAMARAJ SALAI, THATTANCHAVADY, PUDUCHERRY-9 Landmark: Opposite to Thattanchavady Industrial Estate, Next to VVP Nagar Arch. Mobile: (0) 9952649690 , Email: jpinfotechprojects@gmail.com, web: www.jpinfotech.org Blog: www.jpinfotech.blogspot.com PACK: Prediction-Based Cloud Bandwidth and Cost Reduction System In this paper, we present PACK (Predictive ACKs), a novel end-to-end traffic redundancy elimination (TRE) system, designed for cloud computing customers. Cloud-based TRE needs to apply a judicious use of cloud resources so that the bandwidth cost reduction combined with the additional cost of TRE computation and storage would be optimized. PACK's main advantage is its capability of offloading the cloud-server TRE effort to end clients, thus minimizing the processing costs induced by the TRE algorithm. Unlike previous solutions, PACK does not require the server to continuously maintain clients' status. This makes PACK very suitable for pervasive computation environments that combine client mobility and server migration to maintain cloud elasticity. PACK is based on a novel TRE technique, which allows the client to use newly received chunks to identify previously received chunk chains, which in turn can be used as reliable predictors to future transmitted chunks. We present a fully functional PACK implementation, transparent to all TCP-based applications and network devices. Finally, we analyze PACK benefits for cloud users, using traffic traces from various sources.
Views: 1577 jpinfotechprojects
Back-Pressure-Based Packet-by-Packet Adaptive Routing in Communication Networks
 
03:52
To get this project in ONLINE or through TRAINING Sessions, Contact: JP INFOTECH, 45, KAMARAJ SALAI, THATTANCHAVADY, PUDUCHERRY-9 Landmark: Opposite to Thattanchavady Industrial Estate, Next to VVP Nagar Arch. Mobile: (0) 9952649690 , Email: jpinfotechprojects@gmail.com, web: www.jpinfotech.org Blog: www.jpinfotech.blogspot.com Back-Pressure-Based Packet-by-Packet Adaptive Routing in Communication Networks Back-pressure-based adaptive routing algorithms where each packet is routed along a possibly different path have been extensively studied in the literature. However, such algorithms typically result in poor delay performance and involve high implementation complexity. In this paper, we develop a new adaptive routing algorithm built upon the widely studied back-pressure algorithm. We decouple the routing and scheduling components of the algorithm by designing a probabilistic routing table that is used to route packets to per-destination queues. The scheduling decisions in the case of wireless networks are made using counters called shadow queues. The results are also extended to the case of networks that employ simple forms of network coding. In that case, our algorithm provides a low-complexity solution to optimally exploit the routing--coding tradeoff.
Views: 1184 jpinfotechprojects
Dynamic Control of Coding for Progressive Packet Arrivals in DTNs
 
07:19
To get this project in ONLINE or through TRAINING Sessions, Contact: JP INFOTECH, 45, KAMARAJ SALAI, THATTANCHAVADY, PUDUCHERRY-9 Landmark: Opposite to Thattanchavady Industrial Estate, Next to VVP Nagar Arch. Mobile: (0) 9952649690 , Email: jpinfotechprojects@gmail.com, web: www.jpinfotech.org Blog: www.jpinfotech.blogspot.com Dynamic Control of Coding for Progressive Packet Arrivals in DTNs In Delay Tolerant Networks (DTNs) the core challenge is to cope with lack of persistent connectivity and yet be able to deliver messages from source to destination. In particular, routing schemes that leverage relays' memory and mobility are a customary solution in order to improve message delivery delay. When large files need to be transferred from source to destination, not all packets may be available at the source prior to the first transmission. This motivates us to study general packet arrivals at the source, derive performance analysis of replication based routing policies and study their optimization under two hop routing. In particular, we determine the conditions for optimality in terms of probability of successful delivery and mean delay and we devise optimal policies, so-called piecewise-threshold policies. We account for linear block-codes and rate less random linear coding to efficiently generate redundancy, as well as for an energy constraint in the optimization. We numerically assess the higher efficiency of piecewise-threshold policies compared with other policies by developing heuristic optimization of the thresholds for all flavors of coding considered.
Views: 346 jpinfotechprojects