Random channel allocation scheme in HIPERLAN/2

  • Authors:
  • Eui-Seok Hwang;Jeong-Jae Won;You-Chang Ko;Hyong-Woo Lee;Choong-Ho Cho

  • Affiliations:
  • Korea Univ. Dept. of Computer & Information Science;Dept. of Electrical and Computers Engineering, Univ. of British Columbia;UMTS Handset Lab., LG Electronics Inc.;Korea Univ. Dept. of Electronics & Information Engineering;Korea Univ. Dept. of Computer & Information Science

  • Venue:
  • PCM'04 Proceedings of the 5th Pacific Rim conference on Advances in Multimedia Information Processing - Volume Part I
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

HIPERLAN/2 is one of the standards for high-speed wireless LANs developed by ETSI BRAN. A mobile terminal(MT), when it has messages to send in the uplink channel, may use contention slots, called random access channels (RCHs), to send the resource request messages. Based on successful resource request messages from the MTs, the access point(AP) allocates uplink channel resources dynamically. The number of RCHs in one MAC frame should be adjusted in such way that the access delay for request messages is kept small without underutilizing the RCHs. In this paper, we propose a new RCH allocation scheme using the splitting algorithm, which dynamically adjusts the number of RCHs according to the current traffic situation. The simulation results show that our scheme performs well in terms of channel throughput, access delay and delay jitter compared with previously proposed RCH allocation schemes.