A Strict Hierarchy of Dynamic Graphs for Shortest, Fastest, and Foremost Broadcast

The notion of highly dynamic networks encompasses many real-world contexts. The need to categorize and understand them led the engineering community to design a variety of mobility models, based on which experiments can be reproduced and solutions fairly compared. The theoretical analogues of mobility models are the logical properties of the network dynamics that allow the taxonomy of various of classes of dynamic graphs. In this paper, the authors study the relationship between three classes of (highly) dynamic networks by means of studying the feasibility of several variants of the broadcast, namely shortest, fastest, and foremost broadcast.

Provided by: University of Otago Topic: Software Date Added: Oct 2012 Format: PDF

Download Now

Find By Topic