检索结果-内蒙古大学图书馆

22nd International Conference on distributed Computing and Networking (ICDCN)

作者： Cicerone, Serafino Di Fonso, Alessia Di Stefano, Gabriele Navarra, Alfredo Univ Aquila Dip Ingn & Sci Informaz & Matemat Laquila Italy Univ Perugia Dip Matemat & Informat Perugia Italy

ISBN: (纸本)9781450389334

Given a set R of robots, each one located at a different vertex of an infinite regular tessellation graph, we aim to explore the Arbitrary Pattern Formation (APF) problem. Given a multiset F of grid vertices such that vertical bar R vertical bar = vertical bar F vertical bar, APF asks for a distributed algorithm that moves robots so as to reach a configuration similar to F. Similarity means that robots must be disposed as F regardless of translations, rotations, reflections. So far, as possible discretization of the Euclidean plane only the standard square grid has been considered in the context of the classical Look-Compute-Move model. However, it is natural to consider the other regular tessellation graphs, that are triangular and hexagonal grids. For any regular tessellation graph, we provide a resolution algorithm for APF when the initial configuration is asymmetric.

关键词： distributed algorithms Mobile and collaborative systems Asynchrony Self-organization Pattern formation Graphs

来源：评论

学校读者我要写书评

暂无评论

Scaling the monitoring of approximate top-k queries in streaming windows

Scaling the monitoring of approximate top-k queries in strea...

引用

9th IEEE International Conference on Big Data (IEEE BigData)

作者： Ramperez, Victor Zahmatkesh, Shima Della Valle, Emanuele Univ Politecn Madrid Madrid Spain Politecn Milan Milan Italy

ISBN: (纸本)9781665439022

The continuous search for the k best results given a query (top-k) in a data stream is a problem that has gained a lot of attention in recent years, especially in social media and IoT contexts. In these contexts it is essential that the system is able to respond reactively. Therefore, in this study we address how to scale the monitoring of approximate continuous top-k queries to guarantee the reactiveness of the system. In this paper we introduce a scalable distributed version of the MinTopK+N algorithm that allows the system to remain reactive when the load increases. In addition, we present a scale-out/in algorithm that allows the system to add instances to cope with workload increments and remove instances to avoid over-provisioning. Furthermore, in a set of managed experiments, we demonstrated how the increase in the workload could affect the system performance and the impact of the instant of triggering scaling actions on the system performance. Finally, we present a study on the impact of the scaling action on the correctness of the result, showing that the scaling algorithm does not negatively impact the correctness of the results, and in certain conditions, it can even improve the quality of the approximation.

关键词： Continuous Top-k distributed algorithms scalability

来源：评论

学校读者我要写书评

暂无评论

Enhanced Precision Time Synchronization for Modular Robots 20

Enhanced Precision Time Synchronization for Modular Robots

引用

IEEE 20th International Symposium on Network Computing and Applications (NCA)

作者： Bassil, Jad Piranda, Benoit Makhoul, Abdallah Bourgeois, Julien Univ Bourgogne Franche Comte FEMTO ST Inst CNRS Besancon France

ISBN: (纸本)9781665495509

As in all distributed systems, having an accurate access to a global notion of time is vital for a modular robot's modules to coordinate their activities and accomplish their goal. In this paper, we present and compare two methods for clock skew compensation to enhance the performance of network-wide time synchronization in modular robots with neighbor-to-neighbor communication. The first one, Adaptive Rate Search (ARS), uses a light weight adaptive search method to adapt the drift rate of local clocks. The second one, combines Linear Regression with Bayes estimation (LR+) to reduce the accumulative error induced during the propagation of synchronization messages on large number of hops. We evaluate both methods with Blinky Block robots: using a real modular robots system and simulation. The results show that both methods LR+ and ARS present a significant error reduction compared to least-square linear regression used in previous state of the art synchronization protocol for modular robots with neighbor-to-neighbor communication.

关键词： time synchronization modular robots distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Byzantine Agreement and Leader Election: From Classical to the Modern 21

Byzantine Agreement and Leader Election: From Classical to t...

引用

40th ACM SIGACT-SIGOPS Symposium on Principles of distributed Computing (PODC)

作者： Augustine, John Molla, Anisur Rahaman Pandurangan, Gopal IIT Madras Dept Comp Sci & Engn Chennai Tamil Nadu India Indian Stat Inst Kolkata Crypto & Secur Res Unit Kolkata W Bengal India Univ Houston Dept Comp Sci Houston TX 77204 USA

ISBN: (纸本)9781450385480

We will present the fundamentals of Byzantine agreement and leader election problems from a modern perspective. Byzantine fault tolerant protocols are at the heart of secure and robust protocols that can tolerate the presence of malicious nodes in a distributed system, such as a Peer-to-Peer (P2P) network, which allows a large number of peers to enter the network with little or no admission control. Such malicious peers acting alone or in collaboration can cause disruption of service in P2P systems. Our tutorial is largely inspired by recent P2P applications like Blockchain and cryptocurrencies that espouse permissionless settings whereby peers can anonymously and dynamically join and leave the network at will. Our presentation will be in three parts. In the first part, we will present the historic foundations of Byzantine agreement and leader election and describe the fundamentals that underlie our modern understanding of these problems. Much of the classical results focus on complete networks where nodes have global knowledge. In the second part, motivated by real-world distributed networks such as P2P networks which are typically sparse and bounded degree with nodes having only local knowledge, we focus on Byzantine protocols for sparse networks. While the first two parts will focus on static settings, motivated by modern applications such as blockchains and cryptocurrencies which operate on dynamic P2P networks, the third part will delve into Byzantine procotols for dynamic networks where nodes continuously join and leave the system. The tutorial will cover various tools and techniques that are useful in designing Byzantine protocols in sparse and dynamic networks and will discuss key open problems in the area.

关键词： Byzantine protocols leader election agreement consensus distributed algorithms blockchain sparse networks P2P networks dynamic networks

来源：评论

学校读者我要写书评

暂无评论

Continuous-time fully distributed generalized Nash equilibrium seeking for multi-integrator agents

引用

AUTOMATICA 2021年 129卷 109660-109660页

作者： Bianchi, Mattia Grammatico, Sergio Delft Univ Technol Delft Ctr Syst & Control Delft Netherlands

We consider strongly monotone games with convex separable coupling constraints, played by dynamical agents, in a partial-decision information scenario. We start by designing continuous-time fully distributed feedback controllers, based on consensus and primal-dual gradient dynamics, to seek a generalized Nash equilibrium in networks of single-integrator agents. Our first solution adopts a fixed gain, whose choice requires the knowledge of some global parameters of the game. To relax this requirement, we conceive a controller that can be tuned in a completely decentralized fashion, thanks to the use of uncoordinated integral adaptive weights. We further introduce algorithms specifically devised for generalized aggregative games. Finally, we adapt all our control schemes to deal with heterogeneous multi-integrator agents and, in turn, with nonlinear feedback-linearizable dynamical systems. For all the proposed dynamics, we show convergence to a variational equilibrium, by leveraging monotonicity properties and stability theory for projected dynamical systems. (C) 2021 The Author(s). Published by Elsevier Ltd.

关键词： Nash equilibrium seeking distributed algorithms Multi-agent systems Primal-dual dynamics Adaptive consensus

来源：评论

学校读者我要写书评

暂无评论

Byzantine Dispersion on Graphs 35

Byzantine Dispersion on Graphs

引用

35th IEEE International Parallel and distributed Processing Symposium (IPDPS)

作者： Molla, Anisur Rahaman Mondal, Kaushik Moses, William K., Jr. Indian Stat Inst Comp & Commun Sci Kolkata India Indian Inst Technol Ropar Dept Math Ropar India Univ Houston Dept Comp Sci Houston TX 77204 USA

ISBN: (纸本)9781665440660

This paper considers the problem of Byzantine dispersion and extends previous work along several parameters. The problem of Byzantine dispersion asks: given n robots, up to f of which are Byzantine, initially placed arbitrarily on an n node anonymous graph, design a terminating algorithm to be run by the robots such that they eventually reach a configuration where each node has at most one non-Byzantine robot on it. Previous work solved this problem for rings and tolerated up to n - 1 Byzantine robots. In this paper, we investigate the problem on more general graphs. We first develop an algorithm that tolerates up to n - 1 Byzantine robots and works for a more general class of graphs. We then develop an algorithm that works for any graph but tolerates a lesser number of Byzantine robots. We subsequently turn our focus to the strength of the Byzantine robots. Previous work considers only "weak" Byzantine robots that cannot fake their IDs. We develop an algorithm that solves the problem when Byzantine robots are not weak and can fake IDs. Finally, we study the situation where the number of the robots is not n but some k. We show that in such a scenario, the number of Byzantine robots that can be tolerated is severely restricted. Specifically, we show that it is impossible to deterministically solve Byzantine dispersion when inverted right perpendiculark/ninverted left perpendicular > inverted right perpendicular( k - f)/ninverted left perpendicular.

关键词： Dispersion Mobile robots distributed algorithms Byzantine faults Faulty robots General graphs

来源：评论

学校读者我要写书评

暂无评论

Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs 21

Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs

引用

40th ACM SIGACT-SIGOPS Symposium on Principles of distributed Computing (PODC)

作者： Bodwin, Greg Parter, Merav Univ Michigan EECS Ann Arbor MI 48109 USA Weizmann Inst Sci Rehovot Israel

ISBN: (纸本)9781450385480

The restoration lemma by Afek, Bremler-Barr, Kaplan, Cohen, and Merritt [Dist. Comp. '02] proves that, in an undirected unweighted graph, any replacement shortest path avoiding a failing edge can be expressed as the concatenation of two original shortest paths. However, the lemma is tiebreaking-sensitive: if one selects a particular canonical shortest path for each node pair, it is no longer guaranteed that one can build replacement paths by concatenating two selected shortest paths. They left as an open problem whether a method of shortest path tiebreaking with this desirable property is generally possible. We settle this question affirmatively with the first general construction of restorable tiebreaking schemes. We then show applications to various problems in fault-tolerant network design. These include a faster algorithm for subset replacement paths, more efficient fault-tolerant (exact) distance labeling schemes, fault-tolerant subset distance preservers and +4 additive spanners with improved sparsity, and fast distributed algorithms that construct these objects. For example, an almost immediate corollary of our restorable tiebreaking scheme is the first nontrivial distributed construction of sparse fault-tolerant distance preservers resilient to three faults.

关键词： shortest path tiebreaking fault tolerance spanners labeling schemes replacement paths distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

An Intelligent Multi-Speed Advisory System using Improved Whale Optimisation Algorithm 93

An Intelligent Multi-Speed Advisory System using Improved Wh...

引用

IEEE 93rd Vehicular Technology Conference (VTC-Spring)

作者： Chen, Beiran Liu, Mingming Zhang, Yi Chent, Zhengyong Gu, Yingqi O'Connor, Noel E. Trinity Coll Dublin CONNECT Ctr Dublin Ireland Dublin City Univ Insight Ctr Data Analyt Sch Elect Engn Dublin Ireland Huawei Technol Ireland Dublin Ireland

ISBN: (纸本)9781728189642

An intelligent speed advisory system can be used to recommend speed for vehicles travelling in a given road network in cities. In this paper, we extend our previous work where a distributed speed advisory system has been devised to recommend an optimal consensus speed for a fleet of Internal Combustion Engine Vehicles (ICEVs) in a highway scenario. In particular, we propose a novel optimisation framework where the exact format of each vehicle's cost function can be implicit, and our algorithm can be used to recommend multiple consensus speeds for vehicles travelling on different lanes in an urban highway scenario. Our studies show that the proposed scheme based on an improved whale optimisation algorithm can effectively reduce CO2 emission generated from ICEVs while providing different recommended speed options for groups of vehicles.

关键词： Speed advisory systems distributed algorithms Whale Optimisation

来源：评论

学校读者我要写书评

暂无评论

Privacy-Preserving Collaborative SDR Networks for Anomaly Detection

Privacy-Preserving Collaborative SDR Networks for Anomaly De...

引用

IEEE International Conference on Communications (ICC)

作者： Katzef, Marc Cullen, Andrew C. Alpcan, Tansu Leckie, Christopher Kopacz, Justin Univ Melbourne Dept Elect & Elect Engn Melbourne Vic Australia Univ Melbourne Sch Comp & Informat Syst Melbourne Vic Australia Northrop Grumman Corp Falls Church VA USA

ISBN: (纸本)9781728171227

By offering unprecedented flexibility for wireless communications, Software-Defined Radio (SDR) is an enabling technology for distributed platforms such as Internet-of-Things (IoT) and cognitive radio. We propose a network of SDR devices with sensing and computation capabilities without relying on a centralized architecture to monitor and develop a detailed representation of network behavior in the radio frequency spectrum. This network representation provides a foundation for the task of anomaly detection for security purposes, in which SDRs collect the data needed to identify adversarial actors in a selected environment. We present and evaluate a novel distributed anomaly detection scheme for SDRs that applies Round Robin Learning (RRL) and Random Exchange Learning (REL) strategies to a type of machine learning model known as an autoencoder. In doing so, participating devices fill in gaps in a single model's data representation, in order to build a model closer to that achieved through centralized training, while maintaining the advantages of distributed systems. The distributed architecture developed improves network robustness, decreases the amount of intranetwork communication, and preserves privacy of individual SDR subnetworks. Furthermore, it was found to consistently raise the average anomaly detection performance for groups of participating devices without exchanging any training data.

关键词： software-defined radio anomaly detection machine learning distributed algorithms privacy-preserving methods

来源：评论

学校读者我要写书评

暂无评论

The CODYSUN Approach: A Novel distributed Paradigm for Dynamic Spectrum Sharing in Satellite Communications

引用

SENSORS 2021年第23期21卷 8052-8052页

作者： Jabandzic, Irfan Firyaguna, Fadhil Giannoulis, Spilios Shahid, Adnan Mukhopadhyay, Atri Ruffini, Marco Moerman, Ingrid Univ Ghent IMEC Dept Informat Technol IDLab B-9052 Ghent Belgium Trinity Coll Dublin CONNECT Ctr Dublin 2 Ireland

With a constant increase in the number of deployed satellites, it is expected that the current fixed spectrum allocation in satellite communications (SATCOM) will migrate towards more dynamic and flexible spectrum sharing rules. This migration is accelerated due to the introduction of new terrestrial services in bands used by satellite services. Therefore, it is important to design dynamic spectrum sharing (DSS) solutions that can maximize spectrum utilization and support coexistence between a high number of satellite and terrestrial networks operating in the same spectrum bands. Several DSS solutions for SATCOM exist, however, they are mainly centralized solutions and might lead to scalability issues with increasing satellite density. This paper describes two distributed DSS techniques for efficient spectrum sharing across multiple satellite systems (geostationary and non-geostationary satellites with earth stations in motion) and terrestrial networks, with a focus on increasing spectrum utilization and minimizing the impact of interference between satellite and terrestrial segments. Two relevant SATCOM use cases have been selected for dynamic spectrum sharing: the opportunistic sharing of satellite and terrestrial systems in (i) downlink Ka-band and (ii) uplink Ka-band. For the two selected use cases, the performance of proposed DSS techniques has been analyzed and compared to static spectrum allocation. Notable performance gains have been obtained.

关键词： satellite communications dynamic spectrum sharing spectrum coexistence distributed algorithms ns-3

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：