Pub Date : 2013-05-13DOI: 10.1109/IADCC.2013.6514258
M. Dutta, A. K. Singh, A. Kumar
In this paper, an efficient signcryption scheme based on elliptic curve cryptosystem is going to be proposed which can effectively combine the functionalities of digital signature and encryption and also takes a comparable amount of computational cost and communication overhead. The proposed scheme provides confidentiality, integrity, unforgeability and nonrepudiation, along with encrypted message authentication, forward secrecy of message confidentiality and public verification. By forward secrecy of message confidentiality function we mean, although the private key of the sender is divulged inattentively, it does not affect the confidentiality of the previously stored messages. By the public verification function we mean, any third party can verify directly the signature of the sender of the original message without the sender's private key when dispute occurs. It enhances the justice of judge. In addition, proposed scheme will save great amount of computational cost. The proposed scheme can be applied to the lower computational power devices, like smart card based applications, e-voting and many more, due to their lower computational cost. The Proposed Scheme is discussed in this paper and is compared with the existing schemes with respect to computational cost and the security functions it provides.
{"title":"An efficient signcryption scheme based on ECC with forward secrecy and encrypted message authentication","authors":"M. Dutta, A. K. Singh, A. Kumar","doi":"10.1109/IADCC.2013.6514258","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514258","url":null,"abstract":"In this paper, an efficient signcryption scheme based on elliptic curve cryptosystem is going to be proposed which can effectively combine the functionalities of digital signature and encryption and also takes a comparable amount of computational cost and communication overhead. The proposed scheme provides confidentiality, integrity, unforgeability and nonrepudiation, along with encrypted message authentication, forward secrecy of message confidentiality and public verification. By forward secrecy of message confidentiality function we mean, although the private key of the sender is divulged inattentively, it does not affect the confidentiality of the previously stored messages. By the public verification function we mean, any third party can verify directly the signature of the sender of the original message without the sender's private key when dispute occurs. It enhances the justice of judge. In addition, proposed scheme will save great amount of computational cost. The proposed scheme can be applied to the lower computational power devices, like smart card based applications, e-voting and many more, due to their lower computational cost. The Proposed Scheme is discussed in this paper and is compared with the existing schemes with respect to computational cost and the security functions it provides.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123381640","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514351
S. Gupta, R. K. Tripathi
Flexible AC Transmission Systems (FACTS) devices have been used in power systems since the 1970s for the improvement of its dynamic performance. Among these devices, Static Synchronous Compensator (STATCOM) is a shunt connected FACTS device, which is capable of providing reactive power compensation to the power system. STATCOM is a multiple input and multiple output system. In this paper, the CSC based STATCOM is controlled by the pole placement. But the best constant values for pole placement controller's parameters are laboriously obtained through trial and error, although time consuming. So the genetic algorithm (GA) is employed to find the best values for pole placement controller's parameters in a very short time. These methods are tested in MATLAB, and their results are obtained. The simulation results show an improvement in input-output response of CSC-STATCOM.
{"title":"A pole placement controller for CSC based STATCOM with genetic algorithm","authors":"S. Gupta, R. K. Tripathi","doi":"10.1109/IADCC.2013.6514351","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514351","url":null,"abstract":"Flexible AC Transmission Systems (FACTS) devices have been used in power systems since the 1970s for the improvement of its dynamic performance. Among these devices, Static Synchronous Compensator (STATCOM) is a shunt connected FACTS device, which is capable of providing reactive power compensation to the power system. STATCOM is a multiple input and multiple output system. In this paper, the CSC based STATCOM is controlled by the pole placement. But the best constant values for pole placement controller's parameters are laboriously obtained through trial and error, although time consuming. So the genetic algorithm (GA) is employed to find the best values for pole placement controller's parameters in a very short time. These methods are tested in MATLAB, and their results are obtained. The simulation results show an improvement in input-output response of CSC-STATCOM.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122289198","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514316
K. R. Prasad, B. E. Reddy
Clustering analysis is widely used technique in many emerging applications. Assessment of clustering tendency is generally done by Visual Access Tendency (VAT) algorithm. VAT detects the clustering tendency by reordering the indices of objects from the dissimilarity matrix, according to logic of Prim's algorithm. Therefore, VAT demands high computational cost for large datasets. The contribution of proposed work is to develop best sampling technique for obtaining good representative of entire dataset in the form of sub-dissimilarity matrix in VAT, it provides accessing of prior tendency visually by detecting number of square shaped dark blocks along with diagonal in sample based VAT image. This proposed work gives same clustering tendency results when we compare with simple VAT, and it has an advantage of less processing time since it uses only sampled dissimilarity matrix. This sample based VAT (PSVAT) uses set of distinguished features for random selection of progressive sample representatives. Finally, known clustering tendency is used in graph-based clustering technique (Minimum Spanning Tree based clustering) for achieving efficient clustering results. Comparative runtime values of PSVAT and VAT on several datasets are presented in this paper for showing that PSVAT is better than VAT in respect of runtime performance and clustering validity is also tested by Dunn's Index for sampled data.
{"title":"Assessment of clustering tendency through progressive random sampling and graph-based clustering results","authors":"K. R. Prasad, B. E. Reddy","doi":"10.1109/IADCC.2013.6514316","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514316","url":null,"abstract":"Clustering analysis is widely used technique in many emerging applications. Assessment of clustering tendency is generally done by Visual Access Tendency (VAT) algorithm. VAT detects the clustering tendency by reordering the indices of objects from the dissimilarity matrix, according to logic of Prim's algorithm. Therefore, VAT demands high computational cost for large datasets. The contribution of proposed work is to develop best sampling technique for obtaining good representative of entire dataset in the form of sub-dissimilarity matrix in VAT, it provides accessing of prior tendency visually by detecting number of square shaped dark blocks along with diagonal in sample based VAT image. This proposed work gives same clustering tendency results when we compare with simple VAT, and it has an advantage of less processing time since it uses only sampled dissimilarity matrix. This sample based VAT (PSVAT) uses set of distinguished features for random selection of progressive sample representatives. Finally, known clustering tendency is used in graph-based clustering technique (Minimum Spanning Tree based clustering) for achieving efficient clustering results. Comparative runtime values of PSVAT and VAT on several datasets are presented in this paper for showing that PSVAT is better than VAT in respect of runtime performance and clustering validity is also tested by Dunn's Index for sampled data.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128028143","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514413
P. Goyal, N. Bansal, N. Gupta
In the recent years, there has been a tremendous rise in online banking transactions. Some of the major factors contributing to this growth are - easy availability of higher bandwidth internet connections at low cost and ease of online transactions compared to the traditional banking methods. Also, this field has attracted the cybercriminals to take advantage of the loopholes in the process of online transaction. One of the most advanced threats today is the Man In The Browser (MitB) attack. MitB attack deploys a Trojan in the browser of the user and then steals the credentials of the user to initiate a transaction for transferring the money in a mule account. All this happens without any notice to bank or the user. MitB attack defeats the traditional two factor authentication currently used by the banks to authenticate the identity of the user performing the transaction. This paper presents a new framework for enhancing authentication during an online transaction to tackle the problem of MitB attack.
{"title":"Averting man in the browser attack using user-specific personal images","authors":"P. Goyal, N. Bansal, N. Gupta","doi":"10.1109/IADCC.2013.6514413","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514413","url":null,"abstract":"In the recent years, there has been a tremendous rise in online banking transactions. Some of the major factors contributing to this growth are - easy availability of higher bandwidth internet connections at low cost and ease of online transactions compared to the traditional banking methods. Also, this field has attracted the cybercriminals to take advantage of the loopholes in the process of online transaction. One of the most advanced threats today is the Man In The Browser (MitB) attack. MitB attack deploys a Trojan in the browser of the user and then steals the credentials of the user to initiate a transaction for transferring the money in a mule account. All this happens without any notice to bank or the user. MitB attack defeats the traditional two factor authentication currently used by the banks to authenticate the identity of the user performing the transaction. This paper presents a new framework for enhancing authentication during an online transaction to tackle the problem of MitB attack.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128221195","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514228
N. Bilandi, H. Verma, N. Kumar
An ad hoc network is a dynamic topology network having no centralized control or base station. In such a network, routing is a challenging task due to frequently changes in network topology and resource constraints. Many routing protocols have been proposed to overcome various challenges of routing in ad hoc networks. Each routing protocol has some advantages and disadvantages in various situations. So, it is difficult for a group of user's to choose a particular routing protocol for a particular requirement. In this performance analysis paper, we compare six existing well known routing protocols based on user's point of view. The protocols are AODV, DSR, LAR, OLSR, STAR and ZRP. This paper, presents its usefulness by providing comparative analysis of the protocols with the important routing parameters. The parameters are packet delivery ratio, throughput, end-to-end delay, battery power consumption, average hop count for a connection, packet drop due to retransmission limit and average jitter for received packets. We analyze the protocols in a most realistic ad hoc network scenario using simulation. Comparative study of the protocols using the routing parameters is useful to make a decision about a protocol by an analyzer or user that, which protocol is suitable for particular requirements.
{"title":"Comparative analysis of ad hoc routing protocols based on user's point of view","authors":"N. Bilandi, H. Verma, N. Kumar","doi":"10.1109/IADCC.2013.6514228","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514228","url":null,"abstract":"An ad hoc network is a dynamic topology network having no centralized control or base station. In such a network, routing is a challenging task due to frequently changes in network topology and resource constraints. Many routing protocols have been proposed to overcome various challenges of routing in ad hoc networks. Each routing protocol has some advantages and disadvantages in various situations. So, it is difficult for a group of user's to choose a particular routing protocol for a particular requirement. In this performance analysis paper, we compare six existing well known routing protocols based on user's point of view. The protocols are AODV, DSR, LAR, OLSR, STAR and ZRP. This paper, presents its usefulness by providing comparative analysis of the protocols with the important routing parameters. The parameters are packet delivery ratio, throughput, end-to-end delay, battery power consumption, average hop count for a connection, packet drop due to retransmission limit and average jitter for received packets. We analyze the protocols in a most realistic ad hoc network scenario using simulation. Comparative study of the protocols using the routing parameters is useful to make a decision about a protocol by an analyzer or user that, which protocol is suitable for particular requirements.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128434201","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514449
S. Pandit, Ghanshyam Singh
Due to the fixed spectrum allocation policy, bandwidth has become one of the scarcest resources for the wireless communications. Therefore, various advanced application, which is very useful in the development of communication system, cannot be used. Currently, the wireless network systems suffer from insufficient bandwidth utilization. However, the licensed users or primary users (PUs) do not use their spectrum all the time. So, to enhance the efficiency of bandwidth usage, the concept of Cognitive Radio (CR) also called secondary user (SU) has emerged as a new design paradigm. By detecting the spectrum holes in PU band as long as they cause no intolerable interference to licensed users, we can make a new dynamic bandwidth sharing strategy between primary and secondary users based on the economic factors, so that the bandwidth utilization and users satisfaction can be enhanced dramatically. We have proposed a simulation model, which allocates free bandwidth of PUs to SUs with an aim to minimize overall bandwidth allocation cost. To share the bandwidth of the primary user with secondary user's, we have developed an algorithm to minimize the cost of the bandwidth.
{"title":"Spectrum sharing in Cognitive Radio using game theory","authors":"S. Pandit, Ghanshyam Singh","doi":"10.1109/IADCC.2013.6514449","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514449","url":null,"abstract":"Due to the fixed spectrum allocation policy, bandwidth has become one of the scarcest resources for the wireless communications. Therefore, various advanced application, which is very useful in the development of communication system, cannot be used. Currently, the wireless network systems suffer from insufficient bandwidth utilization. However, the licensed users or primary users (PUs) do not use their spectrum all the time. So, to enhance the efficiency of bandwidth usage, the concept of Cognitive Radio (CR) also called secondary user (SU) has emerged as a new design paradigm. By detecting the spectrum holes in PU band as long as they cause no intolerable interference to licensed users, we can make a new dynamic bandwidth sharing strategy between primary and secondary users based on the economic factors, so that the bandwidth utilization and users satisfaction can be enhanced dramatically. We have proposed a simulation model, which allocates free bandwidth of PUs to SUs with an aim to minimize overall bandwidth allocation cost. To share the bandwidth of the primary user with secondary user's, we have developed an algorithm to minimize the cost of the bandwidth.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128851481","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514318
C. D. Gracia, S. Sudha
The proliferation of World Wide Web and the immense growth of Internet users and services requiring high bandwidth have increased the response time of the users substantially. Thus, users often experience long latency while retrieving web objects. The popularity of web objects and web sites show a considerable spatial locality that makes it possible to predict future accesses based on the previous accessed ones. This infact has motivated the researchers to devise new prefetching techniques in web so as to reduce the user perceived latency. Most of the research works are based on the standard Prediction by Partial Match model and its derivates such as the Longest Repeating Sequence and the Popularity based model that are built into Markov predictor trees using common surfing patterns. These models require lot of memory. Hence, in this paper, memory efficient Prediction by Partial Match models based on Markov model are proposed to minimize memory usage compared to the standard Prediction models and its derivatives.
{"title":"MePPM- Memory efficient prediction by partial match model for web prefetching","authors":"C. D. Gracia, S. Sudha","doi":"10.1109/IADCC.2013.6514318","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514318","url":null,"abstract":"The proliferation of World Wide Web and the immense growth of Internet users and services requiring high bandwidth have increased the response time of the users substantially. Thus, users often experience long latency while retrieving web objects. The popularity of web objects and web sites show a considerable spatial locality that makes it possible to predict future accesses based on the previous accessed ones. This infact has motivated the researchers to devise new prefetching techniques in web so as to reduce the user perceived latency. Most of the research works are based on the standard Prediction by Partial Match model and its derivates such as the Longest Repeating Sequence and the Popularity based model that are built into Markov predictor trees using common surfing patterns. These models require lot of memory. Hence, in this paper, memory efficient Prediction by Partial Match models based on Markov model are proposed to minimize memory usage compared to the standard Prediction models and its derivatives.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130339979","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514347
S. Rawat, D. R. Patil
The World Wide Web continues to grow at an exponential rate, so fetching information about a special-topic is gaining importance which poses exceptional scaling challenges for general-purpose crawlers and search engines. This paper describes a web crawling approach based on best first search. As the goal of a focused crawler is to selectively seek out pages that are relevant to given keywords. Rather than collecting and indexing all available web documents to be able to answer all possible queries, a focused crawler analyze its crawl boundary to hit upon the links that are likely to be most relevant for the crawl, and avoids irrelevant links of the document. This leads to significant savings in hardware as well as network resources and also helps keep the crawl more up-to-date. To accomplish such goal-directed crawling, we select top most k relevant documents for a given query and then expand the most promising link chosen according to link score, to circumvent irrelevant regions of the web.
{"title":"Efficient focused crawling based on best first search","authors":"S. Rawat, D. R. Patil","doi":"10.1109/IADCC.2013.6514347","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514347","url":null,"abstract":"The World Wide Web continues to grow at an exponential rate, so fetching information about a special-topic is gaining importance which poses exceptional scaling challenges for general-purpose crawlers and search engines. This paper describes a web crawling approach based on best first search. As the goal of a focused crawler is to selectively seek out pages that are relevant to given keywords. Rather than collecting and indexing all available web documents to be able to answer all possible queries, a focused crawler analyze its crawl boundary to hit upon the links that are likely to be most relevant for the crawl, and avoids irrelevant links of the document. This leads to significant savings in hardware as well as network resources and also helps keep the crawl more up-to-date. To accomplish such goal-directed crawling, we select top most k relevant documents for a given query and then expand the most promising link chosen according to link score, to circumvent irrelevant regions of the web.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130635623","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514204
Ramanathan Mohan, Rao Kovvur, S. Ramachandram, Vijayakumar Kadappa, A. Govardhan
We consider scheduling of bag of independent mixed tasks (Hard, firm and soft) in a distributed dynamic grid environment. Recently, a general distributed scalable grid scheduler (GDS) for independent tasks was proposed to maximize successful schedule percent in an error-free grid environment. However, GDS did not consider constraint failure of task during execution due to resource overload, which leads to limited successful schedule percent. In this paper, we propose a novel distributed dynamic grid scheduler for mixed tasks (DDGS-MT), which takes into consideration the constraint failure of task during execution due to resource overload. The proposed scheduler incorporates migration and resume fault tolerant mechanisms for computational and communication intensive tasks respectively. The proposed scheduler shows improved performance in terms of successful schedule percent and makespan in comparison with GDS. The results of our exhaustive simulations experiments demonstrate the superiority of DDGS over GDS scheduler.
{"title":"A distributed dynamic grid scheduler for mixed tasks","authors":"Ramanathan Mohan, Rao Kovvur, S. Ramachandram, Vijayakumar Kadappa, A. Govardhan","doi":"10.1109/IADCC.2013.6514204","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514204","url":null,"abstract":"We consider scheduling of bag of independent mixed tasks (Hard, firm and soft) in a distributed dynamic grid environment. Recently, a general distributed scalable grid scheduler (GDS) for independent tasks was proposed to maximize successful schedule percent in an error-free grid environment. However, GDS did not consider constraint failure of task during execution due to resource overload, which leads to limited successful schedule percent. In this paper, we propose a novel distributed dynamic grid scheduler for mixed tasks (DDGS-MT), which takes into consideration the constraint failure of task during execution due to resource overload. The proposed scheduler incorporates migration and resume fault tolerant mechanisms for computational and communication intensive tasks respectively. The proposed scheduler shows improved performance in terms of successful schedule percent and makespan in comparison with GDS. The results of our exhaustive simulations experiments demonstrate the superiority of DDGS over GDS scheduler.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129680448","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514309
N. Srivastav, R. Challa
The threat from spammers, attackers and criminal enterprises has grown with the expansion of Internet, thus, intrusion detection systems (IDS)have become a core component of computer network due to prevalence of such threats. In this paper, we present layered framework integrated with neural network to build an effective intrusion detection system. This system has experimented with Knowledge Discovery & Data Mining(KDD) 1999 dataset. The systems are compared with existing approaches of intrusion detection which either uses neural network or based on layered framework. The results show that the proposed system has high attack detection accuracy and less false alarm rate.
{"title":"Novel intrusion detection system integrating layered framework with neural network","authors":"N. Srivastav, R. Challa","doi":"10.1109/IADCC.2013.6514309","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514309","url":null,"abstract":"The threat from spammers, attackers and criminal enterprises has grown with the expansion of Internet, thus, intrusion detection systems (IDS)have become a core component of computer network due to prevalence of such threats. In this paper, we present layered framework integrated with neural network to build an effective intrusion detection system. This system has experimented with Knowledge Discovery & Data Mining(KDD) 1999 dataset. The systems are compared with existing approaches of intrusion detection which either uses neural network or based on layered framework. The results show that the proposed system has high attack detection accuracy and less false alarm rate.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130182283","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
扫码关注我们
求助内容：
应助结果提醒方式：