Pub Date : 2014-12-29DOI: 10.1109/ICRTIT.2014.6996162
T. Prasath, R. Vijayalakshmi, Krishnarao Arthi
In day today emerging trends utility services, cloud and green computations are playing the major task. The Utilities based paradigm provides many services for general public and other business activities. In the middle end cloud plays the vital role in shifting towards computational paradigm and pays way for users to utilize the resources anywhere at any time. In the current trend green replaces cloud with the effective performance evaluation strategy, with proper resource utilization without any waste of resource not in use. In this paper, it aims at developing digital cloud based utility management to enhance security based metering and billing service by using monitoring strategy. The security based monitoring service provides the way for the utility usage service, to maintain the efficient billing strategy as per the metering service. It also provides zonal wide substation monitoring and base station monitoring services are enhanced to track in with proper usage of utilities by the general public. In the existing service analog based metering services are allowed, but the identification of electric hack is very high in the perspective of security and monitoring. Here the advanced digital based cloud fault detection management is enhanced and security, monitoring is improved.
{"title":"DigiCloud: Scrutinizing apt service for coping with confidential control over utility practice","authors":"T. Prasath, R. Vijayalakshmi, Krishnarao Arthi","doi":"10.1109/ICRTIT.2014.6996162","DOIUrl":"https://doi.org/10.1109/ICRTIT.2014.6996162","url":null,"abstract":"In day today emerging trends utility services, cloud and green computations are playing the major task. The Utilities based paradigm provides many services for general public and other business activities. In the middle end cloud plays the vital role in shifting towards computational paradigm and pays way for users to utilize the resources anywhere at any time. In the current trend green replaces cloud with the effective performance evaluation strategy, with proper resource utilization without any waste of resource not in use. In this paper, it aims at developing digital cloud based utility management to enhance security based metering and billing service by using monitoring strategy. The security based monitoring service provides the way for the utility usage service, to maintain the efficient billing strategy as per the metering service. It also provides zonal wide substation monitoring and base station monitoring services are enhanced to track in with proper usage of utilities by the general public. In the existing service analog based metering services are allowed, but the identification of electric hack is very high in the perspective of security and monitoring. Here the advanced digital based cloud fault detection management is enhanced and security, monitoring is improved.","PeriodicalId":422275,"journal":{"name":"2014 International Conference on Recent Trends in Information Technology","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127897557","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-04-10DOI: 10.1109/ICRTIT.2014.6996131
S. A. Abbas, S. Susithra, D. Priya, S. Thiruvengadam
Long Term Evolution (LTE) receiver processing involves decoding of complex valued received symbols from each antenna port to detect the codeword sent by the transmitter. The main objective of this paper is to design and implement the receiver hardware architectures for the control channels, PCFICH (Physical Control Format Indicator Channel) and PHICH (Physical Hybrid ARQ Indicator Channel) using fixed point and IEEE 754 single precision floating point arithmetic units for single input single output (SISO) configuration and validate their performance based on the signal to noise ratio (SNR) and mean square error (MSE) or the decision values for detecting the code words received. Floating point based receiver has an edge over fixed point in terms of reduced developing time, reduced complexity, higher accuracy, higher precision and tolerance to error but at the cost of increased hardware. Floating point based receivers employing folding and superscalar techniques to optimize the architectures through reduction in resource utilization are synthesized and implemented. ModelSim 6.4a is used to simulate the results while the architecture is implemented in Virtex-6 FPGA device using Xilinx-Plan Ahead tool.
{"title":"Design and performance tradeoff analysis of floating point datapath in LTE downlink control channel receiver","authors":"S. A. Abbas, S. Susithra, D. Priya, S. Thiruvengadam","doi":"10.1109/ICRTIT.2014.6996131","DOIUrl":"https://doi.org/10.1109/ICRTIT.2014.6996131","url":null,"abstract":"Long Term Evolution (LTE) receiver processing involves decoding of complex valued received symbols from each antenna port to detect the codeword sent by the transmitter. The main objective of this paper is to design and implement the receiver hardware architectures for the control channels, PCFICH (Physical Control Format Indicator Channel) and PHICH (Physical Hybrid ARQ Indicator Channel) using fixed point and IEEE 754 single precision floating point arithmetic units for single input single output (SISO) configuration and validate their performance based on the signal to noise ratio (SNR) and mean square error (MSE) or the decision values for detecting the code words received. Floating point based receiver has an edge over fixed point in terms of reduced developing time, reduced complexity, higher accuracy, higher precision and tolerance to error but at the cost of increased hardware. Floating point based receivers employing folding and superscalar techniques to optimize the architectures through reduction in resource utilization are synthesized and implemented. ModelSim 6.4a is used to simulate the results while the architecture is implemented in Virtex-6 FPGA device using Xilinx-Plan Ahead tool.","PeriodicalId":422275,"journal":{"name":"2014 International Conference on Recent Trends in Information Technology","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115367802","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-04-10DOI: 10.1109/ICRTIT.2014.6996139
T. Muralidhar Reddy, P. Muralidhar, C. Rama Rao
Video encoding algorithms with less complexity are required in many real time video coding applications. Motion Estimation (ME) is computationally intensive part of video compression. This paper introduces One bit transformation ME algorithm, which transforms the video sequences from multi-bit to a single bit per pixel representation and then used conventional motion estimation search strategies, this will reduce the arithmetic calculations and hardware complexity while maintaining almost good compression performance. In this paper, we propose an efficient fast search ME method for one bit transform to reduce computations involved in determining motion of blocks in a frame. The proposed Fast search algorithm effectively estimates the motion information in video. Experimental results shows 50% reduction in computations with a marginal loss of 3% PSNR compared to the conventional Exhaustive search algorithm.
{"title":"New fast search block matching Motion Estimation algorithm for H.264 /AVC","authors":"T. Muralidhar Reddy, P. Muralidhar, C. Rama Rao","doi":"10.1109/ICRTIT.2014.6996139","DOIUrl":"https://doi.org/10.1109/ICRTIT.2014.6996139","url":null,"abstract":"Video encoding algorithms with less complexity are required in many real time video coding applications. Motion Estimation (ME) is computationally intensive part of video compression. This paper introduces One bit transformation ME algorithm, which transforms the video sequences from multi-bit to a single bit per pixel representation and then used conventional motion estimation search strategies, this will reduce the arithmetic calculations and hardware complexity while maintaining almost good compression performance. In this paper, we propose an efficient fast search ME method for one bit transform to reduce computations involved in determining motion of blocks in a frame. The proposed Fast search algorithm effectively estimates the motion information in video. Experimental results shows 50% reduction in computations with a marginal loss of 3% PSNR compared to the conventional Exhaustive search algorithm.","PeriodicalId":422275,"journal":{"name":"2014 International Conference on Recent Trends in Information Technology","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116939315","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-04-10DOI: 10.1109/ICRTIT.2014.6996179
Preeti Yadav, Savita Gupta, S. Venkatesan
With the advancement in the technology, this era of Internet has witnessed a bloom in the Social Networking sites popularity. Social Networking sites facilitate the users with features like sharing personal information, making friends, developing new relationships, giving rise to new privacy concerns, etc., allowing only reliable people in one's network. Here comes in the concept of `Trust'. How can we assure that a person is trustworthy and what factors account to build the trust between two persons, known or unknown to each other? This requires an exploratory insight into users' intention to share information. This paper aims to understand the factors of trust, trust levels based on trust ratings from others and probability of accepting the other person in his/her network.
{"title":"Trust model for privacy in social networking using probabilistic determination","authors":"Preeti Yadav, Savita Gupta, S. Venkatesan","doi":"10.1109/ICRTIT.2014.6996179","DOIUrl":"https://doi.org/10.1109/ICRTIT.2014.6996179","url":null,"abstract":"With the advancement in the technology, this era of Internet has witnessed a bloom in the Social Networking sites popularity. Social Networking sites facilitate the users with features like sharing personal information, making friends, developing new relationships, giving rise to new privacy concerns, etc., allowing only reliable people in one's network. Here comes in the concept of `Trust'. How can we assure that a person is trustworthy and what factors account to build the trust between two persons, known or unknown to each other? This requires an exploratory insight into users' intention to share information. This paper aims to understand the factors of trust, trust levels based on trust ratings from others and probability of accepting the other person in his/her network.","PeriodicalId":422275,"journal":{"name":"2014 International Conference on Recent Trends in Information Technology","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115566555","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-04-10DOI: 10.1109/ICRTIT.2014.6996120
Jenith G. Delphin, R. Purushothaman
Service-based applications are applications that make use of one or more autonomous computer-based entities owned by third parties known as services, to perform their functions. The identification of similar, reputed services during the execution of service-based applications to replace services in them that are no longer available is an important issue. This paper proposes a framework to support dynamic service discovery. The users subscribe with the framework and submit their request for services. The framework is integrated with a Web service repository, where the service providers publish their services with QoS specification. The framework also collects the user ratings of services. To discover services, first the framework finds the similarity between functional and quality characteristics of services in the repository and the user requests. Then it calculates the reputation score of the services based on the ratings collected. Based on the similarity score and reputation score, the framework lists and ranks a set of candidate services for replacement. The framework can perform service discovery both proactively and reactively. Thus the framework provides an effective, user-friendly and flexible approach for run time service identification for service-based applications.
{"title":"Reputation-enhanced similarity-based dynamic service discovery framework for service-based applications","authors":"Jenith G. Delphin, R. Purushothaman","doi":"10.1109/ICRTIT.2014.6996120","DOIUrl":"https://doi.org/10.1109/ICRTIT.2014.6996120","url":null,"abstract":"Service-based applications are applications that make use of one or more autonomous computer-based entities owned by third parties known as services, to perform their functions. The identification of similar, reputed services during the execution of service-based applications to replace services in them that are no longer available is an important issue. This paper proposes a framework to support dynamic service discovery. The users subscribe with the framework and submit their request for services. The framework is integrated with a Web service repository, where the service providers publish their services with QoS specification. The framework also collects the user ratings of services. To discover services, first the framework finds the similarity between functional and quality characteristics of services in the repository and the user requests. Then it calculates the reputation score of the services based on the ratings collected. Based on the similarity score and reputation score, the framework lists and ranks a set of candidate services for replacement. The framework can perform service discovery both proactively and reactively. Thus the framework provides an effective, user-friendly and flexible approach for run time service identification for service-based applications.","PeriodicalId":422275,"journal":{"name":"2014 International Conference on Recent Trends in Information Technology","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128331243","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-04-10DOI: 10.1109/ICRTIT.2014.6996126
M. Karthikadevi, K. .. Srinivasagan
Speech synthesis is the most significant applications in linguistic communication process. The Text to Speech structure is the undertaking of accepts the input sentence and converts the audible speech as output. The Tamil language may be a syllable based language. A syllable is the unit of language, which may be spoken independent of the adjacent phones. It consists of an interrupted portion of sound, once the word is pronounced. The task of proposed Text to Speech System for Tamil language includes syllabication, Letter-to-Sound rules and concatenation. Syllabication is that the method of distinguishing the linguistic unit units, that is presented within the given input. The Trainable Text syllabication algorithm is employed for deriving the syllables. The Letter to Sound mapping technique is employed for changing the text to phonemes. These phonemes square measure mapped with the waveform that may be a recorded sound file, which can be a variety of wave files. The recorded sounds are concatenated by Unit selection Speech Synthesis algorithm, which uses the massive databases of recorded speech. The efficient joining cost is required to be calculated for locating the best sequence of speech as synthesized output. Java Media Framework speak engine is employed to synthesis the speech. The proposed text to speech system founded on syllable unit for Tamil language is employed to boost the excellence of speech.
语音合成是语言交际过程中最重要的应用。语转语结构是接受输入句子，将可听语音转换为输出的过程。泰米尔语可能是一种基于音节的语言。音节是语言的单位，可以独立于相邻的音素而说。一旦单词被发音，它由声音的中断部分组成。提出的泰米尔语文本到语音系统的任务包括音节、字母到声音规则和连接。音节是一种区分语言单位的方法，它是在给定的输入中呈现的。采用可训练文本音节提取算法进行音节提取。字母到声音的映射技术用于将文本转换为音素。这些音素平方测量映射的波形可能是一个录制的声音文件，它可以是各种波文件。采用单元选择语音合成算法，利用海量的录音数据库，将录音进行拼接。为了找到最佳的语音序列作为合成输出，需要计算有效的连接代价。采用Java Media Framework语音引擎进行语音合成。提出了基于音节单位的泰米尔语语篇转语系统，提高了泰米尔语语篇的语音质量。
{"title":"The development of syllable based text to speech system for Tamil language","authors":"M. Karthikadevi, K. .. Srinivasagan","doi":"10.1109/ICRTIT.2014.6996126","DOIUrl":"https://doi.org/10.1109/ICRTIT.2014.6996126","url":null,"abstract":"Speech synthesis is the most significant applications in linguistic communication process. The Text to Speech structure is the undertaking of accepts the input sentence and converts the audible speech as output. The Tamil language may be a syllable based language. A syllable is the unit of language, which may be spoken independent of the adjacent phones. It consists of an interrupted portion of sound, once the word is pronounced. The task of proposed Text to Speech System for Tamil language includes syllabication, Letter-to-Sound rules and concatenation. Syllabication is that the method of distinguishing the linguistic unit units, that is presented within the given input. The Trainable Text syllabication algorithm is employed for deriving the syllables. The Letter to Sound mapping technique is employed for changing the text to phonemes. These phonemes square measure mapped with the waveform that may be a recorded sound file, which can be a variety of wave files. The recorded sounds are concatenated by Unit selection Speech Synthesis algorithm, which uses the massive databases of recorded speech. The efficient joining cost is required to be calculated for locating the best sequence of speech as synthesized output. Java Media Framework speak engine is employed to synthesis the speech. The proposed text to speech system founded on syllable unit for Tamil language is employed to boost the excellence of speech.","PeriodicalId":422275,"journal":{"name":"2014 International Conference on Recent Trends in Information Technology","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128426052","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-04-10DOI: 10.1109/ICRTIT.2014.6996215
M. Sumalatha, M. Ananthi, A. Arvind, N. Navin, C. Siddarth
Feature set selection is the process of identifying a subset of features which produces the result same as the entire set. The feature set selection helps in clustering the datasets. In this paper, a Highly Correlated Feature set Selection (HCFS) algorithmis proposed for clustering the data. This algorithm helps in selecting features based on its relevancy and redundancy factors. All the selected features are finally clustered based on how they are correlated with each other. The main objective of this paper is to identify the feature subsets which will improve the classification performance by constructing minimum spanning tree (MST) between the features.The HCFS algorithm works in two steps. In the first step, the features are divided into clusters using the spanning tree construction process. In the second step, the cluster representatives are selected using Frequent Pattern Analysis (FPA) technique to form the effective feature set which reduces the time required for query evaluation process. The redundant and irrelevant features are removed based on their Symmetric Uncertainty (SU) values. This effectively improves the efficiency of data clustering process.
{"title":"Highly correlated feature set selection for data clustering","authors":"M. Sumalatha, M. Ananthi, A. Arvind, N. Navin, C. Siddarth","doi":"10.1109/ICRTIT.2014.6996215","DOIUrl":"https://doi.org/10.1109/ICRTIT.2014.6996215","url":null,"abstract":"Feature set selection is the process of identifying a subset of features which produces the result same as the entire set. The feature set selection helps in clustering the datasets. In this paper, a Highly Correlated Feature set Selection (HCFS) algorithmis proposed for clustering the data. This algorithm helps in selecting features based on its relevancy and redundancy factors. All the selected features are finally clustered based on how they are correlated with each other. The main objective of this paper is to identify the feature subsets which will improve the classification performance by constructing minimum spanning tree (MST) between the features.The HCFS algorithm works in two steps. In the first step, the features are divided into clusters using the spanning tree construction process. In the second step, the cluster representatives are selected using Frequent Pattern Analysis (FPA) technique to form the effective feature set which reduces the time required for query evaluation process. The redundant and irrelevant features are removed based on their Symmetric Uncertainty (SU) values. This effectively improves the efficiency of data clustering process.","PeriodicalId":422275,"journal":{"name":"2014 International Conference on Recent Trends in Information Technology","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128721559","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-04-10DOI: 10.1109/ICRTIT.2014.6996207
R. V. Kumar, P. Ramesh, H. A. Rauf
Fully self-controlled mobile ad hoc networks represent a complex system. Due to the broadcast nature of wireless channel, MANET has many security issues. Especially, Sybil Attack is a very serious threat to the MANET as it creates multiple virtual fake identities per entity, there by affecting the routing table. The multiple virtual identities are obtained by spoofing the victim's node or by creating an arbitrary node as there is no restriction to create an arbitrary node in MANET. In the existing system, author has used RSSI as a parameter to detect the Sybil node because of its lightweight but it has failed to detect the fast moving Sybil nodes. The proposed system works considering the Certification Authority as one parameter and RSSI as the other parameter. The RSSI is used to form the cluster and to elect the cluster head. The CA's responsibility is given to the CH. Whenever huge variations occur in RSSI on neighbour's entry and exit behaviour, the Certification Authority comes into play. The CA checks the certification of a node. If it is not valid, its certificate is revoked otherwise it is free to communicate in the network.
{"title":"Cluster based enhanced sybil attack detection in MANET through integration of RSSI and CRL","authors":"R. V. Kumar, P. Ramesh, H. A. Rauf","doi":"10.1109/ICRTIT.2014.6996207","DOIUrl":"https://doi.org/10.1109/ICRTIT.2014.6996207","url":null,"abstract":"Fully self-controlled mobile ad hoc networks represent a complex system. Due to the broadcast nature of wireless channel, MANET has many security issues. Especially, Sybil Attack is a very serious threat to the MANET as it creates multiple virtual fake identities per entity, there by affecting the routing table. The multiple virtual identities are obtained by spoofing the victim's node or by creating an arbitrary node as there is no restriction to create an arbitrary node in MANET. In the existing system, author has used RSSI as a parameter to detect the Sybil node because of its lightweight but it has failed to detect the fast moving Sybil nodes. The proposed system works considering the Certification Authority as one parameter and RSSI as the other parameter. The RSSI is used to form the cluster and to elect the cluster head. The CA's responsibility is given to the CH. Whenever huge variations occur in RSSI on neighbour's entry and exit behaviour, the Certification Authority comes into play. The CA checks the certification of a node. If it is not valid, its certificate is revoked otherwise it is free to communicate in the network.","PeriodicalId":422275,"journal":{"name":"2014 International Conference on Recent Trends in Information Technology","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129314120","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-04-10DOI: 10.1109/ICRTIT.2014.6996171
S. Grace, M. Sumalatha
Sensor cloud infrastructure is composed of wireless sensor network and cloud computing technology. The limitation of wireless sensor network can be overcome by integrating it with cloud. The sensor data are collected and stored in cloud for processing that helps to make real time alert in critical situation used for future analysis. Distributing the sensor data to appropriate subscriber is more important. In existing work many event matching algorithms are discussed. The matching is performed on the basis of their predicates and requires more space for indexing all the predicate values. In our proposed work publisher/subscriber model has been taken. In the first stage, subscriptions are categorized on the basis of their privilege and in next stage the events will be matched to the subscription. By this method the subscription storing and matching can be made easier and faster.
{"title":"Event matching based on subscriber category in sensor cloud","authors":"S. Grace, M. Sumalatha","doi":"10.1109/ICRTIT.2014.6996171","DOIUrl":"https://doi.org/10.1109/ICRTIT.2014.6996171","url":null,"abstract":"Sensor cloud infrastructure is composed of wireless sensor network and cloud computing technology. The limitation of wireless sensor network can be overcome by integrating it with cloud. The sensor data are collected and stored in cloud for processing that helps to make real time alert in critical situation used for future analysis. Distributing the sensor data to appropriate subscriber is more important. In existing work many event matching algorithms are discussed. The matching is performed on the basis of their predicates and requires more space for indexing all the predicate values. In our proposed work publisher/subscriber model has been taken. In the first stage, subscriptions are categorized on the basis of their privilege and in next stage the events will be matched to the subscription. By this method the subscription storing and matching can be made easier and faster.","PeriodicalId":422275,"journal":{"name":"2014 International Conference on Recent Trends in Information Technology","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121545945","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-04-10DOI: 10.1109/ICRTIT.2014.6996118
V. Dinesh Kumar, S. Radhakrishnan
Mobile Ad-hoc networks (MANET) are formed with dynamism and upheld by individual hosts in a network. In these type of networks all communication occurs through a wireless medium and the nature of the network is decentralized and dynamic. Hence it probes for a number of security problems and in order provide security against malicious attacks, Intrusion Detection System (IDS) is commonly used as a second route of protection in MANET. Intrusion detection models are used to detect the attacks based on the patterns and alerts in case of intruders are being met with the system. In this paper, we propose and implement intrusion-detection system grounded on artificial neural network model such as Self-Organizing Map (SOM) based competitive network, which in turn plays a vital role in detection of malicious nodes based on input data patterns. The proposed model deals with different types of attacks and their detection approach based on SOM model. The approach aids at increasing Detection rate as well as reducing the False alarm rate, which in turn helps to detect those attacks before it makes larger damage to the network and prevent them with supportive techniques and increase the network performance. The experimental results of proposed model is evaluated under different parameters.
{"title":"Intrusion detection in MANET using Self Organizing Map (SOM)","authors":"V. Dinesh Kumar, S. Radhakrishnan","doi":"10.1109/ICRTIT.2014.6996118","DOIUrl":"https://doi.org/10.1109/ICRTIT.2014.6996118","url":null,"abstract":"Mobile Ad-hoc networks (MANET) are formed with dynamism and upheld by individual hosts in a network. In these type of networks all communication occurs through a wireless medium and the nature of the network is decentralized and dynamic. Hence it probes for a number of security problems and in order provide security against malicious attacks, Intrusion Detection System (IDS) is commonly used as a second route of protection in MANET. Intrusion detection models are used to detect the attacks based on the patterns and alerts in case of intruders are being met with the system. In this paper, we propose and implement intrusion-detection system grounded on artificial neural network model such as Self-Organizing Map (SOM) based competitive network, which in turn plays a vital role in detection of malicious nodes based on input data patterns. The proposed model deals with different types of attacks and their detection approach based on SOM model. The approach aids at increasing Detection rate as well as reducing the False alarm rate, which in turn helps to detect those attacks before it makes larger damage to the network and prevent them with supportive techniques and increase the network performance. The experimental results of proposed model is evaluated under different parameters.","PeriodicalId":422275,"journal":{"name":"2014 International Conference on Recent Trends in Information Technology","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130422719","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：