Proceedings of the 19th International Conference on Distributed Computing and Networking最新文献_第5页

Using Bounded Binary Particle Swarm Optimization to Analyze Network Attack Graphs 基于有界二元粒子群算法的网络攻击图分析

Proceedings of the 19th International Conference on Distributed Computing and Networking Pub Date : 2018-01-04 DOI: 10.1145/3154273.3154324

A. Sairam, S. Verma

引用次数: 1

Distributed Graph Routing for WirelessHART Networks 无线shart网络的分布式图路由

Proceedings of the 19th International Conference on Distributed Computing and Networking Pub Date : 2018-01-04 DOI: 10.1145/3154273.3154335

V. P. Modekurthy, Abusayeed Saifullah, S. Madria

{"title":"Distributed Graph Routing for WirelessHART Networks","authors":"V. P. Modekurthy, Abusayeed Saifullah, S. Madria","doi":"10.1145/3154273.3154335","DOIUrl":"https://doi.org/10.1145/3154273.3154335","url":null,"abstract":"Communication reliability in a Wireless Sensor and Actuator Network (WSAN) has a high impact on stability of industrial process monitoring and control. To make reliable and real-time communication in highly unreliable environments, industrial WSANs such as those based on WirelessHART adopt graph routing. In graph routing, each packet is scheduled on multiple time slots using multiple channels, on multiple links along multiple paths on a routing graph between a source and a destination. While high redundancy is crucial to reliable communication, determining and maintaining graph routing is challenging in terms of execution time and energy consumption for resource constrained WSAN. Existing graph routing algorithms use centralized approach, do not scale well in terms of these metrics, and are less suitable under network dynamics. To address these limitations, we propose the first distributed graph routing protocol for WirelessHART networks. Our distributed protocol is based on the Bellman-Ford Algorithm, and generates all routing graphs together using a single algorithm. We prove that our proposed graph routing can include a path between a source and a destination with cost (in terms of hop-count) at most 3 times the optimal cost. We implemented our proposed routing algorithm on TinyOS and evaluated through experiments on TelosB motes and simulations using TOSSIM. The results show that it is scalable and consumes at least 40% less energy and needs at least 65% less time at the cost of 1kB of extra memory compared to the state-of-the-art centralized approach for generating routing graphs.","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116713419","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}

引用次数: 17

Exploiting multiple side channels for secret key agreement in Wireless Networks 利用多侧信道实现无线网络中的密钥协议

Proceedings of the 19th International Conference on Distributed Computing and Networking Pub Date : 2018-01-04 DOI: 10.1145/3154273.3154337

Hailun Tan, D. Ostry, S. Jha

{"title":"Exploiting multiple side channels for secret key agreement in Wireless Networks","authors":"Hailun Tan, D. Ostry, S. Jha","doi":"10.1145/3154273.3154337","DOIUrl":"https://doi.org/10.1145/3154273.3154337","url":null,"abstract":"Generating a secret key between two wireless devices without any priori information is a challenging problem. Extracting the shared secret from a wireless fading channel is proven as an effective solution to this problem. However, the unreliable wireless channel results in a significant communication overhead. Most of the related works focus on minimizing the impact of channel unreliability in the key agreement process. In this paper, we explore another direction, multiple side channels, to establish the shared key in wireless networks. In the context of network security, side channels are a way to steal sensitive information from computer network system. However, they can also be used in the hidden information exchange such as key agreement protocol. In our design, one of the side channels is packet transmission power. By switching among multiple transmission power levels, the receiver is able to decode the bits by comparing the Received Signal Strength (RSS) of the current packet with that of the previous one. However, a side channel of transmission power changes alone is not sufficiently secure as adversary could intercept the packets and infer the transmission power change pattern. Therefore, we employ another side channel by swapping the source and Destination address of the packets. We showed that adversary is able to extract shared bit with only one of the these side channels deployed but cannot when both side channels are utilized. We showed that our approach could establish the N-bit shared key with O(N) packets.","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121679698","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

Near-Optimal Clustering in the k-machine model k机模型的近最优聚类

Proceedings of the 19th International Conference on Distributed Computing and Networking Pub Date : 2017-10-23 DOI: 10.1145/3154273.3154317

Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai, S. Pemmaraju

{"title":"Near-Optimal Clustering in the k-machine model","authors":"Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai, S. Pemmaraju","doi":"10.1145/3154273.3154317","DOIUrl":"https://doi.org/10.1145/3154273.3154317","url":null,"abstract":"The clustering problem, in its many variants, has numerous applications in operations research and computer science (e.g., in applications in bioinformatics, image processing, social network analysis, etc.). As sizes of data sets have grown rapidly, researchers have focused on designing algorithms for clustering problems in models of computation suited for large-scale computation such as MapReduce, Pregel, and streaming models. The k-machine model (Klauck et al., SODA 2015) is a simple, message-passing model for large-scale distributed graph processing. This paper considers three of the most prominent examples of clustering problems: the uncapacitated facility location problem, the p-median problem, and the p-center problem and presents O (1)-factor approximation algorithms for these problems running in Õ (n/k) rounds in the k -machine model. These algorithms are optimal upto polylogarithmic factors because this paper also shows Ω (n/k) lower bounds for obtaining poly(n)-factor approximation algorithms for these problems. These are the first results for clustering problems in the k -machine model. We assume that the metric provided as input for these clustering problems in only implicitly provided, as an edge-weighted graph and in a nutshell, our main technical contribution is to show that constant-factor approximation algorithms for all three clustering problems can be obtained by learning only a small portion of the input metric.","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128765178","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}

引用次数: 11

Fast Flow Volume Estimation 快速流量体积估算

Proceedings of the 19th International Conference on Distributed Computing and Networking Pub Date : 2017-10-09 DOI: 10.1145/3154273.3154332

R. Ben-Basat, Gil Einziger, R. Friedman

引用次数: 18

Optimally Gathering Two Robots 最佳集合两个机器人

Proceedings of the 19th International Conference on Distributed Computing and Networking Pub Date : 2017-08-21 DOI: 10.1145/3154273.3154323

Adam Heriban, X. Défago, S. Tixeuil

引用次数: 26

Proof of Work Without All the Work 没有所有工作的工作证明

Proceedings of the 19th International Conference on Distributed Computing and Networking Pub Date : 2017-08-03 DOI: 10.1145/3154273.3154333

Diksha Gupta, Jared Saia, Maxwell Young

{"title":"Proof of Work Without All the Work","authors":"Diksha Gupta, Jared Saia, Maxwell Young","doi":"10.1145/3154273.3154333","DOIUrl":"https://doi.org/10.1145/3154273.3154333","url":null,"abstract":"Proof-of-work (PoW) is an algorithmic tool used to secure networks by imposing a computational cost on participating devices. Unfortunately, traditional PoW schemes require that correct devices perform computational work perpetually, even when the system is not under attack. We address this issue by designing a general PoW protocol that ensures two properties. First, the network stays secure. In particular, the fraction of identities in the system that are controlled by an attacker is always less than 1/2. Second, our protocol's computational cost is commensurate with the cost of an attacker. That is, the total computational cost of correct devices is a linear function of the attacker's computational cost plus the number of correct devices that have joined the system. Consequently, if the network is attacked, we ensure security, with cost that grows linearly with the attacker's cost; and, in the absence of attack, our computational cost is small. We prove similar guarantees for bandwidth cost. Our results hold in a dynamic, decentralized system where participants join and depart over time, and where the total computational power of the attacker is up to a constant fraction of the total computational power of correct devices. We show how to leverage our results to address important security problems in distributed computing including: Sybil attacks, Byzantine Consensus, and Committee Election.","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131588222","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}

引用次数: 28

Deterministic Dispersion of Mobile Robots in Dynamic Rings 动态环中移动机器人的确定性离散

Proceedings of the 19th International Conference on Distributed Computing and Networking Pub Date : 2017-07-20 DOI: 10.1145/3154273.3154294

Ankush Agarwalla, John E. Augustine, W. Moses, Sankar K. Madhav, A. Sridhar

{"title":"Deterministic Dispersion of Mobile Robots in Dynamic Rings","authors":"Ankush Agarwalla, John E. Augustine, W. Moses, Sankar K. Madhav, A. Sridhar","doi":"10.1145/3154273.3154294","DOIUrl":"https://doi.org/10.1145/3154273.3154294","url":null,"abstract":"In this work, we study the problem of dispersion of mobile robots on dynamic rings. The problem of dispersion of n robots on an n node graph, introduced by Augustine and Moses Jr. [2], requires robots to coordinate with each other and reach a configuration where exactly one robot is present on each node. This problem has real world applications and applies whenever we want to minimize the total cost of n agents sharing n resources, located at various places, subject to the constraint that cost of an agent moving to a different resource is comparatively much smaller than cost of multiple agents sharing a resource (e.g. smart electric cars sharing recharge stations). Study of this problem also provides indirect benefits to the studies of scattering on graphs, exploration by mobile robots, and load balancing on graphs. We solve the problem of dispersion in presence of two types of dynamism in the underlying graph: (i) vertex permutation and (ii) 1-interval connectivity. We introduce the notion of vertex permutation dynamism and have it mean that for a given set of nodes, in every round, the adversary ensures a ring structure is maintained, but the connections between the nodes may change. We use the idea of 1-interval connectivity from Di Luna et al. [11], where for a given ring, in each round, the adversary chooses at most one edge to remove. We assume robots have full visibility and present asymptotically time optimal algorithms to achieve dispersion in the presence of both types of dynamism when robots have chirality. When robots do not have chirality, we present asymptotically time optimal algorithms to achieve dispersion subject to certain constraints. Finally, we provide impossibility results for dispersion when robots have no visibility.","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129228529","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}

引用次数: 26

Dispersion of Mobile Robots: A Study of Memory-Time Trade-offs 移动机器人的分散:记忆-时间权衡的研究

Proceedings of the 19th International Conference on Distributed Computing and Networking Pub Date : 2017-07-18 DOI: 10.1145/3154273.3154293

John E. Augustine, W. Moses

{"title":"Dispersion of Mobile Robots: A Study of Memory-Time Trade-offs","authors":"John E. Augustine, W. Moses","doi":"10.1145/3154273.3154293","DOIUrl":"https://doi.org/10.1145/3154273.3154293","url":null,"abstract":"We introduce a new problem in the domain of mobile robots, which we term dispersion. In this problem, n robots are placed in an n node graph arbitrarily and must coordinate with each other to reach a final configuration such that exactly one robot is at each node. We study this problem through the lenses of minimizing the memory required by each robot and of minimizing the number of rounds required to achieve dispersion. Dispersion is of interest due to its relationship to the problems of scattering on a graph, exploration using mobile robots, and load balancing on a graph. Additionally, dispersion has an immediate real world application due to its relationship to the problem of recharging electric cars, as each car can be considered a robot and recharging stations and the roads connecting them nodes and edges of a graph respectively. Since recharging is a costly affair relative to traveling, we want to distribute these cars amongst the various available recharge points where communication should be limited to car-to-car interactions. We provide lower bounds on both the memory required for robots to achieve dispersion and the minimum running time to achieve dispersion on any type of graph. We then analyze the trade-offs between time and memory for various types of graphs. We provide time optimal and memory optimal algorithms for several types of graphs and show the power of a little memory in terms of running time.","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130870175","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}

引用次数: 41

Line Recovery by Programmable Particles 线路恢复可编程粒子

Proceedings of the 19th International Conference on Distributed Computing and Networking Pub Date : 2017-07-17 DOI: 10.1145/3154273.3154309

Giuseppe Antonio Di Luna, P. Flocchini, G. Prencipe, N. Santoro, G. Viglietta

引用次数: 21