Having access to an accurate time is a vital building block in all networks; in wireless sensor
networks even more so, because wireless media access or data fusion may depend on it …

We study the distributed maximal independent set (henceforth, MIS) problem on sparse
graphs. Currently, there are known algorithms with a sublogarithmic running time for this …

Much work has focused on the Byzantine Generals (or secure broadcast) problem in the
standard model in which pairwise communication is available between all parties in the …

In this paper we consider the problem of designing a medium access control (MAC) protocol
for single-hop wireless networks that is provably robust against adaptive adversarial …

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 study of a broadcast in the t-locally bounded model in arbitrary graphs assuming
Byzantine graphs were discussed. It was assumed that the nodes knew which node was the …

We consider distributed broadcasting in radio networks, modeled as undirected graphs,
whose nodes have no information on the topology of the network, nor even on their …

Broadcasting is a basic network communication task, where a message initially held by a
source node has to be disseminated to all other nodes in the network. Fast algorithms for …

A selection problem is among the basic communication primitives in networks. In this
problem at most k participating stations have to broadcast successfully their messages. This …