Research Article
The Actual Maximum Throughput of Mobile Ad Hoc Networks with Reed-Solomon Coding
Figure 2
Two absorbing Markov chains. For each state, the transition back to itself is not plotted for simplicity.
| (a) Absorbing Markov chain for the fastest packet sending process at source |
| (b) Absorbing Markov chain for the fastest packet receiving process at destination |