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 Full-Text
Abstract
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.
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.