Pub Date : 2018-06-01DOI: 10.1109/ISNCC.2018.8530984
Mansoor Ahmed, Abid Khan, Osama Saleem, Muhammad Haris
Existing URL filtering mechanisms lacks support for real-time fault tolerance and scalability. In this paper these issues are addressed by developing a scalable model which is real time and fault tolerant to classify streams of URL traffic. The key feature of our model is that it saves computation time, resources usage and bandwidth. This model is implemented in Apache Spark which runs APIs for machine learning and streaming. The dataset consists of 2.4 million URLs which were taken from both clean and malicious classes. In training set, clean URLs are labeled as 1 and malicious are labeled as 0. For this proposed model, distributed in-memory computation is provided by Apache Spark's resilient distributed datasets (RDD) in fault tolerant manner. By increasing number of nodes in the cluster we achieved linear scalability. Our model attained an accuracy of 96% on logistic regression classifier and scaled up well with the Apache Spark's cluster. In 55 second using logistic regression classifier from Spark ML1ib, 2 million URLs can be filtered. The model achieved fl-score values of 0.92, 0.95 and 0.93 along with precision and the results are evaluated using cross-validation schemes.
{"title":"A Fault Tolerant Approach for Malicious URL Filtering","authors":"Mansoor Ahmed, Abid Khan, Osama Saleem, Muhammad Haris","doi":"10.1109/ISNCC.2018.8530984","DOIUrl":"https://doi.org/10.1109/ISNCC.2018.8530984","url":null,"abstract":"Existing URL filtering mechanisms lacks support for real-time fault tolerance and scalability. In this paper these issues are addressed by developing a scalable model which is real time and fault tolerant to classify streams of URL traffic. The key feature of our model is that it saves computation time, resources usage and bandwidth. This model is implemented in Apache Spark which runs APIs for machine learning and streaming. The dataset consists of 2.4 million URLs which were taken from both clean and malicious classes. In training set, clean URLs are labeled as 1 and malicious are labeled as 0. For this proposed model, distributed in-memory computation is provided by Apache Spark's resilient distributed datasets (RDD) in fault tolerant manner. By increasing number of nodes in the cluster we achieved linear scalability. Our model attained an accuracy of 96% on logistic regression classifier and scaled up well with the Apache Spark's cluster. In 55 second using logistic regression classifier from Spark ML1ib, 2 million URLs can be filtered. The model achieved fl-score values of 0.92, 0.95 and 0.93 along with precision and the results are evaluated using cross-validation schemes.","PeriodicalId":313846,"journal":{"name":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123230876","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 : 2018-06-01DOI: 10.1109/ISNCC.2018.8530894
Yilun Liu, Lidong Zhu
In a massive Low Earth Orbit(LEO) satellite network without inter-satellite links(ISLs), connection between source node and destination node can be established through satellite-ground links. Utilizing satellite network topology in time virtualization algorithm and assuming that the current traffic of satellite-ground links which is used as the value of the topology correlation matrix can be perceived, the network uses the Dijkstra algorithm to obtain the shortest path of the current total network traffic and thus implements load balancing of the constellation system. Due to the large number of satellites, the network topology is complex and time varying, it is difficult to find the optimal path in a short time, so a suboptimal routing algorithm based on network topology is proposed in this paper. The local network topology is obtained by using the positions of the source and destination gateway, and the number of satellites and gateways used to establish the correlation matrix of the Dijkstra algorithm is reduced. Through the simulation analysis, the average computational complexity of this algorithm is much lower than that of the global optimal routing algorithm, and the average propagation delay of routing is almost the same. When the network load is normal, the system performance is almost the same with the global optimal routing algorithm.
{"title":"A Suboptimal Routing Algorithm for Massive LEO Satellite Networks","authors":"Yilun Liu, Lidong Zhu","doi":"10.1109/ISNCC.2018.8530894","DOIUrl":"https://doi.org/10.1109/ISNCC.2018.8530894","url":null,"abstract":"In a massive Low Earth Orbit(LEO) satellite network without inter-satellite links(ISLs), connection between source node and destination node can be established through satellite-ground links. Utilizing satellite network topology in time virtualization algorithm and assuming that the current traffic of satellite-ground links which is used as the value of the topology correlation matrix can be perceived, the network uses the Dijkstra algorithm to obtain the shortest path of the current total network traffic and thus implements load balancing of the constellation system. Due to the large number of satellites, the network topology is complex and time varying, it is difficult to find the optimal path in a short time, so a suboptimal routing algorithm based on network topology is proposed in this paper. The local network topology is obtained by using the positions of the source and destination gateway, and the number of satellites and gateways used to establish the correlation matrix of the Dijkstra algorithm is reduced. Through the simulation analysis, the average computational complexity of this algorithm is much lower than that of the global optimal routing algorithm, and the average propagation delay of routing is almost the same. When the network load is normal, the system performance is almost the same with the global optimal routing algorithm.","PeriodicalId":313846,"journal":{"name":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123838017","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 : 2018-06-01DOI: 10.1109/ISNCC.2018.8531067
S. Ghoreyshi, A. Shahrabi, T. Boutaleb
In this paper, a new distributed Cluster-based Mobile Data-Gathering scheme (CMDG) for large-scale Underwater Sensor Networks (UWSNs) is proposed to improve the system performance in terms of routing scalability, energy saving, and data gathering latency. In this scheme, a subset of underwater sensors is selected as cluster heads to collect data from affiliated sensors and transmit the data to an Autonomous Underwater Vehicle (AUV). Then, the AUV tour is planned such that all cluster heads are visited while shortening the tour length of the AUV. Using extensive simulation study, we analyse the performance of CMDG and show that it can effectively reduce the tour length while prolonging the network lifetime compared to another existing mobile data-gathering approach.
{"title":"A Cluster-Based Mobile Data-Gathering Scheme for Underwater Sensor Networks","authors":"S. Ghoreyshi, A. Shahrabi, T. Boutaleb","doi":"10.1109/ISNCC.2018.8531067","DOIUrl":"https://doi.org/10.1109/ISNCC.2018.8531067","url":null,"abstract":"In this paper, a new distributed Cluster-based Mobile Data-Gathering scheme (CMDG) for large-scale Underwater Sensor Networks (UWSNs) is proposed to improve the system performance in terms of routing scalability, energy saving, and data gathering latency. In this scheme, a subset of underwater sensors is selected as cluster heads to collect data from affiliated sensors and transmit the data to an Autonomous Underwater Vehicle (AUV). Then, the AUV tour is planned such that all cluster heads are visited while shortening the tour length of the AUV. Using extensive simulation study, we analyse the performance of CMDG and show that it can effectively reduce the tour length while prolonging the network lifetime compared to another existing mobile data-gathering approach.","PeriodicalId":313846,"journal":{"name":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125767660","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 : 2018-06-01DOI: 10.1109/ISNCC.2018.8530923
Bong-Hwan Oh, S. Vural, Yogaratnam Rahulan, Ning Wang, R. Tafazolli
Network function virtualization (NFV) is one of key features envisioned for the upcoming 5G core networks in order to support high flexibility in network deployment and management. However, potential performance degradations that could be caused by virtualization of network functions is still a controversial issue, especially in regards to virtualization of core network components. In this paper, we evaluate the effect of NFV on an end-to-end mobile network testbed, which is deployed in the 5G Innovation Centre (5GIC) in University of Surrey. The testbed consists of indoor and outdoor LTE Radio Access Networks (RAN) equipment, as well as an enhanced Evolved Packet Core (EPC) following LTE Release 14 specifications, such as control and user plane separation (CUPS). The paper compares the performance of the softwarised core network and that of its virtualized counterpart. Measurement results show that the virtualized core network has adequately similar network performance in terms of throughput and latency, compared with the non-virtual core.
{"title":"Performance Evaluation of a Virtualized 5G Core Network in Indoor Environments","authors":"Bong-Hwan Oh, S. Vural, Yogaratnam Rahulan, Ning Wang, R. Tafazolli","doi":"10.1109/ISNCC.2018.8530923","DOIUrl":"https://doi.org/10.1109/ISNCC.2018.8530923","url":null,"abstract":"Network function virtualization (NFV) is one of key features envisioned for the upcoming 5G core networks in order to support high flexibility in network deployment and management. However, potential performance degradations that could be caused by virtualization of network functions is still a controversial issue, especially in regards to virtualization of core network components. In this paper, we evaluate the effect of NFV on an end-to-end mobile network testbed, which is deployed in the 5G Innovation Centre (5GIC) in University of Surrey. The testbed consists of indoor and outdoor LTE Radio Access Networks (RAN) equipment, as well as an enhanced Evolved Packet Core (EPC) following LTE Release 14 specifications, such as control and user plane separation (CUPS). The paper compares the performance of the softwarised core network and that of its virtualized counterpart. Measurement results show that the virtualized core network has adequately similar network performance in terms of throughput and latency, compared with the non-virtual core.","PeriodicalId":313846,"journal":{"name":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114420875","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 : 2018-06-01DOI: 10.1109/ISNCC.2018.8530896
Souhila Mammeri, M. Yazid, L. Bouallouche-Medjkoune, Thanina Belkhir
Wireless Local Area Networks (WLANs) are becoming an essential form of communication in our life, and they have known a strong history of development. The current IEEE 802.11ac technology aims at achieving a Very High Throughput (VHT), by utilizing wider channels 80 and 160 MHz. The wide channels are obtained by bonding adjacent 20 MHz sub-channels. This is why, Static and Dynamic Multichannel Access (SMA and DMA) methods are proposed for controlling such multichannel transmissions. SMA and DMA guarantee the requirements of Quality of Service (QoS) for VHT WLANs, by following the existing 802.11e Enhanced Distributed Channel Access (EDCA). However, EDCA still suffers from the starvation among low priority ACs. Although several enhancements have been proposed since the emergence of the starvation issue, none of the proposed research works have addressed the critical state of low priority ACs BestEffort (BE) and BacKground (BK) under wide channels. In this paper, we propose to enhance the DMA method, in order to improve the multichannel access efficience and hence increase the throughputs of BK and BE. The obtained simulation results demonstrate the contribution of the Starvation resolution within the DMA method (SDMA) for increasing the throughputs of low priority ACs while maintaining the throughputs of high priority ACs.
{"title":"Enhancing 802.11ac Dynamic Access method for Increasing the Throughput of Low Priority Access Categories BK and BE","authors":"Souhila Mammeri, M. Yazid, L. Bouallouche-Medjkoune, Thanina Belkhir","doi":"10.1109/ISNCC.2018.8530896","DOIUrl":"https://doi.org/10.1109/ISNCC.2018.8530896","url":null,"abstract":"Wireless Local Area Networks (WLANs) are becoming an essential form of communication in our life, and they have known a strong history of development. The current IEEE 802.11ac technology aims at achieving a Very High Throughput (VHT), by utilizing wider channels 80 and 160 MHz. The wide channels are obtained by bonding adjacent 20 MHz sub-channels. This is why, Static and Dynamic Multichannel Access (SMA and DMA) methods are proposed for controlling such multichannel transmissions. SMA and DMA guarantee the requirements of Quality of Service (QoS) for VHT WLANs, by following the existing 802.11e Enhanced Distributed Channel Access (EDCA). However, EDCA still suffers from the starvation among low priority ACs. Although several enhancements have been proposed since the emergence of the starvation issue, none of the proposed research works have addressed the critical state of low priority ACs BestEffort (BE) and BacKground (BK) under wide channels. In this paper, we propose to enhance the DMA method, in order to improve the multichannel access efficience and hence increase the throughputs of BK and BE. The obtained simulation results demonstrate the contribution of the Starvation resolution within the DMA method (SDMA) for increasing the throughputs of low priority ACs while maintaining the throughputs of high priority ACs.","PeriodicalId":313846,"journal":{"name":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124122631","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 : 2018-06-01DOI: 10.1109/ISNCC.2018.8531030
D. Passi, A. Leggieri, Alessio Mattioni, F. Paolo, M. D'Antoni, M. Bartocci, E. Ciacia, A. Tafuto
In this article the new frontier in Spatial Power Amplifiers is shown, with particular attention to the their Space Applications. These amplifiers have in fact the characteristic of High RF Power, Solid State Technology and High Power Density due to the small sizes that can be reached. We will show the performances of three amplifiers employing the spatial combining technique, two prototypes in the X-Band and one in the Ka-Band, with a brief description of the design approach. These amplifiers belong to the Single Waveguide group of the SPC family, thus a WR90 and a WR28 waveguides are employed. Very good performances are obtained from these prototypes, with a very high power density due their small sizes.
{"title":"Small Size, High Power Density, Solid State Amplifiers for Space Application","authors":"D. Passi, A. Leggieri, Alessio Mattioni, F. Paolo, M. D'Antoni, M. Bartocci, E. Ciacia, A. Tafuto","doi":"10.1109/ISNCC.2018.8531030","DOIUrl":"https://doi.org/10.1109/ISNCC.2018.8531030","url":null,"abstract":"In this article the new frontier in Spatial Power Amplifiers is shown, with particular attention to the their Space Applications. These amplifiers have in fact the characteristic of High RF Power, Solid State Technology and High Power Density due to the small sizes that can be reached. We will show the performances of three amplifiers employing the spatial combining technique, two prototypes in the X-Band and one in the Ka-Band, with a brief description of the design approach. These amplifiers belong to the Single Waveguide group of the SPC family, thus a WR90 and a WR28 waveguides are employed. Very good performances are obtained from these prototypes, with a very high power density due their small sizes.","PeriodicalId":313846,"journal":{"name":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132819534","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 : 2018-06-01DOI: 10.1109/ISNCC.2018.8531043
Erkin Kirdan, Daniel Raumer, Paul Emmerich, G. Carle
Traffic policing is the process of ensuring that network traffic complies with its policies with methods like traffic shaping. As the distribution of sources involved in a DDoS attack differs significantly from the typical distribution of customers for web services, traffic shapers and policers can be used in DDoS mitigation. In the past, software-based middleboxes, like traffic shapers, easily became overloaded and therefore a vulnerability for DDoS attacks. Although recent advances in network stack design on commodity hardware increased the performance, the software on top of the network stack also needs to provide adequate throughput and scalability regarding the number of limited subnets. Therefore, we build a high-performance and scalable traffic policer called MoonPol and evaluated it in a DDoS mitigation scenario. MoonPol runs on any commodity hardware, takes advantage of the underlying framework, DPDK, and combines it with appropriate algorithms and data structures. Data structures for efficient lookups are implemented together with the token bucket algorithm to police a traffic of fine-grained IP address ranges. Benchmarking results show that the single core throughput of the policer running on a 3.2 GHz CPU, is 6.5 Mpps with limiting 1 Million subnets, i.e., 492 CPU cycles per packet. With 250K subnets of all countries in the world, the throughput is 6.66 Mpps.
{"title":"Building a Traffic Policer for DDoS Mitigation on Top of Commodity Hardware","authors":"Erkin Kirdan, Daniel Raumer, Paul Emmerich, G. Carle","doi":"10.1109/ISNCC.2018.8531043","DOIUrl":"https://doi.org/10.1109/ISNCC.2018.8531043","url":null,"abstract":"Traffic policing is the process of ensuring that network traffic complies with its policies with methods like traffic shaping. As the distribution of sources involved in a DDoS attack differs significantly from the typical distribution of customers for web services, traffic shapers and policers can be used in DDoS mitigation. In the past, software-based middleboxes, like traffic shapers, easily became overloaded and therefore a vulnerability for DDoS attacks. Although recent advances in network stack design on commodity hardware increased the performance, the software on top of the network stack also needs to provide adequate throughput and scalability regarding the number of limited subnets. Therefore, we build a high-performance and scalable traffic policer called MoonPol and evaluated it in a DDoS mitigation scenario. MoonPol runs on any commodity hardware, takes advantage of the underlying framework, DPDK, and combines it with appropriate algorithms and data structures. Data structures for efficient lookups are implemented together with the token bucket algorithm to police a traffic of fine-grained IP address ranges. Benchmarking results show that the single core throughput of the policer running on a 3.2 GHz CPU, is 6.5 Mpps with limiting 1 Million subnets, i.e., 492 CPU cycles per packet. With 250K subnets of all countries in the world, the throughput is 6.66 Mpps.","PeriodicalId":313846,"journal":{"name":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123270151","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 : 2018-06-01DOI: 10.1109/ISNCC.2018.8531005
M. Rekik, C. Gransart, M. Berbineau
Cyber-physical security is a major concern for the new generation of trains. In fact, trains are increasingly relying on automation, control and communication technologies in order to improve the efficiency and safety of their services as well as the comfort of passengers. This dependency introduces certainly new vulnerabilities and entry points to the system which exposes the system to new threat scenarios. This paper deals with cyber-physical security aspects of Train Control and Monitoring Systems (TCMSs). We analyse vulnerabilities and characteristics of railway threat landscape including potential threats, threats agents and motivations. We discuss, also, direct impacts and cascading consequences on the whole system as well as the risk generated.
{"title":"Cyber-physical Threats and Vulnerabilities Analysis for Train Control and Monitoring Systems","authors":"M. Rekik, C. Gransart, M. Berbineau","doi":"10.1109/ISNCC.2018.8531005","DOIUrl":"https://doi.org/10.1109/ISNCC.2018.8531005","url":null,"abstract":"Cyber-physical security is a major concern for the new generation of trains. In fact, trains are increasingly relying on automation, control and communication technologies in order to improve the efficiency and safety of their services as well as the comfort of passengers. This dependency introduces certainly new vulnerabilities and entry points to the system which exposes the system to new threat scenarios. This paper deals with cyber-physical security aspects of Train Control and Monitoring Systems (TCMSs). We analyse vulnerabilities and characteristics of railway threat landscape including potential threats, threats agents and motivations. We discuss, also, direct impacts and cascading consequences on the whole system as well as the risk generated.","PeriodicalId":313846,"journal":{"name":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115761747","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 : 2018-06-01DOI: 10.1109/ISNCC.2018.8531004
E. Gelenbe, J. Domańska, T. Czachórski, A. Drosou, D. Tzovaras
Attacks on the content and quality of service of IoT platforms have economic and physical consequences well beyond the Internet's lack of security. This paper describes a new research project on “Secure and Safe Internet of Things” (SerIoT) to improve both the information and physical security of IoT applications platforms in a holistic and cross-layered manner. The purpose is to be able to create secure operational IoT platfnrms for diverse applieations.
{"title":"Security for Internet of Things: The SerIoT Project","authors":"E. Gelenbe, J. Domańska, T. Czachórski, A. Drosou, D. Tzovaras","doi":"10.1109/ISNCC.2018.8531004","DOIUrl":"https://doi.org/10.1109/ISNCC.2018.8531004","url":null,"abstract":"Attacks on the content and quality of service of IoT platforms have economic and physical consequences well beyond the Internet's lack of security. This paper describes a new research project on “Secure and Safe Internet of Things” (SerIoT) to improve both the information and physical security of IoT applications platforms in a holistic and cross-layered manner. The purpose is to be able to create secure operational IoT platfnrms for diverse applieations.","PeriodicalId":313846,"journal":{"name":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124598026","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 : 2018-06-01DOI: 10.1109/ISNCC.2018.8530884
Massimo Marchiori
The mobile world has freed individuals from many physical constraint, but has also added degrees of freedom that might amplify privacy and security problems, especially for a critical part of the population: underage children. How much of this freedom is a risk for our kids? The problem is that we do not really know yet the answer to this question. Knowing what kids really do with their smartphone is not an easy task: we can try to get a grasp of their actions using questionnaires, but this introduces bias when trying to measure inappropriate behavior, even more in the kids world due to additional factors like shame. In this paper we report on an attempt to shed light on this problem, and to delve deep into the true world of kids. We first state what the problems are when trying to analyze their mobile behavior, identify the critical technical challenges, and show that there is also a number of non-technical challenges making up for a significant barrier. We then design and implement a system able to overcome a good number of these challenges, and effectively study the unfiltered behavior of kids in the mobile world, and so to check the potential risks for privacy and security during their mobile interactions. A large pool of kids is then studied, shading new light on the potentially dangerous zones that underage kids cross every day, and showing how truly dangerous the mobile environment, in its present technological and social shape, is for our children.
{"title":"Discovering True Kids Mobile Behavior","authors":"Massimo Marchiori","doi":"10.1109/ISNCC.2018.8530884","DOIUrl":"https://doi.org/10.1109/ISNCC.2018.8530884","url":null,"abstract":"The mobile world has freed individuals from many physical constraint, but has also added degrees of freedom that might amplify privacy and security problems, especially for a critical part of the population: underage children. How much of this freedom is a risk for our kids? The problem is that we do not really know yet the answer to this question. Knowing what kids really do with their smartphone is not an easy task: we can try to get a grasp of their actions using questionnaires, but this introduces bias when trying to measure inappropriate behavior, even more in the kids world due to additional factors like shame. In this paper we report on an attempt to shed light on this problem, and to delve deep into the true world of kids. We first state what the problems are when trying to analyze their mobile behavior, identify the critical technical challenges, and show that there is also a number of non-technical challenges making up for a significant barrier. We then design and implement a system able to overcome a good number of these challenges, and effectively study the unfiltered behavior of kids in the mobile world, and so to check the potential risks for privacy and security during their mobile interactions. A large pool of kids is then studied, shading new light on the potentially dangerous zones that underage kids cross every day, and showing how truly dangerous the mobile environment, in its present technological and social shape, is for our children.","PeriodicalId":313846,"journal":{"name":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125130076","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
扫码关注我们
求助内容：
应助结果提醒方式：