Random Channel Allocation Scheme in HIPERLAN/2

Hwang, Euiseok; Won, Jeong-Jae; Ko, You-Chang; Lee, Hyong-Woo; Cho, Choong-Ho

doi:10.1007/978-3-540-30541-5_4

Cited by 3 publications

(8 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…먼저, 이전 프레임에서의 채널경쟁에서 성공한 MT 수 와 실패한 MT 수의 차이만큼 다음 프레임의 RCH 수를 가변시키는 연구가 있었다 [4]. 또한 AP에서 자원할당 시 충돌 MT에게 우선적으로 자원을 할당하여 전체 지연시 간을 감소시키는 연구도 있었다 [5].…”

Section: 서론unclassified

“…또한 AP에서 자원할당 시 충돌 MT에게 우선적으로 자원을 할당하여 전체 지연시 간을 감소시키는 연구도 있었다 [5]. Split 알고리즘에 이 용하여 RCH 수를 제어하는 기법을 제안하고 분석한 연 구도 있었다 [6]. 또한 트래픽이 급격하게 증가하는 경우 를 대비하기 위해 입력 트래픽이 낮은 상황에서도 최소 RCH 개수를 제한하는 방법도 제시되었다 [7].…”

Section: 서론unclassified

See 1 more Smart Citation

Efficient Channel Assignment Scheme in HiperLAN/2 WLAN

Lim

2011

Journal of the Korea Academia-Industrial cooperation Society

View full text Add to dashboard Cite

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.

show abstract

Section: 서론unclassified

Efficient Channel Assignment Scheme in HiperLAN/2 WLAN

Lim

2011

Journal of the Korea Academia-Industrial cooperation Society

View full text Add to dashboard Cite

show abstract

“…In [3], an AP controls the number of random channels (RCHs), which works as open or association MCTA in IEEE 802.15.3 does, based on the binary splitting algorithm. By the binary splitting algorithm the number of RCHs of (t + 1) th MAC frame is given by…”

Section: Previous Scheme [3]mentioning

confidence: 99%

“…Random access within [1, Na] after a random delay if 2i + Na > RMAX (5) where i is the location of collided RCH in the previous MAC frame.…”

Section: Previous Scheme [3]mentioning

confidence: 99%

“…As a random access scheme slotted aloha was proposed for an open MCTA or an association MCTA in [2]. However, this mechanism in line with the exponential back-off algorithm for a collision resolution has been challenged by some prior works in order to enhance realtime multimedia traffic access efficiently in terms of throughput, delay, and delay variance [4][5][6]. In this paper, we propose a new open and association MCTAs access and allocation scheme named staggering algorithm to deal with collision resolution which is inevitable in random access environment such as slotted aloha scheme.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Open and Association MCTAs Access and Allocation Scheme by Staggering Algorithm in IEEE 802.15.3

Hwang

Cho

et al. 2006

Information Networking. Advances in Data Communications and Wireless Networks

Self Cite

View full text Add to dashboard Cite

Abstract. The IEEE 802.15.3 medium access control (MAC) protocol is standard for high bit rate wireless personal area network (WPAN). The open or association management channel time allocations (MCTAs) are used by devices(DEVs) for sending command messages or association request command to piconet coordinator (PNC) by means of slotted aloha random access manner. Based on slotted aloha scheme the binary back-off algorithm has been considered as a primary contention resolution candidate due to its simple operation. However it is not appropriate for the future wireless networks because of low throughput and high delay and delay variance. Without loss of generality the goals of the random multiple access algorithm are to maximize the throughput and to minimize the average packet delay. In this paper, we propose a new multiple access protocol named staggering algorithm working on top of slotted aloha scheme. The performance results by NS-2 simulation show that the proposed algorithm achieves the maximum throughput up to 0.54 and guarantees the QoS in terms of delay and delay variance of realtime multimedia traffic.

show abstract

Collision Reduction Random Access Using m-Ary Split Algorithm in Wireless Access Network

Hwang

Won

et al. 2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Random Channel Allocation Scheme in HIPERLAN/2

Cited by 3 publications

References 5 publications

Efficient Channel Assignment Scheme in HiperLAN/2 WLAN

Efficient Channel Assignment Scheme in HiperLAN/2 WLAN

Open and Association MCTAs Access and Allocation Scheme by Staggering Algorithm in IEEE 802.15.3

Collision Reduction Random Access Using m-Ary Split Algorithm in Wireless Access Network

Contact Info

Product

Resources

About