A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
We consider infrastructure-less highly dynamic networks, where connectivity does not necessarily hold, and the network may actually be disconnected at every time instant. These networks are naturally modeled as time-varying graphs. Clearly the task of designing protocols for these networks is less difficult if the environment allows waiting (i.e., it provides the nodes with store-carryforward-like mechanisms such as local buffering) than if waiting is not feasible. We provide a quantitativedoi:10.1145/2332432.2332452 dblp:conf/podc/CasteigtsFGSY12 fatcat:tojlzewgcvf5jhgl6z4xoy6pcq