Efficient and reliable propagation of blocks is vital to the scalability of the Bitcoin network. As
a result, several schemes, such as the compact block protocol (BIP 152), have been …

This paper investigates distributed Dominating Set (DS) and Connected Dominating Set
(CDS) construction in dynamic wireless networks under the SINR interference model …

We establish and generalise several bounds for various random walk quantities including
the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are …

We initiate the study of network monitoring algorithms in a class of hybrid networks in which
the nodes are connected by an external network and an internal network (as a short form for …

Broadcast is a ubiquitous distributed computing problem that underpins many other system
tasks. In static, connected networks, it was recently shown that broadcast is solvable without …

In this paper, which is a culmination of our previous research efforts, we provide a general
framework for studying mixing profiles of non-backtracking random walks on dynamic …

This paper introduces the concept of metaphorical structure as a way of conciliating user
interface development by demonstration and by generation so that advantages of both …

A random walk is a basic stochastic process on graphs and a key primitive in the design of
distributed algorithms. One of the most important features of random walks is that, under mild …

Byzantine agreement is a fundamental problem in fault-tolerant distributed networks that has
been studied intensively for the last four decades. Most of these works designed protocols …

Dynamic behavior is an essential part of wireless networking, due mobility, environmental
changes or failures. We analyze a natural exponential backoff procedure to manage …