• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.34-36
• /
• 2003

본 논문은 무선 LAN 상에서 단말간에 전송되는 트래픽의 서비스 품질을 차별화하고, 처리율 관점에서 기존의 IEEE 802.11e 프로토콜보다 향상된 서비스 품질을 제공하기 위한 새로운 백오프 방식을 제안한다. 제안된 백오프 방식은 단말의 수나 트래픽 손실률과 같은 서비스 영역의 정보를 분석하여 그 정보를 바탕으로 트래픽 특성에 따라 경쟁 윈도우를 동적으로 변화시켜 백오프 절차를 수행한다. 본 논문에서는 제안된 백오프 방식을 분석하기 위해 마코프 모델을 이용한 수학적 분석으로 기존의 IEEE 802.11e 백오프 방식과 비교 분석한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2016.10a
• /
• pp.136-137
• /
• 2016

WSN의 활용 분야 중 하나로 표준화된 IEEE 802.15.4 WBAN(wireless body area networks)은 웨어러블 디바이스의 무선 통신환경을 고려한 기술이다. WBAN은 높은 밀집도를 가지는 특징을 가지며, 이로 인하여 데이터 충돌이 큰 이슈가 되고 있다. 본 논문에서는 WBAN의 표준에서 제시한 메시지 우선순위를 백오프 알고리즘에 적용하여 WBAN 환경에 더 효율적인 전송을 제공하는 것을 목표로한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6B
• /
• pp.406-415
• /
• 2005

The standards which use shared medium like IEEE 802.11 wireless LAN have transmission opportunity by contention in contention period. If there are collisions in contention period, medium access control protocol may solve problem by using backoff algorithm. Backoff algorithm is important part in medium access control, but legacy backoff method which is used under IEEE 802.11 standards is not adjusted when load is heavy because of increasing collisions. In this paper, we propose a new load-based dynamic backoff algorithm in contention-based wireless shared medium to improve throughput of medium and to reduce the number of collisions. Proposed backoff algorithm can increase the network utilization about $20\%$ higher than that of binary exponential backoff algorithm.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.14 no.6
• /
• pp.125-132
• /
• 2015

This paper presents an event data delivery scheme for wireless sensor networks that use a GTS-based channel allocation scheme. Many sensor nodes can share a GTS channel for sending their normal data to the sink node. When there is an event at a node, the node makes a temporal route to the sink node and the nodes of the route can use the GTS channel in a privileged access. This scheme controls the backoff number effectively so the data delivery priority is given to the nodes of that route. Simulation results show that the event data delivery of the proposed scheme outperforms at the end-to-end transfer delay and jitter characteristics. The proposed scheme can effectively gather the event data using the guaranteed GTS channel of the route in proposed scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.3B
• /
• pp.165-173
• /
• 2012

In this paper, we propose a random backoff scheme for Emergency Warning Messages (EWMs) in the vehicle-to-vehicle environment. The EWMs are disseminated from a vehicle that detects an emergency situation to other vehicles in a multi-hop fashion. Since the vehicle-to-vehicle communication based on IEEE 802.11 adapts CSMA/CA, the density of vehicles increase the probability of collisions between transmissions. Moreover, in the presence of background traffic, the EWM should have a higher priority than that of other messages in neighboring vehicles. To that end, we propose the Distant-Dependent Adaptive Backoff (DDAB) scheme, which set a different contention window for random backoff depending on the distance from the sender to the receiver. In the case when a vehicle is expected to located in the outskirts of the communication boundary, the proposed scheme makes the contention window size small in order to compete the background traffic transmission. Otherwise the contention window is set to a large number to reduce the collision possibility among the EWM transmissions. Via simulations, we show that the proposed scheme performs better than the previous schemes for EWM.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.12
• /
• pp.121-129
• /
• 2012

In this paper, we proposed WBAN system model to management an application that requires low rate data transfer in IEEE 802.15.4. We have to use different wireless sensor network technology to transfer different date rate and emergency message in medical application service. A suitable system model for WBAN and a WBAN MAC protocol in order to solve these existing system problems are proposed. Firstly, the priority queuing was applied to contention access period, and the system model which could guarantee transmission of a MAC command frame was proposed. Secondly, the MAC frame was newly defined to use the system model which was proposed above. Thirdly, WBAN CSMA/CA back-off algorithm based on data transmission rate was proposed to enhance data throughput and transmission probability of the data frame which does not have priority in the proposed WBAN system. The proposed algorithm is designed to be variable CSMA/CA algorithm parameter, depending on data rate. For the evaluation of WBAN CSMA/CA algorithm, we used Castalia. As a result of the simulation, it is found that the proposed system model can not only relieve loads of data processing, but also probability of collision was decreased.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.6
• /
• pp.229-234
• /
• 2007

In the IEEE 802.11 Wireless Local Area Networks (WLANs), network nodes experiencing collisions on the shared channel need to backoff for a random period of time. which is uniformly selected from the Contention Window (CW) This contention window is dynamically controlled by the Binary Exponential Backoff (BEB) algorithm. The BEB scheme suffers from a unfairness problem and low throughput under high traffic load. In this paper, I propose a new backoff algorithm for use with the IEEE 802.11 Distributed Coordination Function.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.14 no.5
• /
• pp.837-844
• /
• 2019

In this paper, we propose the AMBM(: Adaptive Multi-channel Backoff Machisum) -Mac protocol to provide high throughput for non-safety applications in VANET(: Vehicular Ad Hoc Networks) environment. The proposed protocol guarantees the quality of service of non-safety packets by dynamically adjusting CW(: Channel Window) of WSA(: WAVE Service Advertisement) to maximize throughput between non-safety packets of different priority. It also shows that allocating a large amount of time for channel coordination and time slot reservation for SC and dynamically adjusting CW and CCI as nodes increase to reduces transmission delay than IEEE 1609.9, C-MAC(: Coordinated multi-channel MAC, and Q-VCI(: QoS Variable CCH Interval) protocols.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.1
• /
• pp.129-137
• /
• 2010

In this paper, we propose a packet prioritization scheme using preamble signal and backoff time which is designed to provide a differentiated channel occupation with a packet priority in wireless sensor networks. This scheme aims at enabling QoS such as fast delivery of high priority packets by reducing their backoff time as well as thus securing higher channel occupation. We expect that it could also improve the channel utilization of the entire network by avoiding unnecessary channel contention. For the purpose, we add new features of multiple queue and preamble modification to the TinyOS based B-MAC. This scheme achieves 82-88% reduction in delivery time of high priority packets, thus it enables realtime support for urgent applications.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.1656-1660
• /
• 2006

Distributed coordination function(DCF) is the primary random access mechanism of IEEE 802.11, which is the basic protocol of wireless LAN based on the CSMA/CA protocol. It enables fast installation with minimal management and maintenance costs and is a very robust protocol for the best effort service in wireless medium. The current DCF, however, is known to be unsuitable for real-time applications such as voice message transmission. In this paper, we focus on the performance issues of IEEE 802.11 which accommodate the prioritized messages. Existing results use the initial window size and backoff window-increasing factor as tools to handle the priority of the messages. Instead, we introduce a novel scheme which chooses the backoff timer with arbitrary probabilities. By this, one can greatly reduce the backoff delay of the lower priority messages without degrading the performance of higher priority.