• Title/Summary/Keyword: 동적 TDMA 프로토콜

Search Result 29, Processing Time 0.043 seconds

A MAC Protocol Considering Traffic Loads Information For a Clustered Wireless Sensor Networks (클러스터 기반의 무선 센서 네트워크 환경에서 트래픽 부하 정보를 고려한 MAC 프로토콜)

  • Kim, Seong-Cheol;Kim, Hyung-Jue
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.3
    • /
    • pp.113-119
    • /
    • 2009
  • In this paper, we proposed an efficient TDMA scheduling algorithm for a clustered Wireless Sensor Network. Since some previous algorithms used unnecessary idle period and schedule period in each frame. It became an overhead that might consume unexpected energy and delay data transmission. To solve this problem, a dynamic scheduling algorithm according to the number of member nodes and node traffic load within a cluster was suggested. Our proposed DS-MAC(Dynamic Scheduling MAC) could save energy and reduce transmission delay Then DS-MAC was analyzed mathematically to compare with the previous algorithms.

Hybrid reservation request algorithm for dynamic reservation TDMA/TDD protocol (혼합 예약 요청 알고리즘을 이용한 동적 예약 TDMA/TDD 프로토콜)

  • 박선현;최덕규
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 2001.05a
    • /
    • pp.132-132
    • /
    • 2001
  • 본 논문에서는 혼합예약요청(hybrid reservation request) 알고리즘을 적용한 새로운 동적 예약 TDMA 프로토콜을 제안한다. 제안된 혼합 예약 요청 알고리즘은 기존의 랜덤접속방식과 기지국의 중재 없이 단말간 직접 신호교환을 통하여 이웃 단말의 새로운 예약 요청을 대신 전송하는 방식을 혼합해서 사용하는 방법이다. 이 알고리즘은 기존 slotted-ALOHA 방식을 이용한 예약 요청의 비효율성을 개선하여 새로운 단말의 예약 요청실패로 인한 셀 전송지연 및 호 봉쇄 확률(call blocking probability)을 줄이기 위한 목적으로 제안되었다. 제안한 알고리즘은 새로 전송할 데이터를 가진 단말이 많은 경우에 특히 효율적이다. 본 논문에서 제안하는 프로토콜은 모든 종류의 트래픽이 예약을 통한 전송방식으로 전송된다. 즉, 단말들로부터의 예약 요청을 바탕으로, 기지국이 스케줄링을 하여 트래픽 별로 접근 슬랏을 할당해 주는 방식이다. 이 경우, 예약 요청을 하는 방법은 새로 전송을 개시하는 단말과 이미 전송중인 단말의 경우가 다른데, 새로운 전송을 위한 예약이 필요한 단말은 제안하는 알고리즘을 이용하며, 이미 예약에 성공한 단말은 기존에 사용하던 자신의 버스트헤더(burst header)에 피기백(piggybacking)하는 방법을 이용한다. 제안한 알고리즘에 따라, 새로 접속하는 단말이나 새로운 예약 요청이 필요한 단말은 두 단계로 요청을 전송할 수 있다. 첫 번째 단계는 이미 예약에 성공하여 전송중인 이웃단말에게 전송요청신호를 보내 간접적으로 기지국에게 예약을 요청하는 방법이며, 두 번째 단계는 첫 번째 방법이 실패했을 경우 기존의 랜덤접속방법에 참가하는 것이다 먼저 첫 번째 방법에서는 단말이 랜덤접근 구간의 예약요청구간(resonation request)중 하나의 미니 슬랏을 선택해 이웃 단말들에게 한번 방송(broadcast) 한다 이후 ACK 응답구간(ACK receive)에서 응답을 받으면 예약요청성공이라 간주하고, 그렇지 않으면 실패로 판단, 뒤이어 오는 랜덤접근구간(normal random access period)에 참가하여 기지국에게 직접 예약 요청을 한다. 시뮬레이션은 기존 slotted-ALOHA방식으로 랜덤 접속을 할 경우와 제안한 방식과의 성공률을 비교해 제안한 방식의 call blocking probability가 낮음을 보였다.

  • PDF

An Analysis of the Peservation-based MAC Protocol for Wireless Multimedia Service (무선 멀티미디어 서비스를 위한 예약 기반의 MAC 프로토콜 성능 분석)

  • 지성규;김형민;석정봉;정해원
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1998.10a
    • /
    • pp.232-234
    • /
    • 1998
  • ATM을 기반으로 하는 광대역 무선 멀티미디어 환경에서의 다양한 트래픽의 수용을 위한 MAC 프로토콜로서 TDMA기반의 예약 방식이 많이 연구되어 있다. 본 논문에서는 기존의 예약기반 MAC프로?로의 고찰을 통하여 다양한 트래픽 수용에 따른 QoS의 고려와 함께 전송대역의 효율을 극대화 할 수 있도록 프레임 구조에 있어 기지국과 단말간의요구 전송 피드백의 시간지연을 최소치로 유지하고, 순.역방향간의 동적 비태칭을 구현하는 MAC 프로토콜을 제안한다. 또한 요구 전송 단계에서의 개선 방안으로 충돌로 인한 오버해드를 줄이고 트래필에 따른 차별화로 QoS를 고려하는 방식을 제안하고 각각의 성능 분석을 수행하고 , 충돌 시 선택적 재전송 프로토콜의 사용으로 인한 MAC 프로토콜의 개선을 성능분석으로 보인다.

  • 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

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

A Time Slot Assignment Scheme for Sensor Data Compression (센서 데이터의 압축을 위한 시간 슬롯 할당 기법)

  • Yeo, Myung-Ho;Kim, Hak-Sin;Park, Hyoung-Soon;Yoo, Jae-Soo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.11
    • /
    • pp.846-850
    • /
    • 2009
  • Recently, wireless sensor networks have found their way into a wide variety of applications and systems with vastly varying requirements and characteristics such as environmental monitoring, smart spaces, medical applications, and precision agriculture. The sensor nodes are battery powered. Therefore, the energy is the most precious resource of a wireless sensor network since periodically replacing the battery of the nodes in large scale deployments is infeasible. Energy efficient mechanisms for gathering sensor readings are indispensable to prolong the lifetime of a sensor network as long as possible. There are two energy-efficient approaches to prolong the network lifetime in sensor networks. One is the compression scheme to reduce the size of sensor readings. When the communication conflict is occurred between two sensor nodes, the sender must try to retransmit its reading. The other is the MAC protocol to prevent the communication conflict. In this paper, we propose a novel approaches to reduce the size of the sensor readings in the MAC layer. The proposed scheme compresses sensor readings by allocating the time slots of the TDMA schedule to them dynamically. We also present a mathematical model to predict latency from collecting the sensor readings as the compression ratio is changed. In the simulation result, our proposed scheme reduces the communication cost by about 52% over the existing scheme.

Bandwidth Allocation and Performance Analysis of MAC Protocol for Ethernet PON (Ethernet PON의 MAC프로토콜의 대역폭 할당 및 성능 분석)

  • 엄종훈;장용석;김성호
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.40 no.7
    • /
    • pp.261-272
    • /
    • 2003
  • An Ethernet PON(Passive Optical Network) is an economical and efficient access network that has received significant research attention in recent years. A MAC(Media Access Control) protocol of PON , the next generation access network, is based on TDMA(Time Division Multiple Access) basically and can classify this protocol into a fixed length slot assignment method suitable for leased line supporting QoS(Quality of Service) and a variable length slot assignment method suitable for LAN/MAN with the best effort. For analyzing the performance of these protocols, we design an Ethernet PON model using OPNET tool. To establish the maximum efficiency of a network, we verify a MAC protocol and determine the optimal number of ONUs(Optical Network Unit) that can be accepted by one OLT(Optical Line Terminal) and propose the suitable buffer size of ONU based on analyzing the end-to-end Ethernet delay, queuing delay, throughput, and utilization.

A Study On The Wireless ATM MAC Protocol Using Mini-slot With Dynamic Bandwidth Allocation Algorithm (동적 대역 할당 알고리즘을 이용한 미니슬롯 기반의 무선 ATM 매체 접속 제어 프로토콜에 관한 연구)

  • Jeong, Geon-Jin;Lee, Seong-Chang
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.37 no.2
    • /
    • pp.17-23
    • /
    • 2000
  • Wireless link has high bit error rate compared with wired link and many users share this limited bandwidth. So it needs more powerful error control code and efficient media access control(MAC) to provide multimedia service reliably. In this paper we proposed efficient MAC frame format based on TDMA using mini-slot for request access. The number of mini-slots is variable based on the result of collision in the previous frame. This dynamic allocation of request mini-slots helps resolve the contention situation quickly and avoids the waste of bandwidth that may occur when there are several unneeded request mini-slots. The simulation results are also presented in terms of channel utilization, call blocking probability and cell transmission delay for mixed traffic environment.

  • PDF