Over the last decade, the paradigm of Wireless Mesh Networks (WMNs) has matured to a
reasonably commonly understood one, and there has been extensive research on various …

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 wide range of applications for wireless ad hoc networks are time-critical and impose
stringent requirement on the communication latency. This paper studies the problem …

Numerous approaches study the vulnerability of networks against social contagion. Graph
burning studies how fast a contagion, modeled as a set of fires, spreads in a graph. The …

We present a randomized distributed algorithm that in radio networks with collision detection
broadcasts a single message in O (D+ log6 n) rounds, with high probability. This time …

We consider the problem of broadcasting in an unknown radio network modeled as a
directed graph G=(V,E), where |V|=n. In unknown networks, every node knows only its own …

We study the size of memory of mobile agents that permits to solve deterministically the
rendezvous problem, ie, the task of meeting at some node, for two identical agents moving …

We study the amount of knowledge about the network that is required in order to efficiently
solve a task concerning this network. The impact of available information on the efficiency of …

Broadcast is a fundamental operation in wireless networks and naive flooding is not
practical because it cannot deal with interference. Scheduling is a good way to avoid …

Abstract The Signal-to-Interference-and-Noise-Ratio (SINR) physical model is one of the
most popular models of wireless networks. Despite of the vast amount of study done in …