2014 IEEE 34th International Conference on Distributed Computing Systems最新文献_第4页

NomLoc: Calibration-Free Indoor Localization with Nomadic Access Points NomLoc:无校准室内定位与游牧接入点

2014 IEEE 34th International Conference on Distributed Computing Systems Pub Date : 2014-06-30 DOI: 10.1109/ICDCS.2014.66

Jiang Xiao, Youwen Yi, Lu Wang, Haochao Li, Zimu Zhou, Kaishun Wu, L. Ni

{"title":"NomLoc: Calibration-Free Indoor Localization with Nomadic Access Points","authors":"Jiang Xiao, Youwen Yi, Lu Wang, Haochao Li, Zimu Zhou, Kaishun Wu, L. Ni","doi":"10.1109/ICDCS.2014.66","DOIUrl":"https://doi.org/10.1109/ICDCS.2014.66","url":null,"abstract":"Newly popular indoor location-based services (ILBS), when integrated with commerce and public safety, offer a promising land for wireless indoor localization technologies. WLAN is suggested to be one of the most potential candidates owing to its prevalent infrastructure (i.e., access points (APs)) and low cost. However, the overall performance can be greatly degraded by the spatial localizability variance problem, i.e., the localization accuracy across various locations may have significant differences given any fixed AP deployment. As a result, it brings in user experience inconsistency which is unfavorable for ILBS. In this paper, we propose NomLoc - an indoor localization system using nomadic APs to address the performance variance problem. The key insight of NomLoc is to leverage the mobility of nomadic APs to dynamically adjust the WLAN network topology. A space partition (SP)-based localization algorithm is tailored for NomLoc to perform calibration-free positioning. Moreover, fine-grained channel state information (CSI) is employed to mitigate the performance degradation of the SP-based method due to multipath and none-line-of-sight (NLOS) effects. We have implemented the NomLoc system with off-the-shelf devices and evaluated the performance in two typical indoor environments. The results show that NomLoc can greatly mitigate spatial localizability variance and improve localization accuracy with the assistance of nomadic APs as compared with the corresponding static AP deployment. Moreover, it is robust to the position error of nomadic APs.","PeriodicalId":170186,"journal":{"name":"2014 IEEE 34th International Conference on Distributed Computing Systems","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127116750","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}

引用次数: 18

Two-Party Fine-Grained Assured Deletion of Outsourced Data in Cloud Systems 云系统中外包数据的两方细粒度保证删除

2014 IEEE 34th International Conference on Distributed Computing Systems Pub Date : 2014-06-30 DOI: 10.1109/ICDCS.2014.39

Zhen Mo, Yan Qiao, Shigang Chen

引用次数: 18

Achieving Absolutely Optimal Block Pipelining in Organized Network Coded Gossip 在有组织的网络编码八卦中实现绝对最佳的块管道

2014 IEEE 34th International Conference on Distributed Computing Systems Pub Date : 2014-06-30 DOI: 10.1109/ICDCS.2014.69

M. Khabbazian, Di Niu

引用次数: 1

Enhancing Visibility of Network Performance in Large-Scale Sensor Networks 增强大规模传感器网络中网络性能的可见性

2014 IEEE 34th International Conference on Distributed Computing Systems Pub Date : 2014-06-30 DOI: 10.1109/ICDCS.2014.49

Xiaoxu Li, Q. Ma, Zhichao Cao, Kebin Liu, Yunhao Liu

{"title":"Enhancing Visibility of Network Performance in Large-Scale Sensor Networks","authors":"Xiaoxu Li, Q. Ma, Zhichao Cao, Kebin Liu, Yunhao Liu","doi":"10.1109/ICDCS.2014.49","DOIUrl":"https://doi.org/10.1109/ICDCS.2014.49","url":null,"abstract":"Being embedded in the physical world, wireless sensor networks (WSNs) present a wide range of failures, due to environment conditions, hardware limitations and software uncertainties, and so on. Once deployed, the interactivity of a WSN greatly decreases, which leads to limited visibility of network performance for managers to investigate sensor behaviors. Existing evidence-based approaches aim to explain particular network symptoms based on expert knowledge and heuristic experiences, which degrade diagnosis accuracy and perform unreliably. These diagnosis models define a limited group of network failures, emphasizing on expert knowledge too much, and thus fail to be adopted to different applications. In this work, we propose VN2, a novel tool to enhance the visibility of network performance. VN2 quantifies a node's state in terms of variation of 43 metrics, and trains a representative matrix of network exceptions with Non-negative Matrix Factorization (NMF) model. With this matrix, when a new network state coming up, VN2 automatically attributes abnormal symptoms to one or more root causes. We implement VN2 on test bed and real system traces. Experimental results show that VN2 models network exceptions involving small subsets of root causes, and the interpretation of root causes help us understand network behaviors in details.","PeriodicalId":170186,"journal":{"name":"2014 IEEE 34th International Conference on Distributed Computing Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131000709","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

Counting in Anonymous Dynamic Networks under Worst-Case Adversary 最坏情况下匿名动态网络的计数

2014 IEEE 34th International Conference on Distributed Computing Systems Pub Date : 2014-06-30 DOI: 10.1109/ICDCS.2014.42

Giuseppe Antonio Di Luna, R. Baldoni, Silvia Bonomi, I. Chatzigiannakis

{"title":"Counting in Anonymous Dynamic Networks under Worst-Case Adversary","authors":"Giuseppe Antonio Di Luna, R. Baldoni, Silvia Bonomi, I. Chatzigiannakis","doi":"10.1109/ICDCS.2014.42","DOIUrl":"https://doi.org/10.1109/ICDCS.2014.42","url":null,"abstract":"In this paper we investigate the problem of counting the size of a network where processes are anonymous (i.e, they share the same identifier) and the network topology constantly changes controlled by an adversary able to look internal process states and add and remove edges in order to contrast the convergence of the algorithm to the correct count. It is easy to show that, if the adversary can generate graphs without any constraint on the connectivity (i.e. it can generate topologies where there exist nodes not able to influence the others), counting is impossible. In this paper we consider a synchronous round based computation and the dynamicity is governed by a worst-case adversary that generates a sequence of graphs, one for each round, with the only constraint that each graph must be connected (1-interval connectivity property). It has been conjectured that counting in a finite time against such adversary is impossible and the existing solutions consider that each process has some knowledge about network topologies generated by the adversary, i.e. at each round, each node has a degree lesser than D. Along the path of proving the validity (or not) of the conjecture, this paper presents an algorithm that counts in a finite time against the worst-case adversary assuming each process is equipped with an oracle. The latter provides a process at each round r with an estimation of the process degree in the graph generated by the adversary at round r. To the best of our knowledge, this is the first counting algorithm (terminating in a finite time) where processes exploit the minimal knowledge about the behavior of the adversary. Interestingly, such oracle can be implemented in a wide range of real systems.","PeriodicalId":170186,"journal":{"name":"2014 IEEE 34th International Conference on Distributed Computing Systems","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132007996","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}

引用次数: 35

SOR: An Objective Ranking System Based on Mobile Phone Sensing 基于手机感知的目标排序系统SOR

2014 IEEE 34th International Conference on Distributed Computing Systems Pub Date : 2014-06-30 DOI: 10.1109/ICDCS.2014.20

Xiang Sheng, Jian Tang, Jing Wang, Chenfei Gao, G. Xue

{"title":"SOR: An Objective Ranking System Based on Mobile Phone Sensing","authors":"Xiang Sheng, Jian Tang, Jing Wang, Chenfei Gao, G. Xue","doi":"10.1109/ICDCS.2014.20","DOIUrl":"https://doi.org/10.1109/ICDCS.2014.20","url":null,"abstract":"Currently, a few online review and recommendation systems (such as Yelp and Trip Advisor) have attracted millions of users and are gaining increasing popularity. They usually rate and rank places and attractions based on subjective ratings provided by users. In this paper, we present design, implementation and evaluation of a mobile phone Sensing based Objective Ranking (SOR) system, which ranks a target place based on data collected via mobile phone sensing. Our system has the following desirable features: 1) it is easy to use, 2) its architecture is so scalable that various embedded and external sensors can be easily integrated into it, 3) an online scheduling algorithm is proposed and used to schedule sensing activities for coverage maximization, which has a constant approximation ratio of 1/2, 4) a personalizable ranking algorithm is developed and used to rank target places based on various sensor readings and user preferences. We validate and evaluate SOR via both field tests (using real hiking trails and coffee shops in Syracuse, NY as target places) and simulation. The field-testing results show that data collected and processed by SOR can well capture characteristics of target places, and personalizable rankings produced by SOR can well match user preferences. In addition, simulation results well justify effectiveness of the proposed scheduling algorithm.","PeriodicalId":170186,"journal":{"name":"2014 IEEE 34th International Conference on Distributed Computing Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125731543","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

Turret: A Platform for Automated Attack Finding in Unmodified Distributed System Implementations 炮塔:一个在未修改的分布式系统实现中自动发现攻击的平台

2014 IEEE 34th International Conference on Distributed Computing Systems Pub Date : 2014-06-30 DOI: 10.1109/ICDCS.2014.73

Hyojeong Lee, Jeff Seibert, Md. Endadul Hoque, C. Killian, C. Nita-Rotaru

{"title":"Turret: A Platform for Automated Attack Finding in Unmodified Distributed System Implementations","authors":"Hyojeong Lee, Jeff Seibert, Md. Endadul Hoque, C. Killian, C. Nita-Rotaru","doi":"10.1109/ICDCS.2014.73","DOIUrl":"https://doi.org/10.1109/ICDCS.2014.73","url":null,"abstract":"Security and performance are critical goals for distributed systems. The increased design complexity, incomplete expertise of developers, and limited functionality of existing testing tools often result in bugs and vulnerabilities that prevent implementations from achieving their design goals in practice. Many of these bugs, vulnerabilities, and misconfigurations manifest after the code has already been deployed making the debugging process difficult and costly. In this paper, we present Turret, a platform for automatically finding performance attacks in unmodified implementations of distributed systems. Turret does not require the user to provide any information about vulnerabilities and runs the implementation in the same operating system setup as the deployment, with an emulated network. Turret uses a new attack finding algorithm and several optimizations that allow it to find attacks in a matter of minutes. We ran Turret on 5 different distributed system implementations specifically designed to tolerate insider attacks, and found 30 performance attacks, 24 of which were not previously reported to the best of our knowledge.","PeriodicalId":170186,"journal":{"name":"2014 IEEE 34th International Conference on Distributed Computing Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126884779","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}

引用次数: 24

Generic Composite Counting in RFID Systems RFID系统中的通用复合计数

2014 IEEE 34th International Conference on Distributed Computing Systems Pub Date : 2014-06-30 DOI: 10.1109/ICDCS.2014.67

Haoxiang Liu, Wei Gong, Lei Chen, Wenbo He, Kebin Liu, Yunhao Liu

{"title":"Generic Composite Counting in RFID Systems","authors":"Haoxiang Liu, Wei Gong, Lei Chen, Wenbo He, Kebin Liu, Yunhao Liu","doi":"10.1109/ICDCS.2014.67","DOIUrl":"https://doi.org/10.1109/ICDCS.2014.67","url":null,"abstract":"Counting the number of RFID tags is a fundamental issue and has a wide range of applications in RFID systems. Most existing protocols, however, only apply to the scenario where a single reader counts the number of tags covered by its radio, or at most the union of tags covered by multiple readers. They are unable to achieve more complex counting objectives, i.e., counting the number of tags in a composite set expression such as (S_1 big cup S_2) - (S_3 big cap S_4). This type of counting has realistic significance since it provides more diversity than existing counting scenario, and can be applied in various applications. In this paper, we formally introduce the RFID composite counting problem, which aims at counting the tags in arbitrary set expression. We obtain strong lower bounds on the communication cost of composite counting. We then propose a generic Composite Counting Framework (CCF) that provides estimates for any set expression with desired accuracy. The communication cost of CCF is proved to be within a small factor from the optimal. We build a prototype system for CCF using USRP software defined radio and Intel WISP computational tags. Also, extensive simulations are conducted to evaluate the performance of CCF. The experimental results show that CCF is generic, accurate and time-efficient.","PeriodicalId":170186,"journal":{"name":"2014 IEEE 34th International Conference on Distributed Computing Systems","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123449416","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}

引用次数: 25

S4D-Cache: Smart Selective SSD Cache for Parallel I/O Systems S4D-Cache:智能选择SSD缓存并行I/O系统

2014 IEEE 34th International Conference on Distributed Computing Systems Pub Date : 2014-06-30 DOI: 10.1109/ICDCS.2014.59

Shuibing He, Xian-He Sun, Bo Feng

引用次数: 37

AJIRA: A Lightweight Distributed Middleware for MapReduce and Stream Processing AJIRA:用于MapReduce和流处理的轻量级分布式中间件

2014 IEEE 34th International Conference on Distributed Computing Systems Pub Date : 2014-06-30 DOI: 10.1109/ICDCS.2014.62

J. Urbani, Alessandro Margara, C. Jacobs, Spyros Voulgaris, H. Bal

{"title":"AJIRA: A Lightweight Distributed Middleware for MapReduce and Stream Processing","authors":"J. Urbani, Alessandro Margara, C. Jacobs, Spyros Voulgaris, H. Bal","doi":"10.1109/ICDCS.2014.62","DOIUrl":"https://doi.org/10.1109/ICDCS.2014.62","url":null,"abstract":"Currently, MapReduce is the most popular programming model for large-scale data processing and this motivated the research community to improve its efficiency either with new extensions, algorithmic optimizations, or hardware. In this paper we address two main limitations of MapReduce: one relates to the model's limited expressiveness, which prevents the implementation of complex programs that require multiple steps or iterations. The other relates to the efficiency of its most popular implementations (e.g., Hadoop), which provide good resource utilization only for massive volumes of input, operating sub optimally for smaller or rapidly changing input. To address these limitations, we present AJIRA, a new middleware designed for efficient and generic data processing. At a conceptual level, AJIRA replaces the traditional map/reduce primitives by generic operators that can be dynamically allocated, allowing the execution of more complex batch and stream processing jobs. At a more technical level, AJIRA adopts a distributed, multi-threaded architecture that strives at minimizing overhead for non-critical functionality. These characteristics allow AJIRA to be used as a single programming model for both batch and stream processing. To this end, we evaluated its performance against Hadoop, Spark, Esper, and Storm, which are state of the art systems for both batch and stream processing. Our evaluation shows that AJIRA is competitive in a wide range of scenarios both in terms of processing time and scalability, making it an ideal choice where flexibility, extensibility, and the processing of both large and dynamic data with a single programming model are either desirable or even mandatory requirements.","PeriodicalId":170186,"journal":{"name":"2014 IEEE 34th International Conference on Distributed Computing Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131328760","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 27