2020 16th International Conference on Mobility, Sensing and Networking (MSN)最新文献_第9页

AirQ: A Privacy-Preserving Truth Discovery Framework for Vehicular Air Quality Monitoring 一种保护隐私的车载空气质量监测真相发现框架

2020 16th International Conference on Mobility, Sensing and Networking (MSN) Pub Date : 2020-12-01 DOI: 10.1109/MSN50589.2020.00026

R. Liu, Jianping Pan

{"title":"AirQ: A Privacy-Preserving Truth Discovery Framework for Vehicular Air Quality Monitoring","authors":"R. Liu, Jianping Pan","doi":"10.1109/MSN50589.2020.00026","DOIUrl":"https://doi.org/10.1109/MSN50589.2020.00026","url":null,"abstract":"Air pollution has become an important health concern. The recent developments of vehicular networks and crowdsensing systems make it possible to monitor fine-grained air quality with vehicles and road-side units. On account of the different precisions of onboard sensors and malicious behaviors of participants, sensory data usually vary in quality. Thus, truth discovery has been a crucial task which targets at better utilizing the data. However, in urban cities, there is a significant difference in traffic volumes of streets or blocks, which leads to a data sparsity problem for truth discovery. To tackle the challenge, we present a truth discovery algorithm incorporating spatial and temporal correlations. Besides, to protect the privacy of participating vehicles, we develop the algorithm into a privacy-preserving truth discovery framework by adopting the technique of masking. The proposed framework is lightweight than the existing cryptography-based methods. Simulations are conducted to show that the proposed framework has a good performance. Although the framework is presented for air quality monitoring, we fully discuss the possible applications and extensions.","PeriodicalId":447605,"journal":{"name":"2020 16th International Conference on Mobility, Sensing and Networking (MSN)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125568467","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}

引用次数: 1

Coding based Distributed Data Shuffling for Low Communication Cost in Data Center Networks 基于编码的分布式数据变换在数据中心网络中的低通信成本

2020 16th International Conference on Mobility, Sensing and Networking (MSN) Pub Date : 2020-12-01 DOI: 10.1109/MSN50589.2020.00119

Junpeng Liang, Lei Yang, Zhenyu Wang, Xuxun Liu, Weigang Wu

引用次数: 0

Autonomous Security Analysis and Penetration Testing 自主安全分析和渗透测试

2020 16th International Conference on Mobility, Sensing and Networking (MSN) Pub Date : 2020-12-01 DOI: 10.1109/MSN50589.2020.00086

Ankur Chowdhary, Dijiang Huang, Jayasurya Sevalur Mahendran, Daniel Romo, Yuli Deng, Abdulhakim Sabur

{"title":"Autonomous Security Analysis and Penetration Testing","authors":"Ankur Chowdhary, Dijiang Huang, Jayasurya Sevalur Mahendran, Daniel Romo, Yuli Deng, Abdulhakim Sabur","doi":"10.1109/MSN50589.2020.00086","DOIUrl":"https://doi.org/10.1109/MSN50589.2020.00086","url":null,"abstract":"Security Assessment of large networks is a challenging task. Penetration testing (pentesting) is a method of analyzing the attack surface of a network to find security vulnerabilities. Current network pentesting techniques involve a combination of automated scanning tools and manual exploitation of security issues to identify possible threats in a network. The solution scales poorly on a large network. We propose an autonomous security analysis and penetration testing framework (ASAP) that creates a map of security threats and possible attack paths in the network using attack graphs. Our framework utilizes: (i) state of the art reinforcement learning algorithm based on Deep-Q Network (DQN) to identify optimal policy for performing pentesting testing, and (ii) incorporates domain-specific transition matrix and reward modeling to capture the importance of security vulnerabilities and difficulty inherent in exploiting them. ASAP framework generates autonomous attack plans and validates them against real-world networks. The attack plans are generalizable to complex enterprise network, and the framework scales well on a large network. Our empirical evaluation shows that ASAP identifies non-intuitive attack plans on an enterprise network. The DQN planning algorithm employed scales well on a large network $sim 60 -70(mathrm{s})$ for generating an attack plan for network with 300 hosts.","PeriodicalId":447605,"journal":{"name":"2020 16th International Conference on Mobility, Sensing and Networking (MSN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129375158","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}

引用次数: 27

[Invited] NDN Based Participatory Crowdsensing Framework with Area-focused Interest Forwarding [特邀]基于NDN的参与式众感框架与区域利益转发

2020 16th International Conference on Mobility, Sensing and Networking (MSN) Pub Date : 2020-12-01 DOI: 10.1109/MSN50589.2020.00094

H. Tode, Ashish Man Singh Pradhan, Daishi Kondo, Y. Tanigawa

引用次数: 0

CoOMO: Cost-efficient Computation Outsourcing with Multi-site Offloading for Mobile-Edge Services CoOMO:具有多站点卸载的移动边缘服务的成本效益计算外包

2020 16th International Conference on Mobility, Sensing and Networking (MSN) Pub Date : 2020-12-01 DOI: 10.1109/MSN50589.2020.00033

Tianhui Meng, Huaming Wu, Zhihao Shang, Yubin Zhao, Cheng-Zhong Xu

{"title":"CoOMO: Cost-efficient Computation Outsourcing with Multi-site Offloading for Mobile-Edge Services","authors":"Tianhui Meng, Huaming Wu, Zhihao Shang, Yubin Zhao, Cheng-Zhong Xu","doi":"10.1109/MSN50589.2020.00033","DOIUrl":"https://doi.org/10.1109/MSN50589.2020.00033","url":null,"abstract":"Mobile phones and tablets are becoming the primary platform of choice. However, these systems still suffer from limited battery and computation resources. A popular technique in mobile edge systems is computing outsourcing that augments the capabilities of mobile systems by migrating heavy workloads to resourceful clouds located at the edges of cellular networks. In the multi-site scenario, it is possible for mobile devices to save more time and energy by offloading to several cloud service providers. One of the most important challenges is how to choose servers to offload the jobs. In this paper, we consider a multi-site decision problem. We present a scheme to determine the proper assignment probabilities in a two-site mobile-edge computing system. We propose an open queueing network model for an offloading system with two servers and put forward performance metrics used for evaluating the system. Then in the specific scenario of a mobile chess game, where the data transmission is small but the computation jobs are relatively heavy, we conduct offloading experiments to obtain the model parameters. Given the parameters as arrival rates and service rates, we calculate the optimal probability to assign jobs to offload or locally execute and the optimal probabilities to choose different cloud servers. The analysis results confirm that our multi-site offloading scheme is beneficial in terms of response time and energy usage. In addition, sensitivity analysis has been conducted with respect to the system arrival rate to investigate wider implications of the change of parameter values.","PeriodicalId":447605,"journal":{"name":"2020 16th International Conference on Mobility, Sensing and Networking (MSN)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130210370","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}

引用次数: 0

Tile-based Multi-source Adaptive Streaming for 360-degree Ultra-High-Definition Videos 基于磁贴的多源自适应流媒体360度超高清视频

2020 16th International Conference on Mobility, Sensing and Networking (MSN) Pub Date : 2020-12-01 DOI: 10.1109/MSN50589.2020.00077

Xinjing Yuan, Lingjun Pu, Ruilin Yun, Jingdong Xu

{"title":"Tile-based Multi-source Adaptive Streaming for 360-degree Ultra-High-Definition Videos","authors":"Xinjing Yuan, Lingjun Pu, Ruilin Yun, Jingdong Xu","doi":"10.1109/MSN50589.2020.00077","DOIUrl":"https://doi.org/10.1109/MSN50589.2020.00077","url":null,"abstract":"360° UHD videos have absorbed great attention in recent years. However, as they are of significant size and usually watched from a close range, they require extremely high bandwidth for a good immersive experience, which poses a great challenge on the current single-source adaptive streaming strategies. Realizing the great potentials of tile-based video streaming and pervasive edge services, we advocate a tile-based multi-source adaptive streaming strategy for 360° UHD videos over edge networks. In order to reap its benefits, we consider a comprehensive model which captures the key components of tile-based multi-source adaptive streaming. Then we formulate a joint bitrate selection and request scheduling problem, aiming at maximizing the system utility (i.e., user QoE minus service overhead) while satisfying the service integrity and latency constraints. To solve the formulated non-linear integer programming problem efficiently, we decouple the control variables and resort to matroid theory to design an optimal master-slave algorithm. In addition, we improve our proposed algorithm with a deep learning-based bitrate selection algorithm, which can achieve a rationalization result in a short running time. Extensive datadriven simulations validate the superior performance of our proposed algorithm.","PeriodicalId":447605,"journal":{"name":"2020 16th International Conference on Mobility, Sensing and Networking (MSN)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129670407","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}

引用次数: 0

Length Matters: Fast Internet Encrypted Traffic Service Classification based on Multi-PDU Lengths 长度问题:基于多pdu长度的快速互联网加密流量业务分类

2020 16th International Conference on Mobility, Sensing and Networking (MSN) Pub Date : 2020-12-01 DOI: 10.1109/MSN50589.2020.00089

Zihan Chen, Guang Cheng, Bomiao Jiang, Shuye Tang, Shuyi Guo, Yuyang Zhou

{"title":"Length Matters: Fast Internet Encrypted Traffic Service Classification based on Multi-PDU Lengths","authors":"Zihan Chen, Guang Cheng, Bomiao Jiang, Shuye Tang, Shuyi Guo, Yuyang Zhou","doi":"10.1109/MSN50589.2020.00089","DOIUrl":"https://doi.org/10.1109/MSN50589.2020.00089","url":null,"abstract":"Encryption of network traffic has become an inevitable trend. As an important link to Internet encrypted traffic analysis, encrypted traffic service classification can provide support for the coarse-grained network service traffic management and security supervision. But traditional DPI method cannot be effectively applied in an encrypted traffic environment, and the existing methods based on machine learning have two problems in feature selection. One is the complex feature classification over costing problem, the other is the TLS-1.2 suited method is no longer applicable to TLS-1.3 handshake encryption. To solve these problems, in this paper, we consider the differences among encryption network protocol stacks and propose a method of encrypted traffic service classification combining with capsule neural network in a multi-protocol environment by using multi-PDU lengths as the features, making full use of Markov property between PDU length sequences and being suitable to TLS1.3 environment. The feature makes our method much faster than others in feature extraction. Our control experiments on ISCX VPN-nonVPN dataset show that our method achieves a satisfactory performance (0.9860 Pr, 0.9856 Rc, 0.9855 F1), which is superior to the state-of-the-art methods.","PeriodicalId":447605,"journal":{"name":"2020 16th International Conference on Mobility, Sensing and Networking (MSN)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130589238","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}

引用次数: 6

Privacy-Protecting Reputation Management Scheme in IoV-based Mobile Crowdsensing 基于物联网的移动众测中的隐私保护声誉管理方案

2020 16th International Conference on Mobility, Sensing and Networking (MSN) Pub Date : 2020-12-01 DOI: 10.1109/MSN50589.2020.00063

Zhifei Wang, Luning Liu, Luhan Wang, X. Wen, Wenpeng Jing

{"title":"Privacy-Protecting Reputation Management Scheme in IoV-based Mobile Crowdsensing","authors":"Zhifei Wang, Luning Liu, Luhan Wang, X. Wen, Wenpeng Jing","doi":"10.1109/MSN50589.2020.00063","DOIUrl":"https://doi.org/10.1109/MSN50589.2020.00063","url":null,"abstract":"Mobile crowdsensing (MCS) has appeared as a viable solution for data gathering in Internet of Vehicle (IoV). As it utilizes plenty of mobile users to perform sensing tasks, the cost on sensor deployment can be reduced and the data quality can be improved. However, there exist two main challenges for the IoV-based MCS, which are the privacy issues and the existence of malicious vehicles. In order to solve these two challenges simultaneously, we propose a privacy-protecting reputation management scheme in IoV-based MCS. In particular, our privacy-protecting scheme can execute quickly since its complexity is extremely low. The reputation management scheme considers vehicle’s past behaviors and quality of information. In addition, we introduced time fading into the scheme, so that our scheme can detect the malicious vehicles accurately and quickly. Moreover, latency in the IoV must be exceedingly low. With the help of the mobile edge computing (MEC) which is deployed on the base station side and has powerful computing capability, the latency can be greatly reduced to meet the requirements of the IoV. Simulation results demonstrate effectiveness of our reputation management scheme in resisting malicious vehicles, which can assess the reputation value accurately and detect the malicious vehicles quickly while protecting the privacy.","PeriodicalId":447605,"journal":{"name":"2020 16th International Conference on Mobility, Sensing and Networking (MSN)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122135014","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}

引用次数: 2

A Collision-free MAC protocol based on quorum system for underwater acoustic sensor networks 基于仲裁系统的水声传感器网络无碰撞MAC协议

2020 16th International Conference on Mobility, Sensing and Networking (MSN) Pub Date : 2020-12-01 DOI: 10.1109/MSN50589.2020.00112

Guangjie Han, Xingjie Wang, Ning Sun, Li Liu

引用次数: 1

User Interest Communities Influence Maximization in a Competitive Environment 用户兴趣社区影响竞争环境中的最大化

2020 16th International Conference on Mobility, Sensing and Networking (MSN) Pub Date : 2020-12-01 DOI: 10.1109/MSN50589.2020.00100

Jie-ming Chen, Leilei Shi, Lu Liu, Ayodeji Ayorinde, Rongbo Zhu, John Panneerselvam

{"title":"User Interest Communities Influence Maximization in a Competitive Environment","authors":"Jie-ming Chen, Leilei Shi, Lu Liu, Ayodeji Ayorinde, Rongbo Zhu, John Panneerselvam","doi":"10.1109/MSN50589.2020.00100","DOIUrl":"https://doi.org/10.1109/MSN50589.2020.00100","url":null,"abstract":"In the field of social computing, influence-based propagation only studies the maximized propagation of a single piece of information. However, in the actual network environment, there are more than one piece of competing information spreading in the network, and the information will influence each other in the process of spreading. This paper focuses on the problem of competitive propagation of multiple similar information, which considers the influence of communities on information propagation, and establishes overlapping interest communities based on label propagation. Based on users' interests and preferences, the influence probability between nodes of different types of information is calculated, and combining the characteristics of the community structure, the influence calculation method of nodes is proposed. Specifically, aiming at the shortcomings of strong randomness in existing overlapping community detection methods that are based on label propagation, this paper proposes the User Interest Overlapping Community Detection Algorithm based on Label Propagation (UICDLP). Furthermore, when the seed node set of competition information is known, this paper proposes the Influence Maximization Algorithm of Node Avoidance (IMNA). Finally, the experimental results verified that the proposed algorithms are effective and feasible.","PeriodicalId":447605,"journal":{"name":"2020 16th International Conference on Mobility, Sensing and Networking (MSN)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123526293","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}

引用次数: 0