2020 29th International Conference on Computer Communications and Networks (ICCCN)最新文献

筛选
英文 中文
Relational Database Watermarking Based on Chinese Word Segmentation and Word Embedding 基于中文分词和词嵌入的关系数据库水印
2020 29th International Conference on Computer Communications and Networks (ICCCN) Pub Date : 2020-08-01 DOI: 10.1109/ICCCN49398.2020.9209600
Wenling Li, Jianen Yan, Zhaoxin Zhang
{"title":"Relational Database Watermarking Based on Chinese Word Segmentation and Word Embedding","authors":"Wenling Li, Jianen Yan, Zhaoxin Zhang","doi":"10.1109/ICCCN49398.2020.9209600","DOIUrl":"https://doi.org/10.1109/ICCCN49398.2020.9209600","url":null,"abstract":"With the development of big data, relational databases are playing an important role in enterprises, military affairs, medical, etc. Moreover, they are vulnerable to piracy, forgery, and tampering. Consequently, the copyright protection of relational databases has become an issue with increasing concern. The use of digital watermarking technology can solve this problem effectively. In this paper, by using Chinese word segmentation and word embedding, the non-numerical attributes of the relational database with Chinese natural language are chosen to embed watermark. The method of the virtual splitting of the attribute column and the principle of modification minimum are proposed to guarantee the watermark capacity and reduce the data modification rate. The simulations are carried out to prove the algorithm has strong robustness to defense malicious attacks.","PeriodicalId":137835,"journal":{"name":"2020 29th International Conference on Computer Communications and Networks (ICCCN)","volume":"321 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124544581","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 Model Based on Program Slice and Deep Learning for Software Defect Prediction 基于程序切片和深度学习的软件缺陷预测模型
2020 29th International Conference on Computer Communications and Networks (ICCCN) Pub Date : 2020-08-01 DOI: 10.1109/ICCCN49398.2020.9209658
Junfeng Tian, Yongqing Tian
{"title":"A Model Based on Program Slice and Deep Learning for Software Defect Prediction","authors":"Junfeng Tian, Yongqing Tian","doi":"10.1109/ICCCN49398.2020.9209658","DOIUrl":"https://doi.org/10.1109/ICCCN49398.2020.9209658","url":null,"abstract":"Defects are inherent in software and can lead to many serious problems during the use of software. Software defect prediction is an important method for finding defects and can help developers improve their testing efficiency. To build accurate prediction models, previous software defect prediction techniques focus on design of functions related to the code of potential defects. But these methods do not adequately capture the semantic features of the program. In this paper, we propose a software defect prediction model based on program slice and deep learning. We extract program slice based on system dependence graph and leverage Gated Recurrent Unit (GRU) to generate features. We conducted experiments both within-project defect prediction and cross-project defect prediction using the dataset of the public PROMISE database. The results show that our method improves on average by 11.0% in F1-measure in within-project and 10.4% in F1-measure in cross-project defect prediction compared to the Tree-LSTM method.","PeriodicalId":137835,"journal":{"name":"2020 29th International Conference on Computer Communications and Networks (ICCCN)","volume":"294 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130229394","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}
引用次数: 8
Quality-driven Energy Optimization in Internet of Things 物联网中质量驱动的能源优化
2020 29th International Conference on Computer Communications and Networks (ICCCN) Pub Date : 2020-08-01 DOI: 10.1109/ICCCN49398.2020.9209666
V. Dhaimodker, Rahul Desai, S. Mini, Deepak K. Tosh
{"title":"Quality-driven Energy Optimization in Internet of Things","authors":"V. Dhaimodker, Rahul Desai, S. Mini, Deepak K. Tosh","doi":"10.1109/ICCCN49398.2020.9209666","DOIUrl":"https://doi.org/10.1109/ICCCN49398.2020.9209666","url":null,"abstract":"As a consequence of limited internal battery capacity and needless expenditure of electrical energy in commercial and residential deployments of Internet of Things (IoT) in recent years, there has been a rise in the impetus given to energy saving and optimization. In this paper, we propose a technique to solve the energy optimization problem for an IoT deployment that detects critical events like elderly fall detection, fire detection, intruder detection, etc. This technique aims to achieve an optimal set of configurations for a given IoT deployment such that the total energy consumption is minimum, and the deployment satisfies the required threshold accuracy expected from the deployment. Researchers have addressed this issue using algorithms mostly based on the Greedy Heuristic approach to reduce energy consumption by considering the dynamic nature of configurations of IoT devices. We propose Dynamic multiple-choice knapsack (DMCKP) algorithm that produces a better solution. The results of the proposed approach are compared with the existing algorithms to demonstrate the superiority of the proposed algorithm.","PeriodicalId":137835,"journal":{"name":"2020 29th International Conference on Computer Communications and Networks (ICCCN)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133823282","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
A Low Latency Transmission Control for Multi-link WLAN 多链路无线局域网的低延迟传输控制
2020 29th International Conference on Computer Communications and Networks (ICCCN) Pub Date : 2020-08-01 DOI: 10.1109/ICCCN49398.2020.9209740
Yoshihisa Kondo, H. Yomo, H. Yokoyama
{"title":"A Low Latency Transmission Control for Multi-link WLAN","authors":"Yoshihisa Kondo, H. Yomo, H. Yokoyama","doi":"10.1109/ICCCN49398.2020.9209740","DOIUrl":"https://doi.org/10.1109/ICCCN49398.2020.9209740","url":null,"abstract":"Stable wireless connections are required for ITS applications employing real-time video streaming. It is effective to enable multiple links which work on different channels in order to make WLAN connections stable. Therefore, we propose a transmission control scheme for multi-link WLAN assuming the real-time video streaming. In our proposed scheme, radio units, which have different types of transmission queues, transmit a video streaming collaboratively with the minimum support of a coordinator. A multi-radio receiver controls A-MPDU transmissions of the radio units using Block-Acks including a shared scoreboard context to avoid duplicated retransmissions. Our simulation results show that the proposed scheme reduces both average latency and maximum latency of video streaming traffic significantly when wireless link conditions change dynamically.","PeriodicalId":137835,"journal":{"name":"2020 29th International Conference on Computer Communications and Networks (ICCCN)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125125763","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
A Semantic-aware Representation Framework for Online Log Analysis 面向在线日志分析的语义感知表示框架
2020 29th International Conference on Computer Communications and Networks (ICCCN) Pub Date : 2020-08-01 DOI: 10.1109/ICCCN49398.2020.9209707
Weibin Meng, Ying Liu, Yuheng Huang, Shenglin Zhang, Federico Zaiter, Bingjin Chen, Dan Pei
{"title":"A Semantic-aware Representation Framework for Online Log Analysis","authors":"Weibin Meng, Ying Liu, Yuheng Huang, Shenglin Zhang, Federico Zaiter, Bingjin Chen, Dan Pei","doi":"10.1109/ICCCN49398.2020.9209707","DOIUrl":"https://doi.org/10.1109/ICCCN49398.2020.9209707","url":null,"abstract":"Logs are one of the most valuable data sources for large-scale service management. Log representation, which converts unstructured texts to structured vectors or matrices, serves as the the first step towards automated log analysis. However, the current log representation methods neither represent domain-specific semantic information of logs, nor handle the out-of-vocabulary (OOV) words of new types of logs at runtime. We propose Log2Vec, a semantic-aware representation framework for log analysis. Log2Vec combines a log-specific word embedding method to accurately extract the semantic information of logs, with an OOV word processor to embed OOV words into vectors at runtime. We present an analysis on the impact of OOV words and evaluate the performance of the OOV word processor. The evaluation experiments on four public production log datasets demonstrate that Log2Vec not only fixes the issue presented by OOV words, but also significantly improves the performance of two popular log-based service management tasks, including log classification and anomaly detection. We have packaged Log2Vec into an open-source toolkit and hope that it can be used for future research.","PeriodicalId":137835,"journal":{"name":"2020 29th International Conference on Computer Communications and Networks (ICCCN)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127972487","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}
引用次数: 33
The Trusted and Decentralized Network Resource Management 可信和分散的网络资源管理
2020 29th International Conference on Computer Communications and Networks (ICCCN) Pub Date : 2020-08-01 DOI: 10.1109/ICCCN49398.2020.9209590
Shuai Liu, Fei Yang, Dandan Li, M. Bagnulo, Bingyang Liu, Xiaohong Huang
{"title":"The Trusted and Decentralized Network Resource Management","authors":"Shuai Liu, Fei Yang, Dandan Li, M. Bagnulo, Bingyang Liu, Xiaohong Huang","doi":"10.1109/ICCCN49398.2020.9209590","DOIUrl":"https://doi.org/10.1109/ICCCN49398.2020.9209590","url":null,"abstract":"Network resource management relies on trusted infrastructures. However, current trusted infrastructures have centralized or hierarchical structures where root nodes often have privileges over subtrees. Hacked or malicious roots may affect subtrees by modifying IP ownership, routing and so on. Therefore, a trusted and decentralized network resource management becomes crucial. The emergence of blockchain such as Ethereum becomes a leading candidate for achieving trusted and decentralized network resource management. In this paper, based on Ethereum, we design a trusted authentication scheme that includes voting policy, endorsement, credibility model and rebinding mechanism to ensure the credibility of entities. Our scheme can allocate, delegate and transfer network resources in a trusted and decentralized style. The experimental results verify the feasibility and security of our scheme. When an entity is hacked or malicious, its endorsement authentication is revoked and the entity does not have the right to manage the network resources. In addition, the overhead increased by the trusted authentication scheme is within a reasonable range.","PeriodicalId":137835,"journal":{"name":"2020 29th International Conference on Computer Communications and Networks (ICCCN)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121137052","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
ICCCN 2020 Ad Page ICCCN 2020广告页
2020 29th International Conference on Computer Communications and Networks (ICCCN) Pub Date : 2020-08-01 DOI: 10.1109/icccn49398.2020.9209696
{"title":"ICCCN 2020 Ad Page","authors":"","doi":"10.1109/icccn49398.2020.9209696","DOIUrl":"https://doi.org/10.1109/icccn49398.2020.9209696","url":null,"abstract":"","PeriodicalId":137835,"journal":{"name":"2020 29th International Conference on Computer Communications and Networks (ICCCN)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126225937","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
ML Soft-decision Decoding for Binary Linear Block Codes Based on Trellises of Their Supercodes 基于超码网格的二进制线性分组码的ML软判决译码
2020 29th International Conference on Computer Communications and Networks (ICCCN) Pub Date : 2020-08-01 DOI: 10.1109/ICCCN49398.2020.9209629
Ting-Yi Wu, Y. Han
{"title":"ML Soft-decision Decoding for Binary Linear Block Codes Based on Trellises of Their Supercodes","authors":"Ting-Yi Wu, Y. Han","doi":"10.1109/ICCCN49398.2020.9209629","DOIUrl":"https://doi.org/10.1109/ICCCN49398.2020.9209629","url":null,"abstract":"Based on the notion of supercodes, we propose a two-phase maximum-likelihood (ML) soft-decision decoding (tpMLSD) algorithm for binary linear block codes in this work. The first phase applies the priority-first search algorithm backwardly to a trellis derived from the parity-check matrix of the supercode of the linear block code. Using the information retained from the first phase, the second phase employs the priority-first search algorithm to the trellis corresponding to the linear block code itself, which guarantees to find the ML decision with a constant complexity per information bit at high signal-to-noise ratios (SNRs). Simulations on the extended BCH code of n = 64 and k = 24 show that the proposed two-phase scheme is an order of magnitude more efficient in average decoding complexity than the recursive ML decoding [1] when the SNR per information bit is 8 dB.","PeriodicalId":137835,"journal":{"name":"2020 29th International Conference on Computer Communications and Networks (ICCCN)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115054886","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
QoS Aware Task Management Strategies for Mobile Crowdsensing Applications 面向移动众感应用的QoS感知任务管理策略
2020 29th International Conference on Computer Communications and Networks (ICCCN) Pub Date : 2020-08-01 DOI: 10.1109/ICCCN49398.2020.9209684
Shuhui Yang, Xuefeng Xi, Wei Li
{"title":"QoS Aware Task Management Strategies for Mobile Crowdsensing Applications","authors":"Shuhui Yang, Xuefeng Xi, Wei Li","doi":"10.1109/ICCCN49398.2020.9209684","DOIUrl":"https://doi.org/10.1109/ICCCN49398.2020.9209684","url":null,"abstract":"Mobile Crowdsensing (MCS) systems are under rapid development due to the popularization of smart mobile devices with various sensing abilities. MCS systems are useful in applications that require large scale spatial data collecting. To provide satisfactory service, the MCS system is expected to contain effective and efficient task management strategies, considering worker qualification, and possible worker moving. Most existing works design moving trajectory for each worker, in order to improve task accomplishment ratio (TAR) for QoS consideration. Other than great real time operation cost, it is also not practical to control workers’ moving due to privacy issue. In this work, we propose a MCS model with comprehensive integrated parameters to support the design of effective QoS aware task assignment strategies. We design strategies to perform task assignment based on worker qualification, using gradient to represent worker moving probability. We develop the accumulated gradient based reward allocation (AGRA) that improves QoS by motivating worker moving. Our experiments show that the proposed QoS MCS management strategies improve task accomplishment ratio significantly.","PeriodicalId":137835,"journal":{"name":"2020 29th International Conference on Computer Communications and Networks (ICCCN)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130190273","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
TaDPole: Traffic-aware Discovery Protocol for Software-Defined Wireless and Mobile Networks 蝌蚪:用于软件定义无线和移动网络的流量感知发现协议
2020 29th International Conference on Computer Communications and Networks (ICCCN) Pub Date : 2020-08-01 DOI: 10.1109/ICCCN49398.2020.9209683
Faheed A. F. Alenezi, Sejun Song, Baek-Young Choi, Haymanot Gebre-Amlak
{"title":"TaDPole: Traffic-aware Discovery Protocol for Software-Defined Wireless and Mobile Networks","authors":"Faheed A. F. Alenezi, Sejun Song, Baek-Young Choi, Haymanot Gebre-Amlak","doi":"10.1109/ICCCN49398.2020.9209683","DOIUrl":"https://doi.org/10.1109/ICCCN49398.2020.9209683","url":null,"abstract":"The Software-Defined Networking (SDN) technologies enhance the performance, reliability, and cost of managing the functions, controls, and services of the wireless and mobile network infrastructures (i.e., Internet of Things). However, the current OpenFlow Discovery Protocol (OFDP) in SDN poses substantial scalability, accuracy, and latency challenges due to its gossipy, centralized, periodic, and tardy protocol nature. Furthermore, the problems are aggravated in the wireless, and mobile SDN due to the dynamic topology churns and the lack of link-layer discovery methods.In this paper, we design and build a novel Traffic-aware Discovery Protocol (TaDPole) for wireless and mobile SDN. We facilitate multiple discovery frequency timers for each target instead of using a uniform discovery timer for the entire network. TaDPole calculates the significance of each discovery target according to the recent network usage by assuming that the higher traffic node has more impact on the network service. It lessens discovery delay by increasing the discovery frequency to the more critical nodes. Also, it enhances the control message efficiency by reducing the discovery frequency to the less significant targets. Besides, it supports the port-neutral broadcast-based discovery method instead of using port-specific request and response approaches. We have implemented TaDPole on the RYU controller. Extensive Mininet experiment results validate that TaDPole improves discovery message efficiency by two times and makes the control traffic less bursty than OFDP with a uniform timer. It reduces the network status discovery delay by three times without increasing the control overhead.","PeriodicalId":137835,"journal":{"name":"2020 29th International Conference on Computer Communications and Networks (ICCCN)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128418051","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
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学术文献互助群
群 号:604180095
Book学术官方微信