Published in 2016
Charles Vijay, R.Saranya
Now-a-days security is a necessary component for every infrastructure due to increase in hacking activities. Many approaches have been used to improve the efficiency of security systems. To make the process even better, the One Time Dynamic Persuasive Cued Click-Point (OTD-PCCP) graphical password scheme is proposed. This paper proposes the selection of password in a powerful secure space, where greater security is assured. In order to improve the security, the password selection utilizes the click-based graphical passwords that allow the users to choose their passwords randomly. The security and the usability of the proposed system are assessed thoroughly. A sequence of images is selected and those images are split in grid format. Split regions are then numbered in any random order. When the user attempts to login, the system generates a One-Time Password (OTP). Received OTP are numbers that represent the indexed region of the image. Clicking on the same indexed region with respect to the received OTP make the user authentic.
One Time Dynamic- Persuasive Cued Click-Point , One Time Password, Graphical passwords, authentication, persuasive technology,security.
N.Saritha, M.Aruna
Extracting information from semi structured documents is a very hard task, and is going to become more and more critical as the amount of digital information available on the internet grows. Indeed, documents are often so large that the dataset returned as answer to a query may be too big to convey interpretable knowledge. In this work we describe an approach based on Tree-based Association Rules (TARs) mined rules, which provide approximate, intentional information on both the structure and the contents of XML documents, and can be stored in XML format as well. This mined knowledge is later used to provide: (i) a concise idea – the gist – of both the structure and the content of the XML document, (ii) quick, approximate answers to queries and (iii) output without redundancy, null tags and empty tag. In this work we focus on the second and third feature. A prototype system and experimental results demonstrate the effectiveness of the approach.
XML, approximate query-answering, data mining, intentional information.
M.P.Farha Jamal, M.Aruna
In recent years in order to access the persistent block storage devices i.e. virtual disks Block-level cloud storage (BLCS) could be used. By using this users and applications access those type of devices and used those as a raw physical disks. This survey discusses ENIGMA architecture which is used as the back-end of BLCS systems. The ENIGMA able to provide adequate levels of access and transfer performance, availability, integrity, and confidentiality, for the data it stores. ENIGMA provides LT rate less codes to store fragments on storage nodes which should be organized in clusters. The various ENIGMA system parameters quantitatively affect the performance, availability, integrity, and confidentiality of virtual disks. The analytical modeling evaluation could be done by measuring availability, integrity and confidentiality and discrete event simulation could be done by measuring the performance and by considering a set of realistic operational scenarios. The ENIGMA system useful to simultaneously achieve all the objectives set for BLCS systems. The careful choice of the various system parameters is crucial to achieve a good compromise among them. The LT codingbased BLCS systems outperform traditional BLCS systems in all the aspects.
Cloud storage, rate less codes, availability, confidentiality, integrity, performance
S.Revathi, N.Poongothai
In heterogeneous datasets while used matching instances state-of-the-art instance matching approaches do not perform well. From the central part operation on direct matching these disadvantages should be generated. The direct matching involves a direct connection between instances at the source dataset and instances at the target dataset. If the overlap between the datasets is minimum direct matching is not applicable for that type of application. The big aim of this survey is resolving this problem by proposing a new paradigm called semantic similarity matching. The class of interest is defined as a class of instances from the source dataset. The class-based matching is defined as a set of candidate matches retrieved from the target. Measuring the semantic similarity between words is an important component in various web applications they are relation extraction, community mining, document clustering, and automatic metadata extraction. The usefulness of semantic similarity measures in these applications, accurately measuring semantic similarity between two words or entities. This survey proposes an empirical method to estimate semantic similarity using page counts and text snippets. Both should be retrieved from a web search engine for two words. The various word co-occurrence measures using page counts should be integrated with lexical patterns those should be extracted from text snippets. To identify the numerous semantic relations between two words a novel pattern extraction algorithm and a pattern clustering algorithm should be introduced. The proposed method outperforms various baselines compared to previously proposed SERMI approach on three benchmark data sets showing a high correlation with human ratings. Moreover, the proposed method significantly improves the accuracy in a community mining task.
Data integration, class-based matching, direct matching, instance matching, semantic web
T.Sathya, T.Krishnan, T.Laksmanakumar
Password-based authentication schemes have been widely deployed to verify the legitimacy of remote users. Smart card-based user authentication technology has been widely deployed in various kinds of applications, such as remote host login, withdrawals from automated cash dispensers, and physical entry to restricted areas. The above mentioned scheme can create parallel session attack, masquerading attack and password guess attack. In any type of communications in order to share sensitive information between 2 or more entities remote authentication could be used. This process contains three sub functions. The first sub function is the encryption of finger print image i.e change the original image into chaotic image then converts encrypted chaotic image into set of vectorized value. The second sub function is the taking human object from the playing video or teleconferencing. Then third function is the merging those vector value into the extracted video object. Trojan horse and other those types of attacks could be mostly created in cases of remote examinations or in or in personnel hiring which may create serious pressure. This survey proposes a robust remote authentication mechanism via enhanced biometric based on semantic segmentation, chaotic encryption and data hiding and wireless transfer at the sender side. The wireless data receive; object recovery and quality enhancement and interview are the receiver side function. Remote authentication is a method to authenticate remote users over insecure communication channel.
Biometrics Hiding, Steganographic System, Remote Authentication, Biometrics
R.Vaishnavi, N.Poongothai
E-Learning Management System is a web based Learning Management System that helps students to interactively learn a new course, allow course experts to learn new courses on different subjects. The purpose of this E-Learning Management System project is to develop a front-end application for e-learning applications and queries using graphical user interface. It delivers its data so that each analysis application can receive only the information it needs and in the format required. In response to individual needs, personalization in education not only facilitates students to learn better by using different ways to create various learning experiences. However, an important consideration is often being ignored or overlooked in accomplishing a personalized E-learning framework. This consideration concerns all people understanding about source document and learning system influence how individuals want and intend to learn online. Indeed, each participant learning style allows him to learn better and to ignore ineffective online learning solutions. Most of the learners prefer some kind of interacting with, taking in, and processing stimuli or information or simply using a visual medium. In order to learn effectively and efficiently, learner has to be aware of his preferences which make easy to manage his own way of learning. This information will enable the learner to improve the effectiveness of its approach to learning and to exploit its own resources.
E-learning, fuzzy sets, knowledge-based recommendation, recommender systems, tree matching.
T. Ramaprabha, M.Karthika
Mobile Ad-hoc Networks are type of wireless network which are infrastructure less, self organizing, highly mobile and quickly deployable. There is no central authority, the communication occur hop by hop based on cooperation among the nodes. It is vulnerable to attacks from malicious nodes since there is no centralized administration and security and hence the qualities of overall networks are also easily affected. As the network is wireless, security becomes the major issue in Mobile Ad hoc Networks. Some of the attacks such as modification, fabrication, impersonation and denial of service attacks are due to misbehavior of malicious nodes, which disrupts the transmission. Thus, secure routing protocols are needed which are robust and ensure that the nodes in the network behave in trustworthy manner otherwise detect and eliminate the untrustworthy nodes which degrade the overall performance. In this paper, we have given a survey of trust based AODV, in which, trust is used to ensure secure routing and improved network performance.
Mobile ad hoc network (MANET), AODV Routing protocol, Secure AODV, Trust based AODV.
V.Dhinakari, R.NallaKumar, L.S.Santhoshkumar
Sharing information with a large number of participants must take into account several issues, including eff iciency, data integrity and privacy of data owner. Visual less key BASED Forward ID Ring signature is a promising cand idate to construct an anonymous and authentic data sharing system. The existing survey proposes an Identity Based forward secure ring signature scheme which works under without random oracles. The special factor of forward secu rity is if a secret key of a corresponding ring member is exposed to the other person means, all previously signed sign atures of this member remains valid. If the attacker has stolen the secret key he/she cannot identify any valid signatu re generated on the past time period by the valid user. This factor is especially useful in the case of ring signature sch eme. The exposure of a single secret key to the attacker may make invalidity in thousands or even millions ring signa tures which belongs to that particular user. Because most of the ring signature schemes in the literature does not co ntain forward security. Existing scheme relies on random oracles to prove the security in ring signature scheme. This survey first interest to construct a forward secure ring signature scheme that can be provide secure without using ra ndom oracles. In a wireless sensor networks and smart grid system this scheme may be deployed where more numb er of users is working. In addition to the existing module namely forward ID Based Ring signature scheme the visual l ess key concept could be introduced in a proposed system. In this module the cellular key should be created and the n the ring signature size should be created. The ring signature size should be increased. The original file should be co nverted into the visual less key file and it could be segmented and stored into the multiple locations. The big advanta ge is that Based on both public and private key. The visual less key concept adds additional security. The original file recovery process include more recovery process it is difficult for an attacker to guess
Authentication, data sharing, cloud computing, forward security, smart grid
M.Niveditha, K.Sivachandran
This paper explains the problem of determinizing probabilistic data which takes only un deterministic input. While accepting those types of un deterministic input data the legacy systems stores those type of data. The automated data analysis/enrichment techniques generate probabilistic data. These techniques are entity resolution, information extraction, and speech processing. The legacy application system may correspond to the existing web applications like Flicker, Picasa, etc. The goal of this survey is to generate a deterministic representation of probabilistic data which optimizes the deterministic data quality on the end-application. Those determinization problems should be deployed in the area of two different data processing tasks they are triggers and selection queries. The top-1 selection techniques are traditionally used for determinization problem which create suboptimal performance for many applications. Instead this survey proposes a query-aware strategy and explains its advantages over existing solutions through a comprehensive empirical study over real and synthetic datasets. We propose a probabilistic topic model for analyzing and extracting content-related annotations from noisy annotated discrete data such as web pages stored in social bookmarking services. In these services, since users can attach annotations freely, some annotations do not describe the semantics of the content, thus they are noisy, i.e. not content-related. The extraction of content-related annotations can be used as a preprocessing step in machine learning tasks such as text classification and image recognition, or can improve information retrieval performance. The proposed model is a generative model for content and annotations, in which the annotations are assumed to originate either from topics that generated the content or from a general distribution unrelated to the content. We demonstrate the effectiveness of the proposed method by using synthetic data and real social annotation data for text and images.
Determination, uncertain data, data quality, query workload, branch and bound algorithm
M.Tharani, K.Sivachandran, T.Lakshmana kumar
In large scale sensor networks contain various applications and domains. The data composed from wireless sensor network are used under making decisions in critical infrastructures. Data’s are generated from multiple sources those are transmitted through intermediate processing nodes. The aggregation function should be performed by the intermediate nodes. An attacker compromise those type of intermediate nodes by introducing additional attacking nodes in the network or compromising the existing nodes in the network. So achieving the high data trustworthiness is critical for correct decision-making. The provenance management challenges in sensor networks are consumption of low energy and low bandwidth consumption. This survey introduces a new lightweight scheme in order to securely transmit sensor data with provenance. The in-packet Bloom filters techniques used to encode provenance with the sensor data. This mechanism initially performs provenance at the source then perform restoration of the data at the destination. The provenance scheme functionality used to detect packet drop attacks organized by malicious intermediate data forwarding nodes. This survey describes the effectiveness and efficiency of the Light weight secure provenance scheme in detecting packet forgery and packet loss attacks through In Network Aggregation scheme. This scheme reduces the energy cost of processing in wireless sensor networks also there is no currently solution providing both integrity and confidentiality. Moreover, existing solutions allow only limited data transfer from 15MB to 25MB.So they have limited applicability to certain types of application. Recently, research has focused on secure exact in-network aggregation. Secure Exact In Network Aggregation use multi path approach. Secure Exact In Network Aggregation increase the data rate of data transfer up to 2GB from 25 MB based on the tree based approach .This approach perform aggregation by constructing an multipath, which could be a minimum spanning tree, rooted at sink and source nodes are considered as leaves. Each node has a parent node to forward its data. Flow of data starts from leaves nodes up to the sink and therein the aggregation done by multi path start from failed nodes rather at source node.
Provenance, security, sensor networks, Packet drop attack, Wireless Sensor Networks, Provenance attack.
S.N.Saranya, P.Thilagavathi, M.Suguna
In the advanced cloud computing world Data sharing has never been easier task. Data communication with a large number of participants must take into account several issues, including efficiency, data integrity and privacy of data owner. Cellular automata image is a promising candidate to construct an anonymous and authentic data sharing system. The segmented allows a data owner to anonymously authenticate his data which can be put into the different places of 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. Forwarded Identity-based (IDbased) ring signature which eliminates the process of certificate verification, can be used instead. In this paper, we further enhance the security of Forwarded ID-based ring signature by providing with segmented cellular automata scheme. If a secret key of any user has been compromised, all previous generated segments that include with a 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 re authenticate 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.
Authentication, data sharing, cloud computing, forward security, smart grid.
M.Gomathy, G.Rajasekaran
Spatial Data is the data that has geographic location of features and retrieving the space related information. In existing, RKBSK (Reverse top-k Boolean Spatial Keyword query) algorithm is used to retrieve the exact query. The filter and refinement technique is used to satisfy the keyword constraint. The Spatial information is taken into the consideration and textual information is inefficient and no pre computation in existing. In proposed system, Score based spatial query and count tree algorithm is used in the agriculture application. The Score based spatial keyword query is used to retrieve and measures the combination of distance of the query location and the relevance of their textual descriptions to the query keywords. The count tree algorithm is used for the indexing purpose. When the user is giving the location name and the co-ordinates the user is provided with a growth of crops.
Reverse top k Boolean spatial keyword query, Count Tree, Score based spatial query, K nearest neighbour, Boolean spatial retrieval query
S.Dhivya, Dr A.Ezil Sam Leni
Web service composition is an aggregate of service collectively composed to automate a particular task for business process. In existing system, searching composition service gets the user requirement, when the data is transferred and consumed by target service the data misinterpretation will occur. BPEL(Business Process Execution Language) manually detect conflict and fulfill requirements of the user and produce corresponding output .In proposed system the banking system is used which consists of different type of web services namely, travel booking service, ticket booking service and online shopping service , hotel booking service. In the services commonly faced conflict is representation conflicts such as date format, shortcuts used in providing information, different units of currency, length, weight. These are the conflicts that occur in the banking service and they are detected and recovered automatically using reconciliation algorithm .then the recovered web services are composed using BPEL4WS(business process executive language 4 web service) process and provide valid service to the user.
BPEL, BPEL4WS, Banking System Service
Dr T.Ramaprabha, V.Premalatha
Mobile ad hoc networks (MANETs) are autonomously self-organized networks without infrastructure support. In a mobile ad hoc network, nodes move arbitrarily; therefore the network may experience rapid and unpredictable topology changes. Because nodes in a MANET normally have limited transmission ranges, some nodes cannot communicate directly with each other. Hence, routing paths in mobile ad hoc networks potentially contain multiple hops, and every node in mobile ad hoc networks has the responsibility to act as a router. In this paper, we survey of routing protocols for MANET.
MANETs, Proactive, Reactive and Hybrid Routing Protocols.
Dr Ananthi Sheshasaayee, Roby Jose
Aspect Oriented Software Development is gaining wide attention because of its ability to support modularization. The modularization is achieved in aspect Oriented paradigm by the feature separation of concerns that are scattered over the system. Aspect Oriented Software Development takes in software abstractions at new dimensions. Since this is a new paradigm more studies are required to arrive at models that assess the external quality attributes. For the predecessor, object oriented technology; studies have proven that the software metrics are capable of predicting maintainability. So for assessing the maintainability of aspect oriented systems product metrics based models can be employed. This paper attempt to figure out metrics that can be used to build the maintainability model of the aspect oriented software.
Aspect Oriented metrics, Aspect Oriented Programming, Maintainability metrics, Software maintenance, Software Product metrics.
Dr.P.Sumitra, P.Kaladevi, K.Anitha
Cloud computing is growing popular as day by day in distributed computing environment. Cloud computing provides applications, platforms and infrastructure over the internet. It is a new era of referring to access shared computing resources. Wireless sensor networks have been seen as one of the most essential technologies where they distributed spatially connected sensor node automatically forms a network for data transmission and receive among themselves is popularly known as Sensor Network. For security and easy access of data, cloud computing is widely used in distributed or mobile computing environment. Wireless sensor network (WSN) is widely applied in many fields and it has limited resources of a sensor, especially limited battery life, limited bandwidth and limited processing power, are the main challenges for deploying and operating WSNs.
wireless sensor network, Data Centric Network, Cloud Computing, Sensor Node, Routing Protocols
N.Boomathi, K.S.Saravanan, B.Nathiya, N.Kohila
Mobile Ad hoc Network (MANET) is a collection of wireless mobile nodes that dynamically form a network temporarily without any support of central administration. Extensive use of wireless networks in different fields increases the need to improve their performance, as well as minimize the amplitude of loss messages. Device mobility, where there is no standard topology that can be applied or fixed routing that can be designed, is a topic that received recent attention in wireless networks. Every node in MANET moves arbitrarily making the multi-hop network topology to change randomly at unpredictable time. Mobile ad-hoc network (MANET) is one of the most promising fields for research and development of wireless network. This paper, we analyze a MANET’s performance for protocols, Manet applications and their attacks
MANET, AODV, OLSR, ZPR
M.Karthika, N.Kowsalya
A number of ad hoc routing protocols of vehicular ad hoc network (VANET) have been proposed and evaluated based on mobile ad hoc network (MANET) routing protocols. Although a large number of routing protocols have been developed in MANET, the VANET has different environments such as highly dynamic topology, frequently disconnected network, hard delay constraints for safety-related application, and various communications environments (e.g., highway or urban traffic scenarios). Therefore, development of a suitable routing protocol that considers these characteristics of VANET should be needed. In this paper we describe and comparing the Stable Routing, Connectivity-Sensed Routing and A Lightweight Neighbor-Info-Based Routing in VANET.
Routing, Protocol, VANET, V2V, V2I.