Abstract

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 Rn n both Ω, where n is the number of nodes in the network, vn vn the maximum node speed, and Rn the radio range.

Citations