Siri PSG Arts and Science College for Women - Department Of Computer Science
Dr MN Nachappa, J.Rohini Suzana
As wireless technology has made life much easier.Appcesories has contributed to the sudden emergence
of the multiple wireless devices. Bluetooth being one of the wireless communication technologies has been a boon
to the app store which provide a varied list of apps that support wireless devices that help an individual to keep track
of events on a day to day measure, by just installing an app on their phone. Can life become any easier, well you can
never say the evolution of technology can cease. This article describes those apps that run on mobile phones by
establishing a Bluetooth connection to the Bluetooth wireless devices. The most commonly used devices are
Bluetooth speakers and headphones, but here are some more devices that can keep you awestruck by its
functionalities.
J.Selwyn Paul, D.Ravi Kumar
Mobile ad-hoc network is a very interesting research area. A mobile ad-hoc network consists of nodes
which can move freely. There are intermediate nodes which can communicate between channels. The techniques used in MANET open peer –to-peer network architecture, wireless mediums, network topology. Security challenges have to look into primary concern to provide secure communication. This paper we discuss the various security issues, threats and different measures to handle them.
I.Aruna, K.Manohari
Data streams are generated by many real time systems. Data stream is fast changing and
massive. Traditional methods are not efficient so that many methodologies developed to stream data
processing. Clustering data streams has become an important technique for data and knowledge
engineering. Data stream clustering aims at studying large volumes of data to build a good clustering of the
stream, using a small amount of memory and time. In this paper, we propose StreamOptics algorithm. It
computes augmented cluster ordering for automatic and interactive analysis. This algorithm maintains
proper ordering of the objects in given database and also store the core-distance and reach ability distance
for each object respectively. StreamOptics is extends OPTICS algorithm for data streams using concepts of
micro clusters. Stream algorithm also uses potential micro-cluster and outlier micro-cluster. StreamOptics
algorithm are as follows: first the neighbourhood of each potential micro-cluster is determined than
ordered list of potential micro-clusters is made based by using reachability distance and then produces a
reachability plot that represents the micro-cluster structure using OPTICS algorithm. This algorithm
provides three dimensional plots which show evolution of cluster structure with respect to time.
S. Boopathi, Dr. A.SenthilKumar
Security in Wireless Sensor Networks is the major concern when they are used in military and national applications. Traditional routing protocols are designed for attaining maximum throughput but they cannot guarantee security and reliability.This article presents the study of major security attacks in WSNs and the level of Multipath Secure Reliable Routing's resistance against the security attacks. Different types of security attacks and the counter-measures of MSR to prevent those attacks are presented under three broad categories: Attacks completely prevented by MSR, attacks which can be prevented by reducing their effect and attacks which needs to be handled by different means.
B.Dhivya, Dr.R.Suguna
Wireless link signature is a physical layer authentication mechanism, which uses the unique wireless
channel characteristics between a transmitter and a receiver to provide authentication of wireless channels. A vulnerability of existing link signature schemes has been identified by introducing a new attack, called mimicry attack. To defend against the threat identified in this paper, we develop a new link signature scheme, which is called time-synched (i.e., time synchronized) link signature. Time-synched link signature integrates cryptographic protection as well as time factor into the wireless physical layer features, and provides an effective countermeasure against mimicry attacks. We also perform an extensive set of experimental evaluation of the mimicry attacks and the time-synched link signature scheme on the USRP2 platform running GNU Radio. Our experiments confirm that the mimicry attacks against the previous link signature schemes are a real threat and demonstrate that the newly proposed time-synched link signatures are effective in mitigating those attacks.
P.Brindha, Dr. A. Senthilkumar
Multipath routing techniques does not mask the consequences of security attacks. WSNs are in danger
mode on most of the security attacks even when multipath routing technique is used. In critical situations, for example, in armed and fitness applications this might lead to undesired, dangerous and ruinous effects. These applications need to acquire their data communicated resourcefully and in a secure manner. In this paper, we illustrate the results of a series of security attacks on the multipath extension to the adhoc on-demand distance vector AODV protocol, AOM DV. It is proved that many security parameters are negatively affected by security attacks on AOM DV, which is conflicting to research claims. This capitalize the alternative refinements have to be made on present multipath routing protocols to build them more effective beside network security attacks.
M.Shanmugapriya, S.Mythili
A Mobile Ad Hoc Networks (MANET) is a collection of mobile nodes that can communicate with each other using multihop wireless links without utilizing any fixed based-station infrastructure and centralized management. Each mobile node in the network acts as both a host generating flows or being destination of flows and a router forwarding flows directed to other nodes. Routing is a fundamental problem in mobile ad hoc networks. Multipath routing is a routing technique that is used to find multiple paths between a single source and a single destination. This paper presents an overview of several multipath routing protocols that have been proposed by researchers.
S.Gajapriya, K.Manohari
Twitter Monitor, a system that performs trend detection over the Twitter stream. The system identifies
emerging topics (i.e. ‘trends’) on Twitter in real time and provides meaningful analytics that synthesize an accurate description of each topic. In this paper, we focus on hierarchical spatio-temporal hashtag clustering techniques. Our system has the following features: (1) Exploring events (hashtag clusters) with different space granularity. Users can zoom in and out on maps to find out what is happening in a particular area. (2) Exploring events with different time granularity. Users can choose to see what is happening today or in the past week. (3) Efficient single-pass algorithm for event identification, which provides human-readable hashtag clusters. (4) Efficient event ranking which aims to find burst events and localized events given a particular region and time frame. To support aggregation with different space and time granularity, we propose a data structure called S TREAMCUBE, which is an extension of the
data cube structure from the database community with spatial and temporal hierarchy. To achieve high scalability, we propose a divide-and-conquer method to construct the STREAMCUBE. To support flexible event ranking with different weights, we proposed a top-k based index.
S.Geethamani, C.Swathi
GNSS (Global Navigation Satellite System) is a satellite system that is used to pinpoint the geographic
location of a user's receiver anywhere in the world. The developing Global Navigation Satellite Systems (GNSS), for example the Russian GLONASS system and the emerging European Galileo and Chinese BeiDou systems is expanding exponentially. Current and future utilization, research, and application developments are becoming key to most walks of life and hence prevalent within government, commercial industry, research communities as well as for the citizen. The ability to accurately locate and relocate, to navigate and track and to synchronies data streams has made this a technology that we all utilize, whether we are aware of it or not. Current GNSS drivers with in the engineering community are to improve efficiency, to provide better customer service, to enhance health and safety provision and as an aid to meet industry regulation. Augmenting GNSS devices with other positioning tools (whether they be ground penetrating radar, inertial devices, lasers, tachographs, etc) can provide a total solution when they are appropriately combined together.
N.V.Chinnasamy, Dr. A.Senthilkumar
in this paper the multi-path routing is to improve the efficient, load balancing and quality of
service in WSN and also provide reliability and security. We are provide a survey of proposed multipath
routing protocol for WSNs. it is benefits and the elements of these schemes and their classifications based on their attributes have been also discussed. Which are classified into three categories, infrastructure, oninfrastructure, and coding on multiple paths and delivering sensing data. We study the design of protocols; analyze the tradeoff of each design, and different properties of protocols. In this paper summery are design main goals, challenges and evaluation for multi-path routing protocols. In addition the multipath routing protocols to improve the load balancing and quality of service in WSN and also provide reliable communication the comparison of these protocols which are of great help to understand the properties and limitations.
K.K.Uma, Dr.K.Meenakshisundaram
Social Network Analysis is a branch of social science which seems for a long time to have resisted the
integration of empirical research and not surprising an interdisciplinary endeavor. Nowadays, hundreds of millions of Internet users participate in social networks, form communities, produce and consume media content in revolutionary ways.The concept of social network analysis developed out of propitious meeting of social theory and application with formal mathematical, statistical and computing methodology. SNA provides both a visual and a mathematical analysis of human relationships. The social network perspective encompasses methods, models, and software applications and tools that is based on an assumption of the importance of relationships among interacting units. With the aim of producing effective idea on social network analysis a platform for studying the basic phenomena are discussed. The paper is concerned with the structural properties of the model, patterning methods, facilitating tools, sites and software are studied. We hope the discussed topics here will provide ideas to researchers in various other field as well.
Dr.K.Meenakshisundaram, G.Vijaiprabhu
In recent years, image mining techniques enters and plays a vital role in various fields. The fast improvement in the information technology various methods has been appear to process and store these information, issues in data retrieval and huge volume. Image retrieval has been developed into a very dynamic explore the part will focus on how to extract and retrieve the images. An assortment of methods has been proposed for image retrieval and each technique has advantages and drawbacks. The difficulty in procedure and other problem involve the performance of existing system which makes inadequate. In this paper image retrieval with feature are extracted based on features such as contrast, energy, homogeneity and the threshold value calculated separately stored in feature database. The feature is generated and matching is done by Euclidean distance which is used to measure distance between two images. The experimental results shows that CSLBP method provides better retrieval rate when compared with the existing methods in terms of retrieval, precision and recall.
K.Veena, R.Malathi, Dr.V.Sasirekha
Newspapers are widely used information source for the past century. The electronic media converts the newspaper as web pages. The web newspapers are updated frequently with respect to the news collection and its importance. The text mining techniques are used to analyze the web newspapers. The page mining techniques are currently used to extract the web newspapers. This paper proposes the process of automated page extraction and classification by using complete page mining mechanism. This mechanism is divided as four phases: download, extraction, cleaning and classification. The download phase downloads the entire newspaper pages into the local machine. The extraction process extracts the news item from the stored pages. The irrelevant and redundant data are removed in the cleaning phase. The classification phase arranges the news item documents based on the content using knowledge base based classification technique. The extraction and classification can be applied the news item from any web newspaper. Reduction in storage requirements, automation of news item extraction and fast information retrieval are the major features of the system.
Web usage mining is the area of data mining which deals with the discovery and analysis of usage patterns from Web data, specifically web logs, in order to improve web based applications. Web usage mining consists of three phases, pre-processing, pattern discovery, and pattern analysis. The web access log file is saved to keep a record of every request made by the users. In this paper, we have considered the Data Mining and Web Usage Mining for overall study.
Dr. A.SenthilKumar, R.Gopalakrishan
The objective of energy efficient routing protocol is to increase the operational lifetime of the wireless sensor networks. Multipath routing protocols enhance the lifetime of the wireless sensor networks by distributing traffic among multiple paths instead of single optimal path. Transmission of secured data is also an important research concern in the wireless sensor networks. In this paper, a secure node disjoint multipath routing protocol for wireless sensor networks is proposed. Here, the data packets are transmitted in a secure manner by using the digital signature crypto system. It is compared with an ad hoc on-demand multipath distance vector routing protocol. It shows better results in terms of packet delivery fraction, energy consumption, and end-to-end delay compared to the ad hoc on-demand multipath distance vector routing.
B.Sindhupiriyaa, Dr.D.Maruthanayagam
This paper proposes a hypergraph interference model for the scheduling problem in wireless ad hoc networks. The proposed hypergraph model can take the sum interference into account and, therefore, is more accurate as compared with the traditional binary graph model. We provide an improved bound for the expectation of the stationary delay under the maximum weight scheduling (MWS) policy in one-hop wireless networks. Finally, by adjusting certain parameters, the hypergraph can achieve a systematic tradeoff between the interference approximation accuracy and the user node coordination complexity during scheduling. As an application of the hypergraph model, we consider the performance of a simple distributed scheduling algorithm, i.e., maximal scheduling, in wireless networks. We propose a lower bound stability region for any maximal scheduler and show that it achieves a fixed fraction of the optimal stability region, which depends on the interference degree of the underlying hypergraph. Further, different from the global signal-to-interference-plus-noise ratio (SINR) model, the hypergraph model preserves a localized graph-theoretic structure and, therefore, allows the efficient scheduling algorithms to be extended to the cumulative interference case. We also demonstrate the interference approximation accuracy of hypergraphs in random networks and show that hypergraphs with small hyperedge sizes can model the interference quite accurately. Finally, the analytical performance is verified by simulation results.
A.Anthony Paul Raj, Dr. J. K. Kani Mozhi
: In this paper introduces a new approach for executing honeypots in network security. There are huge numbers of security tools to overcome a network security problem like firewalls, anti-malwares and Intrusion Detection System (IDS), that are branch of network security correspondences. Honeypot technology is a quite new and rising region of research to deal with new security intimidation and confronts. Denial of service attacks (DOS), Distributed denial of service attack (DDOS), and zero day attacks are silent and major risk to the Internet. Many suggestions and models have been offered in the past but none is active by itself. In this paper we are make another way to deal with help tackle these issues. Each part is self-sufficient in implementation ensuing in better recital and improved security. In the future, we aim to use this form and make it more capable based on real time results and analysis.
V.Vijayalakshmi, Dr.A.Senthilkumar
A typical Wireless Sensor Network is built of several hundreds or even thousands of sensor nodes. Each node has the ability to communicate with every other node wirelessly, thus a typical sensor node has several components like transceiver, microcontroller. Routing is the fundamental operation in WSN that facilitate the establishment of communication links between Sensor nodes and a packet delivery. Designing such QoS based routing protocol to meet the reliability and delay guarantee of critical events while preserving the energy efficiency is a challenging task. Considerable research has been focused on developing robust energy efficient QoS based routing protocols. In this paper, we present QoS Challenges and compare QoS routing protocols.
R.Kalaiselvi, Dr.R.Suguna
Mining high utility item sets(HUIs) from databases is an important data mining task, which refers to the discovery of itemsets with high utilities (e.g. high profits). However, it may present too many HUIs to users, which also degrades the efficiency of the mining process. To achieve high efficiency for the mining task and provide a concise mining result to users, proposed a novel framework in this paper for mining closed high utility itemsets (CHUIs), which serves as a compact and lossless representation of HUIs. Proposed three efficient algorithms named ApriorityCH(Apriori-based algorithm for mining High utility closed itemsets), AprioriHC-D (AprioriHC algorithm with Discarding unpromising and isolated items) and CHUD (Closed High Utility Itemset Discovery) to find this representation. Further, a method called DAHU (Derive All High Utility Itemsets) is proposed to recover all HUIs from the set of CHUIs without accessing the original database. Results on real and synthetic datasets show that the proposed algorithms are very efficient and that our approaches achieve a massive reduction in the number of HUIs. In addition, when all HUIs can be recovered by DAHU, the combination of CHUD and DAHU outperforms the state-of-the-art algorithms for mining HUIs.
M.Malathi, Dr. A.SenthilKumar
Wireless sensor networks (WSNs) are highly susceptible to jamming attacks due to their resource limitations .In WSN architecture, the Base station (BS) is a single point of failure, because it collects tasks. so BSs are main targets of the jamming attack. For mitigating the effects of BS jamming attack .we propose a hybrid model of defense, which combines 3 defense techniques. The first technique is BS replication, so in a jamming condition, there may be some unjammed replicated BSs for providing service to the network. The second technique is the evasion of BS from jammed is multipath routing for providing alternative paths for communication with BS in case of jamming of one or more paths. Through simulation .We show the effects of the hybrid model of defense on the communication traffic throughput of WSNs
A.Nazini Banu, K.Thaarani
In mobile ad-hoc wireless network connectivity is always a major issue. Due to dynamic behavior of mobile nodes, good network topology shall be achieved efficiency. In this survey paper some energy efficient load balancing routing algorithms detected recently in many literature. Control over the rapidly change of the topology by minimizing the maximum transmission power in ad hoc wireless networks. Maintain battery power life and network lifetime during the networks connectivity. We suggest to do study of energy-based performance survey of aware routing protocols for wireless mobile ad hoc networks. Existing work based on review of existing research work in ad hoc wireless network and explores the possibilities of new research in these areas.
G.Priya, K.Manohari
K Nearest Neighbors (kNN) is an efficient lazy learning algorithm and has successfully been developed in real applications. It is natural to scale the kNN method to the large scale datasets. In this paper, we propose to first conduct a k-means clustering to separate the whole dataset into several parts, each of which is then conducted kNN classification. We conduct sets of experiments on big data and medical imaging data. In this paper we study how to efficiently perform set-similarity joins in parallel using the popular MapReduce framework. We propose a 3-stage approach for end-to-end setsimilarity joins. We take as input a set of records and output a set of joined records based on a set-similarity condition. We efficiently partition the data across nodes in order tobalance the workload and minimize the need for replication. We study both self-join and R-S join cases, and show how to carefully control the amount of data kept in main memory on each node. We also propose solutions for the case where, even if we use the most fine-grained partitioning, the data still does not fit in the main memory of a node. We report results from extensive experiments on real datasets, synthetically increased in size, to evaluate the speedup and scaleup properties of the proposed algorithms using Hadoop.
S.Radhika, N.Manohari
A Mobile Ad hoc Network (MANET) is a group of mobile nodes which cooperate in forwarding packets in a multi-hop fashion without any centralized administration. One of its key challenges is finding the malicious node in MANETs. In this paper we have proposed a scheme in which we are sending a control sequence to the neighbour nodes and we are expecting the nodes response. Based on the node response we can identify the malicious node.
S.Sangeetha, Dr.R.Suguna
The computerization of critical infrastructure such as control systems means that these systems interact with information technology (IT) to an extent that makes them susceptible to malicious attacks. the main focus of research in routing protocols for Mobile Ad-Hoc Networks (MANET) geared towards routing efficiency, the resulting protocols tend to be vulnerable to various attacks overload. One major DOS attack against the Optimized Link State Routing protocol (OLSR) known as the node isolation attack occurs when topological knowledge of the network is exploited by an attacker who is able to isolate the victim from the rest of the network and subsequently deny communication services to the victim In this paper, we suggest a novel solution to defend the OLSR protocol We develop a model-based resilient control algorithm that enables the team of autonomous agents accomplish their formation task even in the presence of a malicious denial of service (DOS) attack disrupting inter-agent communication.
N.Dhivya, Dr.R.Suguna
Wireless sensor networks (WSNs) provide a flexible way to detect spatial information through a large number of sensor nodes. This paper considers energy efficient distributed data gathering methods for correlated data field monitoring in multi-hop wireless sensor networks (WSNs) via Lite-IDE based hierarchical node authentication protocol. The proposed protocol is to solve problem of energy imbalance. The proposed method is Lite-IDE based authentication scheme is proposed for node authentication, which needs to exchange the authentication messages, and key generation. We provided complexity and energy cost analysis of our protocols and show that our protocols are more energy efficient and suitable for WSN.
V.Perumal, Dr.K.Meenakshi Sundram
In real world network need for most challenging task in WSN. The network need for energy efficient and data transmit protocol is large –scale. So, that WSN is most important applications in network. WSN have a large number of nodes of sensing, computing and transmit the data. There is a lot of existing system for WSN related to energy consumption, and sensor nodes. Furthermore, clustering is useful for reply based sensor network that require scalability to hundreds even large number of nodes. However clustering algorithm has lot of advantages and disadvantages .In clustering most of the protocols compared on LEACH protocol have saving, data aggregation and the first dead node to find in wireless sensor network.
S.Malathi, K.Sumathi
An Ad-hoc mobile network is a collection on self configuring wireless nodes, without any central administration. Due to the mobility the nature of the nodes in dynamic. Routing in MANET has immense challenges due to dynamic network topology, limited bandwidth, and limited transmission range, and power constraints and then they can communicate with each other directly. Otherwise the nodes can’t communicate other. Due to mobility nature in the network, we need routing protocols that can handle the numerous changes in the topology without any lose in communication. Here main aim of this paper is to simulate and analyze the dynamic performance of ad hoc routing protocols of AODV AND DSR. That performance is basis of Packet delivery ratio, packet dropped ratio, Average end-to-end delay, throughput, and false packets are measured as performance parameter for evaluating the performance of AODV and DSR protocols.
P.Kanagavalli, Dr.V.Karthikeyani
In the era of information and communication technology, Security is an important issue. A lot of effort and finance are being invested in this sector. Intrusion detection is one of the most prominent fields in this area. Data mining in network intrusion detection can automate the network intrusion detection field with a greater efficiency. Intrusion detection is the problem of identifying unauthorized use, misuse, and abuse of computer systems by both system insiders and external penetrators. The proliferation of heterogeneous computer networks provides additional implications for the intrusion detection problem. The fast propagation of computer networks has changed the viewpoint of network security. A boundlessness of methods for misuse detection as well as anomaly detection has been applied. IDS’s are based on the belief that an intruder’s behavior will be noticeably different from that of a legitimate user. We are designing and implementing a prototype Distributed Intrusion Detection System (DIDS) that combines distributed monitoring and data reduction (through individual host and LAN monitors) with centralized data analysis (through the DIDS director) to monitor a heterogeneous network of computers. Many of the technologies proposed are complementary to each other, since for different kind of environments some approaches perform better than others. This paper presents a review of intrusion detection systems that is then used to survey and classify them. The taxonomy consists of the detection principle, and second of certain operational aspects of the intrusion detection system.