Clock synchronization protocols in wireless sensor networks (WSNs) provide a uniform notion of time which is required by both system as well as application level programs of WSNs. Since nodes have limited energy, it is required that the energy consumed by the clock synchronization protocols is as minimum as possible. Synchronous clock synchronization protocols execute their clock synchronization process at each node, roughly during the same real-time interval, called synchronization phase. The energy consumed by these protocols depends on the duration of the synchronization phase and how frequently the synchronization phase is executed. Hence, to minimize the energy consumption by each node, the duration of synchronization phase should be as small as possible, and the interval between consecutive synchronization phases as large as possible. Due to different drift rates of the clocks, the synchronization phases at different nodes drift apart and special techniques are required to keep them in sync. Keeping synchronization phases at neighbouring nodes in sync helps to reduce the synchronization phase. In this paper, we propose a novel technique using TDMA-based MAC protocol to keep the synchronization phases at neighbouring nodes in sync much more tightly than the existing techniques. We have applied the technique in the improved weighted-average based clock synchronization (IWICS) protocol to reduce the synchronization phase considerably and the modified TDMA-based IWICS protocol is named TIWICS protocol. This reduction in energy consumption is achieved without reducing the synchronization accuracy. Simulation results obtained using Castalia network simulator and the experimental results obtained using a test bed of WSN consisting of a few TELUS motes confirm the effectiveness of the approach.
{"title":"Improving the Energy Efficiency of a Clock Synchronization Protocol for WSNs Using a TDMA-Based MAC Protocol","authors":"Siddharth Watwe, R. Hansdah","doi":"10.1109/AINA.2015.190","DOIUrl":"https://doi.org/10.1109/AINA.2015.190","url":null,"abstract":"Clock synchronization protocols in wireless sensor networks (WSNs) provide a uniform notion of time which is required by both system as well as application level programs of WSNs. Since nodes have limited energy, it is required that the energy consumed by the clock synchronization protocols is as minimum as possible. Synchronous clock synchronization protocols execute their clock synchronization process at each node, roughly during the same real-time interval, called synchronization phase. The energy consumed by these protocols depends on the duration of the synchronization phase and how frequently the synchronization phase is executed. Hence, to minimize the energy consumption by each node, the duration of synchronization phase should be as small as possible, and the interval between consecutive synchronization phases as large as possible. Due to different drift rates of the clocks, the synchronization phases at different nodes drift apart and special techniques are required to keep them in sync. Keeping synchronization phases at neighbouring nodes in sync helps to reduce the synchronization phase. In this paper, we propose a novel technique using TDMA-based MAC protocol to keep the synchronization phases at neighbouring nodes in sync much more tightly than the existing techniques. We have applied the technique in the improved weighted-average based clock synchronization (IWICS) protocol to reduce the synchronization phase considerably and the modified TDMA-based IWICS protocol is named TIWICS protocol. This reduction in energy consumption is achieved without reducing the synchronization accuracy. Simulation results obtained using Castalia network simulator and the experimental results obtained using a test bed of WSN consisting of a few TELUS motes confirm the effectiveness of the approach.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"34 1","pages":"231-238"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82665871","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}
Danish Mahmood, N. Javaid, M. Imran, Z. Khan, U. Qasim, M. Alnuem
Orientation sensing is not a new concept. It is being used since ages however, with emergence of new technologies such as Wireless Body Area Sensor Networks (WBASNs), it gives new challenges. Commencement of smart phones that have built in orientation sensors are replacing expensive and complex Inertial Measurement Units (IMUs) designed for a specific purpose. Orientation sensing in WBASN have numerous applications. In e-health applications, rehabilitation investigation of backbone injuries can be measured by continues readings of posture. For that, gyroscopes and accelerometers are key sensors that play vital role. For machines such as robots and air crafts, such data fusion is in practice. However, considering human body movements yet there is a need to find an accurate fusion algorithm that meets all demands with low complexity. In this work, we discussed and compared two algorithms considering Wireless Body Area Sensor Fusion (WBASF) i.e. Kalman and Complementary data fusion techniques. According to our findings, Kalman Filter may have given very good results regarding machines however, Complementary filter proved itself better in performance, complexity and required computational power in WBASNs.
{"title":"On Data Fusion for Orientation Sensing in WBASNs Using Smart Phones","authors":"Danish Mahmood, N. Javaid, M. Imran, Z. Khan, U. Qasim, M. Alnuem","doi":"10.1109/AINA.2015.222","DOIUrl":"https://doi.org/10.1109/AINA.2015.222","url":null,"abstract":"Orientation sensing is not a new concept. It is being used since ages however, with emergence of new technologies such as Wireless Body Area Sensor Networks (WBASNs), it gives new challenges. Commencement of smart phones that have built in orientation sensors are replacing expensive and complex Inertial Measurement Units (IMUs) designed for a specific purpose. Orientation sensing in WBASN have numerous applications. In e-health applications, rehabilitation investigation of backbone injuries can be measured by continues readings of posture. For that, gyroscopes and accelerometers are key sensors that play vital role. For machines such as robots and air crafts, such data fusion is in practice. However, considering human body movements yet there is a need to find an accurate fusion algorithm that meets all demands with low complexity. In this work, we discussed and compared two algorithms considering Wireless Body Area Sensor Fusion (WBASF) i.e. Kalman and Complementary data fusion techniques. According to our findings, Kalman Filter may have given very good results regarding machines however, Complementary filter proved itself better in performance, complexity and required computational power in WBASNs.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"1 1","pages":"461-467"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77290913","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}
A. H. Khan, N. Javaid, M. Imran, Z. Khan, U. Qasim, Noman Haider
In this paper, we present need-based clustering (NbC) with dynamic sink mobility (DYN-NbC) scheme for wireless sensor networks (WSNs). Our proposed scheme increases the stability period, network lifetime, and throughput of the WSN. The scheme incorporates dynamic sink mobility in a way that mobile sink (MS) moves from dense (in terms of number of nodes) regions towards sparse regions. Intelligently moving the sink to high density regions ensure maximum collection of data. As, more number of nodes (sensors) are able to send data directly to MS, therefore, significant amount of energy is saved in each particular round. However, there is a certain limitation to this approach. Nodes which are far from sink have to wait much for their turn. So, there are chances of buffer (node storage) overflow that is not desirable. To overcome this issue our scheme includes. Clustering (communication via CHs) becomes the part for those regions which are away from MS. Simulation results show that DYN-NbC outperforms the other two protocols D-LEACH and LEACH in terms of stability period, network lifetime, and network throughput.
{"title":"DYN-NbC: A New Routing Scheme to Maximize Lifetime and Throughput of WSNs","authors":"A. H. Khan, N. Javaid, M. Imran, Z. Khan, U. Qasim, Noman Haider","doi":"10.1109/AINA.2015.171","DOIUrl":"https://doi.org/10.1109/AINA.2015.171","url":null,"abstract":"In this paper, we present need-based clustering (NbC) with dynamic sink mobility (DYN-NbC) scheme for wireless sensor networks (WSNs). Our proposed scheme increases the stability period, network lifetime, and throughput of the WSN. The scheme incorporates dynamic sink mobility in a way that mobile sink (MS) moves from dense (in terms of number of nodes) regions towards sparse regions. Intelligently moving the sink to high density regions ensure maximum collection of data. As, more number of nodes (sensors) are able to send data directly to MS, therefore, significant amount of energy is saved in each particular round. However, there is a certain limitation to this approach. Nodes which are far from sink have to wait much for their turn. So, there are chances of buffer (node storage) overflow that is not desirable. To overcome this issue our scheme includes. Clustering (communication via CHs) becomes the part for those regions which are away from MS. Simulation results show that DYN-NbC outperforms the other two protocols D-LEACH and LEACH in terms of stability period, network lifetime, and network throughput.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"10 1","pages":"92-97"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77539793","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}
In our previous work, we proposed a dynamic data reallocation method for Web-based multiserver Multiplayer On-line Role-Playing Game (MORPG) systems. This method handles the data allocation as a combinational optimization problem. It is solved by using a tabu search that is a well-known meta-heuristic algorithm. Our system has some Web servers and an additional computation server. The computation server solves algorithm and decides the data allocation. However, each load of server is not completely balanced. This means that some Web server might have free computing resources. We aim to use these resources effectively. Therefore, our system handles a Web server that has free resources as a computation server. In this paper, we propose a selection method of a computation server in the Web servers. The server loads might be predicted because the data allocation is decided according to the last server loads and the user requests. Therefore, our system predicts the load of each server and selects a Web server. This selected server acts the computation server and decides the data allocation for the next term. After that, the computation server predicts the server load and selects the next computation server. We evaluates the performance of our system by measuring the latency values for game users and the server loads.
{"title":"A Server Selection Method for Web-Based Multiserver Systems","authors":"Masaki Kohana, S. Okamoto","doi":"10.1109/AINA.2015.174","DOIUrl":"https://doi.org/10.1109/AINA.2015.174","url":null,"abstract":"In our previous work, we proposed a dynamic data reallocation method for Web-based multiserver Multiplayer On-line Role-Playing Game (MORPG) systems. This method handles the data allocation as a combinational optimization problem. It is solved by using a tabu search that is a well-known meta-heuristic algorithm. Our system has some Web servers and an additional computation server. The computation server solves algorithm and decides the data allocation. However, each load of server is not completely balanced. This means that some Web server might have free computing resources. We aim to use these resources effectively. Therefore, our system handles a Web server that has free resources as a computation server. In this paper, we propose a selection method of a computation server in the Web servers. The server loads might be predicted because the data allocation is decided according to the last server loads and the user requests. Therefore, our system predicts the load of each server and selects a Web server. This selected server acts the computation server and decides the data allocation for the next term. After that, the computation server predicts the server load and selects the next computation server. We evaluates the performance of our system by measuring the latency values for game users and the server loads.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"237 1","pages":"112-117"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88911762","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}
Peer to peer network is highly huge, open and dynamic. The nodes in the network with autonomy, anonymity, can freely join in or leave the network, and they do not need to be responsible for their own behavior, which reduces the P2P file sharing system's transaction success rate and brings a lot of serious hidden security danger. Some security issues in the P2P network file share system were studied in this paper. The reputation incentive mechanism is established to encourage nodes to contribute own resources positively, increase network resources and promote the healthy development of network, which can improve the resources localization rate and transaction success rate to enhance the network's security.
{"title":"The Research of Security of P2P Network File Sharing System","authors":"Shaojing Li, Wanli Su, Haoling Li","doi":"10.1109/WAINA.2015.57","DOIUrl":"https://doi.org/10.1109/WAINA.2015.57","url":null,"abstract":"Peer to peer network is highly huge, open and dynamic. The nodes in the network with autonomy, anonymity, can freely join in or leave the network, and they do not need to be responsible for their own behavior, which reduces the P2P file sharing system's transaction success rate and brings a lot of serious hidden security danger. Some security issues in the P2P network file share system were studied in this paper. The reputation incentive mechanism is established to encourage nodes to contribute own resources positively, increase network resources and promote the healthy development of network, which can improve the resources localization rate and transaction success rate to enhance the network's security.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"13 1","pages":"250-254"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89085151","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}
Tomoya Kawakami, T. Yoshihisa, Y. Yanagisawa, M. Tsukamoto
Recently, sensor devices such as temperature sensors or cameras are used for various purposes. These devices sometimes construct ad hoc networks, and a grid topology is one of their typical network topologies. Describing processing by rules is suitable for them since the system can flexibly change their processing according to their purposes. By relieving their rule processing loads and communication delay, the system can be applied for many applications. However, there is no rule processing schemes to realize those. In this paper, we propose a rule processing scheme using the Rete algorithm. Our proposed scheme can realize rule processing reducing redundant loads and delay for many applications.
{"title":"A Rule Processing Scheme Using the Rete Algorithm in Grid Topology Networks","authors":"Tomoya Kawakami, T. Yoshihisa, Y. Yanagisawa, M. Tsukamoto","doi":"10.1109/AINA.2015.252","DOIUrl":"https://doi.org/10.1109/AINA.2015.252","url":null,"abstract":"Recently, sensor devices such as temperature sensors or cameras are used for various purposes. These devices sometimes construct ad hoc networks, and a grid topology is one of their typical network topologies. Describing processing by rules is suitable for them since the system can flexibly change their processing according to their purposes. By relieving their rule processing loads and communication delay, the system can be applied for many applications. However, there is no rule processing schemes to realize those. In this paper, we propose a rule processing scheme using the Rete algorithm. Our proposed scheme can realize rule processing reducing redundant loads and delay for many applications.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"37 1","pages":"674-679"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85046643","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}
This paper presents an iterative visualization technique including the timeline and parallel coordinates to illustrate network communication for forensic analysis. In primarily analysis process, the timeline of events is reconstructed from traffic logs. An analyst can track the related anomaly event on-demand. In addition the details of abnormal and normal activities are shown in multiple dimensions of parallel coordinates. The novelty of this research is not a presentation of the timeline and parallel coordinates technique, but iterative visualization framework to illustrate both anomaly traffic and application traffic pattern. We applied frequent item-set mining to search dominant traffic flow and classify them by traffic flow shape and entropy. Although some studies have been applied frequent item-set mining with traffic dataset, but as we have known, this is the first research to 1) take advantages of the frequent item-set mining and parallel coordinates, which allow us to find both the anomaly traffic and application traffic and it can easily understand the patterns of traffic flow with the multi-dimensional visualization, and 2) classify the application traffic from the entropy values of traffic flow discovered by frequent item-set mining. This method is able to classify the encrypted traffic data and it does not violate a user privacy. The results of this research and development of a visual network communication tool can: 1) show abnormalities and normal communication activities, 2) have application traffic classification 92% accurate, 3) be a visual network communication prototype which helps an analyst to find the cause of the network malfunction.
{"title":"Traffic Flow Classification and Visualization for Network Forensic Analysis","authors":"Nuttachot Promrit, A. Mingkhwan","doi":"10.1109/AINA.2015.207","DOIUrl":"https://doi.org/10.1109/AINA.2015.207","url":null,"abstract":"This paper presents an iterative visualization technique including the timeline and parallel coordinates to illustrate network communication for forensic analysis. In primarily analysis process, the timeline of events is reconstructed from traffic logs. An analyst can track the related anomaly event on-demand. In addition the details of abnormal and normal activities are shown in multiple dimensions of parallel coordinates. The novelty of this research is not a presentation of the timeline and parallel coordinates technique, but iterative visualization framework to illustrate both anomaly traffic and application traffic pattern. We applied frequent item-set mining to search dominant traffic flow and classify them by traffic flow shape and entropy. Although some studies have been applied frequent item-set mining with traffic dataset, but as we have known, this is the first research to 1) take advantages of the frequent item-set mining and parallel coordinates, which allow us to find both the anomaly traffic and application traffic and it can easily understand the patterns of traffic flow with the multi-dimensional visualization, and 2) classify the application traffic from the entropy values of traffic flow discovered by frequent item-set mining. This method is able to classify the encrypted traffic data and it does not violate a user privacy. The results of this research and development of a visual network communication tool can: 1) show abnormalities and normal communication activities, 2) have application traffic classification 92% accurate, 3) be a visual network communication prototype which helps an analyst to find the cause of the network malfunction.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"28 1","pages":"358-364"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84114532","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}
User's varying posture incurs undesired measurement error on conventional BCG or non-restrictive ECG measurement system during real time measurement. In this paper, we present a novel UBPchair that embed BCG, nonrestrictive ECG, and the posture detection system within a single chair to overcome such problem. Through our evaluation result, we prove that our UBPchair is a fully functional system which is work well for continuous bio signals and posture detection. It is simple and comfortable.
{"title":"Implementation of the Smart Chair System for Multi-functional Unconstrained Healthcare Monitoring","authors":"Byeong-Ju Kim, Yun-Hong Noh, Do-Un Jeong","doi":"10.1109/AINA.2015.220","DOIUrl":"https://doi.org/10.1109/AINA.2015.220","url":null,"abstract":"User's varying posture incurs undesired measurement error on conventional BCG or non-restrictive ECG measurement system during real time measurement. In this paper, we present a novel UBPchair that embed BCG, nonrestrictive ECG, and the posture detection system within a single chair to overcome such problem. Through our evaluation result, we prove that our UBPchair is a fully functional system which is work well for continuous bio signals and posture detection. It is simple and comfortable.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"59 1","pages":"448-452"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88510439","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}
With Android applications processing not only personal but also business-critical data, efficient and precise data flow analysis has become a major technique to detect apps handling critical data in unwanted ways. Although data flow analysis in general is a thoroughly researched topic, the event-driven lifecycle model of Android has its own challenges and practical application requires for reliable and efficient analysis techniques. In this paper we present Apparecium, a tool to reveal data flows in Android applications. Apparecium has conceptual differences to other techniques, and can be used to find arbitrary data flows inside Android applications. Details about the used techniques and the differences to existing data flow analysis tools are presented, as well as an evaluation against the data flow analysis framework Flow Droid.
{"title":"Apparecium: Revealing Data Flows in Android Applications","authors":"Dennis Titze, J. Schütte","doi":"10.1109/AINA.2015.239","DOIUrl":"https://doi.org/10.1109/AINA.2015.239","url":null,"abstract":"With Android applications processing not only personal but also business-critical data, efficient and precise data flow analysis has become a major technique to detect apps handling critical data in unwanted ways. Although data flow analysis in general is a thoroughly researched topic, the event-driven lifecycle model of Android has its own challenges and practical application requires for reliable and efficient analysis techniques. In this paper we present Apparecium, a tool to reveal data flows in Android applications. Apparecium has conceptual differences to other techniques, and can be used to find arbitrary data flows inside Android applications. Details about the used techniques and the differences to existing data flow analysis tools are presented, as well as an evaluation against the data flow analysis framework Flow Droid.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"36 1","pages":"579-586"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88519673","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}
Taro Ishitaki, Donald Elmazi, Yi Liu, Tetsuya Oda, L. Barolli, K. Uchida
Due to the amount of anonymity afforded to users of the Tor infrastructure, Tor has become a useful tool for malicious users. With Tor, the users are able to compromise the non-repudiation principle of computer security. Also, the potentially hackers may launch attacks such as DDoS or identity theft behind Tor. For this reason, there are needed new systems and models to detect the intrusion in Tor networks. In this paper, we present the application of Neural Networks (NNs) for intrusion detection in Tor networks. We used the Back propagation NN and constructed a Tor server and a Deep Web browser (client). Then, the client sends the data browsing to the Tor server using the Tor network. We used Wireshark Network Analyzer to get the data and then use the Back propagation NN to make the approximation. The simulation results show that our simulation system has a good approximation and can be used for intrusion detection in To networks.
{"title":"Application of Neural Networks for Intrusion Detection in Tor Networks","authors":"Taro Ishitaki, Donald Elmazi, Yi Liu, Tetsuya Oda, L. Barolli, K. Uchida","doi":"10.1109/WAINA.2015.136","DOIUrl":"https://doi.org/10.1109/WAINA.2015.136","url":null,"abstract":"Due to the amount of anonymity afforded to users of the Tor infrastructure, Tor has become a useful tool for malicious users. With Tor, the users are able to compromise the non-repudiation principle of computer security. Also, the potentially hackers may launch attacks such as DDoS or identity theft behind Tor. For this reason, there are needed new systems and models to detect the intrusion in Tor networks. In this paper, we present the application of Neural Networks (NNs) for intrusion detection in Tor networks. We used the Back propagation NN and constructed a Tor server and a Deep Web browser (client). Then, the client sends the data browsing to the Tor server using the Tor network. We used Wireshark Network Analyzer to get the data and then use the Back propagation NN to make the approximation. The simulation results show that our simulation system has a good approximation and can be used for intrusion detection in To networks.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"138 1","pages":"67-72"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86694216","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
扫码关注我们
求助内容：
应助结果提醒方式：