Pub Date : 2014-04-10DOI: 10.1109/ICRTIT.2014.6996193
S. Prabha, A. Antony, M. Meena, S. Pandian
Cloud robotics is an emerging field that is centered on the benefits of converged infrastructure and shared services of a cloud computing environment. In this paper, a system is designed with an autonomous robot to sense environmental data such as temperature, humidity, and air quality, along with GPS coordinates and store them on the cloud. The mobile robot is controlled using an Arduino microcontroller and communicates with the cloud via a Raspberry Pi. A private cloud is set up using OpenStack that provides Infrastructure as a Service. The collected data are stored in a cloud server which could be viewed through a web browser and can be used to create awareness about the environmental changes of the location under study. A proof-of-concept prototype has been developed to illustrate the effectiveness of the proposed system.
{"title":"Smart cloud robot using raspberry Pi","authors":"S. Prabha, A. Antony, M. Meena, S. Pandian","doi":"10.1109/ICRTIT.2014.6996193","DOIUrl":"https://doi.org/10.1109/ICRTIT.2014.6996193","url":null,"abstract":"Cloud robotics is an emerging field that is centered on the benefits of converged infrastructure and shared services of a cloud computing environment. In this paper, a system is designed with an autonomous robot to sense environmental data such as temperature, humidity, and air quality, along with GPS coordinates and store them on the cloud. The mobile robot is controlled using an Arduino microcontroller and communicates with the cloud via a Raspberry Pi. A private cloud is set up using OpenStack that provides Infrastructure as a Service. The collected data are stored in a cloud server which could be viewed through a web browser and can be used to create awareness about the environmental changes of the location under study. A proof-of-concept prototype has been developed to illustrate the effectiveness of the proposed system.","PeriodicalId":422275,"journal":{"name":"2014 International Conference on Recent Trends in Information Technology","volume":"19 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":"122911306","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.6996203
M. Divya, P. Kumudha, N. Anithadevi
Online reputation systems play a significant role in decision support during internet mediated service provision. With the fast development of online reputation systems in various social networks, operations against such systems are growing rapidly. It has been considered as an important but most difficult problem. In this paper, we propose a defense solution TTAUCA [Temporal, Trust And User Correlation Analysis], which secure the reputation systems from a novel angle, that is used to integrate time domain anomaly detection, Dempster-Shafer Theory based trust computation and user correlation analysis. Real user attack data collected from a cyber competition is used to construct the testing data set. Compared with previous scheme TATA [Temporal And Trust Analysis], TTAUCA achieves a better performance in terms of detecting products under attacks, identifying malicious users who insert illegitimate ratings, and recovering reputation scores of victim products.
网络声誉系统在网络中介服务提供过程中的决策支持中发挥着重要作用。随着各种社交网络中在线声誉系统的快速发展，针对此类系统的操作也在迅速增长。它一直被认为是一个重要但最难的问题。本文提出了一种新的防御方案TTAUCA (Temporal, Trust And User Correlation Analysis)，将时域异常检测、基于Dempster-Shafer理论的信任计算和用户相关性分析相结合，从一个新的角度对信誉系统进行了保护。使用从网络竞赛中收集的真实用户攻击数据来构建测试数据集。与之前的方案TATA [Temporal And Trust Analysis]相比，TTAUCA在检测受到攻击的产品、识别插入非法评级的恶意用户、恢复受害产品的信誉分数等方面取得了更好的性能。
{"title":"Securing online reputation systems through temporal, trust and user correlation analysis","authors":"M. Divya, P. Kumudha, N. Anithadevi","doi":"10.1109/ICRTIT.2014.6996203","DOIUrl":"https://doi.org/10.1109/ICRTIT.2014.6996203","url":null,"abstract":"Online reputation systems play a significant role in decision support during internet mediated service provision. With the fast development of online reputation systems in various social networks, operations against such systems are growing rapidly. It has been considered as an important but most difficult problem. In this paper, we propose a defense solution TTAUCA [Temporal, Trust And User Correlation Analysis], which secure the reputation systems from a novel angle, that is used to integrate time domain anomaly detection, Dempster-Shafer Theory based trust computation and user correlation analysis. Real user attack data collected from a cyber competition is used to construct the testing data set. Compared with previous scheme TATA [Temporal And Trust Analysis], TTAUCA achieves a better performance in terms of detecting products under attacks, identifying malicious users who insert illegitimate ratings, and recovering reputation scores of victim products.","PeriodicalId":422275,"journal":{"name":"2014 International Conference on Recent Trends in Information Technology","volume":"289 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":"122716916","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.6996116
M. Elakkiya, S. Kaushik, Elizabeth. N Edna
Adhoc Networks (MANETs) are an emerging area of mobile computing. There are various challenges that are faced in adhoc environment. These are mostly due to the resource poorness of these networks. They are usually set up in situations of emergency, for temporary operations or simply if there are no resources to set up elaborate networks. Adhoc networks therefore throw up new requirements and problems in all areas of networking. The solutions for conventional networks are usually not sufficient to provide efficient Ad-hoc operations. The wireless nature of communication and lack of any security infrastructure raise several security problems. Commonly defined as the infrastructure less independent networks are prone to much vulnerability. These decentralized networks when employ conventional routing algorithms to forward data do not effectively transfer the packet to the right destination, as all these algorithms require a contemporary routing path between a source and destination node. Such prolonged link is not possible in a highly mobile network. The link between the nodes is only temporary and these links break down as the nodes move away from the direct communication range. Focusing on the secure routing against various attacks and the high probability of data delivery in an optimum manner, a Trust based opportunistic routing algorithm which is able to reliably route data despite highly unstable links is proposed in this paper. The trust model framed is incorporated in the basic routing algorithm, AODV. An attempt to explain various attack mitigation by the proposed trust model is also made.
{"title":"Opportunistic routing to mitigate attacks in MANET","authors":"M. Elakkiya, S. Kaushik, Elizabeth. N Edna","doi":"10.1109/ICRTIT.2014.6996116","DOIUrl":"https://doi.org/10.1109/ICRTIT.2014.6996116","url":null,"abstract":"Adhoc Networks (MANETs) are an emerging area of mobile computing. There are various challenges that are faced in adhoc environment. These are mostly due to the resource poorness of these networks. They are usually set up in situations of emergency, for temporary operations or simply if there are no resources to set up elaborate networks. Adhoc networks therefore throw up new requirements and problems in all areas of networking. The solutions for conventional networks are usually not sufficient to provide efficient Ad-hoc operations. The wireless nature of communication and lack of any security infrastructure raise several security problems. Commonly defined as the infrastructure less independent networks are prone to much vulnerability. These decentralized networks when employ conventional routing algorithms to forward data do not effectively transfer the packet to the right destination, as all these algorithms require a contemporary routing path between a source and destination node. Such prolonged link is not possible in a highly mobile network. The link between the nodes is only temporary and these links break down as the nodes move away from the direct communication range. Focusing on the secure routing against various attacks and the high probability of data delivery in an optimum manner, a Trust based opportunistic routing algorithm which is able to reliably route data despite highly unstable links is proposed in this paper. The trust model framed is incorporated in the basic routing algorithm, AODV. An attempt to explain various attack mitigation by the proposed trust model is also made.","PeriodicalId":422275,"journal":{"name":"2014 International Conference on Recent Trends in Information Technology","volume":"16 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":"115199240","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.6996124
C. Sindhuja, K. .. Srinivasagan, S. Kalaiselvi
An automated visual monitoring process expands from low level analysis of object detection and tracking to the interpretation of their behaviors. Analyzing human crowd is an emerging trend in intelligent video surveillance for the purpose of detecting abnormalities. Tracking every human being in a crowd and analyzing their behavior is a challenging task due to occlusions. Hence, the crowd can be handled as a group entity instead of tracking the individual in the crowd. The behavior of the crowd can be distinguished with motion patterns due to prominent spatio-temporal characteristics. The proposed system involves a systematic approach to recognize the global events in human crowd through observing motion patterns such as flow, speed and direction. Initially as a preprocessing step, background subtraction is performed to extract the foreground blobs and optical flow is estimated to obtain the velocity and direction of motion. The human crowds are then clustered based on similar direction and proximity using Adjacency Matrix based Clustering (AMC). After clustering, the centroid and orientation of the cluster are extracted inorder to represent the behavior of crowd. Finally the multiclass Support Vector Machine (SVM) is trained to correctly recognize the behavior of crowd.
{"title":"An efficient method for crowd event recognition based on motion patterns","authors":"C. Sindhuja, K. .. Srinivasagan, S. Kalaiselvi","doi":"10.1109/ICRTIT.2014.6996124","DOIUrl":"https://doi.org/10.1109/ICRTIT.2014.6996124","url":null,"abstract":"An automated visual monitoring process expands from low level analysis of object detection and tracking to the interpretation of their behaviors. Analyzing human crowd is an emerging trend in intelligent video surveillance for the purpose of detecting abnormalities. Tracking every human being in a crowd and analyzing their behavior is a challenging task due to occlusions. Hence, the crowd can be handled as a group entity instead of tracking the individual in the crowd. The behavior of the crowd can be distinguished with motion patterns due to prominent spatio-temporal characteristics. The proposed system involves a systematic approach to recognize the global events in human crowd through observing motion patterns such as flow, speed and direction. Initially as a preprocessing step, background subtraction is performed to extract the foreground blobs and optical flow is estimated to obtain the velocity and direction of motion. The human crowds are then clustered based on similar direction and proximity using Adjacency Matrix based Clustering (AMC). After clustering, the centroid and orientation of the cluster are extracted inorder to represent the behavior of crowd. Finally the multiclass Support Vector Machine (SVM) is trained to correctly recognize the behavior of crowd.","PeriodicalId":422275,"journal":{"name":"2014 International Conference on Recent Trends in Information Technology","volume":"167 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":"115916550","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.6996194
S. Chidambaram, K. .. Srinivasagan
Now a Days huge volume of personal and sensitive data is collected and retrieved by various enterprises like social networking system, health networks, financial organizations and retailers. There are three main entities such as data owner; the database service provider and the client are mainly involved in this type of outsourced based data model. So that is more essential for the privacy preservation of the owner. Privacy preservation is a main challenging area in data mining. In that, Data based privacy perturbation technique is the standard model which performs the data transformation process before publishing the data. This paper proposes Additive Multiplicative Perturbation Privacy Preserving Data Mining (AM-PPDM) which is suitable for multiple trust level. In that, the random noise perturbation is applied to individual values before the data are published. This hybrid approach improves the privacy guarantee value during the reconstruction process. In AM-PPDM, the generated random Gaussian noise multiplied with the original data to produce different perturbed copies at various trust levels. By implementing this approach, the diversity attack is completely avoided during the reconstruction process.
{"title":"A combined random noise perturbation approach for multi level privacy preservation in data mining","authors":"S. Chidambaram, K. .. Srinivasagan","doi":"10.1109/ICRTIT.2014.6996194","DOIUrl":"https://doi.org/10.1109/ICRTIT.2014.6996194","url":null,"abstract":"Now a Days huge volume of personal and sensitive data is collected and retrieved by various enterprises like social networking system, health networks, financial organizations and retailers. There are three main entities such as data owner; the database service provider and the client are mainly involved in this type of outsourced based data model. So that is more essential for the privacy preservation of the owner. Privacy preservation is a main challenging area in data mining. In that, Data based privacy perturbation technique is the standard model which performs the data transformation process before publishing the data. This paper proposes Additive Multiplicative Perturbation Privacy Preserving Data Mining (AM-PPDM) which is suitable for multiple trust level. In that, the random noise perturbation is applied to individual values before the data are published. This hybrid approach improves the privacy guarantee value during the reconstruction process. In AM-PPDM, the generated random Gaussian noise multiplied with the original data to produce different perturbed copies at various trust levels. By implementing this approach, the diversity attack is completely avoided during the reconstruction process.","PeriodicalId":422275,"journal":{"name":"2014 International Conference on Recent Trends in Information Technology","volume":"78 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":"123661881","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.6996148
S. Ramachandran, S. Grace, S. S. Beevi
Sensor-cloud is a relatively new interdisciplinary domain that combines the fields of Wireless Sensor Networks (WSN) and Cloud Computing. The major issue needs to be addressed in Sensor-Cloud is storage and retrieval of data. Data security is preserved by encrypting the sensor data before storing it into the cloud. On analysis of existing methods, there are two different issues, First issue; Encrypted Document matching is performed based on their plaintext keywords which is not suitable for sensor data and Second issue, subscribers are categorized based on their predicates. So, the storage space required is more. To overcome these issues, the paper proposes a new indexing structure which is suitable for sensor data and a new algorithm called Weighted Category Matching Algorithm (WCMA) for quick retrieval. On comparing with existing methods, the proposed WCMA algorithm achieves a better document retrieval and results are discussed in implementation details.
{"title":"Weighted Category Matching Algorithm in Sensor Cloud for rapid retrieval","authors":"S. Ramachandran, S. Grace, S. S. Beevi","doi":"10.1109/ICRTIT.2014.6996148","DOIUrl":"https://doi.org/10.1109/ICRTIT.2014.6996148","url":null,"abstract":"Sensor-cloud is a relatively new interdisciplinary domain that combines the fields of Wireless Sensor Networks (WSN) and Cloud Computing. The major issue needs to be addressed in Sensor-Cloud is storage and retrieval of data. Data security is preserved by encrypting the sensor data before storing it into the cloud. On analysis of existing methods, there are two different issues, First issue; Encrypted Document matching is performed based on their plaintext keywords which is not suitable for sensor data and Second issue, subscribers are categorized based on their predicates. So, the storage space required is more. To overcome these issues, the paper proposes a new indexing structure which is suitable for sensor data and a new algorithm called Weighted Category Matching Algorithm (WCMA) for quick retrieval. On comparing with existing methods, the proposed WCMA algorithm achieves a better document retrieval and results are discussed in implementation details.","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":"123681213","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.6996190
Sivashankar, S. Ramasamy
Flash-memory-based solid-state disks (SSDs) provide faster random access and data transfer rates than electromechanical drives and today it can often serve as rotating-disk replacements, but the host interface to SSDs remains a performance bottleneck and also I/O subsystem causes unnecessary latencies, translations in the Read/Write commands. In order to completely utilize the performance of SSDs a Non Volatile Memory Subsystem was designed based on the NVM Express Specification. The communication to this I/O subsystem is through PCI Express interface and the command set is based on NVMe 1.0c Specification. The designed sub-system typically consists of PCIe Core, PCIe controller, NVMe controller, NAND Flash Controller and several NAND Chips. The present paper deals with the design and implementation of PCIe controller and the NVMe controller. The PCIe controller was designed as a generic bridge between any PCIe device and the PCIe Core. The NVMe controller was designed as a PCIe device which implements the NVMe Specification.
{"title":"Design and implementation of non-volatile memory express","authors":"Sivashankar, S. Ramasamy","doi":"10.1109/ICRTIT.2014.6996190","DOIUrl":"https://doi.org/10.1109/ICRTIT.2014.6996190","url":null,"abstract":"Flash-memory-based solid-state disks (SSDs) provide faster random access and data transfer rates than electromechanical drives and today it can often serve as rotating-disk replacements, but the host interface to SSDs remains a performance bottleneck and also I/O subsystem causes unnecessary latencies, translations in the Read/Write commands. In order to completely utilize the performance of SSDs a Non Volatile Memory Subsystem was designed based on the NVM Express Specification. The communication to this I/O subsystem is through PCI Express interface and the command set is based on NVMe 1.0c Specification. The designed sub-system typically consists of PCIe Core, PCIe controller, NVMe controller, NAND Flash Controller and several NAND Chips. The present paper deals with the design and implementation of PCIe controller and the NVMe controller. The PCIe controller was designed as a generic bridge between any PCIe device and the PCIe Core. The NVMe controller was designed as a PCIe device which implements the NVMe Specification.","PeriodicalId":422275,"journal":{"name":"2014 International Conference on Recent Trends in Information Technology","volume":"22 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":"114839474","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.6996182
B. L. Elizabeth, K. Ramya, A. Prakash, V. R. Uthariaraj
Cloud computing has changed the nature of IT and business. However the adoption issues for the cloud is mainly due to the lack of transparency and control. Also, there are too many cloud service providers in the marketplace offering similar functionalities. In order to support the consumers in identifying trustful cloud providers, Trustworthy mechanisms for selecting cloud service providers is proposed in this paper. The proposed system is implemented using feedbacks and credential attributes (QoS) of providers. A modified Identity model is proposed to identify malicious feedbacks and provides improvements in the trust computation. Results show that the trust computation using the proposed architecture is more efficient in terms of finding accurate trust based providers.
{"title":"Trustworthy mechanisms for selecting cloud service providers","authors":"B. L. Elizabeth, K. Ramya, A. Prakash, V. R. Uthariaraj","doi":"10.1109/ICRTIT.2014.6996182","DOIUrl":"https://doi.org/10.1109/ICRTIT.2014.6996182","url":null,"abstract":"Cloud computing has changed the nature of IT and business. However the adoption issues for the cloud is mainly due to the lack of transparency and control. Also, there are too many cloud service providers in the marketplace offering similar functionalities. In order to support the consumers in identifying trustful cloud providers, Trustworthy mechanisms for selecting cloud service providers is proposed in this paper. The proposed system is implemented using feedbacks and credential attributes (QoS) of providers. A modified Identity model is proposed to identify malicious feedbacks and provides improvements in the trust computation. Results show that the trust computation using the proposed architecture is more efficient in terms of finding accurate trust based providers.","PeriodicalId":422275,"journal":{"name":"2014 International Conference on Recent Trends in Information Technology","volume":"82 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":"115242649","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.6996153
R. Kirtiga, O. S. GnanaPrakasi, D. Kavipriya, R. Anita, P. Varalakshmi
Vehicular ad hoc networks are a subclass of wireless networks in which vehicles on the road act as nodes, exchanging traffic and road safety information. The traditional MANET specific routing protocols is not as effective in VANET environment. The occurrence of link breakage is very frequent in VANET when compared to MANET due to the swift movement of the vehicles. Hence, this highly dynamic behaviour of VANETs demands a reliable routing strategy. As of now, not much attention is laid on routing reliability of VANETs in highway environment. Our objective is to propose a reliable routing protocol that minimizes link breakage and thereby increasing the throughput in VANET- variable velocity environment. The mechanism is based on the mathematical model of normal (Gaussian) distribution, which is a continuous probability distribution function. This function is used to estimate the link reliability between the vehicular nodes in the road. Based on the computed link reliability values between the nodes, the system constructs an evolving graph in a dynamic fashion and the route reliability value is estimated from the graph. This route forms the Most Reliable Journey for the data transmission.
{"title":"Reliable graph based routing in VANET environment","authors":"R. Kirtiga, O. S. GnanaPrakasi, D. Kavipriya, R. Anita, P. Varalakshmi","doi":"10.1109/ICRTIT.2014.6996153","DOIUrl":"https://doi.org/10.1109/ICRTIT.2014.6996153","url":null,"abstract":"Vehicular ad hoc networks are a subclass of wireless networks in which vehicles on the road act as nodes, exchanging traffic and road safety information. The traditional MANET specific routing protocols is not as effective in VANET environment. The occurrence of link breakage is very frequent in VANET when compared to MANET due to the swift movement of the vehicles. Hence, this highly dynamic behaviour of VANETs demands a reliable routing strategy. As of now, not much attention is laid on routing reliability of VANETs in highway environment. Our objective is to propose a reliable routing protocol that minimizes link breakage and thereby increasing the throughput in VANET- variable velocity environment. The mechanism is based on the mathematical model of normal (Gaussian) distribution, which is a continuous probability distribution function. This function is used to estimate the link reliability between the vehicular nodes in the road. Based on the computed link reliability values between the nodes, the system constructs an evolving graph in a dynamic fashion and the route reliability value is estimated from the graph. This route forms the Most Reliable Journey for the data transmission.","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":"123599335","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.6996154
P. Mohana Priya, V. Akilandeswari, S. Shalinie, V. Lavanya, M. Shanmuga Priya
High-rate flooding attack detection and classification has become a necessary component for network administrators due to their attack range that affects the Data Center servers. The main objective of this paper is to propose the Protocol Independent Detection and Classification (PIDC) system in order to prevent the web servers from devastating attacks such as Distributed Reflection Denial of Service (DRDoS) attacks. The DRDoS flooding attack exploits fixed IP spoofing to defeat the Distributed Denial of Service (DDoS) attack prevention measures. This is the first paper to detect and classify the types of reflected attacks using SNMP MIB variables. The proposed PIDC system uses the data mining and machine learning techniques to detect all types of reflected flooding attacks. The rank correlation based detection algorithm retrieves the incoming traffic in the form of Simple Network Management Protocol -Management Information Base (SNMP-MIB) variables and finds the relationship between the MIB variables to detect the attacks from the normal traffic. Then, C4.5 classification algorithm extracts and frames association rule based on protocol information from reflected DDoS flooding attacks. Finally, the CPU, memory and disk resource distribution to legitimate requests are also increased. This method achieves 99% of true positive rates and less false positive rate of (1%) when compared to existing reflected attack detection methods. Moreover, these attacks are classified by types such as TCP reflection attacks and DNS reflection attacks with the highest probability of attack traffic.
由于高速泛洪攻击的攻击范围广泛，影响到整个数据中心服务器，成为网络管理员必备的检测与分类组件。本文的主要目的是提出一种协议独立检测与分类(PIDC)系统，以防止web服务器遭受分布式反射拒绝服务(DRDoS)攻击等破坏性攻击。DDoS (Distributed Denial of Service)攻击是一种利用固定IP欺骗来攻击DDoS (Distributed Denial of Service)防御措施的攻击方式。这是第一篇使用SNMP MIB变量检测和分类反射攻击类型的论文。所提出的PIDC系统使用数据挖掘和机器学习技术来检测所有类型的反射洪水攻击。基于等级关联的检测算法以SNMP-MIB (Simple Network Management Protocol -Management Information Base)变量的形式检索进入的流量，通过查找MIB变量之间的关系，对正常流量进行攻击检测。然后，C4.5分类算法根据反射式DDoS洪水攻击的协议信息提取关联规则并将其帧化。最后，分配给合法请求的CPU、内存和磁盘资源也增加了。与现有的反射攻击检测方法相比，该方法实现了99%的真阳性率和更低的假阳性率(1%)。此外，这些攻击还根据攻击流量概率最高的类型进行分类，如TCP反射攻击和DNS反射攻击。
{"title":"The Protocol Independent Detection and Classification (PIDC) system for DRDoS attack","authors":"P. Mohana Priya, V. Akilandeswari, S. Shalinie, V. Lavanya, M. Shanmuga Priya","doi":"10.1109/ICRTIT.2014.6996154","DOIUrl":"https://doi.org/10.1109/ICRTIT.2014.6996154","url":null,"abstract":"High-rate flooding attack detection and classification has become a necessary component for network administrators due to their attack range that affects the Data Center servers. The main objective of this paper is to propose the Protocol Independent Detection and Classification (PIDC) system in order to prevent the web servers from devastating attacks such as Distributed Reflection Denial of Service (DRDoS) attacks. The DRDoS flooding attack exploits fixed IP spoofing to defeat the Distributed Denial of Service (DDoS) attack prevention measures. This is the first paper to detect and classify the types of reflected attacks using SNMP MIB variables. The proposed PIDC system uses the data mining and machine learning techniques to detect all types of reflected flooding attacks. The rank correlation based detection algorithm retrieves the incoming traffic in the form of Simple Network Management Protocol -Management Information Base (SNMP-MIB) variables and finds the relationship between the MIB variables to detect the attacks from the normal traffic. Then, C4.5 classification algorithm extracts and frames association rule based on protocol information from reflected DDoS flooding attacks. Finally, the CPU, memory and disk resource distribution to legitimate requests are also increased. This method achieves 99% of true positive rates and less false positive rate of (1%) when compared to existing reflected attack detection methods. Moreover, these attacks are classified by types such as TCP reflection attacks and DNS reflection attacks with the highest probability of attack traffic.","PeriodicalId":422275,"journal":{"name":"2014 International Conference on Recent Trends in Information Technology","volume":"11 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":"128361215","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
扫码关注我们
求助内容：
应助结果提醒方式：