Broadcast delay of epidemic routing in intermittently connected networks

We analyze the performance of epidemic routing in large-scale intermittently connected networks, under a random geometric graph model and for different mobility parameters (such as the random-waypoint, random walk and Brownian motion models). We derive a generic scaling law on the delay, which provides us with lower bounds: the average delay from a source to a destination and the average broadcast delay are both ¿ ((R_N¿n)/v_n), where n is the number of nodes in the network, v_n the maximum node speed, and R_n the radio range.