Abstract

Abstract-The channel throughput for a finite number of packet paper, we give an exact throughput analysis in the case of a broadcasting users is analyzed for random access protocols, including finite population for all of the above-listed protocols. Arthurs slotted persistent carrier sense multiple access (CSMA) with and without and Stuck [ 1] also provide an analysis of throughput for slotted collision detection and unslotted persistent CSMA with and without and unslotted persistent CSMA with collision detection based on collision detection. We consider both p- and 1-persistent CSMA. Our models different from ours. (A difference between our model results can be extended to infinite population cases (by taking the proper and theirs involves the way in which one disposes of a packet, limit), where they agree with available. the known throughput expressions when the transmission of which is suppressed as a result of packets sensing a busy channel. In our model, similar to [6], they are dismissed from the system at the beginning of the next trans-I.

Citations