• Proceedings of the IEEK Conference
• /
• 2004.08c
• /
• pp.681-685
• /
• 2004

Design of efficient Medium Access Control (MAC) protocols with both high throughput performances is a major focus in distributed contention-based MAC protocol research. In this paper, we propose an efficient contention-based MAC protocol for wireless Local Area Networks, namely, the Developed Collision Resolution (DCR) algorithm. This algorithm is developed based on the following innovative ideas: to speed up the collision resolution, we actively redistribute the backoff timers for all active nodes; to reduce the average number of idle slots, we use smaller contention window sizes for nodes with successful packet transmissions and reduce the backoff timers exponentially fast when a fixed number of consecutive idle slots are detected. We show that the proposed DCR algorithm provides high throughput performance and low latency in wireless LANs.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.34 no.3
• /
• pp.137-153
• /
• 2009

In this paper, we present an analytic model that evaluates the performance of B-MAC protocol under contention transmission conditions of two senders in a single-hop wireless sensor network. Our model considers the impact of several important factors such as sleep cycle, the backoff mechanism and incoming traffic loads. After obtaining the service delay distribution of a sending node and expected delay of a receiving node, an iterative algorithm is presented for calculating the performance measures such as expected energy consumption usage per packet and latency. Simulation results show that the proposed analytic model can accurately estimate the performance measures under different traffic conditions.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06d
• /
• pp.246-248
• /
• 2012

In this paper, we recommend some game theoretical schemes try to get reliability transmission and resource allocation of the contention free period in overlapped WBAN(Wireless Body Area Net works) environment. Cooperative bargaining game is considered to guarantee a reliability conflict-free transmission. We study it by considering the priorty of device and the demand number of allocated timeslots in the CFP (Contention Free Period), and guarantee the least requested timeslots through bargaining between each user.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.12A
• /
• pp.1285-1290
• /
• 2004

In this paper, a new algorithm for contention resolution in optical burst switched network is proposed and simulated. The proposed algorithm is made from the all mixing of wavelength conversion, deflection routing, segmentation, and optical fiber delay line buffering. We analysis the performance of the proposed contention resolution algorithm by using ns-2. The application of the algorithm into Korea backbone network shows the superior performance of a low burst loss probability.

• Journal of Electrical Engineering and information Science
• /
• v.3 no.1
• /
• pp.28-35
• /
• 1998

In this paper, an NxN input-buffered crosspoint packet switch which selects a Head of the Line, HOL, packet in contention randomly is analyzed with a new approach. The approach is based on both a Markov chain representation of the input buffer and the probability that a HOL packet is successfully served. The probability as a function of N is derived, and it makes it possible to express the average packet delay and the average number of packets in the buffer as a function of N. The contention resolution policy based on the occupancy of the input buffer is also presented and analyzed with this same approach and the relationship between two selection policies is analyzed in terms of the occupancy of the input buffer.

• ETRI Journal
• /
• v.31 no.1
• /
• pp.31-41
• /
• 2009

Optical burst switching is a promising switching paradigm for the next IP-over-optical network backbones. However, its burst loss performance is greatly affected by burst contention. Several methods have been proposed to address this problem, some of them requiring the network to be flooded by frequent state dissemination signaling messages. In this work, we present a traffic engineering approach for path selection with the objective of minimizing contention using only topological information. The main idea is to balance the traffic across the network to reduce congestion without incurring link state dissemination protocol penalties. We propose and evaluate two path selection strategies that clearly outperform shortest path routing. The proposed path selection strategies can be used in combination with other contention resolution methods to achieve higher levels of performance and support the network reaching stability when it is pushed under stringent working conditions. Results show that the network connectivity is an important parameter to consider.

• Proceedings of the KAIS Fall Conference
• /
• 2008.11a
• /
• pp.304-306
• /
• 2008

CSMA/CA를 기반으로 하는 IEEE 802.11 무선랜의 MAC에서는 데이터 전송을 제어하기 위한 방법으로 DCF와 PCF를 사용한다. CSMA/CA는 스테이션간의 충돌을 줄이기 위해서 임의의 백오프 시간을 각 스테이션의 경쟁윈도우(Contention Window) 범위에서 결정한다. 스테이션은 패킷 전송 후 충돌이 발생하면, 윈도우 크기를 두 배로 증가시키며, 패킷을 성공적으로 전송하면 윈도우 크기를 최소 경쟁 윈도우(Minimum Contention Window)로 감소한다. DCF는 경쟁 스테이션이 적은 상황에서는 비교적 우수한 성능을 보이나 경쟁 스테이션의 수가 많은 경우 처리율, 패킷지연 관점에서 성능이 저하되는 문제점이 있다. 본 논문에서는 IEEE 802.11 MAC 계층 DCF 방식에서 최소 경쟁 윈도우의 값이 포화수율 및 패킷지연에 미치는 영향을 시뮬레이션에 의해 분석한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2017.11a
• /
• pp.131-132
• /
• 2017

CSMA/CA 기반 무선 네트워크에서 장치들은 패킷 충돌을 회피하기 위해 무선 채널을 타 장치가 사용 중인 것을 감지하면 데이터를 전송하지 않고 대기 (Backoff) 한다. 이 Backoff는 Contention Window (CW) 의 크기를 변경하고 Backoff 시간은 이 CW의 크기에 따라 확률적으로 결정된다. 따라서 CW의 크기는 무선 네트워크의 상태를 나타내는 중요한 지표가 될 수 있다. 본 논문에서는 상대적으로 넓은 공간에서 IEEE 802.11a 무선네트워크의 Access Point와 사용자들이 Poisson point process (PPP)를 기반으로 분포되어 Hidden Terminal이 존재할 수 있는 상황에서 CW의 크기 변화를 시뮬레이션을 통해 분석한다.

• Journal of Communications and Networks
• /
• v.15 no.6
• /
• pp.606-613
• /
• 2013

This paper proposes a complete solution of a contention-based medium access control in wireless local networks to provide station level quality of service guarantees in both downstream and upstream directions. The solution, based on the mature distributed coordination function protocol, includes a new fixed contention window backoff scheme, a tuning procedure to derive the optimal parameters, a super mode to mitigate the downstream bottleneck at the access point, and a simple admission control algorithm. The proposed system guarantees that the probability of the delay bound violation is below a predefined threshold. In addition, high channel utilization can be achieved at the same time. The numerical results show that the system has advantages over the traditional binary exponential backoff scheme, including efficiency and easy configuration.

• Journal of information and communication convergence engineering
• /
• v.5 no.1
• /
• pp.29-34
• /
• 2007

This paper proposes a MAC protocol for real-time VBR (rt-VBR) services in wireless ATM networks. The proposed protocol is characterized by a contention-based mechanism of the reservation request, a contention-free polling scheme for transferring the dynamic parameters, and a priority scheme of the slot allocation. The design objective of the proposed protocol is to guarantee the real-time constraint of rt-VBR traffic. The scheduling algorithm uses a priority scheme based on the maximum cell transfer delay parameter. The wireless terminal establishes an rt-VBR connection to the base station with a contention-based scheme. The base station scheduler allocates a dynamic parameter minislot to the wireless terminal for transferring the residual lifetime and the number of requesting slots as the dynamic parameters. Based on the received dynamic parameters, the scheduler allocates the uplink slots to the wireless terminal with the most stringent delay requirement. The simulation results show that the proposed protocol can guarantee the delay constraint of rt-VBR services along with its cell loss rate significantly reduced.