Multiple Working Points in Multichannel ALOHA with Deadlines

Abstract. This paper addresses the problem of maximizing the capacity of multichannel slotted ALOHA networks subject to a userspecified deadline and a permissible probability of exceeding it. A previous paper proposed to transmit a non-decreasing number of copies of a message in successive rounds until success or deadline. This yielded a low probability of failure due to the large maximum number of copies per message, with only minimal "pollution" due to the small mean number of copies. In this paper, we examine another way of implementing variable resource expenditure in different rounds: the channels are partitioned into groups, one for each round, and the channels used in later rounds are operated with lower offered loads, i.e., at different "working points". The delay-constrained capacity with these Single-Copy Multiple-Working-Point (SC-MWP) policies is shown to be substantially higher than that with conventional ALOHA, but lower than with the optimal Multicopy...

• Type: Journal
• Year: 2002
• Where: WINET
• Authors: Dror Baron, Yitzhak Birk
• Keywords: Large Maximum Number, Paper, Small Mean Number, WINET 2002