Flooding time in sparsely connected networks

Lorenzo MAGGI - Create-Net
Communication systems

Date: June 25th 2014
Location: Eurecom - Eurecom

We study mobile ad hoc wireless networks using the notion of evolving connectivity graphs. In particular, we are interested in studying the expected flooding time when full connectivity cannot be ensured at each point in time. Even in this case, due to finite contact times durations, connected components may appear in the connectivity graph. Hence, this represents the intermediate case between extreme cases of sparse and static ad hoc networks. By using a generalization of edge-Markovian graphs, we extend the existing models based on sparse scenarios to this intermediate case and calculate the expected flooding time, which is the time needed by one source to broadcast a message to all the other terminals. We also propose lower and upper bounds that have reduced computational complexity.


Permalink: https://www.eurecom/seminar/39892