MANET driven by mobility models
TOC
1. SIR epidemic routing2. Communication model
3. Animation
1. SIR epidemic routing
Consider a basic stochastic SIR epidemic routing algorithm, where a piece of information starts to broadcast from a source node.
By analogy to the way a disease spreads in a human network, a node in the MANET can be in any of three states S, I, R: A node that has never received the information from the source is in the state of susceptible (S), in which the node can accept incoming transmissions if such opportunity arises. A susceptible node goes into the state of infected and infectious (I) immediately after it has received a copy of the information. The node in state I keeps transmitting the information, i.e. remain infectious, for a certain time period, after which the node enters into the state of recovered and immune (R). A node in state R stops transmitting the information to other nodes and will ignore all future transmissions of the same information from other nodes.
2. Communication model
Two nodes are dircetly connected if their Euclidean distance is smaller than or equal to the radio range r0.
3. Animation
| 1. The information propagation in a MANET driven by Random Direction Model | |||
Legend |
|||
| If the above video does not play, download it here. | |||
| 2. The information propagation in a MANET driven by Random Walk Model with four infrastructure nodes | |||
|
|||
| If the above video does not play, download it here. | |||
