Information dissemination in highly dynamic graphs

We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary so that a node may correctly flood or route a message in a network whose links may change arbitrarily at any given point, subject to the condition that the underlying graph is connected. We look at algorithmic constraints such as limited storage, no knowledge of an upper bound on the number of nodes, and no usage of identifiers. We look at flooding as well as routing to some existing specified destination and give algorithms. Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems General Terms Algorithms, Theory Keywords flooding, routing, mobile network, dynamic graphs

• Type: Conference
• Year: 2005
• Where: DIALM
• Authors: Regina O'Dell, Roger Wattenhofer
• Keywords: Algorithms, DIALM 2005, General Terms Algorithms, Minimal Requirements, Time Step