Abstract Information flow in a telecommunication network is accomplished through the
interaction of mechanisms at various design layers with the end goal of supporting the …

An ad hoc wireless network, or simply an ad hoc network, consists of a collection of
geographically distributed nodes that communicate with one other over a wireless medium …

In this paper, we propose a novel general technique, based on renewal theory, for analyzing
mobility models in ad hoc networks. Our technique enables an accurate derivation of the …

We study how to spread k tokens of information to every node on an n-node dynamic
network, the edges of which are changing at each round. This basic gossip problem can be …

Motivated by the need for robust and fast distributed computation in highly dynamic Peer-to-
Peer (P2P) networks, we study algorithms for the fundamental distributed agreement …

We survey some results for scheduling data in wireless data systems such as lxEV-DO. An
important feature of such systems is that the channel rates between the basestation and the …

In this paper we will present various models and techniques for communication in dynamic
networks. Dynamic networks are networks of dynamically changing bandwidth or topology …

The application of simple random walks on graphs is a powerful tool that is useful in many
algorithmic settings such as network exploration, sampling, information spreading, and …

We study robust and efficient distributed algorithms for searching, storing, and maintaining
data in dynamic Peer-to-Peer (P2P) networks. P2P networks are highly dynamic networks …

We investigate the problem of path selection in radio networks for a given set of sites in two-
dimensional space. For some given static point-to-point communication demand we define …