Random Multiple Access Algorithms Using a Control Mini-Slot

Authors:
Dimitri Kazakos;Lazaros F. Merakos;Hakan Deliç
Affiliations:
Univ. of Southwestern Louisiana, Lafayette;Univ. of Athens, Athens, Greece;Bogazic¸i Univ., Istanbul, Turkey
Venue:
IEEE Transactions on Computers
Year:
1997

Citing 1
Cited 4

Data networks

Data networks

Spread-sprectrum CDMA packet radio MAC protocol using channel overload detection and blocking

Wireless Networks
A multiaccess tree algorithm with free access, interference cancellation and single signal memory requirements

Performance Evaluation
Improved high maximum stable throughput FCFS tree algorithms with interference cancellation

Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Interference cancellation tree algorithms with κ-signal memory locations

IEEE Transactions on Communications

Quantified Score

Hi-index	14.98

Visualization

Abstract

The multiple access problem as characterized by infinite user population and a slotted-time channel is examined, and an algorithm that utilizes a control mini-slot is proposed. The stability region of the proposed algorithm is determined and compared to the random access algorithm with the highest known throughput. A break-even point is also given.