{"title":"Protecting Voice Controlled Systems Using Sound Source Identification Based on Acoustic Cues","authors":"Yuan Gong, C. Poellabauer","doi":"10.1109/ICCCN.2018.8487334","DOIUrl":"https://doi.org/10.1109/ICCCN.2018.8487334","url":null,"abstract":"Over the last few years, a rapidly increasing number of Internet-of-Things (IoT) systems that adopt voice as the primary user input have emerged. These systems have been shown to be vulnerable to various types of voice spoofing attacks. Existing defense techniques can usually only protect from a specific type of attack or require an additional authentication step that involves another device. Such defense strategies are either not strong enough or lower the usability of the system. Based on the fact that legitimate voice commands should only come from humans rather than a playback device, we propose a novel defense strategy that is able to detect the sound source of a voice command based on its acoustic features. The proposed defense strategy does not require any information other than the voice command itself and can protect a system from multiple types of spoofing attacks. Our proof-of- concept experiments verify the feasibility and effectiveness of this defense strategy.","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"358 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133198274","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}
{"title":"Social-Aware D2D Caching Content Deployment Strategy over Edge Computing Wireless Networks","authors":"Tingting Xu, Jian Jiao, Xin Chen, Ying Chen","doi":"10.1109/ICCCN.2018.8487439","DOIUrl":"https://doi.org/10.1109/ICCCN.2018.8487439","url":null,"abstract":"Caching the popular files in mobile terminal equipments and transferring those files via Device-to-Device (D2D) communication technology can offload the traffic from the Base Station(BS) over edge computing wierless network. The user equipments(UE) are mobile and the D2D communication links may drop any instant. In addition, UEs are carried by people with social attributes. Considering those information about mobile terminals when we study the D2D caching content deployment strategy can improve the caching efficiency. In order to reduce the probability of requesting files from BS, we design an efficient social-aware caching content deployment strategy, which includes the community discovery mechanism, the caching nodes selection algorithm and the file caching probability determination algorithm. Simulation experiments are provided to prove that our D2D caching content deployment strategy can improve the traffic offload rate in edge computing wireless networks.","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133996775","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}
{"title":"2018 ICCCN Workshop Program Overview","authors":"","doi":"10.1109/icccn.2018.8487315","DOIUrl":"https://doi.org/10.1109/icccn.2018.8487315","url":null,"abstract":"","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133147607","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}
Xudong He, Jian Wang, Jiqiang Liu, Lei Han, Yang Yu, Shaohua Lv
{"title":"Hierarchical Filtering Method of Alerts Based on Multi-Source Information Correlation Analysis","authors":"Xudong He, Jian Wang, Jiqiang Liu, Lei Han, Yang Yu, Shaohua Lv","doi":"10.1109/ICCCN.2018.8487469","DOIUrl":"https://doi.org/10.1109/ICCCN.2018.8487469","url":null,"abstract":"Nowadays, the threats of Internet are enormous and increasing, however, the classification of huge alert messages generated in this environment is relatively monotonous. It affects the accuracy of the network situation assessment, and also brings inconvenience to the security managers to deal with the emergency. In order to deal with potential network threats effectively and provide more effective data to improve the network situation awareness. There is almost no alerts filtering in the existing network situation assessment and decision making process. Or existing job processing has a large alerts filter granularity and there are many redundant alert data. It is essential to build a hierarchical filtering method to prevent the threats. In this paper, it establishes a method for data monitoring, which can filter systematically from the original data to get the grade of threats and be stored for using again. Firstly, it filters multi- source alerts based on the vulnerable resources, open ports of host devices and services. Then calculate the performance changes of the host devices at the time of the threat occurring, and filter the data using the difference of performance entropy again. At last, it sorts the changes of the performance value at the time of threat occurring. The alerts and performance data are collected in the real network environment, and the comparative experimental analysis shows that the threat filtering method can effectively filter the threat alerts.","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125022884","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}
{"title":"ICN-Based Light-Weighted Mobility Support in IoT","authors":"Donghyeok An, Dohyung Kim","doi":"10.1109/ICCCN.2018.8487384","DOIUrl":"https://doi.org/10.1109/ICCCN.2018.8487384","url":null,"abstract":"In Information-Centric Networking (ICN), name-based addressing and in-network caching allow content to be efficiently distributed/accessed. These properties of ICN have been researched in the arena of wireless domain to implement light-weighted communication protocols. In this paper, specifically, we present an ICN-based content delivery scheme for Internet-of- Things (IoT), and show how the proposed scheme support seamless hand-off.","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123667481","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}
{"title":"A Double-Layer Detection and Classification Approach for Network Attacks","authors":"Chong Sun, Kun Lv, Changzhen Hu, Hui Xie","doi":"10.1109/ICCCN.2018.8487460","DOIUrl":"https://doi.org/10.1109/ICCCN.2018.8487460","url":null,"abstract":"Network intrusion detection system (NIDS) plays a crucial role in maintaining network security. In this paper, we propose a novel double-layer detection and classification technique for network attacks. The advantage of our proposed method is that our two-layer hybird detection combines the advantage of multiple techniques, especially stacking ensemble method, and has better generalization performance. The first layer contains a GBDT classifier which is responsible for identifying DoS (Denial of Service) attacks. The second layer consists of KNN classifier and stacking ensemble classifier. KNN classifier is used to classify the DoS data from the first layer as more subtypes, such as, smurf, pod, neptune, teardrop, back and other DoS attack subtypes. Stacking ensemble classifier optimized by FOA (Fly Optimization Algorithm) is applied to divide the nonDoS data from the first layer to Normal, Probe, R2L (Remote to Local) and U2L (User to Root). The simulation and analysis are done based on KDD99 dataset and we use accuracy, precision rate and recall rate to evaluate our method. The experimental results suggest that our proposed method is a more robust and reliable model and can achieve higher accuracy than other previous methods.","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125403406","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}
{"title":"A Survey of Blockchain: Techniques, Applications, and Challenges","authors":"Weichao Gao, W. G. Hatcher, Wei Yu","doi":"10.1109/ICCCN.2018.8487348","DOIUrl":"https://doi.org/10.1109/ICCCN.2018.8487348","url":null,"abstract":"Blockchain, as a mechanism to decentralize services, security, and verifiability, offers a peer-to-peer system in which distributed nodes collaboratively affirm transaction provenance. In particular, blockchain enforces continuous storage of transaction history, secured via digital signature, and affirmed through consensus. In this study, we consider the recent surge in blockchain interest as an alternative to traditional centralized systems, and consider the emerging applications thereof. In particular, we assess the key techniques required for blockchain implementation, offering a primer to guide research practitioners. We first outline the blockchain framework in general, and then provide a detailed review of the component data and network structures. Additionally, we consider the breadth of applications to which blockchain has been applied, broadly implicating Internet of Things (IoT), Big Data, and Cloud and Edge computing paradigms, along with many other emerging applications. Finally, we assess the various challenges to blockchain implementation for widespread practical use, considering the security vulnerabilities to majority attacks, selfish mining, and privacy leakage, as well as performance limitations of blockchain platforms in terms of scalability and availability.","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126536558","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}
{"title":"A Monte Carlo Graph Search Algorithm with Ant Colony Optimization for Optimal Attack Path Analysis","authors":"Hui Xie, Kun Lv, Changzhen Hu, Chong Sun","doi":"10.1109/ICCCN.2018.8487462","DOIUrl":"https://doi.org/10.1109/ICCCN.2018.8487462","url":null,"abstract":"An optimal attack path is essential for an attacker. With an optimal attack path, the attacker can not only successfully carry out attacks, but also save time, energy and money. This article proposes a Monte Carlo Graph Search algorithm with Ant Colony Optimization(ACO-MCGS) to calculate optimal attack paths in target network. ACO-MCGS can get comprehensive results quickly and avoid the problem of path loss. ACO-MCGS has two steps to calculate optimal attack paths: selection and backpropagation. A weight vector containing host priority, CVSS risk value , host link number is proposed for every host in the target network. The weight vector is applied to improved Ant Colony Optimization algorithm to calculate the evaluation value of every attack path, which is used to screen the optimal attack paths for the first round. The weight vector is also used to calculate the total CVSS value and the average CVSS value of every attack path. Results of our experiment demonstrate the capabilities of the proposed algorithm to generate optimal attack paths in one single run. The results obtained by ACO-MCGS show good performance and are compared with Ant Colony Optimization Algorithm (ACO).","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130534062","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}
Bingqian Lu, Sai Santosh Dayapule, Fan Yao, Jingxin Wu, Guru Venkataramani, S. Subramaniam
{"title":"PopCorns: Power Optimization Using a Cooperative Network-Server Approach for Data Centers","authors":"Bingqian Lu, Sai Santosh Dayapule, Fan Yao, Jingxin Wu, Guru Venkataramani, S. Subramaniam","doi":"10.1109/ICCCN.2018.8487409","DOIUrl":"https://doi.org/10.1109/ICCCN.2018.8487409","url":null,"abstract":"Data centers have become a popular computing platform for various applications, and account for nearly 2% of total US energy consumption. Therefore, it has become important to optimize data center power, and reduce their energy footprint. With newer power- efficient design in data center infrastructure and cooling equipment, active components such as servers and the network consume most of the power with emerging sets of workloads. Most existing work optimizes power in servers and networks independently, and do not address them together in a holistic fashion that can achieve greater power savings. In this paper, we present PopCorns, a cooperative server-network framework for power optimization. We propose power models for switches and servers with low-power modes. We also design job scheduling algorithms that place tasks onto servers in a power-aware manner, such that servers and network switches can take effective advantage of low-power states. Our experimental results show that we are able to achieve more than 20% higher power savings compared to a baseline strategy that performs balanced job allocation across the servers.","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"150 43","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120888386","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}
Dominik Schäfer, Janick Edinger, Martin Breitbach, C. Becker
{"title":"Workload Partitioning and Task Migration to Reduce Response Times in Heterogeneous Computing Environments","authors":"Dominik Schäfer, Janick Edinger, Martin Breitbach, C. Becker","doi":"10.1109/ICCCN.2018.8487326","DOIUrl":"https://doi.org/10.1109/ICCCN.2018.8487326","url":null,"abstract":"Today's modern computing landscape consists of a huge amount of heterogeneous devices, including powerful, stable desktop computers as well as lightweight, unreliable mobile edge devices. This heterogeneity in terms of computation power and reliability increases the complexity for fault tolerance in distributed computing systems. When tasks are offloaded, slow resource providers easily become the bottleneck of a parallel computation. Further, unstable edge devices can leave the system spontaneously, discontinue remote tasks executions, and therefore lose the computation progress. These two effects increase the response time for remote task executions. In this paper, we introduce two mechanisms to avoid delayed or lost task executions caused by edge devices. This paper has five contributions. First, we define a failure model and identify the parameters that determine the magnitude of delays caused by faults and performance bottlenecks. Second, we present reactive and proactive task migration to handle system leaves. Third, we show how computational bottlenecks can be avoided by two-dimensional context-aware task partitioning. Fourth, we integrate these two solutions into an existing heterogeneous distributed computing system. Fifth, we run an evaluation on a real- world testbed to show the benefits of the solutions in practice. The evaluation shows, that we can improve systems with device fluctuation and heterogeneity by up to 39% and 53% respectively.","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"324 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121286091","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}