This paper presents an application of Hierarchical Coloured Timed Petri Nets to the modelling and the performance evaluation of a distributed consensus algorithm. We took a top down modular approach to manage the complexity of the considered protocols. The termination time of the consensus algorithm is mainly set by the communications cost, i.e. by the timing characteristics of the communicatio...

In anticipation of the future GNSS constellations becoming operational, it will no longer be possible to assume that the probability of failure for more than one satellite within a certain timeframe is negligible. Further, it is questionable whether it is always reasonable to compute a position estimate based on all satellites in view, rather than selecting the “best” subset. The Range Consensu...

Much of the past work on asynchronous approximate Byzantine consensus has as-sumed scalar inputs at the nodes [4, 8]. Recent work has yielded approximate Byzantineconsensus algorithms for the case when the input at each node is a d-dimensional vector,and the nodes must reach consensus on a vector in the convex hull of the input vectorsat the fault-free nodes [9, 13]. The d-d...

Consensus problems arise in any area of computing where distributed processes must come to a joint decision. Although solutions to consensus problems have similar aims, they vary according to the processor faults and network properties that must be taken into account, and modifying these assumptions will lead to different algorithms. Reasoning about consensus protocols is subtle, and correctnes...

This paper describes the time analysis of Chandra & Toueg's asynchronous consensus, an algorithm of major importance in the eld of fault-tolerant distributed computing. Contrary to other consensus protocols assuming semi-synchronous or synchronous conditions, Chandra & Toueg's algorithm considers an asynchronous system, thus requiring no bounds on communication delays nor on processes' speeds. ...

This paper is motivated by the lack of distributed algorithm implementations on wireless sensor networks (WSN) in hardware. We deal exemplary with the implementation of the well-known average consensus algorithm. By formulating the algorithm into nesC, a C derivative, it is possible to enrich the knowledge of the algorithm with practical information, specific to embedded devices such as nodes. ...

Random sample consensus (RANSAC) is a successful algorithm in model fitting applications. It is vital to have strong exploration phase when there are an enormous amount of outliers within the dataset. Achieving a proper model is guaranteed by pure exploration strategy of RANSAC. However, finding the optimum result requires exploitation. GASAC is an evolutionary paradigm to add exploitation capa...

We propose a new algorithm for consensus clustering, FCAConsensus, based on Formal Concept Analysis. As the input, the algorithm takes T partitions of a certain set of objects obtained by k-means algorithm after T runs from different initialisations. The resulting consensus partition is extracted from an antichain of the concept lattice built on a formal context objects× classes, where the clas...

Approximate string matching (ASM) is a well-known computational problem with important applications in database searching, plagiarism detection, spelling correction, and bioinformatics. The two main issues with most ASM algorithms are (1) computational complexity, and (2) low specificity due to a large amount of false positives being reported. In this paper, a very efficient ASM method is propo...

A novel power consensus algorithm for DC microgrids is proposed and analyzed. DC microgrids are networks composed of DC sources, loads, and interconnecting lines. They are represented by differential-algebraic equations connected over an undirected weighted graph that models the electrical circuit. A second graph represents the communication network over which the source nodes exchange informat...