IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)最新文献

筛选
英文 中文
Demo Abstract: A demonstration of automatic configuration of OpenFlow in wireless ad hoc networks 摘要:介绍了OpenFlow在无线自组织网络中的自动配置
Sachin Sharma, M. Nekovee
{"title":"Demo Abstract: A demonstration of automatic configuration of OpenFlow in wireless ad hoc networks","authors":"Sachin Sharma, M. Nekovee","doi":"10.1109/INFCOMW.2019.8845307","DOIUrl":"https://doi.org/10.1109/INFCOMW.2019.8845307","url":null,"abstract":"Using OpenFlow, a network can be controlled from one or more servers called controllers. In the demonstration, we show automatic configuration of OpenFlow in a wireless ad hoc network, deployed on a portable testbed, using MININET-WiFi (an emulator for software defined wireless networks). Automatic configuration is shown using a GUI (Graphical User Interface) which shows wireless nodes discovered by the controller. In addition, a video clip is streamed from one node to another and displayed in real time. The demonstration includes automatic configuration in the scenarios in which nodes move from one location to another.","PeriodicalId":321862,"journal":{"name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128786427","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
Towards Automatic Deployment of Virtual Firewalls to Support Secure mMTC in 5G Networks 迈向自动部署虚拟防火墙,支持5G网络安全mMTC
Pablo Salva-Garcia, Enrique Chirivella-Perez, Jorge Bernal Bernabé, J. Alcaraz-Calero, Qi Wang
{"title":"Towards Automatic Deployment of Virtual Firewalls to Support Secure mMTC in 5G Networks","authors":"Pablo Salva-Garcia, Enrique Chirivella-Perez, Jorge Bernal Bernabé, J. Alcaraz-Calero, Qi Wang","doi":"10.1109/INFCOMW.2019.8845183","DOIUrl":"https://doi.org/10.1109/INFCOMW.2019.8845183","url":null,"abstract":"Internet of Things (IoT) has emerged as the main enabler to deal with challenging use cases that require massive Machine-Type Communications (mMTC), and mMTC has been recognized as one of three use case types for the Fifth Generation (5G) and beyond networks. In IoT networks, it is prohibitive to rely on just one firewall where hundreds of thousands of rules need to be installed in order to provide security countermeasures to each of the IoT devices. To fill this gap, this paper proposes an automatic deployment of virtual firewalls by leveraging Network Function Virtualisation (NFV) Management and Orchestration (MANO) to protect NB-IoT mMTC communications. The main idea underneath is to use NFV to deal with efficient rule distribution across VNFs-based firewalls to achieve scalability in the number of managed IoT devices. Empirical results have validated the design and implementation of the proposed scheme and demonstrating its advantageous performance and scalability. In particular, the deployment time for this VNF-based firewall service is highlighted to meet the requirement of a 5G Key Performance Indicator (KPI).","PeriodicalId":321862,"journal":{"name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115166744","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}
引用次数: 5
Efficient Influence Maximization Under Network Uncertainty 网络不确定性下的有效影响最大化
S. Eshghi, S. Maghsudi, Valerio Restocchi, S. Stein, L. Tassiulas
{"title":"Efficient Influence Maximization Under Network Uncertainty","authors":"S. Eshghi, S. Maghsudi, Valerio Restocchi, S. Stein, L. Tassiulas","doi":"10.1109/INFCOMW.2019.8845088","DOIUrl":"https://doi.org/10.1109/INFCOMW.2019.8845088","url":null,"abstract":"We consider the influence maximization (IM) problem in a partially visible social network. The goal is to design a decision-making framework for an autonomous agent to select a limited set of influential seed nodes to spread a message as widely as possible across the network. We consider the realistic case where only a partial section of the network is visible to the agent, while the rest is one of a finite set of known structures, each with a given realization probability. We show that solving the IM problem in this setting is NP-hard, and we provide analytical guarantees for the performance of a novel computationally-efficient seed-selection approximation algorithm for the agent. In empirical experiments on real-world social networks, we demonstrate the efficiency of our scheme and show that it outperforms state-of-the-art approaches that do not model the uncertainty.","PeriodicalId":321862,"journal":{"name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129596242","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}
引用次数: 10
ECC-based Secure and Lightweight Authentication Protocol for Mobile Environment 基于ecc的移动环境安全轻量级认证协议
IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2019-04-29 DOI: 10.1109/infocomwkshps47286.2019.9093756
S. Garg, K. Kaur, Georges Kaddoum, Syed Hassan Ahmed, F. Gagnon, M. Guizani
{"title":"ECC-based Secure and Lightweight Authentication Protocol for Mobile Environment","authors":"S. Garg, K. Kaur, Georges Kaddoum, Syed Hassan Ahmed, F. Gagnon, M. Guizani","doi":"10.1109/infocomwkshps47286.2019.9093756","DOIUrl":"https://doi.org/10.1109/infocomwkshps47286.2019.9093756","url":null,"abstract":"Due to recent advances in wireless communication, the availability of mobile services has increased significantly. However, due to the open nature of wireless channels, vulnerabilities exploiting these services have increased as well. Thus, it is essential to ensure the legitimacy of both clients and servers and to provide communication confidentiality. To feed this trend, mutual authentication has become a critical security issue in mobile environments. In the past, a large number of authentication protocols have been proposed to provide secure communication and key exchange between parties. However, most of them fail to provide reliable security solutions due to inherent challenges such as the mobility of users, increasing attack vectors, and resource-constrained mobile devices. Thus, developing an efficient authentication protocol for practical mobile device deployment remains challenging. Therefore, we propose a lightweight and secure authentication key exchange protocol for mobile environment able to resist the threats while providing higher operational efficiency. The designed solution is based on Elliptic Curve Cryptography, well known for its short key sizes as well as its reduced storage and transmission requirements. The formal security verification of the proposed scheme has been carried out using the widely used AVIPSA tool. Further, the computational and communicational overhead analysis of the proposed scheme mark its superior performance relative to the current state-of-the-art.","PeriodicalId":321862,"journal":{"name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115485747","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
Poster Abstract: Secure Data Sharing by Means of Fragmentation, Encryption, and Dispersion 摘要:通过碎片化、加密和分散的方式实现安全的数据共享
K. Kapusta, Han Qiu, G. Memmi
{"title":"Poster Abstract: Secure Data Sharing by Means of Fragmentation, Encryption, and Dispersion","authors":"K. Kapusta, Han Qiu, G. Memmi","doi":"10.1109/INFCOMW.2019.8845243","DOIUrl":"https://doi.org/10.1109/INFCOMW.2019.8845243","url":null,"abstract":"Outsourcing data to the cloud raise several security challenges. Among others, a user may fear that their data could be exposed during a data breach, misused by the storage provider, or acquired by an attacker observing communication channels. In this poster abstract, we introduce a conceptual multi-cloud architecture reinforcing the confidentiality of the information sharing. Not only it does protect against untrusted storage providers but also is a secure alternative to direct data sharing between users. Moreover, it simplifies the access revocation procedure when the data is shared between multiple users.","PeriodicalId":321862,"journal":{"name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114162312","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
Constructive Interference Precoding for Reliable Non-Orthogonal IoT Signaling 可靠非正交物联网信令的建设性干扰预编码
T. Xu, Fan Liu, Ang Li, C. Masouros, I. Darwazeh
{"title":"Constructive Interference Precoding for Reliable Non-Orthogonal IoT Signaling","authors":"T. Xu, Fan Liu, Ang Li, C. Masouros, I. Darwazeh","doi":"10.1109/INFCOMW.2019.8845151","DOIUrl":"https://doi.org/10.1109/INFCOMW.2019.8845151","url":null,"abstract":"Efficient signal waveform design is paving the way to next generation Internet of Things (NG-IoT) communications. Non-orthogonal spectrally efficient frequency division multiplexing (SEFDM) waveform brings bandwidth saving advantages but at the cost of complex signal processing in IoT devices. Power efficiency is the main concern in IoT applications since IoT devices have limited battery life and cannot easily recharge after deployment. Therefore, signal processing in each IoT device should be as simple as possible. Precoding is applied as the strategy at transmitters to pre-cancel the self-created inter carrier interference (ICI) caused by the non-orthogonal sub-carrier packing, and to facilitate low-complexity IoT receivers. However, the typical zero forcing (ZF) precoding results in performance degradation due to the ill-conditioned precoding matrix. To achieve reliable communications using SEFDM signals, a robust constructive interference (CI) precoding method is employed, which constructively converts interference power to useful signal power. Thus, signal-to-noise ratio (SNR) is effectively improved leading to better performance than ZF precoding. This work initially studies the performance of precoding methods in simulation. Furthermore, the CI precoding is practically tested over-the-air on a multi-user multiple input multiple output (MIMO)-SEFDM software defined radio NG-IoT platform.","PeriodicalId":321862,"journal":{"name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114274533","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
Ranking node influence according to dynamic network load 根据动态网络负载对节点影响进行排序
IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2019-04-29 DOI: 10.1109/infocomwkshps47286.2019.9093757
Tiantian Jin, Changda Wang
{"title":"Ranking node influence according to dynamic network load","authors":"Tiantian Jin, Changda Wang","doi":"10.1109/infocomwkshps47286.2019.9093757","DOIUrl":"https://doi.org/10.1109/infocomwkshps47286.2019.9093757","url":null,"abstract":"When a mobile network suffering attacks, ranking and then protecting influential nodes to ensure the security of the network are critical. Many methods have been proposed to evaluate nodes influences. However, most of such methods are based on network topology analysis through graph theory only. As a result, the most influential node chosen by such methods may be a rarely used one for packets transmissions. We devise NodeRank, Direct Principal Component Ranking (DPCR) and Comprehensive Principal Component Ranking (CPCR) algorithms to rank node influence according to dynamic network load changes, where NodeRank is a single-dimensional method with higher efficiency; DPCR and CPCR are multi-dimensional methods with higher accuracy. DPCR applies the rule that the first principle component takes all in the measurement; CPCR applies a moderate rule that uses linear-weight comprehensive evaluation which takes the importance from each principal component in the measurement. Simulation results show that our proposed schemes outperform the known methods such as Degree Centrality (DC), Betweenness Centrality (BC), Closeness Centrality (CC) and Eigenvalue Centrality (EC) for node ranking. To the best of our knowledge, DPCR and CPCR are the first known schemes that can rank node influence with respect to the direction of packets transmissions in networks.","PeriodicalId":321862,"journal":{"name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130790627","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
Optimal Control Design for Connected Cruise Control with Edge Computing, Caching, and Control 连接巡航控制的最优控制设计与边缘计算,缓存和控制
IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2019-04-29 DOI: 10.1109/infocomwkshps47286.2019.9093766
Zhuwei Wang, Yu Gao, Chao Fang, Yang Sun, Pengbo Si
{"title":"Optimal Control Design for Connected Cruise Control with Edge Computing, Caching, and Control","authors":"Zhuwei Wang, Yu Gao, Chao Fang, Yang Sun, Pengbo Si","doi":"10.1109/infocomwkshps47286.2019.9093766","DOIUrl":"https://doi.org/10.1109/infocomwkshps47286.2019.9093766","url":null,"abstract":"As an advanced driver assistance system (ADAS), connected cruise control (CCC), which is able to significantly improve vehicle’s reliability, stability, and safety, is currently under extensive investigation. In the CCC system, V2V communication plays a key role in sharing a large amount of reliable information among vehicles. In this paper, considering the communication delays, an optimal control design is proposed for the CCC system with edge controllers having the capability of computing, caching, and control. First, the dynamics of each vehicle in the platoon is modeled in detail, and then a linear quadratic optimization problem is formulated when the sampling period and the communication delay are considered. In order to minimize the deviations of vehicle’s headway and velocity, the optimal control strategy is iteratively solved using a backwards recursion. Finally, numerical simulations are carried out to demonstrate the effectiveness of the proposed algorithm.","PeriodicalId":321862,"journal":{"name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131102717","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}
引用次数: 7
Virtual Network Function Service Provisioning for Offloading Tasks in MEC by Trading off Computing and Communication Resource Usages 通过权衡计算和通信资源的使用,为MEC中卸载任务提供虚拟网络功能服务
IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2019-04-29 DOI: 10.1109/infocomwkshps47286.2019.9093758
Yu Ma, W. Liang, Meitian Huang, Yang Liu, Song Guo
{"title":"Virtual Network Function Service Provisioning for Offloading Tasks in MEC by Trading off Computing and Communication Resource Usages","authors":"Yu Ma, W. Liang, Meitian Huang, Yang Liu, Song Guo","doi":"10.1109/infocomwkshps47286.2019.9093758","DOIUrl":"https://doi.org/10.1109/infocomwkshps47286.2019.9093758","url":null,"abstract":"Mobile edge computing (MEC) has emerged as a promising technology that offers resource-intensive yet delaysensitive applications from the edge of mobile networks. With the emergence of complicated and resource-hungry mobile applications, offloading user tasks to cloudlets of nearby mobile edgecloud networks is becoming an important approach to leverage the processing capability of mobile devices, reduce mobile device energy consumptions, and improve experiences of mobile users. In this paper we study the joint VNF instance deployment and offloading task request assignment in MEC, by explicitly exploring a non-trivial tradeoff between usages of different types of resources. We aim to maximize the number of request admissions while minimizing their admission cost. To this end, we first formulate the cost minimization problem that admits all requests, by assuming that there are sufficient computing resources to accommodate the requested VNF instances of all requests, for which we formulate an Integer Linear Program solution and an efficient heuristic. We then deal with the throughput maximization problem by admitting as many requests as possible, subject to computing resource capacity at each cloudlet, for which we devise an efficient algorithm. We finally evaluate the performance of the proposed algorithms through experimental simulations. Experimental results demonstrate that the proposed algorithms are promising.","PeriodicalId":321862,"journal":{"name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123176595","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
Model-Based optimization for JT CoMP in C-RAN C-RAN中JT CoMP的模型优化
Hadjer Touati, Hind Castel-Taleb, B. Jouaber, Sara Akbarzadeh
{"title":"Model-Based optimization for JT CoMP in C-RAN","authors":"Hadjer Touati, Hind Castel-Taleb, B. Jouaber, Sara Akbarzadeh","doi":"10.1109/INFCOMW.2019.8845102","DOIUrl":"https://doi.org/10.1109/INFCOMW.2019.8845102","url":null,"abstract":"In this paper, we develop a model-based optimization technique for JT CoMP (Joint transmission Coordinated Multi-Points) in the context of Cloud based Radio Access (C-RAN) and 5G networks. The objective is to ease decisions on the distribution of resources between CoMP and non-CoMP users according to the traffic load. We propose a mathematical queuing model which parameters are computed from real radio conditions that we reproduced in a cluster of cells. We use a closed form formula that fits the behavior of the considered scheme and allows the analysis of the cell throughput according to traffic load, radio conditions and the distribution of available resources among the CoMP and non-CoMP users within the cooperative macro cells. Moreover, the computation speed of the results allows us to develop a complex optimization model. The relevance of our work is that it can be integrated as a resource management tools to decide quickly on the distribution of the available resources among the CoMP and non-CoMP users of the cooperative macro cells to achieve the optimal capacity of the cells in terms of user throughput. As a perspective, the proposed queue-based model can be used in order to define the traffic load in order to dimension the front-haul links and the BBU pool in C-RAN.","PeriodicalId":321862,"journal":{"name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131369021","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
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学术官方微信