Broadcast delay of epidemic routing in intermittently connected networks

Jacquet, Philippe; Mans, Bernard; Rodolakis, Georgios

doi:10.1109/isit.2009.5205611

Cited by 4 publications

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

A Reaction-Diffusion Model for Epidemic Routing in Sparsely Connected MANETs

Klein

Hespanha

Madhow

2010

2010 Proceedings IEEE INFOCOM

View full text Add to dashboard Cite

Abstract-We propose and investigate a deterministic traveling wave model for the progress of epidemic routing in disconnected mobile ad hoc networks. In epidemic routing, broadcast or unicast is achieved by exploiting mobility: message-carrying nodes "infect" non message-carrying nodes when they come within communication range of them. Early probabilistic analyses of epidemic routing follow a "well-mixed" model which ignores the spatial distribution of the infected nodes, and hence do not provide good performance estimates unless the node density is very low. More recent work has pointed out that the infection exhibits wave-like characteristics, but does not provide a detailed model of the wave propagation. In this paper, we model message propagation using a reaction-diffusion partial differential equation that has a traveling wave solution, and show that the performance predictions made by the model closely match simulations in regimes where the well-mixed model breaks down. In particular, we show that well-mixed models are generally overly optimistic in regard to the scaling of the message delivery delay with problem parameters such as communication range, node density, and total area. In contrast to prior work, our model provides insight into the spatial distribution of the "infection," and reveals that the performance is sensitive to the geometry of the deployment region, not just its area. I. INTRODUCTIONWe consider the problem of message dissemination in disconnected mobile ad hoc networks (MANETs). Such delaytolerant networks arise naturally in many contexts, including battlefield communication networks, animal tag based sensor networks [1], [2], and emergency response networks. In this setting, a given source node may be unable to reach its intended destination using multiple hops of communication for the current network topology. Instead, knowledge of the message spreads like an infection through the nodes as they employ short-range broadcast opportunistically; hence the commonly used term epidemic routing. Eventual delivery of the message is guaranteed for typical mobility models, so the main focus is on understanding how performance metrics such as end-to-end delay and memory requirements scale as a function of parameters such as the number of nodes, the communication range, the mobility model, and the geometry of the region over which the network is deployed. To this end, we derive a partial differential equation (PDE) model for the dissemination of information via epidemic routing.Early analyses of epidemic routing employ a mathematical simplification that applies for exceedingly sparse deployments

show abstract