Pub Date : 2016-04-10DOI: 10.1109/INFOCOM.2016.7524464
L. Yang, Mingxuan Yuan, Wei Wang, Qian Zhang, Jia Zeng
Owing to the proliferation of mobile devices and their corresponding app ecosystems, more and more people are accessing the internet via various mobile apps, which generates tremendous volume of mobile data. Despite the growing importance of these mobile apps, we have a rather sparse understanding of how they are accessed and what issues affect their usage patterns. To address this problem, we perform a comprehensive measurement on large-scale anonymized network data collected from a tier-1 cellular carrier in China. In this measurement, we characterize the usage pattern of mobile apps and exhibit how the mobility, geospatial properties and behaviours of subscribers affect their mobile app usage at a fine-grained level.
{"title":"Apps on the move: A fine-grained analysis of usage behavior of mobile apps","authors":"L. Yang, Mingxuan Yuan, Wei Wang, Qian Zhang, Jia Zeng","doi":"10.1109/INFOCOM.2016.7524464","DOIUrl":"https://doi.org/10.1109/INFOCOM.2016.7524464","url":null,"abstract":"Owing to the proliferation of mobile devices and their corresponding app ecosystems, more and more people are accessing the internet via various mobile apps, which generates tremendous volume of mobile data. Despite the growing importance of these mobile apps, we have a rather sparse understanding of how they are accessed and what issues affect their usage patterns. To address this problem, we perform a comprehensive measurement on large-scale anonymized network data collected from a tier-1 cellular carrier in China. In this measurement, we characterize the usage pattern of mobile apps and exhibit how the mobility, geospatial properties and behaviours of subscribers affect their mobile app usage at a fine-grained level.","PeriodicalId":274591,"journal":{"name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114308416","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}
Pub Date : 2016-04-10DOI: 10.1109/INFOCOM.2016.7524446
Zhenghao Zhang, Avishek Mukherjee
Privacy has become a major concern in wireless networks, especially in networks with weak or no password protection. While it has been proposed to send jamming signals to thwart the reception of the eavesdropper, the jamming signal typically cannot introduce enough errors to cover the entire packet when the jamming signal is not very strong, mainly due to the use of error correction codes in the system. Fortunately, error amplifiers can be easily constructed using block ciphers to amplify and spread the errors without requiring any secret keys. With error amplification, the jamming strategy needs to be revisited, because introducing a few errors is sufficient protect the privacy of the entire packet, instead of having to jam the entire packet. We propose a novel jamming strategy, called jMax, with proven performance bounds to the optimal jamming signal power. The idea of jMax is to rotate jamming vectors such that the jamming power can be maximized when the jamming vector close to the optimal jamming vector is used. We collect real-world CSI data with the Intel 5300 wireless card and use the Microsoft Sora Software-Defined Radio to process jammed data packets. Our results show that jMax achieves significant gains over other approaches.
{"title":"Friendly channel-oblivious jamming with error amplification for wireless networks","authors":"Zhenghao Zhang, Avishek Mukherjee","doi":"10.1109/INFOCOM.2016.7524446","DOIUrl":"https://doi.org/10.1109/INFOCOM.2016.7524446","url":null,"abstract":"Privacy has become a major concern in wireless networks, especially in networks with weak or no password protection. While it has been proposed to send jamming signals to thwart the reception of the eavesdropper, the jamming signal typically cannot introduce enough errors to cover the entire packet when the jamming signal is not very strong, mainly due to the use of error correction codes in the system. Fortunately, error amplifiers can be easily constructed using block ciphers to amplify and spread the errors without requiring any secret keys. With error amplification, the jamming strategy needs to be revisited, because introducing a few errors is sufficient protect the privacy of the entire packet, instead of having to jam the entire packet. We propose a novel jamming strategy, called jMax, with proven performance bounds to the optimal jamming signal power. The idea of jMax is to rotate jamming vectors such that the jamming power can be maximized when the jamming vector close to the optimal jamming vector is used. We collect real-world CSI data with the Intel 5300 wireless card and use the Microsoft Sora Software-Defined Radio to process jammed data packets. Our results show that jMax achieves significant gains over other approaches.","PeriodicalId":274591,"journal":{"name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","volume":"232 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123447225","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}
Pub Date : 2016-04-10DOI: 10.1109/INFOCOM.2016.7524429
Yixin Chen, Wenbo He, Yu Hua, Wen Wang
At the present time, billions of videos are hosted and shared in the cloud of which a sizable portion consists of near-duplicate video copies. An efficient and accurate content-based online near-duplicate video detection method is a fundamental research goal; as it would benefit applications such as duplication-aware storage, pirate video detection, polluted video tag detection, searching result diversification. Despite the recent progress made in near-duplicate video detection, it remains challenging to develop a practical detection system for large-scale applications that has good efficiency and accuracy performance. In this paper, we shift the focus from feature representation design to system design, and develop a novel system, called CompoundEyes, accordingly. The improvement in accuracy is achieved via well-organized classifiers instead of advanced feature design. Meanwhile, by applying simple features with reduced dimensionality and exploiting the parallelism of the detection architecture, we accelerate the detection speed. Through extensive experiments we demonstrate that the proposed detection system is accurate and fast. It takes approximately 1.45 seconds to process a video clip from a large video dataset, CC_WEB_VIDEO, with a 89% detection accuracy.
{"title":"CompoundEyes: Near-duplicate detection in large scale online video systems in the cloud","authors":"Yixin Chen, Wenbo He, Yu Hua, Wen Wang","doi":"10.1109/INFOCOM.2016.7524429","DOIUrl":"https://doi.org/10.1109/INFOCOM.2016.7524429","url":null,"abstract":"At the present time, billions of videos are hosted and shared in the cloud of which a sizable portion consists of near-duplicate video copies. An efficient and accurate content-based online near-duplicate video detection method is a fundamental research goal; as it would benefit applications such as duplication-aware storage, pirate video detection, polluted video tag detection, searching result diversification. Despite the recent progress made in near-duplicate video detection, it remains challenging to develop a practical detection system for large-scale applications that has good efficiency and accuracy performance. In this paper, we shift the focus from feature representation design to system design, and develop a novel system, called CompoundEyes, accordingly. The improvement in accuracy is achieved via well-organized classifiers instead of advanced feature design. Meanwhile, by applying simple features with reduced dimensionality and exploiting the parallelism of the detection architecture, we accelerate the detection speed. Through extensive experiments we demonstrate that the proposed detection system is accurate and fast. It takes approximately 1.45 seconds to process a video clip from a large video dataset, CC_WEB_VIDEO, with a 89% detection accuracy.","PeriodicalId":274591,"journal":{"name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123666963","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}
Pub Date : 2016-04-10DOI: 10.1109/INFOCOM.2016.7524492
Mei Wang, Zhehui Zhang, Xiaohua Tian, Xinbing Wang
Indoor localization based on RSS fingerprinting approach has been attracting many research efforts in the past decades. Recent study presents a fundamental limit of the approach: given requirement of estimation accuracy, reliability of the user's localization result can be derived. As highly accurate indoor localization is essential to enable many location based services, a natural question to ask is: can we further improve the accuracy of the localization scheme fundamentally? In this paper, we theoretically show that the temporal correlation of the RSS can improve accuracy of the RSS fingerprinting based indoor localization. In particular, we construct a theoretical framework to evaluate how the temporal correlation of the RSS can influence the reliability of location estimation, which is based on a newly proposed radio propagation model considering the time-varying property of signals from a given Wi-Fi AP. Such a theoretical framework is then applied to analyze localization in the one dimensional physical space, which reveals the fundamental reason why performance improvement of localization can be brought by temporal correlation of the RSS. We further extend our analysis to high-dimensional scenarios. Experimental results corroborate our theoretical analysis.
{"title":"Temporal correlation of the RSS improves accuracy of fingerprinting localization","authors":"Mei Wang, Zhehui Zhang, Xiaohua Tian, Xinbing Wang","doi":"10.1109/INFOCOM.2016.7524492","DOIUrl":"https://doi.org/10.1109/INFOCOM.2016.7524492","url":null,"abstract":"Indoor localization based on RSS fingerprinting approach has been attracting many research efforts in the past decades. Recent study presents a fundamental limit of the approach: given requirement of estimation accuracy, reliability of the user's localization result can be derived. As highly accurate indoor localization is essential to enable many location based services, a natural question to ask is: can we further improve the accuracy of the localization scheme fundamentally? In this paper, we theoretically show that the temporal correlation of the RSS can improve accuracy of the RSS fingerprinting based indoor localization. In particular, we construct a theoretical framework to evaluate how the temporal correlation of the RSS can influence the reliability of location estimation, which is based on a newly proposed radio propagation model considering the time-varying property of signals from a given Wi-Fi AP. Such a theoretical framework is then applied to analyze localization in the one dimensional physical space, which reveals the fundamental reason why performance improvement of localization can be brought by temporal correlation of the RSS. We further extend our analysis to high-dimensional scenarios. Experimental results corroborate our theoretical analysis.","PeriodicalId":274591,"journal":{"name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116868995","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}
Pub Date : 2016-04-10DOI: 10.1109/INFOCOM.2016.7524474
Jia Liu, A. Eryilmaz, N. Shroff, E. Bentley
The last decade has seen significant advances in optimization-based resource allocation and control approaches for wireless networks. However, the existing work suffer from poor performance in one or more of the metrics of optimality, delay, and convergence speed. To overcome these limitations, in this paper, we introduce a largely overlooked but highly effective heavy-ball optimization method. Based on this heavy-ball technique, we develop a cross-layer optimization framework that offers utility-optimality, fast-convergence, and significant delay reduction. Our contributions are three-fold: i) we propose a heavy-ball joint congestion control and routing/scheduling framework for both single-hop and multi-hop wireless networks; ii) we show that the proposed heavy-ball method offers an elegant three-way trade-off in utility, delay, and convergence, which is achieved under a near index-type simple policy; and more importantly, iii) our work opens the door to an unexplored network control and optimization paradigm that leverages advanced optimization techniques based on “memory/momentum” information.
{"title":"Heavy-ball: A new approach to tame delay and convergence in wireless network optimization","authors":"Jia Liu, A. Eryilmaz, N. Shroff, E. Bentley","doi":"10.1109/INFOCOM.2016.7524474","DOIUrl":"https://doi.org/10.1109/INFOCOM.2016.7524474","url":null,"abstract":"The last decade has seen significant advances in optimization-based resource allocation and control approaches for wireless networks. However, the existing work suffer from poor performance in one or more of the metrics of optimality, delay, and convergence speed. To overcome these limitations, in this paper, we introduce a largely overlooked but highly effective heavy-ball optimization method. Based on this heavy-ball technique, we develop a cross-layer optimization framework that offers utility-optimality, fast-convergence, and significant delay reduction. Our contributions are three-fold: i) we propose a heavy-ball joint congestion control and routing/scheduling framework for both single-hop and multi-hop wireless networks; ii) we show that the proposed heavy-ball method offers an elegant three-way trade-off in utility, delay, and convergence, which is achieved under a near index-type simple policy; and more importantly, iii) our work opens the door to an unexplored network control and optimization paradigm that leverages advanced optimization techniques based on “memory/momentum” information.","PeriodicalId":274591,"journal":{"name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125021263","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}
Pub Date : 2016-04-10DOI: 10.1109/INFOCOM.2016.7524517
Zhifeng He, S. Mao
We investigate the scheduling problem in a centralized dual-hop 60 GHz network with multiple Source-Destination (SD) pairs, relays, and a PicoNet Coordinator (PNC). The objective is to minimize the Maximum Expected Delivery Time (MEDT) among all SD pairs by jointly optimizing relay and link selection, while exploiting reflected mmWave transmissions and considering link blockage dynamics. We develop a Decomposition Principle to transform this problem into two sub-problems, one for link selection and the other for relay assignment when there is enough replays. We prove that the proposed scheme can achieve an optimality gap of just 1 time slot at greatly reduced complexity. We also develop a heuristic scheme to handle the case when there is no enough relays. The proposed schemes are validated with simulations, where their superior performance is observed.
{"title":"A decomposition principle for link and relay selection in dual-hop 60 GHz networks","authors":"Zhifeng He, S. Mao","doi":"10.1109/INFOCOM.2016.7524517","DOIUrl":"https://doi.org/10.1109/INFOCOM.2016.7524517","url":null,"abstract":"We investigate the scheduling problem in a centralized dual-hop 60 GHz network with multiple Source-Destination (SD) pairs, relays, and a PicoNet Coordinator (PNC). The objective is to minimize the Maximum Expected Delivery Time (MEDT) among all SD pairs by jointly optimizing relay and link selection, while exploiting reflected mmWave transmissions and considering link blockage dynamics. We develop a Decomposition Principle to transform this problem into two sub-problems, one for link selection and the other for relay assignment when there is enough replays. We prove that the proposed scheme can achieve an optimality gap of just 1 time slot at greatly reduced complexity. We also develop a heuristic scheme to handle the case when there is no enough relays. The proposed schemes are validated with simulations, where their superior performance is observed.","PeriodicalId":274591,"journal":{"name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128330462","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}
Pub Date : 2016-04-10DOI: 10.1109/INFOCOM.2016.7524564
Shaowei Wang, X. Huang
Smart grid is characterized by a large number of smart meters (SMs) that exchange huge amounts of data with control center, where an effective communication network is required to guarantee reliable data transmission. In this paper, we introduce software defined network (SDN) technology to the smart grid, which decouples the control plane from the data plane so as to satisfy the communication requirements in the mart grid effectively. Aggregation points (APs) are employed in the data plane to process and forward data between SMs and control center. A general mathematical model is formulated to plan the APs, where we try to minimize the total deployment cost, including the opening expenditure of the APs, the connection cost between SMs and APs, and the connection cost between APs and control center. We present a 5-approximation algorithm to address the generated NP-hard problem, which yields performance-guaranteed solutions. Three representative scenarios are investigated to verity the efficiency of our proposal. Numerical results show that our proposed algorithm has great advantages over other heuristic ones.
{"title":"Aggregation points planning for software-defined network based smart grid communications","authors":"Shaowei Wang, X. Huang","doi":"10.1109/INFOCOM.2016.7524564","DOIUrl":"https://doi.org/10.1109/INFOCOM.2016.7524564","url":null,"abstract":"Smart grid is characterized by a large number of smart meters (SMs) that exchange huge amounts of data with control center, where an effective communication network is required to guarantee reliable data transmission. In this paper, we introduce software defined network (SDN) technology to the smart grid, which decouples the control plane from the data plane so as to satisfy the communication requirements in the mart grid effectively. Aggregation points (APs) are employed in the data plane to process and forward data between SMs and control center. A general mathematical model is formulated to plan the APs, where we try to minimize the total deployment cost, including the opening expenditure of the APs, the connection cost between SMs and APs, and the connection cost between APs and control center. We present a 5-approximation algorithm to address the generated NP-hard problem, which yields performance-guaranteed solutions. Three representative scenarios are investigated to verity the efficiency of our proposal. Numerical results show that our proposed algorithm has great advantages over other heuristic ones.","PeriodicalId":274591,"journal":{"name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128405449","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}
Pub Date : 2016-04-10DOI: 10.1109/INFOCOM.2016.7524438
Sijia Gu, Zongpeng Li, Chuan Wu, Chuanhe Huang
Network Function Virtualization (NFV) is emerging as a new paradigm for providing elastic network functions through flexible virtual network function (VNF) instances executed on virtualized computing platforms exemplified by cloud datacenters. In the new NFV market, well defined VNF instances each realize an atomic function that can be chained to meet user demands in practice. This work studies the dynamic market mechanism design for the transaction of VNF service chains in the NFV market, to help relinquish the full power of NFV. Combining the techniques of primal-dual approximation algorithm design with Myerson's characterization of truthful mechanisms, we design a VNF chain auction that runs efficiently in polynomial time, guarantees truthfulness, and achieves near-optimal social welfare in the NFV eco-system. Extensive simulation studies verify the efficacy of our auction mechanism.
网络功能虚拟化(Network Function Virtualization, NFV)正在成为一种新的范例，它通过在云数据中心等虚拟化计算平台上执行灵活的虚拟网络功能(virtual Network Function, VNF)实例来提供弹性网络功能。在新的NFV市场中，定义良好的VNF实例每个都实现一个原子功能，可以通过链接来满足用户在实践中的需求。本文研究了NFV市场中VNF服务链交易的动态市场机制设计，以帮助NFV充分释放力量。结合原对偶逼近算法设计技术和Myerson真实机制表征，设计了一个在多项式时间内高效运行、保证真实性并实现NFV生态系统中接近最优社会福利的VNF链拍卖。大量的模拟研究验证了我们的拍卖机制的有效性。
{"title":"An efficient auction mechanism for service chains in the NFV market","authors":"Sijia Gu, Zongpeng Li, Chuan Wu, Chuanhe Huang","doi":"10.1109/INFOCOM.2016.7524438","DOIUrl":"https://doi.org/10.1109/INFOCOM.2016.7524438","url":null,"abstract":"Network Function Virtualization (NFV) is emerging as a new paradigm for providing elastic network functions through flexible virtual network function (VNF) instances executed on virtualized computing platforms exemplified by cloud datacenters. In the new NFV market, well defined VNF instances each realize an atomic function that can be chained to meet user demands in practice. This work studies the dynamic market mechanism design for the transaction of VNF service chains in the NFV market, to help relinquish the full power of NFV. Combining the techniques of primal-dual approximation algorithm design with Myerson's characterization of truthful mechanisms, we design a VNF chain auction that runs efficiently in polynomial time, guarantees truthfulness, and achieves near-optimal social welfare in the NFV eco-system. Extensive simulation studies verify the efficacy of our auction mechanism.","PeriodicalId":274591,"journal":{"name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128164086","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}
Pub Date : 2016-04-10DOI: 10.1109/INFOCOM.2016.7524340
Liang Tong, Yong Li, Wei Gao
The performance of mobile computing would be significantly improved by leveraging cloud computing and migrating mobile workloads for remote execution at the cloud. In this paper, to efficiently handle the peak load and satisfy the requirements of remote program execution, we propose to deploy cloud servers at the network edge and design the edge cloud as a tree hierarchy of geo-distributed servers, so as to efficiently utilize the cloud resources to serve the peak loads from mobile users. The hierarchical architecture of edge cloud enables aggregation of the peak loads across different tiers of cloud servers to maximize the amount of mobile workloads being served. To ensure efficient utilization of cloud resources, we further propose a workload placement algorithm that decides which edge cloud servers mobile programs are placed on and how much computational capacity is provisioned to execute each program. The performance of our proposed hierarchical edge cloud architecture on serving mobile workloads is evaluated by formal analysis, small-scale system experimentation, and large-scale trace-based simulations.
{"title":"A hierarchical edge cloud architecture for mobile computing","authors":"Liang Tong, Yong Li, Wei Gao","doi":"10.1109/INFOCOM.2016.7524340","DOIUrl":"https://doi.org/10.1109/INFOCOM.2016.7524340","url":null,"abstract":"The performance of mobile computing would be significantly improved by leveraging cloud computing and migrating mobile workloads for remote execution at the cloud. In this paper, to efficiently handle the peak load and satisfy the requirements of remote program execution, we propose to deploy cloud servers at the network edge and design the edge cloud as a tree hierarchy of geo-distributed servers, so as to efficiently utilize the cloud resources to serve the peak loads from mobile users. The hierarchical architecture of edge cloud enables aggregation of the peak loads across different tiers of cloud servers to maximize the amount of mobile workloads being served. To ensure efficient utilization of cloud resources, we further propose a workload placement algorithm that decides which edge cloud servers mobile programs are placed on and how much computational capacity is provisioned to execute each program. The performance of our proposed hierarchical edge cloud architecture on serving mobile workloads is evaluated by formal analysis, small-scale system experimentation, and large-scale trace-based simulations.","PeriodicalId":274591,"journal":{"name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128173714","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}
Pub Date : 2016-04-10DOI: 10.1109/INFOCOM.2016.7524448
Zhihong Liu, Jiajia Liu, N. Kato, Jianfeng Ma, Qiping Huang
This paper investigates divide-and-conquer based cooperative jamming for physical-layer security enhancement in the presence of multiple eavesdroppers. Different from previous works, we consider a scenario where the eavesdroppers can be located anywhere inside the communication region of the source, no location information of the eavesdroppers is available and no constraint on the number of eavesdroppers is presupposed. The basic idea is to transmit the message in multiple rounds and exploit the helpful interference from the source and the destination to jam the eavesdroppers in close proximity. Stochastic geometry based analytic results as well as Monte Carlo simulations are presented to illustrate the achievable secrecy performances.
{"title":"Divide-and-conquer based cooperative jamming: Addressing multiple eavesdroppers in close proximity","authors":"Zhihong Liu, Jiajia Liu, N. Kato, Jianfeng Ma, Qiping Huang","doi":"10.1109/INFOCOM.2016.7524448","DOIUrl":"https://doi.org/10.1109/INFOCOM.2016.7524448","url":null,"abstract":"This paper investigates divide-and-conquer based cooperative jamming for physical-layer security enhancement in the presence of multiple eavesdroppers. Different from previous works, we consider a scenario where the eavesdroppers can be located anywhere inside the communication region of the source, no location information of the eavesdroppers is available and no constraint on the number of eavesdroppers is presupposed. The basic idea is to transmit the message in multiple rounds and exploit the helpful interference from the source and the destination to jam the eavesdroppers in close proximity. Stochastic geometry based analytic results as well as Monte Carlo simulations are presented to illustrate the achievable secrecy performances.","PeriodicalId":274591,"journal":{"name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128685094","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：