TY - JOUR
T1 - Multiple working points in multichannel ALOHA with deadlines
AU - Baron, Dror
AU - Birk, Yitzhak
N1 - Funding Information:
∗This work was supported in part by the Information Superhighway In Space consortium, administered by the office of the Chief Scientist of the Israeli Ministry of Industry and Trade. ∗∗Presently with the ECE Department, University of Illinois at Urbana-Champaign.
PY - 2002
Y1 - 2002
N2 - This paper addresses the problem of maximizing the capacity of multichannel slotted ALOHA networks subject to a user-specified 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 Single-Working-Point (MC-SWP) scheme. Combining the two to form an MC-MWP scheme only slightly improves capacity over MC-SWP. The SC-MWP approach can be more attractive when using a single transmitter per station because, unlike with multiple copies, transmission time is not prolonged. Therefore, multiple-working-point policies become more attractive when propagation delay is lower (e.g., low orbit satellites).
AB - This paper addresses the problem of maximizing the capacity of multichannel slotted ALOHA networks subject to a user-specified 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 Single-Working-Point (MC-SWP) scheme. Combining the two to form an MC-MWP scheme only slightly improves capacity over MC-SWP. The SC-MWP approach can be more attractive when using a single transmitter per station because, unlike with multiple copies, transmission time is not prolonged. Therefore, multiple-working-point policies become more attractive when propagation delay is lower (e.g., low orbit satellites).
KW - Deadline
KW - Multichannel ALOHA
KW - Multiple working points
KW - Satellite networks
UR - http://www.scopus.com/inward/record.url?scp=0036154786&partnerID=8YFLogxK
U2 - 10.1023/A:1012744023290
DO - 10.1023/A:1012744023290
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0036154786
SN - 1022-0038
VL - 8
SP - 5
EP - 11
JO - Wireless Networks
JF - Wireless Networks
IS - 1
M1 - 382760
ER -