The outer Lowner-John method is widely used in sensor fusion applications to find the smallest ellipsoid that can approximate the intersection of a set of ellipsoids, described by positive definite covariance matrices...
详细信息
The outer Lowner-John method is widely used in sensor fusion applications to find the smallest ellipsoid that can approximate the intersection of a set of ellipsoids, described by positive definite covariance matrices modeling the quality of each sensor. We propose a distributed algorithm to solve this problem when these matrices are defined over the network's nodes. This is of particular significance as it is the first decentralized algorithm capable of computing the covariance intersection ellipsoid by combining information from the entire network using only local interactions. The solution is based on a reformulation of the centralized problem, leading to a local protocol based on exact dynamic consensus tools. After reaching consensus, the protocol converges to an outer Lowner-John ellipsoid in finite time, and to the global optimum asymptotically. Formal convergence analysis and numerical experiments are provided to validate the proposal's advantages.
A Maximal Independent Set (MIS) is an inclusion maximal set of pairwise non-adjacent vertices. The computation of an MIS is one of the core problems in distributed computing. In this article, we introduce and analyze ...
详细信息
A Maximal Independent Set (MIS) is an inclusion maximal set of pairwise non-adjacent vertices. The computation of an MIS is one of the core problems in distributed computing. In this article, we introduce and analyze a finite-state distributed randomized algorithm for computing a Maximal Independent Set (MIS) on arbitrary undirected graphs. Our algorithm is self-stabilizing (reaches a correct output on any initial configuration) and can be implemented on systems with very scarce conditions. We analyze the convergence time of the proposed algorithm, showing that in many cases the algorithm converges in logarithmic time with high probability.
The research on multi-UAV formation in maritime, terrestrial, and aerial environments holds significant importance across various domains. This paper focuses on investigating a distributed formation algorithm for quad...
详细信息
The research on multi-UAV formation in maritime, terrestrial, and aerial environments holds significant importance across various domains. This paper focuses on investigating a distributed formation algorithm for quadrotor UAVs based on game theory. Despite the influence of communication variations in complex environments, the formation can still be achieved under specific conditions without directly disclosing sensitive information such as location and speed, the privacy of each UAV is ensured by preventing data leakage during communication.
Microgrids have been attracted increasingly attention due to renewable energy integration. Multiple microgrids are often interconnected for benefiting each other. A significant challenge in operating such power system...
详细信息
Microgrids have been attracted increasingly attention due to renewable energy integration. Multiple microgrids are often interconnected for benefiting each other. A significant challenge in operating such power systems lies in the uncertainties including intermittence in renewable energy sources and load demands estimation. Sharing state variables in interconnected systems poses additional difficulties. This paper proposes a numerical solution approach to a chance constrained distributed optimisation for interconnected power systems under uncertainty. The inner-outer approximation approach is used for the solution and ALADIN for numerical implementation. An interconnected optimal power flow problem with a three-bus and a four-bus system is solved as a case study. Copyright (C) 2024 The Authors. This is an open access article under the CC BY-NC-ND license (https://***/licenses/by-nc-nd/4.0/)
A key feature for most collaborative applications is their ability to distinguish access rights to shared documents in a dynamic group of collaborators. To achieve high availability and avoid single points of failure,...
详细信息
ISBN:
(纸本)9798350381993;9798350382006
A key feature for most collaborative applications is their ability to distinguish access rights to shared documents in a dynamic group of collaborators. To achieve high availability and avoid single points of failure, systems can replicate this access control policy across sites. Increasingly, Conflict-free Replicated Data Types (CRDTs) are used to this end. They embed conflict resolution strategies that take into account concurrent modifications to the policy but also to the document that it manages. However, few systems in the literature support multiple administrators, and those which do fall short of considering distributed applications where no node or group of nodes is central to its operation. To allow multiple concurrent edits of the policy in massively collaborative settings with no central server, we devise a specialized causal model that minimizes concurrency. Crucially our model allows to correct the document state in case operations have become unauthorized following a policy change. We apply our model to a CRDT replicating an access control policy with read and write rights on a collaborative document and admin rights on the policy. We end by studying flexible conflict resolution strategies, providing our underlying algorithms.
Wireless sensor networks are vulnerable to various potential threats in numerous real-world applications. As recently identified by the scientific community, some faults can cause intensive damage to a system or even ...
详细信息
ISBN:
(纸本)9783031702846;9783031702853
Wireless sensor networks are vulnerable to various potential threats in numerous real-world applications. As recently identified by the scientific community, some faults can cause intensive damage to a system or even prevent the whole system from functioning properly. Therefore, the resilience of wireless sensor networks is an aspect that has gained importance over the last years. In this paper, we consider the scenario where the sensor-measured values are aggregated in highly defective wireless sensor networks using the distributed flooding algorithm operating in either the synchronous or asynchronous mode. More specifically, we assume that the communication among the nodes is affected by random link failures causing a complete loss of transmitted data. Our goal in this paper is to verify the applicability of the mentioned algorithm in both the synchronous and asynchronous mode, analyze how its precision is worsened, examine how the algorithm rate is affected, and identify which mode results in higher performance. The algorithm is tested in numerous randomly generated graphs (created by applying the Gilbert model) with various parameters and affected by link failures of different probabilities of occurrence. Also, the experimentally obtained results are compared to the performance of the algorithm in error-free scenarios.
Sparse matrix dense matrix multiplication (SpMM) is commonly used in applications ranging from scientific computing to graph neural networks. Typically, when SpMM is executed in a distributed platform, communication c...
详细信息
ISBN:
(纸本)9798400703850
Sparse matrix dense matrix multiplication (SpMM) is commonly used in applications ranging from scientific computing to graph neural networks. Typically, when SpMM is executed in a distributed platform, communication costs dominate. Such costs depend on how communication is scheduled. If it is scheduled in a sparsity-unaware manner, such as with collectives, execution is often inefficient due to unnecessary data transfers. On the other hand, if communication is scheduled in a fine-grained sparsity-aware manner, communicating only the necessary data, execution can also be inefficient due to high software overhead. We observe that individual sparse matrices often contain regions that are denser and regions that are sparser. Based on this observation, we develop a model that partitions communication into sparsity-unaware and sparsity-aware components. Leveraging the partition, we develop a new algorithm that performs collective communication for the denser regions, and fine-grained, one-sided communication for the sparser regions. We call the algorithm Two-Face. We show that Two-Face attains an average speedup of 2.11x over prior work when evaluated on a 4096-core supercomputer. Additionally, Two-Face scales well with the machine size.
This paper describes the adaptation to a distributed computational setting of a well-scaling parallel algorithm for computing Morse-Smale segmentations based on path compression. Additionally, we extend the algorithm ...
详细信息
ISBN:
(纸本)9798331516932;9798331516925
This paper describes the adaptation to a distributed computational setting of a well-scaling parallel algorithm for computing Morse-Smale segmentations based on path compression. Additionally, we extend the algorithm to efficiently compute connected components in distributed structured and unstructured grids, based either on the connectivity of the underlying mesh or a feature mask. Our implementation is seamlessly integrated with the distributed extension of the Topology ToolKit (TTK), ensuring robust performance and scalability. To demonstrate the practicality and efficiency of our algorithms, we conducted a series of scaling experiments on large-scale datasets, with sizes of up to 40963 vertices on up to 64 nodes and 768 cores.
For the shortest link scheduling (SLS), i.e., scheduling a given set of links with minimum time slots, we consider the distributed algorithm design by using the locality of the protocol model with high fidelity under ...
详细信息
For the shortest link scheduling (SLS), i.e., scheduling a given set of links with minimum time slots, we consider the distributed algorithm design by using the locality of the protocol model with high fidelity under the Rayleigh fading. Different from most previous works, focusing on distributed algorithm design under the deterministic SINR model, which ignores the fading effects in signal propagation, we first show that a successful link of protocol model is also feasible under the deterministic SINR model, then it can be scheduled successfully with high probability under the Rayleigh fading, by upper-bounding interference outside interference range of protocol model. Then on the basis of this key conclusion, we design LLS-SLS algorithm to solve SLS within . Specifically, is the number of a sender & x2019;s neighbors within some certain range, and can be upper-bounded. Next, based on the concept of random contention, we design CLLS algorithm to schedule all links after costing time slots. In addition, extensive simulations evaluate the performance of two proposed algorithms.
This paper focuses on distributed online composite optimization with feedback delays. Using the delayed feedback and signs of relative states, a distributed online proximal gradient algorithm is proposed and then the ...
详细信息
ISBN:
(纸本)9798331540845;9789887581598
This paper focuses on distributed online composite optimization with feedback delays. Using the delayed feedback and signs of relative states, a distributed online proximal gradient algorithm is proposed and then the performance of this algorithm is evaluated by dynamic regret. Under basic assumptions, a bound on dynamic regret for each agent is established, which is consistent with the existing result in the setting without regularizers. In the end, numerical examples are presented to support the theoretical finding.
暂无评论