• Title/Summary/Keyword: TDMA/TDD MAC

Search Result 19, Processing Time 0.023 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.

A Design of TDMA/TDD MAC Protocol for Full-Duplex Multi-User Voice Communication Systems Based on Sensor Network (센서 네트워크 기반의 다수 사용자간 Full-Duplex 음성 통신 시스템을 위한 TDMA/TDD MAC 프로토콜 설계)

  • Kim, Jisoo;Lee, Jae Hyoung;Cho, Sung Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38C no.3
    • /
    • pp.239-246
    • /
    • 2013
  • The IEEE 802.15.4 offers standard about PHY and MAC layer and features low power, low bandwidth, and low speed data communication. Because of this reason, IEEE 802.15.4 is only within a limited range such as sensor detection and home network; nevertheless, the research about transmission multimedia data like voice packet through wireless sensor networks is conducted widely. In this paper, we proposed the group communication system based on the sensor network. TDMA/TDD MAC based on the IEEE 802.15.4 PHY for voice communication on the sensor network is designed by improvement existing peer-to-peer voice communication on the sensor network and hardware is implemented for group communication. To measure the quality of designed system, mean opinion score (MOS) is obtained from the experiment and verified by using sine wave method. As a result of an experiment, we expect that a many cases of application solution can be developed using presented system.

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.

Efficient RCH Assignment Scheme in HiperLNA/2 WLAN (HiperLAN/2 무선랜에서 효율적인 RCH 할당방안)

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

  • PDF

Efficient Channel Assignment Scheme in HiperLAN/2 WLAN (HiperLAN/2 무선랜에서 효율적인 채널할당방안)

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

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

Random Channel Allocation Scheme Based on Split Algorithm in HIPERLAN 2 (HIPERLAN Type 2에서 Split 알고리즘에 기반한 랜덤채널 할당 기법)

  • 황의석;고유창;이승규;윤철식;이형우;조충호
    • 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.

A New MAC Protocol for Multimedia Wireless Networks Using Dynamic TDMA/TDD Frame and Eestimation of the Number F Active Mobiles (동적 TDMA/TDD 프레임과 활성 단말의 개수 예측을 이용한 무선 멀티미디어 매체접근제어 프로토콜)

  • 박준호;조영종
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1998.10a
    • /
    • pp.229-231
    • /
    • 1998
  • 본 논문에서 제안하는 매체접근제어 프로토콜은 활성 단말의 개수를 통계적 특성에 의하여 예측하고 이를 상향 요구 슬롯의 액세스 확률에 적용하여 요구슬롯의 수율(Throughput)을 높이도록 하였으며, 단말에세 슬롯을 할당하는 방식으로 고정할당법과 동적 할당법을 동시에 사용하였다. 고정 할당법은 모든 단말에게 최송한 제공될 수 있는 서비스 품질(QoQ: Quality of Server)을 보장하는 방식이며 동적할당법은 음성 단말에 대하여 버퍼의 상태에 따라 지정된 서비스 품질을 제공하기 위하여 각 단말에게 동적으로 슬롯을 할당하는 방법이다. 제안된 프로토콜에 대해 시뮬레이션을 통하여 음성 및 데이터 단말의 수율과 패킷 전송 지연을 구하고 음성 단말의 패킷 손실률을 분석하여 동적 할당법의 효율에 대하여 알아본다.

  • PDF

Variable RCH Channel Assignment Scheme in HiperLAN/2 System (HiperLAN/2 시스템에서 가변적인 RCH 채널 할당방안)

  • Jang, soon-gun;Jang, jae-hwan;Lim, seog-ku
    • 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.

  • PDF