Throughput and backlogtime in S-ALOHA multi-hop networks

The author analyzes a model of an S-ALOHA multihop network with randomly distributed mobile stations. The one-hop throughput is computed assuming different transmission probabilities for new and retransmitted packets. The impact of the retransmission probability on throughput is shown to be comparable for fully-meshed and multihop networks. The mean backlog-time of a packet, i.e., the mean number of slots between its first transmission attempt and the successful transmission, is evaluated, assuming that the local network topology remains fixed from a station's first transmission attempt until its final success. It is demonstrated that multihop networks have better stability properties than fully-meshed networks because the number of users which might interfere with each other is smaller.<
>