{"title":"Caching Strategy for Scalable Video Coding in Information-Centric Networking","authors":"Junhua Tang, S. Zhao, Yue Wu, Jianhua Li","doi":"10.1109/SSIC.2018.8556720","DOIUrl":"https://doi.org/10.1109/SSIC.2018.8556720","url":null,"abstract":"Information-Centric Networking (ICN) is widely accepted as the network architecture for the next generation Internet. Caching strategy is one of the most important issues of ICN and has received much attention in recent years. In this paper we focus on caching strategy for Scalable Video Coding (SVC) in ICN. We first develop the mathematical models of user behavior, video popularity, user experience and caching efficiency. Then we propose a new caching strategy named PoProb, which determines the caching probability of a video according to its popularity. Simulation of PoProb is conducted using AMuSt simulator based on the ndnSIM simulation platform. Simulation results show that compared with existing caching strategies, PoProb can improve user experience and cache efficiency to a certain extent.","PeriodicalId":302563,"journal":{"name":"2018 Third International Conference on Security of Smart Cities, Industrial Control System and Communications (SSIC)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127379892","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":"SSIC 2018 Committee","authors":"","doi":"10.1109/ssic.2018.8556716","DOIUrl":"https://doi.org/10.1109/ssic.2018.8556716","url":null,"abstract":"","PeriodicalId":302563,"journal":{"name":"2018 Third International Conference on Security of Smart Cities, Industrial Control System and Communications (SSIC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130791840","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}
Y. Meng, P. Yi, Xuejun Guo, Wen Gu, Xin Liu, Wei Wang, Ting Zhu
{"title":"Detection for Pulmonary Nodules using RGB Channel Superposition Method in Deep Learning Framework","authors":"Y. Meng, P. Yi, Xuejun Guo, Wen Gu, Xin Liu, Wei Wang, Ting Zhu","doi":"10.1109/SSIC.2018.8556807","DOIUrl":"https://doi.org/10.1109/SSIC.2018.8556807","url":null,"abstract":"The detection of pulmonary nodules is a very important research field in computer-aided diagnosis. In order to help doctors to identify pulmonary nodules more conveniently, especially for some small pulmonary nodules, a method based on RGB channel superposition to detect pulmonary nodules is proposed in this paper. We put the same ROI (region of interest) from three sequential lung CT slices into RGB channels to gain a pseudo-color image for deep learning. AlexNet and GoogLeNet is used as the deep learning network. We use 10000 patches of healthy tissues and 12000 patches of pulmonary nodules in LIDC-IDRI dataset for training and get a prediction model. The model is tested on 176 patients’ CT images and gain the sensitive of 95.0% at 5.62 false positives per scan. The experimental results show that the proposed method can improve the detection rate of pulmonary nodules compared with some traditional feature extraction methods.","PeriodicalId":302563,"journal":{"name":"2018 Third International Conference on Security of Smart Cities, Industrial Control System and Communications (SSIC)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127638130","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":"An Improved Group-based Influence Maximization Method in Social Networks","authors":"Danhua Huang, Li Pan","doi":"10.1109/SSIC.2018.8556647","DOIUrl":"https://doi.org/10.1109/SSIC.2018.8556647","url":null,"abstract":"Influence maximization is a classic problem studied in social network analysis. This problem is NP-hard and can be solved with a greedy algorithm. However, the method requires tens of thousands of Monte-Carlo simulations, which are very time consuming and not scalable. To improve this method, researchers presented the community-based influence maximization method. However, this method detects communities based on node connections while generally ignores the influence property of nodes. In addition, when computing the influence spread based on community structure, it loses sight of the community size and border nodes. To improve the community-based influence maximization method, this paper first finds groups with similar influence characteristics based on the influence property of nodes. Then influence spread is approximately calculated based on the group structure in which the group size and border nodes are considered. Experiments demonstrate that the group-based influence maximization method in this paper achieves better influence spread than corresponding community-based influence maximization methods with matching running time.","PeriodicalId":302563,"journal":{"name":"2018 Third International Conference on Security of Smart Cities, Industrial Control System and Communications (SSIC)","volume":"120 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128490010","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":"[Copyright notice]","authors":"","doi":"10.1109/ssic.2018.8556666","DOIUrl":"https://doi.org/10.1109/ssic.2018.8556666","url":null,"abstract":"","PeriodicalId":302563,"journal":{"name":"2018 Third International Conference on Security of Smart Cities, Industrial Control System and Communications (SSIC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128052012","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":"PU Learning in Payload-based Web Anomaly Detection","authors":"Yuxuan Luo, Shaoyin Cheng, Chong Liu, Fan Jiang","doi":"10.1109/SSIC.2018.8556662","DOIUrl":"https://doi.org/10.1109/SSIC.2018.8556662","url":null,"abstract":"Intrusion detection is one of the most important methods for protecting web-based applications. Most anomaly detection approaches have weak detection capabilities for a new type of malicious web traffic. Besides, the misuse detection methods are based on malicious pattern matching, where the patterns usually depended on security experts. Although some supervised techniques have been applied, in real scenarios, HTTP traffic dataset is impure and more diverse. In this paper, we propose a new web anomaly detection method that combines with supervised learning model and PU learning (Positive and Unlabeled learning) based on HTTP payload data. In order to represent as many data patterns as possible, we vectorize HTTP request payloads by its numeric ASCII or Unicode value on byte-level, and each HTTP payload will be represented as a dimension-fixed numerical vector. First, our approach trains a base supervised XG-Boost model to learn the most of known attack traffics, and then the remaining normal traffics will be passed to a classifier based on the PU learning algorithm for finding some unknown malicious traffics. We test our model on a dataset gathered from a well-known security enterprise and the results show that our model achieves a remarkable accuracies on known attacks detection and has a great improvement in detecting unknown malicious web traffics.","PeriodicalId":302563,"journal":{"name":"2018 Third International Conference on Security of Smart Cities, Industrial Control System and Communications (SSIC)","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123585882","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":"An adaptive authentication and authorization scheme for IoT’s gateways: a blockchain based approach","authors":"Achraf Fayad, Badis Hammi, R. Khatoun","doi":"10.1109/SSIC.2018.8556668","DOIUrl":"https://doi.org/10.1109/SSIC.2018.8556668","url":null,"abstract":"Security of the Internet of Things represents a field that strongly attracts academia and industry since it represents one of the main obstacles in its adoption. In this area, authentication and authorization methods holds a golden place in priority rank. Indeed, current approaches suffers from numerous limits. Moreover, generally, deployment systems use separately two methods one dedicated to the authentication and the other to the authorization, while the number of methods that combine both requirements is limited. In this work we propose an adaptive blockchain based authentication and authorization approach for IoT use cases. We provided a real implementation of our approach using Java language. The extensive evaluation provided, shows clearly the ability of our scheme in meeting the different requirements, as well as its ability in ensuring a very lightweight cost.","PeriodicalId":302563,"journal":{"name":"2018 Third International Conference on Security of Smart Cities, Industrial Control System and Communications (SSIC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126530808","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":"Energy-Aware Distribution of Data Fragments in Unattended Wireless Sensor Networks","authors":"Hong-Beom Choi, Young-Bae Ko, K. Lim","doi":"10.1109/SSIC.2018.8556816","DOIUrl":"https://doi.org/10.1109/SSIC.2018.8556816","url":null,"abstract":"In this paper, we study and analyze data fragment placement techniques to exploit their problems and design an energy-aware fragment placement method in Unattended Wireless Sensor Networks (UWSN). In UWSN, the survivability of data is of utmost importance because sensed data cannot be immediately transmitted and must reside in the storage of sensor nodes for extended periods of time. The data, which have delay-tolerant characteristics, can be exploited by attackers that access the storage to erase or steal the data. Even though data fragmentation methods have been designed to solve this problem, these works do not consider a critical issue of where to place data fragments in the sensor network. In this work, we show that basic existing methods of data fragment placement have some problems, especially in terms of energy efficiency and data survival probability. Based on our analysis, we propose a lightweight method that allows us to efficiently select sensor nodes that are used to safely distribute and place data fragments. We show through simulation and preliminary testbed analysis that our proposed method can improve the overall performance of data fragmentation.","PeriodicalId":302563,"journal":{"name":"2018 Third International Conference on Security of Smart Cities, Industrial Control System and Communications (SSIC)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115186870","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}
J. Monteuuis, J. Petit, Jun Zhang, H. Labiod, Stefano Mafrica, Alain Servel
{"title":"“My autonomous car is an elephant”: A Machine Learning based Detector for Implausible Dimension","authors":"J. Monteuuis, J. Petit, Jun Zhang, H. Labiod, Stefano Mafrica, Alain Servel","doi":"10.1109/SSIC.2018.8556651","DOIUrl":"https://doi.org/10.1109/SSIC.2018.8556651","url":null,"abstract":"Connected and Automated Vehicle is the next goal for car manufacturers towards traffic safety and efficiency. To ensure safety, automotive applications rely on data acquired through vehicular communication and locally embedded sensors. Among these data, classification data permit the autonomous vehicle to decide to pass another vehicle according to not only its dynamic but also its length and width. Unlike sensors which are prone to measurement errors, vehicular communication allows others connected vehicles to provide their exact dimension values based on car manufacturer specification. However, this fact assumes that other road users may not lie. Currently, researchers focus on malicious mobility data but none focus on classification data within V2X message. Therefore, this paper proposes a misbehavior classifier related to classification data for multiple types of road users. Thus, we compare four methods that include a threshold classifier (MinMax) and three machine learning algorithms.","PeriodicalId":302563,"journal":{"name":"2018 Third International Conference on Security of Smart Cities, Industrial Control System and Communications (SSIC)","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122620889","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}
Yunlong Hu, P. Yi, Y. Sui, Zongrui Zhang, Yao Yao, Wei Wang, Ting Zhu
{"title":"Dispatching and Distributing Energy in Energy Internet under Energy Dilemma","authors":"Yunlong Hu, P. Yi, Y. Sui, Zongrui Zhang, Yao Yao, Wei Wang, Ting Zhu","doi":"10.1109/SSIC.2018.8556650","DOIUrl":"https://doi.org/10.1109/SSIC.2018.8556650","url":null,"abstract":"The Energy Internet is a hot topic for building networks that can transmit energy like the Internet. This paper mainly discusses the composition and energy scheduling for the electric vehicle energy transmission network. The network mainly includes energy points and charging stations connected by energy routing. The energy point will generate energy and the charging station will provide energy. However, in some cases, the charging station cannot obtain energy point, which leads to its energy reserve crisis. In this paper, we introduce an algorithm to dispatch energy to alleviate the energy crisis. On the basis of some graph theory, the routing problem when energy input is lost is analyzed by comparing two algorithms from the energy point to charging station. In addition, we discuss this issue in dynamic situations to better observe changes in energy transfer over time and use real- world transportation data onto simulation. The simulation results show that the algorithm can effectively delay the emergence of crisis charging stations.","PeriodicalId":302563,"journal":{"name":"2018 Third International Conference on Security of Smart Cities, Industrial Control System and Communications (SSIC)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125027223","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}