Performance of Opportunistic Epidemic Routing on Edge-Markovian Dynamic Graphs

Details Performance of Opportunistic Epidemic Routing on Edge-Markovian Dynamic Graphs Performance of Opportunistic Epidemic Routing on Edge-Markovian Dynamic Graphs

2009-09-11

arxiv.org/abs/0909.2119v3

Computer Science

Networking and Internet Architecture

5 pages, 4 figures. Accepted for publication in IEEE Transactions on Communications

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Performance of Opportunistic Epidemic Routing on Edge-Markovian Dynamic Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Performance of Opportunistic Epidemic Routing on Edge-Markovian Dynamic Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Performance of Opportunistic Epidemic Routing on Edge-Markovian Dynamic Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-427989