In this work we address the question whether a simple shared channel could be efficiently
utilized, that is, with a constant throughput and linear packet latency. A shared channel (also …

The beep model is a very weak communications model in which devices in a network can
communicate only via beeps and silence. As a result of its weak assumptions, it has broad …

We study the effect of noise on the n-party beeping model. In this model, in every round,
each party may decide to either'beep'or not. All parties hear a beep if and only if at least one …

We consider threshold group testing–a generalization of a well known and thoroughly
examined problem of combinatorial group testing. In the classical setting, the goal is to …

Multiple access channel is a well-known communication model that deploys properties of
many network systems, such as Aloha multi-access systems, local area Ethernet networks …

Execution of a protocol in a wireless sensor network may reveal some information about its
size. For example, the time required to elect a leader or establish size approximation using …

A shared channel, also called a multiple access channel, is among the most popular and
widely studied models of communication in distributed computing. An unknown number of …

Multiple access channel is a well-known communication model that deploys properties of
many network systems, such as Aloha multi-access systems, local area Ethernet networks …

Beeping networks consist of exceedingly simple computational devices whose
communication is based on beeps and silence. In this work, we introduce noisy beeping …

Constructing a shortest path between two network nodes is a fundamental task in distributed
computing. This work develops schemes for the construction of shortest paths in randomized …