2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS)最新文献_第9页

Secure Connectivity of Wireless Sensor Networks Under Key Predistribution with on/off Channels 带开/关通道密钥预分配下无线传感器网络的安全连接

2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS) Pub Date : 2017-06-01 DOI: 10.1109/ICDCS.2017.186

Jun Zhao

{"title":"Secure Connectivity of Wireless Sensor Networks Under Key Predistribution with on/off Channels","authors":"Jun Zhao","doi":"10.1109/ICDCS.2017.186","DOIUrl":"https://doi.org/10.1109/ICDCS.2017.186","url":null,"abstract":"Security is an important issue in wireless sensor networks (WSNs), which are often deployed in hostile environments. The q-composite key predistribution scheme has been recognized as a suitable approach to secure WSNs. Although the q-composite scheme has received much attention in the literature, there is still a lack of rigorous analysis for secure WSNs operating under the q-composite scheme in consideration of the unreliability of links. One main difficulty lies in analyzing the network topology whose links are not independent. Wireless links can be unreliable in practice due to the presence of physical barriers between sensors or because of harsh environmental conditions severely impairing communications. In this paper, we resolve the difficult challenge and investigate k-connectivity in secure WSNs operating under the q-composite scheme with unreliable communication links modeled as independent on/off channels, where k-connectivity ensures connectivity despite the failure of any (k - 1) sensors or links, and connectivity means that any two sensors can find a path in between for secure communication. Specifically, we derive the asymptotically exact probability and a zero-one law for k-connectivity. We further use the theoretical results to provide design guidelines for secure WSNs. Experimental results also confirm the validity of our analytical findings.","PeriodicalId":127689,"journal":{"name":"2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129483533","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

k-Protected Routing Protocol in Multi-hop Cognitive Radio Networks 多跳认知无线网络中的k保护路由协议

2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS) Pub Date : 2017-06-01 DOI: 10.1109/ICDCS.2017.266

Chin-Jung Liu, Li Xiao

{"title":"k-Protected Routing Protocol in Multi-hop Cognitive Radio Networks","authors":"Chin-Jung Liu, Li Xiao","doi":"10.1109/ICDCS.2017.266","DOIUrl":"https://doi.org/10.1109/ICDCS.2017.266","url":null,"abstract":"In cognitive radio networks (CRNs), the established communication sessions between secondary users (SUs) may be affected or even get interrupted because the SUs need to relinquish the spectrum when the licensed users (PUs) appear and reclaim the spectrum/channel. On detecting PU activities, the SUs on the affected links either switch to another available idle spectrum using the same link or the SUs seek for an alternative path/link. In either approach, the ongoing session is destined to experience delay or even gets interrupted, which is intolerable to quality of service-sensitive applications such as multimedia streaming or audio/video conferencing. In this paper, we study the problem of establishing k-protected routes in CRNs. A k-protected route consists of a set of main links with preassigned backup spectrum and backup paths and is guaranteed to sustain from k PU appearances without being interrupted. For a CRN, we find a k-protected route for each session request and maximize the number of sessions that can be supported. We propose both centralized and distributed k-protected routing algorithms for this problem. Simulation results show that our k-protected routing protocol outperforms existing opportunistic spectrum switching approaches in terms of delay and interruption rate.","PeriodicalId":127689,"journal":{"name":"2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129581107","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

Serverless Programming (Function as a Service) 无服务器编程(功能即服务)

2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS) Pub Date : 2017-06-01 DOI: 10.1109/ICDCS.2017.305

Paul C. Castro, Vatche Isahagian, Vinod Muthusamy, Aleksander Slominski

引用次数: 47

Max-Min Fair Resource Allocation in HetNets: Distributed Algorithms and Hybrid Architecture HetNets中最大最小公平资源分配:分布式算法和混合架构

2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS) Pub Date : 2017-06-01 DOI: 10.1109/ICDCS.2017.205

Ehsan Aryafar, A. Keshavarz-Haddad, Carlee Joe-Wong, M. Chiang

{"title":"Max-Min Fair Resource Allocation in HetNets: Distributed Algorithms and Hybrid Architecture","authors":"Ehsan Aryafar, A. Keshavarz-Haddad, Carlee Joe-Wong, M. Chiang","doi":"10.1109/ICDCS.2017.205","DOIUrl":"https://doi.org/10.1109/ICDCS.2017.205","url":null,"abstract":"We study the resource allocation problem in RAN-level integrated HetNets. This emerging HetNets paradigm allows for dynamic traffic splitting across radio access technologies for each client, and then for aggregating the traffic inside the network to improve the overall resource utilization. We focus on the max-min fair service rate allocation across the clients, and study the properties of the optimal solution. Based on the analysis, we design a low complexity distributed algorithm that tries to achieve max-min fairness. We also design a hybrid network architecture that leverages opportunistic centralized network supervision to augment the distributed solution. We analyze the performance of our proposed algorithms and prove their convergence. We also derive conditions under which the outcome is optimal. When the conditions are not satisfied, we provide constant upper and lower bounds on the optimality gap. Finally, we study the convergence time of our distributed solution and show that leveraging appropriate policies in its design significantly reduces the convergence time.","PeriodicalId":127689,"journal":{"name":"2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130360135","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

Group Differential Privacy-Preserving Disclosure of Multi-level Association Graphs 多级关联图的群差分隐私保护披露

2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS) Pub Date : 2017-06-01 DOI: 10.1109/ICDCS.2017.223

Balaji Palanisamy, C. Li, P. Krishnamurthy

引用次数: 8

WearLock: Unlocking Your Phone via Acoustics Using Smartwatch WearLock:使用智能手表通过声学解锁手机

2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS) Pub Date : 2017-06-01 DOI: 10.1109/ICDCS.2017.183

Shanhe Yi, Zhengrui Qin, Nancy Carter, Qun A. Li

{"title":"WearLock: Unlocking Your Phone via Acoustics Using Smartwatch","authors":"Shanhe Yi, Zhengrui Qin, Nancy Carter, Qun A. Li","doi":"10.1109/ICDCS.2017.183","DOIUrl":"https://doi.org/10.1109/ICDCS.2017.183","url":null,"abstract":"Smartphone lock screens are implemented to reduce the risk of data loss or compromise given the fact that increasing amount of person data are accessible on smartphones nowadays. Unfortunately, many smartphone users abandon lock screens due to the inconvenience of unlocking their phones many times a day. With the wide adoption of wearables, token-based approaches have gained popularity in simplifying unlocking and retaining security at the same time. To this end, we propose to take advantage of the smartwatch for easy smartphone unlocking. In this paper, we have designed WearLock, a system that uses acoustic tones as tokens to automate the unlocking securely. We build a sub-channel selection and an adaptive modulation in the acoustic modem to maximize unlocking success rate against ambient noise only when those two devices are nearby. We leverage the motion sensor on the smartwatch to reduce the unlock frequency. We offload smartwatch tasks to the smartphone to speed up computation and save energy. We have implemented the WearLock prototype and conducted extensive evaluations. Results achieved a low average bit error rate (BER) as 8% in various experiments. Compared to traditional manual personal identification numbers (PINs) entry, WearLock achieves at least 18% unlock speedup without any manual effort.","PeriodicalId":127689,"journal":{"name":"2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS)","volume":"13 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120907972","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

Scalable Routing for Topic-Based Publish/Subscribe Systems Under Fluctuations 波动下基于主题的发布/订阅系统的可扩展路由

2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS) Pub Date : 2017-06-01 DOI: 10.1109/ICDCS.2017.27

V. Turau, Gerry Siegemund

引用次数: 10

Private, Yet Practical, Multiparty Deep Learning 私人，但实用，多方深度学习

2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS) Pub Date : 2017-06-01 DOI: 10.1109/ICDCS.2017.215

Xinyang Zhang, S. Ji, Hui Wang, Ting Wang

引用次数: 48

DeepOpp: Context-Aware Mobile Access to Social Media Content on Underground Metro Systems DeepOpp:地铁系统社交媒体内容的上下文感知移动访问

2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS) Pub Date : 2017-06-01 DOI: 10.1109/ICDCS.2017.269

Di Wu, Dmitri I. Arkhipov, Thomas Przepiorka, Qiang Liu, J. Mccann, A. Regan

{"title":"DeepOpp: Context-Aware Mobile Access to Social Media Content on Underground Metro Systems","authors":"Di Wu, Dmitri I. Arkhipov, Thomas Przepiorka, Qiang Liu, J. Mccann, A. Regan","doi":"10.1109/ICDCS.2017.269","DOIUrl":"https://doi.org/10.1109/ICDCS.2017.269","url":null,"abstract":"Accessing online social media content on underground metro systems is a challenge due to the fact that passengers often lose connectivity for large parts of their commute. As the oldest metro system in the world, the London underground represents a typical transportation network with intermittent Internet connectivity. To deal with disruption in connectivity along the sub-surface and deep-level underground lines on the London underground, we have designed a context-aware mobile system called DeepOpp that enables efficient offline access to online social media by prefetching and caching content opportunistically when signal availability is detected. DeepOpp can measure, crowdsource and predict signal characteristics such as strength, bandwidth and latency; it can use these predictions of mobile network signal to activate prefetching, and then employ an optimization routine to determine which social content should be cached in the system given real-time network conditions and device capacities. DeepOpp has been implemented as an Android application and tested on the London Underground; it shows significant improvement over existing approaches, e.g. reducing the amount of power needed to prefetch social media items by 2.5 times. While we use the London Underground to test our system, it is equally applicable in New York, Paris, Madrid, Shanghai, or any other urban underground metro system, or indeed in any situation in which users experience long breaks in connectivity.","PeriodicalId":127689,"journal":{"name":"2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129400712","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

DCM: Dynamic Concurrency Management for Scaling n-Tier Applications in Cloud DCM:在云中扩展n层应用程序的动态并发管理

2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS) Pub Date : 2017-06-01 DOI: 10.1109/ICDCS.2017.22

Hui Chen, Qingyang Wang, Balaji Palanisamy, Pengcheng Xiong

{"title":"DCM: Dynamic Concurrency Management for Scaling n-Tier Applications in Cloud","authors":"Hui Chen, Qingyang Wang, Balaji Palanisamy, Pengcheng Xiong","doi":"10.1109/ICDCS.2017.22","DOIUrl":"https://doi.org/10.1109/ICDCS.2017.22","url":null,"abstract":"Scaling web applications such as e-commerce in cloud by adding or removing servers in the system is an important practice to handle workload variations, with the goal of achieving both high quality of service (QoS) and high resource efficiency. Through extensive scaling experiments of an n-tier application benchmark (RUBBoS), we have observed that scaling only hardware resources without appropriate adaptation of soft resource allocations (e.g., thread or connection pool size) of each server would cause significant performance degradation of the overall system by either under- or over-utilizing the bottleneck resource in the system. We develop a dynamic concurrency management (DCM) framework which integrates soft resource allocations into the system scaling management. DCM introduces a model which determines a near-optimal concurrency setting to each tier of the system based on a combination of operational queuing laws and online analysis of fine-grained measurement data. We implement DCM as a two-level actuator which scales both hardware and soft resources in an n-tier system on the fly without interrupting the runtime system performance. Our experimental results demonstrate that DCM can achieve significantly more stable performance and higher resource efficiency compared to the state-of-the-art hardware-only scaling solutions (e.g., Amazon EC2-AutoScale) under realistic bursty workload traces.","PeriodicalId":127689,"journal":{"name":"2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129407271","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}

引用次数: 9