• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.987-990
• /
• 2009

The MAC protocol of HiperLAN/2 is based on TDMA/TDD. The radio channels are assigned by AP(Access Point) that is centrally operated. Mobile terminal that data transmission is necessary to uplink requests radio resource to AP through RCH channel. The changing number of RCHs in each MAC frame is important because too many RCHs may result in a waste of radio resources and too few RCHs may result in many access collisions and prolong time that connect to AP. Therefore, number of RCH should be allocated properly according to traffic. From these viewpoint, this paper proposes an advanced scheme that dynamically changed the number of RCH which is based on the number of success and collision of RR message in previous MAC frame. To prove efficiency of proposed scheme, a lots of simulations are conducted and analyzed.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.8
• /
• pp.3654-3659
• /
• 2011

The MAC protocol of HiperLAN/2 is based on TDMA/TDD. The radio channels are assigned by AP(Access Point) that is centrally operated. Mobile terminal that data transmission is necessary to uplink requests radio resource to AP through RCH channels. The changing number of RCHs in each MAC frame is important because too many RCHs may result in a waste of radio resources and too few RCHs may result in many access collisions and prolong time that connect to AP. Therefore, number of RCH should be allocated properly according to traffic. From these viewpoints, this paper proposes an advanced scheme that dynamically changed the number of RCH which is based on the number of success and collision of RR message in previous MAC frame. To prove efficiency of proposed scheme, lots of simulations are conducted and analyzed.

• Proceedings of the Korea Contents Association Conference
• /
• 2009.05a
• /
• pp.83-87
• /
• 2009

The MAC protocol of HiperLAN/2 is based on TDMA/TDD. Mobile terminal acquires a data transmission opportunity as successfulness in channel competition through RCH (Random CHannel) phase. Therefore, AP (Access Point) be able to dynamically assign optimum RCH at next frame according to the number of success and collision. In this paper, we suggest scheme that fluctuate RCH (Random CHannel) number as fixed value considering success and collision for improvement of performance in HiperLAN/2. To prove efficiency of proposed scheme, a lots of simulations are conducted and analyzed in view of throughput and access delay.

• Proceedings of the Korea Contents Association Conference
• /
• 2009.05a
• /
• pp.682-686
• /
• 2009

The MAC protocol of HiperLAN/2 is based on TDMA/TDD. The radio channels are assigned by AP(Access Point) that is centrally operated. Mobile terminal that data transmission is necessary to uplink requests radio resource to AP through RCH channel. The changing number of RCHs in each MAC frame is important because too many RCHs may result in a waste of radio resources and too few RCHs may result in many access collisions and prolong time that connect to AP. Therefore, number of RCH should be allocated properly according to traffic. From these viewpoint, this paper proposes an advanced scheme that dynamically changed the number of RCH which is based on the number of success and collision of RR message in previous MAC frame. To prove efficiency of proposed scheme, a lots of simulations are conducted and analyzed.

• Journal of Digital Contents Society
• /
• v.12 no.3
• /
• pp.347-353
• /
• 2011

In HIPERLAN/2, the radio channels are assigned by AP(Access Point) that is centrally operated and the MAC protocol is based on TDMA/TDD. Mobile terminal that data transmission is necessary to uplink requests radio resource to AP through RCH channel. The changing number of RCHs in each MAC frame is important because too many RCHs may result in a waste of radio resources and too few RCHs may result in many access collisions and prolong time that connect to AP. Hence the number of RCH should be allocated properly according to traffic. From these point, this paper proposes an scheme that dynamically assigned the number of RCH which is based on the number of success and collision of message in previous MAC frame. To prove efficiency of proposed scheme, lots of simulations are conducted and analyzed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9A
• /
• pp.717-727
• /
• 2003

The HIPERLAN/2(HIgh PERformance Local Area Network Type2) is one of the wireless LAN standards for providing raw data rates of up to 54 Mbps. The MAC protocol of HIPERLAN/2 is based on TDMA/TDD, and resources in one MAC frame can be allocated dynamically by Access Point(AP). The random channel(RCH) is defined for the purpose of giving a mobile terminal the opportunity to request transmission resources in the uplink MAC frames. It is desirable that the number of RCHs is dynamically adapted by the AP depending on the current traffic situation. Allocation of excessive RCHs may waste radio resources and insufficient RCHs compared to traffic loads may result in many collisions in access attempts. We propose an RCH allocation scheme based on split algorithm in HIPERLAN/2. The simulation and analytic results show that the proposed scheme achieves a higher channel throughput, lower access delay and delay jitter than previously proposed RCH allocation schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1A
• /
• pp.58-64
• /
• 2009

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 $\beta$. 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.

• Proceedings of the KAIS Fall Conference
• /
• 2009.05a
• /
• pp.425-428
• /
• 2009

본 논문에서는 유럽의 표준화 기구인 ETSI(European Telecommunication Standards Institute)에서 제정한 HiperLAN/2 MAC계층에서 각 단말들의 매체 접근 경쟁방식을 분석하고 아울러 효율적인 자원분배가 이루어지도록 RCH 채널을 할당하는 방법을 분석한다. HiperLAN/2에서는 RCH를 통해서 자원 요청을 받게 되는데 만약 트래픽부하가 큰 경우 RCH가 적게 할당되면 전송지연이 길어질 것이며 반대로 RCH가 필요이상으로 할당되면 수율이 저하되는 문제가 발생한다. 본 논문에서는 이전 프레임에서 성공한 RCH 채널과 충돌한 RCH 채널의 각 크기를 비교하여 현재 프레임의 RCH 채널수를 결정하는 방식을 제안한다. 제안한 방식의 효율성을 입증하기 위해 시뮬레이션을 수행하였다.

• Proceedings of the KAIS Fall Conference
• /
• 2009.12a
• /
• pp.453-456
• /
• 2009

HiperLAN Type2에서의 MAC 프로토콜은 TDMA/TDD을 기반으로 하며, 무선채널은 중앙제어방식으로 운영되는 AP(Access Point)에 의해서 할당된다. 상향링크로 데이터 전송이 필요한 이동단말은 RCH 채널을 통하여 AP에게 무선자원을 요청한다. 각 MAC 프레임마다 RCH 수를 동적으로 변경하는 것이 중요한데, RCH 수가 많이 할당되면 무선자원의 낭비를 초래하며, RCH 수가 적게 할당되면 이동단말간의 충돌이 증가하고 AP에 접속하는 시간도 길어진다. 따라서 RCH 수는 트래픽에 따라 적절하게 할당되어야 한다. 본 논문에서는 HiperLAN/2에서의 성능향상을 위해 충돌과 성공을 고려하여 RCH(Random CHannel)수를 고정적인 ${\beta}$값만큼 증감하는 방법을 제안하였다. 제안한 방법의 효율성을 입증하기 위해 시뮬레이션을 수행하였으며, 처리율과 접속지연 관점에서 분석하였다.

• Proceedings of the KAIS Fall Conference
• /
• 2010.05a
• /
• pp.99-102
• /
• 2010

TDMA/TDD을 기반으로 동작하는 HiperLAN/2의 MAC 프로토콜에서 무선채널은 중앙제어방식으로 운영되는 AP(Access Point)에 의해서 할당된다. 상향링크로 데이터 전송이 필요한 이동단말은 RCH 채널을 통하여 AP에게 무선자원을 요청한다. 각 MAC 프레임마다 RCH 수를 동적으로 변경하는 것이 중요한데, RCH 수가 많이 할당되면 무선자원의 낭비를 초래하며, RCH 수가 적게 할당되면 이동단말간의 충돌이 증가하고 AP에 접속하는 시간도 길어진다. 따라서 무선자원을 효율적으로 사용하기 위해 RCH 수는 트래픽에 따라 적절하게 할당되어야 한다. 본 논문에서는 HiperLAN/2에서의 성능향상을 위해 패킷의 충돌수와 성공수를 고려하여 RCH 수를 동적으로 변화시키는 방법을 제안하였다. 제안한 방법의 효율성을 입증하기 위해 시뮬레이션을 수행하였으며, 처리율과 접속지연 관점에서 분석하였다.