Logo image
A new approximation for slotted buffered Aloha
Conference proceeding

A new approximation for slotted buffered Aloha

Steven Weber, Ananth Kini, Athina Petropulu and IEEE
2008 42ND ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS, VOLS 1-3, pp 1143-1148
01 Jan 2008

Abstract

Computer Science Computer Science, Information Systems Computer Science, Theory & Methods Engineering Engineering, Electrical & Electronic Science & Technology Technology
Few models in wireless communications have been addressed as thoroughly as slotted Aloha, and most important questions regarding its performance have been answered (e.g., stability). Although slotted time finite user Aloha with infinite backlog (no queueing analysis) and fixed (common) contention probability is trivial, incorporating queueing significantly increases the complexity of the problem, with a corresponding major impact on the resulting performance. The stability region of this model is known, as are many other performance aspects, but a review of the literature yields no explicit performance expressions in terms of the fundamental model parameters. This paper approximates the performance of the K coupled queues with K uncoupled geom/geom/1 queues, where the queue parameters are selected to reflect the actual coupling as closely as possible. The throughput match is excellent, and the service delay match is good. The approach can be extended to queue-specific contention probabilities in a straightforward manner.

Metrics

13 Record Views
7 citations in Scopus

Details

UN Sustainable Development Goals (SDGs)

This publication has contributed to the advancement of the following goals:

#11 Sustainable Cities and Communities

InCites Highlights

Data related to this publication, from InCites Benchmarking & Analytics tool:

Web of Science research areas
Computer Science, Information Systems
Computer Science, Theory & Methods
Engineering, Electrical & Electronic
Logo image