1 / 20

Modeling message diffusion in epidemical DTN

Modeling message diffusion in epidemical DTN. 出處: Claudio Sa de Abreu, Ronaldo Moreira Salles 指導教授:林志浩 博士 研究生:魏子恆. Outline. Introduction Related work and historical review The Epidemical DTN Basic Model Some important epidemical DTN model characteristics Validation with simulation

opa
Download Presentation

Modeling message diffusion in epidemical DTN

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Modeling message diffusion in epidemical DTN 出處:Claudio Sa de Abreu, Ronaldo Moreira Salles 指導教授:林志浩 博士 研究生:魏子恆

  2. Outline Introduction Related work and historical review The Epidemical DTN Basic Model Some important epidemical DTN model characteristics Validation with simulation Dealing with model deviations Summary of the main DTN model results Conclusion and future work

  3. Introduction Mobile Phone to Mobile Phone networks, where wireless channel impairments and mobility cause disconnections and message delays. Car networks (VANETS), where there is no continuous network service along all paths and places. Disaster and war zones, where communication infrastructure is partially or completely destroyed. Sensor Networks, where some devices are not always reachable to the sensor network coverage. Communication in remote zones with no fixed infrastructure. Interplanetary communications, where the line of sight communication between stations is difficult and delays are huge.

  4. Introduction It does not require any previous knowledge of network topology. There is no restriction on the capacity of the propagating nodes. It is not necessary to consider paths or history of contacts.

  5. Introduction

  6. Introduction The employment and validation of a mathematical model for epidemical DTNs based on an epidemical model for the spread of infectious diseases (for the average case).

  7. Related work and historical review In 1906, Hamer [10] postulated that the evolution of an epidemical disease depends on the contact rate between infected and susceptible individuals. 1908 Sir Ronald Ross, who discovered the vector of malaria transmission, generalized the model for continuous time in his work about malaria dynamics. In 1927 and 1932, Kermack and McKendrick in [5,6] improved the continuous model created by Sir Ronald Ross with the threshold principle, establishing that the introduction of infected individuals in a community may not cause an epidemic, unless the density of susceptible individuals is above a certain critical value. In 2000, Vahdat and Becker [2] developed techniques to deliver messages in partially connected networks, like MANETs. Such work employed epidemical routing.

  8. The Epidemical DTN Basic Model

  9. The Epidemical DTN Basic Model

  10. The Epidemical DTN Basic Model

  11. Some important epidemical DTN model characteristics

  12. Some important epidemical DTN model characteristics

  13. Some important epidemical DTN model characteristics

  14. Validation with simulation

  15. Validation with simulation

  16. Validation with simulation

  17. Dealing with model deviations

  18. Dealing with model deviations

  19. Dealing with model deviations

  20. Summary of the main DTN model results The number of nodes N is constant during message propagation, and is big enough for a good approximation with the differentiable model equations. When a contact occurs between a node in P and a node in D, the message transferring probability is 1. When a message is received, the node is immediately able to transfer it to all reachable available nodes during message lifetime. A node makes only one message forwarding at each time. A node makes an average of bN contacts per unit time, where b is the contact rate of the network. No nodes becomes unavailable (r=0). The transmission range (coverage) of each node is much smaller than the scenario area.

More Related