Gossip-based algorithms were first introduced for reliably disseminating data in large-scale
distributed systems. However, their simplicity, robustness, and flexibility make them attractive …

In this paper, we address the problem of estimating the maximal value over a sensor
network using wireless links between them. We introduce two heuristic algorithms and …

The rapid progress in the research and development of electronics, sensing, signal
processing, and communication networks has significantly advanced the state of …

Processing the gathered information efficiently is a key functionality for wireless sensor
networks. In this paper, we study the time complexity, message complexity (number of …

This paper studies the problem of distributed computation over a network of wireless
sensors. While this problem applies to many emerging applications, to keep our discussion …

Numerous blockchain systems with various consensus protocols have emerged to achieve
high transaction rates (2 10K tps). However, their underlying P2P network primitives …

Today, a majority of data is fundamentally distributed in nature. Data for almost any task is
collected over a broad area, and streams in at a much greater rate than ever before. In …

Gathering data from nodes in a network is at the heart of many distributed applications, most
notably while performing a global task. We consider information spreading among n nodes …

To explore the benefit of advertising instant and location-aware commercials that can not be
effectively promoted by traditional medium like TV program and Internet, we propose in this …

This paper gives drastically faster gossip algorithms to compute exact and approximate
quantiles. Gossip algorithms, which allow each node to contact a uniformly random other …