• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.6
• /
• pp.1565-1585
• /
• 2012

The characteristics of ad hoc networks, such as the absence of infrastructure, a dynamic topology, a shared wireless medium and a resource-constrained environment pose various security challenges. Most previous studies focused on the detection of misbehavior after it had occurred. However, in this paper we propose a new way of thinking to evade the occurrence of misbehavior. In our scheme, we firstly present a clustering algorithm that employs a powerful analytic hierarchy process methodology to elect a clusterhead for each cluster. The clusterhead in each cluster is then allowed to assign the backoff values to its members, i.e., originators, rather than permitting the originators to choose the backoff values by themselves. Through this media access control layer misbehavior detection mechanism, the misuse of the backoff in the media access control layer in the 802.11 distributed coordination function can be detected.

• Proceedings of the IEEK Conference
• /
• 2003.11c
• /
• pp.157-163
• /
• 2003

IEEE 802.11a Distributed Coordination Function(DCF) Protocol을 사용하여 Real-Time MultiMedia Data의 전송을 수행할 경우, DCF Protocol의 적합하지 못한 Mechanism에 의하여, Data 전송의 극대화를 이루지 못한다. Retransmission이 반복되는 경우, Binary Slotted Exponential Backoff Mechanism은 거대한 Packet Delay와 Jitter의 원인이 되며 Automatic Repeat Request(ARQ) 방식의 Ack Mechanism은 MultiMedia Data를 전송하기에 적합하지 못하다. 본 논문은 위와 같은 문제점을 해결하기 위하여 Real-Time MultiMedia Data을 주로 전송하는 STA에 따른 Real-Time/Non-Real-Time(RT/NRT) Station(STA)의 구분과 보내고자 하는 Real-Time MultiMedia Data의 Network Traffic Load(The Required Bandwidth)를 고려하여, Modified DCF(mDCF) Protocol의 Modified Backoff(mBackOff), Modified BlockAck(mBlockAck) Mechanism을 제시함으로서, Data 전송의 극대화를 제공하며, 또한 IEEE 802.11a와의 호환성을 제공한다.

• Journal of information and communication convergence engineering
• /
• v.5 no.3
• /
• pp.205-208
• /
• 2007

The IEEE 802.11 is a MAC protocol which has been standardized by IEEE for Wireless Local Area Networks (WLANs). In the IEEE 802.11 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. However, the BEB scheme suffers from a fairness problem; some nodes can achieve significantly larger throughput than others. This paper proposes a new backoff algorithm for the IEEE 802.11 DCF scheme. This algorithm uses the hop count for considering fairness. It causes flows with high hop count to generate short backoff interval than those with low hop count, thus getting high priority. Therefore, when a collision occurs, the modified IEEE 802.11 DCF assigns higher priority to flow to be close to a destination.

• Journal of Communications and Networks
• /
• v.16 no.4
• /
• pp.385-396
• /
• 2014

In this paper, we present a formal method for modeling and checking an enhanced version of the carrier sense multiple access with collision avoidance protocol related to the IEEE 802.11 MAC layer, which has been proposed as the standard protocol for wireless local area networks. We deal mainly with the distributed coordination function (DCF) procedure of this protocol throughout a sequence of transformation steps. First, we use the unified modeling language state machines to thoroughly capture the behavior of wireless stations implementing a DCF, and then translate them into the input language of the UPPAAL model checking tool, which is a network of communicating timed automata. Finally, we proceed by checking of some of the safety and liveness properties, such as deadlock-freedom, using this tool.

• ETRI Journal
• /
• v.37 no.5
• /
• pp.845-855
• /
• 2015

To enable the coexistence of Licensed Assisted Access (LAA) and Wi-Fi in 5 GHz unlicensed bands, a new channel access mechanism is proposed. Accounting for the fairness between LAA and Wi-Fi, the proposed mechanism finds the optimal transmission time ratio by adaptively adjusting the transmission durations for LAA and Wi-Fi. In addition, we propose a new analytical model for the distributed coordination function of IEEE 802.11 through some modifications of conventional analytical models for saturation and non-saturation loads. By computing the activity ratio of Wi-Fi, the proposed analytical model is able to control the time ratio between LAA and Wi-Fi, which is required for practical implementation of the proposed access mechanism. Through numerical simulations, the proposed channel access mechanism is compared with conventional methods in terms of throughput and utility.

• 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 Processing Systems
• /
• v.8 no.4
• /
• pp.739-748
• /
• 2012

We propose an analytic model to compute the station's saturated throughput and packet delay performance of the IEEE 802.11 DCF (Distributed Coordination Function) in which frame transmission error rates in the channel are different from each other. Our analytic model shows that a station experiencing worse frame error rates than the others suffers severe performance degradation below its deserved throughput and delay performance. 802.11 DCF adopts an exponential back-off scheme. When some stations suffer from high frame error rates, their back-off stages should be increased so that others get the benefit from the smaller collision probabilities. This impact is then recursively applied to degrade the performance of the victim stations. In particular, we show that the performance is considerably degraded even if the frame error rate of the victim station satisfies the receiver input level sensitivity that has been specified in the IEEE 802.11 standard. We also verify the analytic results by the OPNET simulations.

• Proceedings of the KAIS Fall Conference
• /
• 2007.11a
• /
• pp.92-94
• /
• 2007

IEEE 802.11 WLAN(Wireless LAN)은 그 편리함과 효율성으로 인하여 수요의 증가 및 기술의 개발이 계속되고 있다. MAC(Medium Access Control)계층 중 기본적인 매체 접근 방식인 DCF(Distributed Coordination Function)는 CSMA/CA 알고리즘을 이용하여 충돌문제를 해결한다. 본 논문에서는 IEEE 802.11 MAC 계층 DCF 방식에서 스테이션간의 충돌확률을 줄이기 위하여 각 스테이션의 경쟁 윈도우 범위 사이에서 임의의 Backoff Time을 설정하는 것에 착안하여 최소 경쟁 윈도우(Minimum Contention Window)의 값이 성능에 어떠한 영향을 미치는가를 시뮬레이션을 이용하여 분석한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.10a
• /
• pp.390-392
• /
• 2015

IEEE 802.11 DCF(Distributed Coordination Function) 프로토콜은 이진 지수 백오프 방식을 사용한다. 단말은 데이터 전송 전에 충돌을 피하기 위해 일정한 시간동안 채널 휴지(Idle)를 기다린다. 데이터 전송이 성공하면 경쟁 윈도우 값을 두 배로 증가시키고 실패하면 최소 값으로 초기화 한다. 이를 통해 DCF는 충돌을 회피하지만 단말의 수가 증가함에 따라 충돌율은 증가하고 전체 네트워크 성능은 저하된다. 본 논문에서는 이 문제를 해결하기 위해 예약 방식을 통한 데이터 전송 방법을 제안한다. 제안된 방법에서 채널 시간을 예약 구간과 경쟁 구간으로 나눈다. 기본적으로 경쟁 구간에서 단말들은 DCF와 마찬가지로 경쟁 방식을 통해 데이터를 전송할 때 예약 구간에 대한 채널 예약을 AP에게 요청한다. 또한 예약 구간에서 데이터를 전송한 단말은 다음 예약 구간에서의 예약을 요청한다. AP는 채널 예약을 수행한다. 채널 예약에 성공한 단말은 예약 구간에서 비경쟁 방법으로 데이터 패킷을 전송한다. 따라서 DCF의 충돌율을 낮추고 전체적인 네트워크 성능을 향상시킨다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.848-851
• /
• 2010

IEEE 802.11 DCF(Distributed Coordination Function)의 성능은 채널에 접근하기 위하여 경쟁하는 단말수에 큰 영향을 받는다. 이에 경쟁하는 단말 수를 예측하기 위하여 많은 방법들이 제안되고 있지만 기존의 방법들은 채널 오류를 고려하지 않고 있다. 따라서 본 논문에서는 기존의 제안된 방법들 중 ARMA(Auto Regressive Moving Average) 필터(Filter)가 적용된 경쟁 단말 수 예측 방법을 수정 및 개선하여 채널 오류를 반영한 단말 수 예측 방법을 제시하였다. 시뮬레이션 결과 제안된 방법은 채널 오류가 존재하는 환경에서 효과적으로 경쟁하는 단말 수를 예측할 수 있음을 확인하였다.