Pub Date : 2012-12-01DOI: 10.1109/ICOAC.2012.6416825
Bazeer Ahamed B, S. Hariharan
The World Wide Web (WWW) has become a part of today's human lives. But searching information has become one of the most important aspects. Various search engines like Google, Bing, Yahoo, etc are used to seek information about a topic. Search engines return ranked lists of Web pages in response to queries. However, the performance of these web search engine has increased dramatically. Moreover, for many scenarios a user who has queried a search engine has led to inaccurate results for a particular query. Web users mostly use the services of search engines to fetch information they want to surf. In spite users spend too much time and energy in seeking useful data, improving the retrieval efficiency to meet the users' personalized need becomes critical in text processing domain. The relevance of the search results provided by the search engines are based on different kinds of algorithms used by these search engines. It also becomes tedious and difficult task for search engines to rank search results which satisfy the user's search intention clearly. A variety of ranking algorithms have been proposed and used in many Web search engines. However, these search engines cannot always return good ranked search results which satisfy users' search intentions adequately. This work addresses few novel algorithms suitable for efficient web retrieval process thereby improving the accuracy & precision of searching mechanisms.
{"title":"State of the art process in query processing ranking system","authors":"Bazeer Ahamed B, S. Hariharan","doi":"10.1109/ICOAC.2012.6416825","DOIUrl":"https://doi.org/10.1109/ICOAC.2012.6416825","url":null,"abstract":"The World Wide Web (WWW) has become a part of today's human lives. But searching information has become one of the most important aspects. Various search engines like Google, Bing, Yahoo, etc are used to seek information about a topic. Search engines return ranked lists of Web pages in response to queries. However, the performance of these web search engine has increased dramatically. Moreover, for many scenarios a user who has queried a search engine has led to inaccurate results for a particular query. Web users mostly use the services of search engines to fetch information they want to surf. In spite users spend too much time and energy in seeking useful data, improving the retrieval efficiency to meet the users' personalized need becomes critical in text processing domain. The relevance of the search results provided by the search engines are based on different kinds of algorithms used by these search engines. It also becomes tedious and difficult task for search engines to rank search results which satisfy the user's search intention clearly. A variety of ranking algorithms have been proposed and used in many Web search engines. However, these search engines cannot always return good ranked search results which satisfy users' search intentions adequately. This work addresses few novel algorithms suitable for efficient web retrieval process thereby improving the accuracy & precision of searching mechanisms.","PeriodicalId":286985,"journal":{"name":"2012 Fourth International Conference on Advanced Computing (ICoAC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129619502","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 : 2012-12-01DOI: 10.1109/ICOAC.2012.6416813
V. Shunmughavel, P. Jaganathan
In semantic web ontology heterogeneity is a big bottleneck of ontology application, and ontology mapping is the base for integration of heterogeneous ontology. The ontology mapping model contains several aspects, and concept similarity computing is the most important part. This paper presents a concept similarity computing algorithm combining lexical matching to achieve semantic enrichment and high accuracy results. It has been proved that the evaluation of concept similarity between ontologies is more accurate by considering both semantic similarity and semantic relativity.
{"title":"Semantic enrichment in ontology mapping using concept similarity computing","authors":"V. Shunmughavel, P. Jaganathan","doi":"10.1109/ICOAC.2012.6416813","DOIUrl":"https://doi.org/10.1109/ICOAC.2012.6416813","url":null,"abstract":"In semantic web ontology heterogeneity is a big bottleneck of ontology application, and ontology mapping is the base for integration of heterogeneous ontology. The ontology mapping model contains several aspects, and concept similarity computing is the most important part. This paper presents a concept similarity computing algorithm combining lexical matching to achieve semantic enrichment and high accuracy results. It has been proved that the evaluation of concept similarity between ontologies is more accurate by considering both semantic similarity and semantic relativity.","PeriodicalId":286985,"journal":{"name":"2012 Fourth International Conference on Advanced Computing (ICoAC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124385355","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 : 2012-12-01DOI: 10.1109/ICOAC.2012.6416855
J. Nithyashri, G. Kulanthaivel
Face Aging has been an vital area of research for the past few decades. As the age increases, there are some visible changes in the face, making age classification simpler. Based on the facial growth, we can classify the human age into various kinds. Though there are various algorithms existed so far, a more sophisticated method is attempted for classifying facial age. Age Prototypes, Statistical models and Distance based technique have been widely used for classification of human face. The system can be improved by using the Wavelet Transformation (WT) for extracting the face features and Artificial Neural Network to classify the age group. The facial images are pre-processed and then the face features are extracted using Wavelet Transformation. The distance between each of features are evaluated using Euclidean distance and these values were given as input to Adaptive Resonance Network (ART). The Neural Network is trained using FG-NET (Face and Gesture Recognition Research Network) aging database. The human age is classified into four categories as Child (0-12 years), Adolescence (13-18 years), Adult (19-59 years) and Senior Adult (60 years and above) which is discussed in the paper.
在过去的几十年里，面部衰老一直是一个重要的研究领域。随着年龄的增长，面部出现了一些明显的变化，使得年龄分类更加简单。根据面部的生长情况，我们可以把人的年龄分为不同的类型。虽然目前存在各种算法，但我们尝试了一种更为复杂的面部年龄分类方法。年龄原型、统计模型和基于距离的人脸分类技术已被广泛应用于人脸分类。利用小波变换提取人脸特征，利用人工神经网络进行年龄分类，对系统进行了改进。对人脸图像进行预处理，然后利用小波变换提取人脸特征。利用欧几里得距离评估每个特征之间的距离，并将这些值作为自适应共振网络(ART)的输入。神经网络使用FG-NET (Face and Gesture Recognition Research Network)老化数据库进行训练。人类的年龄分为儿童(0-12岁)、青少年(13-18岁)、成人(19-59岁)和老年成人(60岁及以上)四类，本文对此进行了讨论。
{"title":"Classification of human age based on Neural Network using FG-NET Aging database and Wavelets","authors":"J. Nithyashri, G. Kulanthaivel","doi":"10.1109/ICOAC.2012.6416855","DOIUrl":"https://doi.org/10.1109/ICOAC.2012.6416855","url":null,"abstract":"Face Aging has been an vital area of research for the past few decades. As the age increases, there are some visible changes in the face, making age classification simpler. Based on the facial growth, we can classify the human age into various kinds. Though there are various algorithms existed so far, a more sophisticated method is attempted for classifying facial age. Age Prototypes, Statistical models and Distance based technique have been widely used for classification of human face. The system can be improved by using the Wavelet Transformation (WT) for extracting the face features and Artificial Neural Network to classify the age group. The facial images are pre-processed and then the face features are extracted using Wavelet Transformation. The distance between each of features are evaluated using Euclidean distance and these values were given as input to Adaptive Resonance Network (ART). The Neural Network is trained using FG-NET (Face and Gesture Recognition Research Network) aging database. The human age is classified into four categories as Child (0-12 years), Adolescence (13-18 years), Adult (19-59 years) and Senior Adult (60 years and above) which is discussed in the paper.","PeriodicalId":286985,"journal":{"name":"2012 Fourth International Conference on Advanced Computing (ICoAC)","volume":"99 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128009068","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 : 2012-12-01DOI: 10.1109/ICOAC.2012.6416808
Bhanu Prakash Gopularam, C. Yogeesha
Software development life cycle consists of various stages like requirements, design, implementation, testing and maintenance. In a typical enterprise level project number of testcases to be executed for each release would be in thousands. One known way of segregating the testcases is using component or module names and one can also classify them based on level of importance like unit testing, functional, sanity etc. With iterative development models like Agile, the release cycle is short and it is prudent to execute the testcase selectively majorly concentrating on impacting components. In this paper we provide a generic way to manage the tests and provide an efficient mechanism to run the tests selectively. In our approach we make use of well-known build management tool called Jenkins for running the tests on-demand. One unique benefit of our approach is that the input is a single comma-separated-value (CSV) file and it is very easy to add/modify existing tests. The tests are tagged using well known keywords (viz. database-layer, configuration, regression). When some particular tests need to be run, the user enters `Tag' in the job parameter and testsuite will be generated dynamically. In this paper we also describe an end-to-end test management system that supports running selective tests with help of jobs created in Jenkins environment. The proposed model of Tests execution is highly useful in high demanding environments like agile software development model, Test driven development model where feature development is many times faster than traditional water fall model. The approach suggested in this paper makes optimum use of cloud resources by distributing the jobs, so this can be utilized specially for testing under virtualized environment.
{"title":"Mechanism for on demand Tag-Based software testing in virtualized environments","authors":"Bhanu Prakash Gopularam, C. Yogeesha","doi":"10.1109/ICOAC.2012.6416808","DOIUrl":"https://doi.org/10.1109/ICOAC.2012.6416808","url":null,"abstract":"Software development life cycle consists of various stages like requirements, design, implementation, testing and maintenance. In a typical enterprise level project number of testcases to be executed for each release would be in thousands. One known way of segregating the testcases is using component or module names and one can also classify them based on level of importance like unit testing, functional, sanity etc. With iterative development models like Agile, the release cycle is short and it is prudent to execute the testcase selectively majorly concentrating on impacting components. In this paper we provide a generic way to manage the tests and provide an efficient mechanism to run the tests selectively. In our approach we make use of well-known build management tool called Jenkins for running the tests on-demand. One unique benefit of our approach is that the input is a single comma-separated-value (CSV) file and it is very easy to add/modify existing tests. The tests are tagged using well known keywords (viz. database-layer, configuration, regression). When some particular tests need to be run, the user enters `Tag' in the job parameter and testsuite will be generated dynamically. In this paper we also describe an end-to-end test management system that supports running selective tests with help of jobs created in Jenkins environment. The proposed model of Tests execution is highly useful in high demanding environments like agile software development model, Test driven development model where feature development is many times faster than traditional water fall model. The approach suggested in this paper makes optimum use of cloud resources by distributing the jobs, so this can be utilized specially for testing under virtualized environment.","PeriodicalId":286985,"journal":{"name":"2012 Fourth International Conference on Advanced Computing (ICoAC)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132495542","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 : 2012-12-01DOI: 10.1109/ICOAC.2012.6416847
U. V. Arivazhagu, S. Srinivasan
Peer-to-Peer systems implement a new environment in decentralized model. In the previous work, to process a single query searching of neighbor nodes is difficult. During query processing we need to search all the nodes in a network for retrieving the appropriate answer for the queries in a particular peer. Hence in this paper we proposed an ant colony optimization technique for query routing and relevance ranking methodology for the selection of peers with good accuracy. Secured way of routing is very important in order to extract efficient resources from the peers. Clustered based approach can be used to overcome the high overhead and delay. By simulation results, we show that our approach improves the efficiency of P2P networks.
{"title":"Ant colony optimization of semantic query routing in Peer to Peer networks","authors":"U. V. Arivazhagu, S. Srinivasan","doi":"10.1109/ICOAC.2012.6416847","DOIUrl":"https://doi.org/10.1109/ICOAC.2012.6416847","url":null,"abstract":"Peer-to-Peer systems implement a new environment in decentralized model. In the previous work, to process a single query searching of neighbor nodes is difficult. During query processing we need to search all the nodes in a network for retrieving the appropriate answer for the queries in a particular peer. Hence in this paper we proposed an ant colony optimization technique for query routing and relevance ranking methodology for the selection of peers with good accuracy. Secured way of routing is very important in order to extract efficient resources from the peers. Clustered based approach can be used to overcome the high overhead and delay. By simulation results, we show that our approach improves the efficiency of P2P networks.","PeriodicalId":286985,"journal":{"name":"2012 Fourth International Conference on Advanced Computing (ICoAC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115727039","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 : 2012-12-01DOI: 10.1109/ICOAC.2012.6416817
R. Tamijetchelvy, G. Sivaradje
Owing to ubiquity of wireless technologies, user satisfaction is greatly affected by the factor such as terminal mobility, guaranteeing quality of service, continuous connectivity to access the world anywhere, anytime and any service has gained a significant importance. Hence, the future generation wireless networks have projected as the integration of various wireless access networks. Seamless internetworking of heterogeneous network is still a stimulating assignment and requires interconnectivity at all layers of network architecture. In mobile communication, seamless vertical handover is one of the most challenging issues. The worst case may cause communication interruption, delays and packet losses which affect the real time communication performance. To resolve the problem of prevailing schemes, a marginal fast vertical handover Mobile IP (MIP) protocol using IEEE 802.21 Media Independent Handover (MIH) standard is proposed. In this paper optimized vertical handover functionality is illustrated for heterogeneous WLAN/WiMAX networks based on IEEE 802.21 Media Independent Handover which combines network functionality from all different access technologies into common set of Commands, Events and Services. The proposed handover scenario is used to evaluate the vertical handover performance involving multimode terminal with WLAN/WiMAX interfaces and IEEE 802.21 entities. This capability proves an efficient solution for mobility, multihoming and routing for integrating heterogeneous networks. In addition, the proposed scheme can reduce considerably traffic overhead between WLAN/WiMAX networks, handover latency and base station scanning interval time. The presented handover scenario concludes by presenting service continuity during and after vertical handover.
{"title":"An optimized fast vertical handover strategy for heterogeneous wireless access networks based on IEEE 802.21 media independent handover standard","authors":"R. Tamijetchelvy, G. Sivaradje","doi":"10.1109/ICOAC.2012.6416817","DOIUrl":"https://doi.org/10.1109/ICOAC.2012.6416817","url":null,"abstract":"Owing to ubiquity of wireless technologies, user satisfaction is greatly affected by the factor such as terminal mobility, guaranteeing quality of service, continuous connectivity to access the world anywhere, anytime and any service has gained a significant importance. Hence, the future generation wireless networks have projected as the integration of various wireless access networks. Seamless internetworking of heterogeneous network is still a stimulating assignment and requires interconnectivity at all layers of network architecture. In mobile communication, seamless vertical handover is one of the most challenging issues. The worst case may cause communication interruption, delays and packet losses which affect the real time communication performance. To resolve the problem of prevailing schemes, a marginal fast vertical handover Mobile IP (MIP) protocol using IEEE 802.21 Media Independent Handover (MIH) standard is proposed. In this paper optimized vertical handover functionality is illustrated for heterogeneous WLAN/WiMAX networks based on IEEE 802.21 Media Independent Handover which combines network functionality from all different access technologies into common set of Commands, Events and Services. The proposed handover scenario is used to evaluate the vertical handover performance involving multimode terminal with WLAN/WiMAX interfaces and IEEE 802.21 entities. This capability proves an efficient solution for mobility, multihoming and routing for integrating heterogeneous networks. In addition, the proposed scheme can reduce considerably traffic overhead between WLAN/WiMAX networks, handover latency and base station scanning interval time. The presented handover scenario concludes by presenting service continuity during and after vertical handover.","PeriodicalId":286985,"journal":{"name":"2012 Fourth International Conference on Advanced Computing (ICoAC)","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115756430","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 : 2012-12-01DOI: 10.1109/ICOAC.2012.6416844
Mr. E. Ramanujam, Dr. S. Padmavathi
The Subsequence Motif mining problem has large class of applications in the field of Bioinformatics, such as protein-protein interaction, protein Motif mining, DNA classification, web log analysis and the like. Existing algorithms detects contiguous exact and approximate patterns by restricting the user in pattern length. Though many algorithms have been solved for the related problem with poor scalability, time inefficiency, some algorithms have extracted only non-contiguous exact patterns without noise in adapting to other applications. In this paper, Constraint Frequent Motif Detection (CFMD) an algorithm is used in extracting both contiguous, non-contiguous patterns of short or long sequences of any length in biological database. CFMD combines data mining techniques such as TRIE like Frequent Pattern (FP-Tree) in constructing the patterns in such a way that most commonly occurring patterns from root to leaf node, Constraints to restrict the growth of FP-Tree and to reduce the search space of the FP-Tree. The efficiency of the proposed CFMD is fast, scalable to extract patterns from both contiguous and non-contiguous sequences. The performance of the proposed approach is proved using both real and synthetic datasets.
{"title":"Constraint Frequent Motif Detection in sequence datasets","authors":"Mr. E. Ramanujam, Dr. S. Padmavathi","doi":"10.1109/ICOAC.2012.6416844","DOIUrl":"https://doi.org/10.1109/ICOAC.2012.6416844","url":null,"abstract":"The Subsequence Motif mining problem has large class of applications in the field of Bioinformatics, such as protein-protein interaction, protein Motif mining, DNA classification, web log analysis and the like. Existing algorithms detects contiguous exact and approximate patterns by restricting the user in pattern length. Though many algorithms have been solved for the related problem with poor scalability, time inefficiency, some algorithms have extracted only non-contiguous exact patterns without noise in adapting to other applications. In this paper, Constraint Frequent Motif Detection (CFMD) an algorithm is used in extracting both contiguous, non-contiguous patterns of short or long sequences of any length in biological database. CFMD combines data mining techniques such as TRIE like Frequent Pattern (FP-Tree) in constructing the patterns in such a way that most commonly occurring patterns from root to leaf node, Constraints to restrict the growth of FP-Tree and to reduce the search space of the FP-Tree. The efficiency of the proposed CFMD is fast, scalable to extract patterns from both contiguous and non-contiguous sequences. The performance of the proposed approach is proved using both real and synthetic datasets.","PeriodicalId":286985,"journal":{"name":"2012 Fourth International Conference on Advanced Computing (ICoAC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128312138","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 : 2012-12-01DOI: 10.1109/ICOAC.2012.6416846
K. Jeyakumar, L. Nithya
The mobile agent paradigm and security issues in the grid has been successfully used in large number of research areas separately, and specifically contributes to the research endeavors. The proposed paper combines both the technologies and provides avenues for further research. Particularly in ad hoc grid environment, resources are not always available as the nodes can spontaneously connect and disconnect at any time. Thus, these environments demand the correct execution of process for improving the performance criteria. However, there are some intruders that affect the normal operation of ad hoc grids. Therefore, it is essential to use punishment procedures based on trust models. The existing work has proven that the RETENTION a reactive trust based mechanism detected and punished malicious nodes in ad hoc grid environments, without generating any false-positives. We propose a mobile agent based trust model in ad hoc grid environment for improving the performance considerations and security issues. Simulation results demonstrate the effectiveness of the proposed work, to detect and punish nodes having malicious behavior, such as selfish nodes, injected nodes and so on. We observe that the behavior of the proposed model is comparatively good in a scenario where the types of attack implemented in different nodes.
{"title":"Mobile agent based security enhancements in ad hoc grid environment","authors":"K. Jeyakumar, L. Nithya","doi":"10.1109/ICOAC.2012.6416846","DOIUrl":"https://doi.org/10.1109/ICOAC.2012.6416846","url":null,"abstract":"The mobile agent paradigm and security issues in the grid has been successfully used in large number of research areas separately, and specifically contributes to the research endeavors. The proposed paper combines both the technologies and provides avenues for further research. Particularly in ad hoc grid environment, resources are not always available as the nodes can spontaneously connect and disconnect at any time. Thus, these environments demand the correct execution of process for improving the performance criteria. However, there are some intruders that affect the normal operation of ad hoc grids. Therefore, it is essential to use punishment procedures based on trust models. The existing work has proven that the RETENTION a reactive trust based mechanism detected and punished malicious nodes in ad hoc grid environments, without generating any false-positives. We propose a mobile agent based trust model in ad hoc grid environment for improving the performance considerations and security issues. Simulation results demonstrate the effectiveness of the proposed work, to detect and punish nodes having malicious behavior, such as selfish nodes, injected nodes and so on. We observe that the behavior of the proposed model is comparatively good in a scenario where the types of attack implemented in different nodes.","PeriodicalId":286985,"journal":{"name":"2012 Fourth International Conference on Advanced Computing (ICoAC)","volume":"2015 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128588378","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 : 2012-12-01DOI: 10.1109/ICOAC.2012.6416854
N. Arulkumar, E. Raj
The wireless medium plays a vital role in communication era in sharing information from one mobile device to another. These wireless devices (nodes) can form a temporary network called Ad-hoc network or they can use existing cellular network. Vehicular Ad-hoc Networks (VANETs) is a type of Ad-hoc network in which vehicles acts as nodes and communicates with the roadside units. VANETs are more helpful in implementing the Intelligent Transport Systems concepts to provide traffic situation, weather conditions and to perform safety warnings by using authentication mechanisms. In this paper, AODV routing protocol is used to implement the Intelligent Transport Systems (ITS) concepts in VANET. A simulation is performed using AODV routing protocol in NS2 to study the hurdles involved in providing a secure and trustworthy data transfer between the vehicular nodes. The data analysis is done based on the results collected from the simulation environment. The data's are traced out to find the absolute details of the network. Finally, the graphs are plotted for Throughput of dropped packets and Throughput of packets generated.
{"title":"A simulation based study to implement Intelligent Transport Systems concepts in VANETs using AODV routing protocol in NS2","authors":"N. Arulkumar, E. Raj","doi":"10.1109/ICOAC.2012.6416854","DOIUrl":"https://doi.org/10.1109/ICOAC.2012.6416854","url":null,"abstract":"The wireless medium plays a vital role in communication era in sharing information from one mobile device to another. These wireless devices (nodes) can form a temporary network called Ad-hoc network or they can use existing cellular network. Vehicular Ad-hoc Networks (VANETs) is a type of Ad-hoc network in which vehicles acts as nodes and communicates with the roadside units. VANETs are more helpful in implementing the Intelligent Transport Systems concepts to provide traffic situation, weather conditions and to perform safety warnings by using authentication mechanisms. In this paper, AODV routing protocol is used to implement the Intelligent Transport Systems (ITS) concepts in VANET. A simulation is performed using AODV routing protocol in NS2 to study the hurdles involved in providing a secure and trustworthy data transfer between the vehicular nodes. The data analysis is done based on the results collected from the simulation environment. The data's are traced out to find the absolute details of the network. Finally, the graphs are plotted for Throughput of dropped packets and Throughput of packets generated.","PeriodicalId":286985,"journal":{"name":"2012 Fourth International Conference on Advanced Computing (ICoAC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128626185","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 : 2012-12-01DOI: 10.1109/ICOAC.2012.6416848
V. Akilandeswari, S. Shalinie
This paper surveys with the emerging research on various methods to identify the legitimate/illegitimate traffic on the network. Here, the focus is on the effective early detection scheme for distinguishing Distributed Denial of Service (DDoS) attack traffic from normal flash crowd traffic. The basic characteristics used to distinguish Distributed Denial of Service (DDoS) attacks from flash crowds are access intents, client request rates, cluster overlap, distribution of source IP address, distribution of clients and speed of traffic. Various techniques related to these metrics are clearly illustrated and corresponding limitations are listed out with their justification. A new method is proposed in this paper which builds a reliable identification model for flash crowd and DDoS attacks. The proposed Probabilistic Neural Network based traffic pattern classification method is used for effective classification of attack traffic from legitimate traffic. The proposed technique uses the normal traffic profile for their classification process which consists of single and joint distribution of various packet attributes. The normal profile contains uniqueness in traffic distribution and also hard for the attackers to mimic as legitimate flow. The proposed method achieves highest classification accuracy for DDoS flooding attacks with less than 1% of false positive rate.
{"title":"Probabilistic Neural Network based attack traffic classification","authors":"V. Akilandeswari, S. Shalinie","doi":"10.1109/ICOAC.2012.6416848","DOIUrl":"https://doi.org/10.1109/ICOAC.2012.6416848","url":null,"abstract":"This paper surveys with the emerging research on various methods to identify the legitimate/illegitimate traffic on the network. Here, the focus is on the effective early detection scheme for distinguishing Distributed Denial of Service (DDoS) attack traffic from normal flash crowd traffic. The basic characteristics used to distinguish Distributed Denial of Service (DDoS) attacks from flash crowds are access intents, client request rates, cluster overlap, distribution of source IP address, distribution of clients and speed of traffic. Various techniques related to these metrics are clearly illustrated and corresponding limitations are listed out with their justification. A new method is proposed in this paper which builds a reliable identification model for flash crowd and DDoS attacks. The proposed Probabilistic Neural Network based traffic pattern classification method is used for effective classification of attack traffic from legitimate traffic. The proposed technique uses the normal traffic profile for their classification process which consists of single and joint distribution of various packet attributes. The normal profile contains uniqueness in traffic distribution and also hard for the attackers to mimic as legitimate flow. The proposed method achieves highest classification accuracy for DDoS flooding attacks with less than 1% of false positive rate.","PeriodicalId":286985,"journal":{"name":"2012 Fourth International Conference on Advanced Computing (ICoAC)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126384711","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
扫码关注我们
求助内容：
应助结果提醒方式：