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.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
HIPERLAN Type2; Data Link Control(DLC) Layer; Part1: Basic Data Transport Functions, Broadband Radio Access Networks(BRAN), ETSI TS 101 761-1 V1.3.1(2001-12)
Hwang, G.-H., Cho, D.-H.: Adaptive Random Channel Allocation Scheme in HIPERLAN Type2. IEEE Communications Letters 6(1) (January 2002)
Ko, Y.-C., Hwang, E.-S., Dong, J.-S., Lee, H.-W., Cho, C.-H.: Throughput Analysis of ETSI BRAN HIPERLAN/2 MAC Protocol taking Guard Timing Spaces into Consideration. In: 9th International Conference on Personal Wireless Communications 2004, Deft Netherlands (September 2004)
Hwang, E.-S., Won, J.-J., Ko, Y.-C., Lee, H.-W., Cho, C.-H.: Random Channel Allocation Scheme in HIPERLAN/2. To appear Pacific-Rim Conference on Multimedia 2004, Tokyo Japan (November 2004)
Petra, D., Kramling, A., Hettich, A.: MAC Protocol for Wireless ATM: Contention Free versus Contention Based Transmission of Reservation Requests. In: 7th IEEE PIMRC (1996)
Van Hooudt, B., Blondia, C.: Analysis if an Identifier Splitting Algorithm Combined with Polling (ISAP) for Contention Resolution in a Wireless Access network. IEEE Journal on Selected Area in Communications 18(11) (November 2000)
Markowski, M.J., Seti, A.S.: Real-Time Wireless Communication Using Splitting Protocols. In: IEEE GLOBECOM, November 1997, vol. 3 (1997)
Gong, Y., Paterakis, M.: A Robust Random Multiple-Access Algorithm for Packet Transmissions over Noisy Channels with Error Memory. IEEE Transactions on Communications 42(9) (September 1994)
Leon-Garcia, A.: Probability and Random Processes for Electrical Engineering, ch. 2, Basic Concept and Probability Theory, 2nd edn. Addison-Wesley, Reading (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ko, YC., Hwang, ES., Won, JJ., Lee, HW., Cho, CH. (2005). Collision Reduction Random Access Using m-Ary Split Algorithm in Wireless Access Network. In: Braun, T., Carle, G., Koucheryavy, Y., Tsaoussidis, V. (eds) Wired/Wireless Internet Communications. WWIC 2005. Lecture Notes in Computer Science, vol 3510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424505_22
Download citation
DOI: https://doi.org/10.1007/11424505_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25899-5
Online ISBN: 978-3-540-32104-0
eBook Packages: Computer ScienceComputer Science (R0)