Dynamic Random Channel Allocation Algorithm by Limiting the Number of Minimum RCH in HIPERLAN/2 


Vol. 34,  No. 1, pp. 58-64, Jan.  2009


PDF
  Abstract

In this paper, we propose an dynamic random channel allocation scheme increasing probability of channel acquisition and reducing delay by limiting the number of minimum RCHs(Random CHannels) as an optimal factor . The MAC protocol of HIPERLAN/2 is based on TDMA/TDD and MT(Mobile Terminal) can obtain chance of traffic transmission through channel competition in RCH period. And AP(Access Point) can dynamically schedule the number of RCHs based on the number of the collision in each RCH of the previous frame. Therefore, the proposed scheme increases a probability of channel acquisition and reduces delay by means of guaranteeing the number of minimum RCHs. With a practical Internet traffic, it is concluded that by the proposed scheme the delay reduction of the order of 19% and slightly better throughput are obtained compared to the conventional algorithm.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

J. Kang and J. Lee, "Dynamic Random Channel Allocation Algorithm by Limiting the Number of Minimum RCH in HIPERLAN/2," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 1, pp. 58-64, 2009. DOI: .

[ACM Style]

Jae-Eun Kang and Jong-Kyu Lee. 2009. Dynamic Random Channel Allocation Algorithm by Limiting the Number of Minimum RCH in HIPERLAN/2. The Journal of Korean Institute of Communications and Information Sciences, 34, 1, (2009), 58-64. DOI: .

[KICS Style]

Jae-Eun Kang and Jong-Kyu Lee, "Dynamic Random Channel Allocation Algorithm by Limiting the Number of Minimum RCH in HIPERLAN/2," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 1, pp. 58-64, 1. 2009.