Collision reduction random access using m-ary split algorithm in wireless access network

TitleCollision reduction random access using m-ary split algorithm in wireless access network
Publication TypeJournal Article
Year of Publication2005
AuthorsKo, Y. C., E. S. Hwang, J. J. Won, H. W. Lee, and C. H. Cho
Secondary AuthorsBraun, T., G. Carle, Y. Koucheryavy, and V. Tsaoussidis
JournalWired/Wireless Internet Communications, Proceedings
Volume3510
Pagination223–233
ISSN0302-9743
Abstract

In the high performance radio access networks, the number of random access channels can be used for mobile stations to transmit their bandwidth requests in contention mode via multiple random access. In this paper a collision reduced random access scheme based on m-art split algorithm in the centralized medium access control protocol is presented. In this method the splitting algorithm is used in two fold. On one hand the whole random access channels are exclusively separated into two parts; one is for initial contention where only initial access mobile stations can be served and the other is for retransmit contention where the mobile stations whose initial random access was not successful can join for their retransmission. On the other hand the m-ary split algorithm applied in the retransmit contention area to resolve the collisions. By doing so the proposed scheme achieves considerably greater performance in terms of maximum throughput, mean access delay, and delay jitter, which is one of the important criteria for real-time traffic. Through numerical examples and computer simulations the effect of the various parameters of the algorithm, initial number of random access report(s) and the split size m, on the system performance is examined.

a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949
Email:

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2020 The University of British Columbia