Skip to main content
Log in

Multiple Working Points in Multichannel ALOHA with Deadlines

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

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).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. N. Abramson, Development of the ALOHANET, IEEE Transactions on Information Theory 31(3) (March 1985) 119–123.

    Google Scholar 

  2. R. Rom and M. Sidi, Multiple Access Protocols (Springer-Verlag, New York, 1990).

    Google Scholar 

  3. S.S. Lam, Packet broadcast networks — A performance analysis of the R-ALOHA protocol, IEEE Transactions on Computers C-29(7) (July 1980) 596–603.

    Google Scholar 

  4. E.W.M. Wong and T.S.P. Yum, The optimal multicopy Aloha, IEEE Transactions on Automatic Control 39(6) (June 1994) 1233–1236.

    Google Scholar 

  5. Y. Birk and Y. Keren, Judicious use of redundant transmissions in multi-channel ALOHA networks with deadlines, IEEE Journal on Selected Areas in Communications 17(2) (February 1999) 257–269.

    Google Scholar 

  6. Y. Birk and D. Baron, Capacity maximization in multichannel slotted ALOHA with deadlines — an overview, EE Technical Report No. 1248 (also CC-pub 314), Technion, Haifa, Israel (June 2000).

    Google Scholar 

  7. Y.W. Leung, Generalised multicopy ALOHA, Electronics Letters 31(2) (January 1995) 82–83.

    Google Scholar 

  8. W.A. Rosenkrantz and D. Towsley, On the instability of the slotted ALOHA multiaccess algorithm, IEEE Transactions on Automatic Control AC-28 (October 1983) 994–996.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Baron, D., Birk, Y. Multiple Working Points in Multichannel ALOHA with Deadlines. Wireless Networks 8, 5–11 (2002). https://doi.org/10.1023/A:1012744023290

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1012744023290

Navigation