2018 27th International Conference on Computer Communication and Networks (ICCCN)最新文献

筛选
英文 中文
ActivityShielder: An Activity Hijacking Defense Scheme for Android Devices activityshield:一个针对Android设备的活动劫持防御方案
2018 27th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2018-07-01 DOI: 10.1109/ICCCN.2018.8487367
Fei Yan, Yijia Li, Liqiang Zhang
{"title":"ActivityShielder: An Activity Hijacking Defense Scheme for Android Devices","authors":"Fei Yan, Yijia Li, Liqiang Zhang","doi":"10.1109/ICCCN.2018.8487367","DOIUrl":"https://doi.org/10.1109/ICCCN.2018.8487367","url":null,"abstract":"With the growing popularity of smartphones in vast areas, the security of Android has been a vital pursuit for developers. Among the security issues in Android, Activity hijacking attacks pose severe threat to normal APPs and sensitive input data by exploiting flaws in Android UI management mechanism with high elusiveness and extensive harmfulness. However, to our best knowledge, existing defenses either only work under particular scenarios or incur obvious false positives. To make up for this vacancy, we propose a novel Activity hijacking defense scheme named \"ActivityShielder\" for Android tasks. The scheme is designed to manage the entities of UI and it can detect and block multiple Activity hijacking attacks explicitly. We have developed a fully functioning prototype of ActivityShielder, and our evaluation results show that ActivityShielder (1) can effectively resist activity hijacking attacks and avoid existing false positives in multi-version Android systems; with (2) a minor performance impact (lower than 2%) to the system.","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"18 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":"116492271","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}
引用次数: 4
Optimizing Online Task Allocation for Multi-Attribute Social Sensing 基于多属性社会感知的在线任务分配优化
2018 27th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2018-07-01 DOI: 10.1109/ICCCN.2018.8487401
Yang Zhang, D. Zhang, Nathan Vance, Dong Wang
{"title":"Optimizing Online Task Allocation for Multi-Attribute Social Sensing","authors":"Yang Zhang, D. Zhang, Nathan Vance, Dong Wang","doi":"10.1109/ICCCN.2018.8487401","DOIUrl":"https://doi.org/10.1109/ICCCN.2018.8487401","url":null,"abstract":"Social sensing has emerged as a new sensing paradigm where humans (or devices on their behalf) collectively report measurements about the physical world. This paper focuses on an optimized task allocation problem in multi- attribute social sensing applications where the goal is to effectively allocate the tasks of collecting multiple attributes of the measured variables to human sensors while respecting the application's budget constraints. While recent progress has been made to tackle the optimized task allocation problem, two important challenges have not been well addressed. The first challenge is \"online task allocation\": the task allocation schemes need to respond quickly to the potentially large dynamics of the measured variables (e.g., temperature, noise, traffic) in social sensing. Delayed task allocation may lead to inaccurate sensing results and/or unnecessarily high sensing costs. The second challenge is the \"multi-attribute constrained optimization\": minimizing the overall sensing error given the dependencies and constraints of multiple attributes of the measured variables is a non-trivial problem to solve. To address the above challenges, this paper develops an Online Optimized Multi-attribute Task Allocation (OO-MTA) scheme inspired by techniques from machine learning and information theory. We evaluate the OO-MTA scheme using an urban sensing dataset collected from a real-world social sensing application. The evaluation results show that OO- MTA scheme significantly outperforms the state-of-the-art baselines in terms of the sensing accuracy.","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"601 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":"116309510","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
2018 ICCCN Technical Program 2018 ICCCN技术计划
2018 27th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2018-07-01 DOI: 10.1109/icccn.2018.8487312
{"title":"2018 ICCCN Technical Program","authors":"","doi":"10.1109/icccn.2018.8487312","DOIUrl":"https://doi.org/10.1109/icccn.2018.8487312","url":null,"abstract":"","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":"126092812","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
Pedestrian Detection Algorithm Based on Multi-Feature Cascade 基于多特征级联的行人检测算法
2018 27th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2018-07-01 DOI: 10.1109/ICCCN.2018.8487468
Jia Wen, Pengfei Liu, Chu Jia, Hongjun Wang
{"title":"Pedestrian Detection Algorithm Based on Multi-Feature Cascade","authors":"Jia Wen, Pengfei Liu, Chu Jia, Hongjun Wang","doi":"10.1109/ICCCN.2018.8487468","DOIUrl":"https://doi.org/10.1109/ICCCN.2018.8487468","url":null,"abstract":"Pedestrian detection can be applied to social security, and can effectively increase safety in traffic safety. In real life, there is a lot of complex background in the environment, such as illumination, occlusion, dress, attitude and perspective. Therefore, the pedestrian detection has been a challenging problems and a hot research topic in computer vision. In order to improve the detection speed and guarantee the detection accuracy, this paper proposed a pedestrian detection algorithm based on multi-feature cascade. The algorithm has two important points. The one, using the improved HOG feature to quickly eliminate negative samples to improve the detection speed. The other, using the cascade structure to guarantee the detection accuracy. In this paper, the experiment proves that the algorithm indeed improves the detection speed obviously, and prove that the algorithm is indeed effective in the improvement of these two important points. The algorithm is a research result which is obtained through study some classical pedestrian detection algorithms. And the algorithm shows the vitality of the classical algorithm and provides a new thinking way for researchers.","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"117 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":"124404294","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
HSNet: Energy Conservation in Heterogeneous Smartphone Ad Hoc Networks HSNet:异构智能手机自组织网络的节能
2018 27th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2018-07-01 DOI: 10.1109/ICCCN.2018.8487427
James Mariani, Spencer Ottarson, Li Xiao
{"title":"HSNet: Energy Conservation in Heterogeneous Smartphone Ad Hoc Networks","authors":"James Mariani, Spencer Ottarson, Li Xiao","doi":"10.1109/ICCCN.2018.8487427","DOIUrl":"https://doi.org/10.1109/ICCCN.2018.8487427","url":null,"abstract":"In recent years mobile computing has been rapidly expanding to the point that there are now more devices than there are people. While once it was common for every household to have one PC, it is now common for every person to have a mobile device. With the increased use of smartphone devices, there has also been an increase in the need for mobile ad hoc networks, in which phones connect directly to each other without the need for an intermediate router. Most modern smart phones are equipped with both Bluetooth and Wifi Direct, where Wifi Direct has a better transmission range and rate and Bluetooth is more energy efficient. However only one or the other is used in a smartphone ad hoc network. We propose HSNet, a framework to enable the automatic switching between Wifi Direct and Bluetooth to emphasize minimizing energy consumption while still maintaining an efficient network. We develop an application to evaluate the HSNet framework which shows significant energy savings when utilizing our switching algorithm to send messages by a less energy intensive technology in situations where energy conservation is desired. We discuss additional features of HSNet such as load balancing to help increase the lifetime of the network by more evenly distributing slave nodes among connected master nodes. Finally, we show that the throughput of our system is not affected due to technology switching for most scenarios.","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"30 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":"128880222","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
Redundancy Elimination on Unidirectional Lossy Links 单向有损链路的冗余消除
2018 27th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2018-07-01 DOI: 10.1109/ICCCN.2018.8487399
Leijun Huang, Hailin Feng, Ying Le, Chaofan Shen
{"title":"Redundancy Elimination on Unidirectional Lossy Links","authors":"Leijun Huang, Hailin Feng, Ying Le, Chaofan Shen","doi":"10.1109/ICCCN.2018.8487399","DOIUrl":"https://doi.org/10.1109/ICCCN.2018.8487399","url":null,"abstract":"Redundant data transmission, which is very common in computer networks, degrades bandwidth efficiency and wastes energy. To reduce such redundancy, many redundancy elimination (RE) techniques have been proposed. Most of them require strict history synchronization between the sender and receiver, and therefore assume the existence of bidirectional links to maintain the synchronization. This paper presents MinMax, a new RE mechanism that is specially designed for unidirectional lossy links. Using an existing fingerprinting algorithm, MinMax eliminates a region of payload in an outgoing packet only when the region is common in a certain number of previous packets. Thus over a lossy link, MinMax significantly reduces decompression failures at the receiver without resorting to any forms of feedback and retransmission. Experiments on synthetic data and real-world traffic show that MinMax is able to maintain fair bandwidth savings while inducing negligible decompression failures even when the packet loss rate of the link is as high as 20%.","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"76 3 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":"122189744","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
Blockchain-Based Security Layer for Identification and Isolation of Malicious Things in IoT: A Conceptual Design 基于区块链的物联网恶意物识别与隔离安全层概念设计
2018 27th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2018-07-01 DOI: 10.1109/ICCCN.2018.8487447
Mandrita Banerjee, Junghee Lee, Qian Chen, Kim-Kwang Raymond Choo
{"title":"Blockchain-Based Security Layer for Identification and Isolation of Malicious Things in IoT: A Conceptual Design","authors":"Mandrita Banerjee, Junghee Lee, Qian Chen, Kim-Kwang Raymond Choo","doi":"10.1109/ICCCN.2018.8487447","DOIUrl":"https://doi.org/10.1109/ICCCN.2018.8487447","url":null,"abstract":"Internet-of-Things (IoT) is increasingly becoming the norm in both civilian and military settings. In this paper, we present a comprehensive security abstraction layer for IoT systems based on blockchain, which provides us a logical view of a system that comprises trusted devices. The goal of the proposed layer is to detect and isolate untrusted devices. The proposed abstraction layer provides three services, namely: authorization, authentication, and auditing by using blockchain and smart contract-based approaches. We adopt a hardware based approach, where dedicated hardware modules are used to monitor the behavior of the firmware without incurring excessive performance overhead.","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"1 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":"130687063","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}
引用次数: 13
Bandwidth Preemption for High-Priority Data Transfer on Dedicated Channels 专用通道上高优先级数据传输的带宽抢占
2018 27th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2018-07-01 DOI: 10.1109/ICCCN.2018.8487395
Liudong Zuo, C. Wu, N. Rao, Aiqin Hou, Chia-Han Chang
{"title":"Bandwidth Preemption for High-Priority Data Transfer on Dedicated Channels","authors":"Liudong Zuo, C. Wu, N. Rao, Aiqin Hou, Chia-Han Chang","doi":"10.1109/ICCCN.2018.8487395","DOIUrl":"https://doi.org/10.1109/ICCCN.2018.8487395","url":null,"abstract":"Bandwidth reservation has been increasingly used to provide QoS for various network applications. To accommodate a high-priority bandwidth reservation request (BRR), the bandwidth scheduler sometimes needs to preempt existing bandwidth reservations that have been made for BRRs with a lower priority, which is traditionally known as connection preemption. When such preemption is unavoidable, one primary goal of bandwidth scheduling is to minimize the disruption to existing reservations. In this paper, we study the problem of bandwidth reservation preemption for two types of BRRs, bandwidth- and data transfer- oriented, respectively, on one given link of the scheduling network with two different objectives: (i) minimize the number and then the total bandwidth of existing bandwidth reservations to be preempted, and (ii) minimize the total bandwidth and then the number of existing bandwidth reservations to be preempted. We prove these four problems to be NP-complete and propose a heuristic algorithm for each. We also design baseline heuristic algorithms for performance comparison. Extensive simulation results show that the proposed heuristic algorithms outperform those in comparison.","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"2500 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":"131226872","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
Modelling Switches with Internal Buffering in Software-Defined Networks 软件定义网络中带内部缓冲的交换机建模
2018 27th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2018-07-01 DOI: 10.1109/ICCCN.2018.8487364
Deepak Singh, Bryan K. F. Ng, Y. Lai, Ying-Dar Lin, Winston K.G. Seah
{"title":"Modelling Switches with Internal Buffering in Software-Defined Networks","authors":"Deepak Singh, Bryan K. F. Ng, Y. Lai, Ying-Dar Lin, Winston K.G. Seah","doi":"10.1109/ICCCN.2018.8487364","DOIUrl":"https://doi.org/10.1109/ICCCN.2018.8487364","url":null,"abstract":"OpenFlow supports internal buffering of data packets in an SDN switch whereby a fraction of data packet header is sent to the controller instead of an entire data packet. This internal buffering increases the robustness and the utilization of the link between SDN switches and controller by absorbing temporary burst of packets which may overwhelm the controller. Existing queuing models for SDN have focused on the switches that immediately send packets to the controller for decisioning, with no existing models investigating the impact of the internal buffer in an SDN switch and the associated trade-offs of having an internal buffer. In this paper, we propose an analytical model for SDN switch with the internal buffer to investigate the potential benefits, drawbacks and trade-off of internal buffering in SDN switches. It was observed that a switch with internal buffer achieves up to 30% lower average packet transfer delay and 7% lower packet loss rate at the cost of requiring up to 50% more queue capacity than one without the internal buffer. The proposed model is validated with discrete event simulation where the difference between simulation and analytical results was between 0.6% and 2.8% for average packet transfer delay and less than 6% for average packet loss rate. With this investigation, we provide some guidelines to SDN switch designers on the merits, demerits and trade-off of internal buffering in an SDN switch.","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"1 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":"131837699","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
The Runtime System Problem Identification Method Based on Log Analysis 基于日志分析的运行时系统问题识别方法
2018 27th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2018-07-01 DOI: 10.1109/ICCCN.2018.8487466
Yanfang Liu, J. Lv, Shilong Ma, Wentao Yao
{"title":"The Runtime System Problem Identification Method Based on Log Analysis","authors":"Yanfang Liu, J. Lv, Shilong Ma, Wentao Yao","doi":"10.1109/ICCCN.2018.8487466","DOIUrl":"https://doi.org/10.1109/ICCCN.2018.8487466","url":null,"abstract":"Currently system logs are an important source of information for system administrators to monitor system behaviors and to identify system problems. The manual examining is infeasible for the complex system and the existing automated methods for identifying system problems have different disadvantages such as the extreme dependency on the source code of the system, the low accuracy of predicting or identifying the system problems, or the requirement of the balanced and labeled training data set. This paper proposes a one- class Support Vector Machine (OCSVM) based method to identify the runtime system problems. Firstly, log sequences are generated for describing the running trajectories of the monitored system by parsing log messages; Secondly, variable length n-gram features are extracted, and moreover, the log sequences are represented as feature vectors based on these variable length n-gram features and Vector Space Model (VSM). Finally, all the feature vectors of the training log sequence set, which only includes the labeled normal log sequences, are input into OCSVM. Experimental results show that it performs better to use linear kernel to train OCSVM on our feature vectors than Gaussian kernel and the size of the sliding window hardly affects the performance of our method. Moreover, the proposed method achieves better performance on unbalanced training dataset than the method based on Random Indexing (RI) and weighted SVM.","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"32 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":"131890571","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}
引用次数: 3
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信