| Average
Throughput Performance |
| Average throughput of
code-based scheduling protocols based on OAs |
|
|
|
| Slotted Aloha
also a time-slotted MAC protocol, no minimum guarantees. |
||
| If we assume
knowledge of max. number of neighbors, find transmission |
||
| probability per node to
maximize average throughput: |
||
| probability of
successful transmission: |
| optimum value of p |
| After substition: |
