• Title/Summary/Keyword: Dynamic Time TDMA/TDD

Search Result 5, Processing Time 0.018 seconds

Adaptive and Prioritized Random Access and Resource Allocation Schemes for Dynamic TDMA/TDD Protocols

  • Choi, Hyun-Ho
    • Journal of information and communication convergence engineering
    • /
    • v.15 no.1
    • /
    • pp.28-36
    • /
    • 2017
  • The medium access control (MAC) protocol based on dynamic time division multiple access/time division duplex (TDMA/TDD) is responsible for random access control and radio resource allocation in dynamic traffic environments. These functions of random access and resource allocation are very important to prevent wastage of resources and improve MAC performance according to various network conditions. In this paper, we propose new random access and resource allocation schemes to guarantee quality of service (QoS) and provide priority services in a dynamic TDMA/TDD system. First, for the QoS guarantee, we propose an adaptive random access and resource allocation scheme by introducing an access probability. Second, for providing priority service, we propose a priority-based random access and resource allocation scheme by extending the first adaptive scheme in both a centralized and a distributed manner. The analysis and simulation results show that the proposed MAC protocol outperforms the legacy MAC protocol using a simple binary exponential backoff algorithm, and provides good differential performance according to priorities with respect to the throughput and delay.

MAC Protocol for Multimedia Services in Wireless ATM Networks based on TDMA/TDD (TDMA/TDD 기반 무선 ATM망에서 멀티미디어 서비스를 위한 MAC 프로토콜)

  • 임인택
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.5
    • /
    • pp.899-906
    • /
    • 2003
  • In this paper, a channel access control algorithm and a slot allocation algorithm are proposed as MAC protocol for multimedia services in TDMA/TDD-based wireless ATM networks. In the proposed protocol, VBR terminals that require real-time services transmit a reservation request through a random access minislot. VBR terminals, which are successfully transmitted the reservation request, transmits the dynamic parameters through a dynamic parameter minislot without contention. On the other hand, ABR terminals transmit a reservation request with contention basis whenever a non-real-time traffic burst is generated. Based on the received dynamic parameters and the number of requested slots, the base station scheduler allocates a dynamic parameter minislot as well as uplink data slots into VBR terminals. Also the scheduler allocates uplink data slots into ABR terminals in proportion to the number of requested slots.

Dynamic Channel Assignment Scheme Based on the Number of Success and Collision of Random Channel in HIPERLAN/2 (HIPERLAN/2에서 랜덤채널의 성공수와 충돌수에 기반한 동적 채널할당 방안)

  • Lim, Seog-Ku
    • 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.

Dynamic Channel Assignment Scheme Considering Number of Success and Collision in HiperLNA/2 WLAN (HiperLAN/2 무선랜에서 성공과 충돌수를 고려한 동적채널할당 방안)

  • Lim, seog-ku
    • 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.

  • PDF

Adaptive Random Access Algorithm for HIPERLAN/2 (HIPERLAN/2를 위한 적응적 랜덤 액세스 알고리즘)

  • Song Young-keum;Lee Jong-kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.5B
    • /
    • pp.310-316
    • /
    • 2005
  • In this paper, we proposed and evaluated ARAH(Adaptive Random Access algorithm for HIPERLAN/2) to improve system performance. In this paper, HIPERLAN/2 uses OFDM(Orthogonal Frequency Division Multiplexing) modulation scheme to select appropriate PHY mode by Radio Channel Quality, Proposed the ARAH scheme uses these 7 PHY mode when mobile terminal determines the RCH(Random CHannel) number for random access. In this paper, these 7 PHY mode divided into two group, good and bad, and will be given high priority to mobile terminals which are in a good group. In the result of performance evaluation. ARAH algorithm, ARAH has a better performance of throughput and delay than existing algorithm.