Published in 2016
S.Gomathi, D.Gandhimathi
Educational Data Mining (EDM) is a research area which includes the student learning methodology. EDM helps to develop the student learning software in the field of education. The software which is developed for student learning environment helps to achieve best learning practices and modifies the usual learning trends. This analysis of educational data mining application provides various objective of learning environment system and explores the research about EDM approaches.
EDM, EDM applications, Student learning environment.
Dr.P.Sumitra, P.Kaladevi
Web applications are accessed by millions of users over the internet via common web browser software. Cloud based virtualized services are used to support resources for web applications. Web application workloads are migrated to cloud environment to utilize the resources.web/application server, load-balancer and database are transferred from the local data center to the selected cloud infrastructure. Cloud service provider’s offers computational services and Virtual Machine (VM) images for information systems. CloudGenius framework is constructed to handle process migration from web applications into public cloud resources. CloudGenius provides migration support for multi- component web applications. Evolutionary migration process for web application clusters is distributed over multiple locations. Parallel Genetic Algorithm (PGA) is applied to select migration solutions. CumulusGenius is an implementation support for CloudGenius framework.
CloudGenius, CumulusGenius, Analytical Hierarchy Process, Parallel Genetic Algorithm, Virtual Machine
N.Kowsalya, M.Karthika
Vehicular Ad hoc Network (VANET) is constructed with vehicles and road side infrastructures. Vehicle location and speed information are continuously collected to manage the VANET communication. Multi hop broadcasting schemes are used to disseminate safety messages. Forwarder node manages the data transmission process in multi-hop broadcasting protocols. Forwarder node selection process is carried out with reference to the waiting time details. Robust and Fast Forwarding (ROFF) protocol solves the unnecessary delay and collusion issues in data dissemination process. Empty Space Distribution (ESD) bitmap describes the distribution of empty spaces between vehicles. A forwarder candidate acquires its forwarding priority using the concept of ESD bitmap. Collisions are avoided by control the waiting time differences than the predefined lower bound. The Robust and Fast Forwarding (ROFF) protocol is integrated with Trajectory based MultiCast (TMC) protocol for data dissemination process.
VANET, Multicasting, ESD map, ROFF,TMC
Dr.G.Kesavaraj, K.Anitha
A data services in the cloud, users can easily modify and share data as a group. To ensure data integrity can be audited publicly, users need to compute signatures on all the blocks in shared data. Different blocks are signed by different users due to data modifications performed by different users. For security reasons, once a user is revoked from the group, the blocks, which were previously signed by this revoked user must be re-signed by an existing user. The straightforward method, which allows an existing user to download the corresponding part of shared data and re-sign it during user revocation, is inefficient due to the large size of shared data in the cloud. In this paper, we propose a novel public auditing mechanism for the integrity of shared data with efficient user revocation in mind. By utilizing proxy re-signatures, we allow the cloud to re-sign blocks on behalf of existing users during user revocation, so that existing users do not need to download and re-sign blocks by themselves. In addition, a public verifier is always able to audit the integrity of shared data without retrieving the entire data from the cloud, even if some part of shared data has been re-signed by the cloud.
Anony control, Anony Control- F, DiffeHellman assumption,Data access control
B.Nathiya, N.Kohila
Sensor devices are used to collect the environment information. Wireless Sensor Network (WSN) is constructed with a set of data collection units. Base station, sinks and sensor devices are used in the WSN. Power resources, bandwidth and storages are the limitations of the sensor devices. Sink nodes are used to collect data from a group of sensor devices. Many to one traffic pattern based data collection model increases the transmission load to a set of nodes. The traffic pattern based network load problem is referred as hotspot problem. Energy efficient communication protocols and multi-sink systems are used to handle hotspot problems. Static and mobility based sink placement schemes are used to handle data collection process. Mobile sinks are used to increase the network lifetime with delay constraints. Random mobility and controlled mobility models are used in the mobile sinks. In random mobility the sinks are moved randomly within the network. The sinks are deterministically moved across the network is referred as controlled mobility. The network lifetime is managed with the number of nodes and delay values. The Delay bounded Sink Mobility (DeSM) problem is initiated under sensor node allocation to sinks. A polynomial-time optimal algorithm is used for the origin problem. Extended Sink Scheduling Data Routing (E-SSDR) algorithm is used to schedule sink nodes.
Multi Sink Node, Energy Efficient, Wireless Sensor Network, Data Routing
K.S.Saravanan, N.Boomathi
Vehicular Ad-hoc Networks (VANET) are constructed to manage the communication between the vehicles. Vehicle to Vehicle (V2V) and Vehicle to Infrastructure (V2I) communication methods are supported under the VANET environment. In cryptography, a message authentication code (MAC) is a short piece of information used to authenticate a message—in other words, to confirm that the message came from the stated sender (its authenticity) and has not been changed in transit (its integrity).On Board Unit and Road Side Infrastructure (RSI) are used to carry out the communication process. In vehicular networks, broadcast communications are critically important, as many safety-related applications rely on single-hop beacon messages broadcast to neighbor vehicles. However, it becomes a challenging problem to design a broadcast authentication scheme for secure vehicle-tovehicle communications. Especially when a large number of beacons arrive in a short time, vehicles are vulnerable to computation-based Denial of Service (DoS) attacks that excessive signature verification exhausts their computational resources.
Vehicular Ad-hoc Networks, Message Authentication code, Denial of Service
K.Ranjitha, M.Jothilakshmi
Mobile Ad hoc Network (MANET) is a collection of mobile nodes equipped with both a wireless transmitter and a receiver that communicate with each other via bidirectional wireless links either directly or indirectly. The Proposed System is designed to resolve the weakness of Watchdog when it fails to detect misbehavior nodes with the presence of false misbehavior report. The core of MRA scheme is to authenticate whether the destination node has received the reported missing packet through a different route. The proposed IDS algorithm maintains the list of all the nodes which send the route reply to the source with sequence number greater than the threshold value. The source route broadcasts an RREQ message to all the neighbors within its communication range. Upon receiving this RREQ message, each neighbor appends their addresses to the message and broadcasts this new message to their neighbors. If any node receives the same RREQ message more than once, it ignores it. If a failed node is detected, which generally indicates a broken link in When the RREQ message arrives to its final destination node, the destination node initiates an RREP message and sends this message back to the source node by reversing the route in the RREQ message. The performance of nodes transfer source to destination is high quality.
MANET, MRA, IDS, RREQ.
Dr.T.Ramaprabha, V.Premalatha
A Vehicular Ad-Hoc Network is a form of mobile ad hoc network, which provide communications among nearby vehicles and nearest fixed equipment, like traffic sensor. Vehicular network act as an infrastructure to transfer the data between vehicles. Road Side Unit acts as a base station to deliver the data about the path to the vehicles using Diffie-Hellman key exchange algorithm.The Diffie-Hellman Key Exchange is one of the more popular and interesting methods of key distribution. It is a public-key cryptographic system whose sole purpose is for distributing keys and avoiding attackers.It gives high level security and more energy efficient data transmission on the network. Diffie-Hellman key exchange is used to find out another route quickly in case of false route. Diffie-Hellman algorithm can be used to recover the failure nodes. In this paper, we improve the performance and good delivery ratio and we do several processes like throughput, network performance, reliability over VANET.
VANET, RSU, OBU Security, Privacy.
K.Ayesha, V.Priya
Mobile ad-hoc networks are constructed without the infrastructure. All the MANET operations are planned with the consideration of the energy and bandwidth limitations. Cooperative communication utilizes nearby terminals to relay the overhearing information to achieve the diversity gains and improve the transmitting efficiency in wireless networks. Cooperative Medium Access Control (CMAC) protocol is constructed to achieve the medium access interactions with relay model. We propose DEL-CMAC that focuses on the network lifetime extension, which is a less explored aspect in the related work. By considering the overheads and interference due to cooperation, as well as the energy consumption on both transceiver circuitry and transmit amplifier, DEL CMAC can significantly prolong the network lifetime.A distributed energy-aware location-based best relay selection strategy is incorporated, which is more reasonable for MANETs comparing with the existing schemes based on channel condition.
MANET, CMAC, DEL-MAC
Dr.G.Kesavaraj, N.Jeevitha
The firewall is one amongst the central technologies permitting high-level access management to organization cloud knowledge networks. Cloud knowledge matching in firewalls involves matching on several fields from the info header. A minimum of 5 fields (protocol variety, supply and destination information processing addresses, and ports) are concerned within the call that rule applies to a given cloud knowledge. Since firewalls ought to filter all the traffic crossing the cloud sharing network perimeter, they must be able to sustain a really high outturn, or risk changing into a bottleneck. Thus, algorithms from process pure mathematics are applied. During this paper we have a tendency to contemplate a classical rule that we have a tendency to tailor to the firewall domain. We have a tendency to decision the ensuing rule “Geometric economical Matching” (GEM). The GEM rule enjoys an exponent matching time performance. Cloud computing could be a new versatile approach for providing higher process power in shared medium. It provides the distributed model supported self-evaluating techniques to enhance the process capabilities of the system with lesser social control issues. This computing model delivers computation capabilities as a calculated service from on top of parts to finish users. Although a good style of devices and their integration are involved, priority of handling security can go down. Implementing firewall for cloud suffers from varied network homeward-bound challenges like load equalization, scheduling, traffic divergence, filtering, dominant the speed of arrival, instance management, attack detection. It additionally aims toward achieving the resource optimizing based mostly provisions and rules to lower the worth related to its possession and operations.
Cloud computing, firewall, GEM.
V.Shanmugapriya, Dr.D.Maruthanayagam
We have entered the big data era. Organizations are capturing, storing, and analyzing data that has high volume, velocity, and variety and comes from a variety of new sources, including social media, machines, log files, video, text, image, RFID (Radio Frequency Identification), and GPS (Global Positioning System). These sources have strained the capabilities of traditional relational database management systems and spawned a host of new technologies, approaches, and platforms. Big data is data that exceeds the processing capacity of traditional databases. The data is too big to be processed by a single machine. New and innovative methods are required to process and store such large volumes of data. This paper presents an overview of Big Data, Big Data Analytics and Big Data technologies, Hadoop Distributed File System and MapReduce.
Big Data, database, Hadoop, MapReduce and HDFS
P.Vinothini, M.Jothilakshmi
Personalized web search (PWS) has demonstrated its effectiveness in improving the quality of various search services on the Internet. However, evidences show that users’ reluctance to disclose their private information during search has become a major barrier for the wide proliferation of PWS. This paper analysis a privacy protection in PWS applications that model user preferences as hierarchical user profiles. This paper proposes a PWS framework called UPS that can adaptively generalize profiles by queries while respecting user-specified privacy requirements. The proposed runtime generalization aims at striking a balance between two predictive metrics that evaluate the utility of personalization and the privacy risk of exposing the generalized profile. The paper presents a greedy algorithm, namely Enhanced GreedyIL, for runtime generalization. It also provides an online prediction mechanism for deciding whether personalizing a query is beneficial.
Personalized web search, profile, Catch base Search Tree, Fusion Re-ranking Algorithm, Security privacy.
Dr.T.Ramaprabha, M.Karthika
Link error and malicious packet dropping are two sources for packet losses in wireless ad hoc network. While observing a sequence of packet losses in the network, we are interested in determining whether the losses are caused by link errors only, or by the combined effect of link errors and malicious packet drop. Because the packet dropping rate in this case is comparable to the channel error rate, conventional algorithms that are based on detecting the packet loss rate cannot achieve satisfactory detection accuracy. To improve the detection accuracy, we propose to exploit the correlations between lost packets. In this paper, we develop a Homomorphic Linear Authenticator (HLA) based public auditing architecture that allows the detector to verify the truthfulness of the packet loss information reported by nodes. This construction is privacy preserving, collusion proof, and incurs low communication and storage overheads. To reduce the computation overhead of the baseline scheme, a packet-block-based mechanism is also proposed. In this paper, we improve the performance and good delivery ratio like throughput ratio, end to end delay ratio and Packet loss ratio in over wireless Adhoc network.
Wireless Ad-hoc Network (WANET), Packet dropping, secure routing, attack detection, Homomorphic Linear Authenticator (HLA), public auditing.
R.Anupriya, V.P.Muthukumar
This article considers the matter of packet planning for localization in associate underwater acoustic sensing element network wherever sensing element nodes are distributed haphazardly in associate in operation space. Our goal is to attenuate the localization time, and to try and do therefore we have a tendency to think about 2 packet transmission schemes, specifically collision-free, and collision-tolerant. The required localization time is formulated for these schemes, and through analytical results and numerical examples their performances are shown to be generally comparable. the packet duration is short (as is the case for a localization packet), the operating area is large (above 3 km in at least one dimension), and the average probability of packet-loss is not close to zero, the collision-tolerant scheme is found to require a shorter localization time. This is a reasonable assumption because anchors are usually located on the surface and can be equipped with a GPS. An iterative Gauss-Newton algorithm is employed by each sensor node for self-localization, and the Cramér Rao lower bound is evaluated as a benchmark.
Underwater acoustic networks, localization, packet scheduling, collision tollerant.
S.Poornima, S.Kavitha, M.Surya
With the Internet architecture changing from host-centric communication model to content-centric model, Content Centric Networking (CCN) has emerged. One distinctive feature of CCN infrastructure is in-networking caching. As cache capacities of routers are relatively small compared with delivered data size, one challenge of innetworking caching is how to efficiently use the cache resources. In this paper, we proposed a cluster-based innetworking caching mechanism to improve the cache hit ratio and reduce caching redundancy for CCN. We designed the improved K-medoids cluster algorithm to cluster the whole network into k clusters and Virtual Distributed Hash Table (VDHT) to efficiently control and manage the resources stored in each cluster. We also proposed different policies for intra cluster routing and inter cluster routing to effectively forwarding requests. Compared with representative on-path caching schemes and hash scheme by simulation, we concluded that our cluster- based innetworking caching mechanism can improve the cache hit ratio and reduce link load of networks.
Content-Centric Networking, In-networking Caching, Cluster Cache Diversity.
S.Muruganandham, M.Surya
The reliability of data delivery is a major concern in Low power Lossy Networks as they are deployed of devices of low energy, processing power and memory. The limitations of these devices leads to the dynamicity of the network.RPL is the routing protocol developed for these networks by the ROLL, working group of IETF. RPL is based on Destination Oriented Direct Acyclic Graph (DODAG). DODAGs have more than one path to the destination unlike the normal tree structure. Mac protocol supports the routing protocol to discover paths to the destinations using the link matrices. In our paper, we are comparing the three protocols: SBMAC, RBMAC and a RANDOM protocol on DODAG in terms of performance: drop rate and throughput. SBMAC follows the usual procedure of forwarding data packets depending on the routing table stored within the nodes. RBMAC forwards data packets to the nearby nodes and these nodes are then subjected to a competition to determine the next packet forwarding node. In random method, same procedure of forwarding data packets to the nearby nodes happens, but a random node will be chosen to forward the data packet.
LLNs, SBMAC, RBMAC, DODAG, MAC Protocols
Dr.G.Kesavaraj, R.Divya
Cloud computing delivers convenient, on-demand access to shared pools of data, applications and hardware over the internet. Cloud computing provides unlimited infrastructure to store and execute customer data and program. Due to this redundancy the data can be easily modified by unauthorized users which can be stored in the database. This leads to loss of data privacy and security to database. Extensive security and performance analysis shows that the proposed scheme ensures that cyclic redundancy check and time-tested practices and technologies for managing trust relationships in traditional enterprise IT environments can be extended to work effectively in both private and public clouds. Those practices include data encryption, strong authentication and fraud detection, etc.
cloud storage, cloud security, workflows, reliability
G.Ramya, M.Jothilakshmi
Social media enable promising new approaches to measuring economic activity and analyzing economic behavior at high frequency and in real time using information independent from standard survey and administrative sources. This project uses data from social media to create indexes of job loss, job search and job posting. This project points out that the solution obtained by a greedy algorithm is likely to be trapped in a local optimal solution. Thus, This project design a new randomized algorithm to effectively and efficiently solve the problem. Given the available computational budgets, the proposed algorithm is able to optimally allocate the resources and find a solution with an approximation ratio. This project implement the proposed algorithm in a social networking portal, and the user study demonstrates that social groups obtained by the proposed algorithm significantly outperform the solutions manually configured
Social Networks, Homophiles, Inbreeding Bias, Occupational Segregation, Labor Market Inequality, Social Welfare JEL Classification: J24, J31, J70, Z13
M.Mala
Relevance Feature Discovery (RFD) has been implemented as the next generation architecture of term frequency. In contrast to traditional solutions, where the search in optimizations services are under proper logical and personal controls mechanism. Based on subject-word customizing model, the movement of word meaning creates a personalized searching technology which describes subject-word knowledge. This method Combines multiple meaning of subject words to match and extended. In this proposed work of searching a specific word or sequence of words, or quotations in a large text document is used. It presents a new technique for text document classification using term frequency matrix. Finally the subject word weight is calculated using cosine similarity measure. This work proposes full secure data sharing and access correct person only in implement attribute based access control mechanism to term frequency similarity and Overcome the user revocation problem.
Textmining, Text feature classification, Text classification
Dr.M.Sughasiny
A wireless sensor network can be separated into multiple connected components due to the failure of some of its nodes, which is called a “cut.” Therefore, we consider the problem of detecting cuts by the remaining nodes of a wireless sensor network. We propose a distributed algorithm can be to detect cuts, named the Distributed Cut Detection (DCD) algorithm. This algorithm allows each node to detect DOS events and a subset of nodes and also to detect CCOS events separation and reconnection to the source in mobile networks is a topic of ongoing research. These algorithms are centralized and detect only a linear cut. Therefore we also propose RECDP (Lightweight and Robust Cut Detection Algorithm) protocol that to detect cuts while providing energy-efficiency and robustness to attack. Using distributed, cluster-based algorithms recognizes and determines the scope of disrupted connectivity while examining available data for evidence of an attack. A result indicates that the energy efficiency can be improved by an order of magnitude in denser networks while malicious nodes are detected at variation of 1% from expected behavior
WSN, DCD, DOS, RECDP, Clustering , Energy Efficiency
S.Sivakumar, Dr.D.Maruthanayagam
Grid is a distributed high performance computing paradigm that offers various types of resources (like computing, storage, communication) to resource-intensive user tasks. These tasks are scheduled to allocate available Grid resources efficiently to achieve high system throughput and to satisfy user requirements. Providing guaranteed QoS for Grid services using resource reservation and allocation is an important feature for today’s service Grid. In this paper, we discussed about grid computing, resource reservation in grid and explore some existing resource reservation mechanisms for resource reservation problems employed in Grid systems.
Grid Computing, Resource Management System (RMS), Co-Scheduling, Co-Reservation and CoAllocation.