Performance of Opportunistic Epidemic Routing on Edge-Markovian Dynamic Graphs
arXiv:0909.2119 · doi:10.1109/TCOMM.2011.020811.090163
Abstract
Connectivity patterns in intermittently-connected mobile networks (ICMN) can be modeled as edge-Markovian dynamic graphs. We propose a new model for epidemic propagation on such graphs and calculate a closed-form expression that links the best achievable delivery ratio to common ICMN parameters such as message size, maximum tolerated delay, and link lifetime. These theoretical results are compared to those obtained by replaying a real-life contact trace.
5 pages, 4 figures. Accepted for publication in IEEE Transactions on Communications
Cited by in corpus (6)
- Simulating Opportunistic Networks: Survey and Future Directions
- Stability of Spreading Processes over Time-Varying Large-Scale Networks
- Dynamic Hidden-Variable Network Models
- Distributed Community Detection in Dynamic Graphs
- Performance Modeling of Epidemic Routing in Mobile Social Networks with Emphasis on Scalability
- Not Always Sparse: Flooding Time in Partially Connected Mobile Ad Hoc Networks