• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.240-242
• /
• 2007

The game theoretic analysis in wireless networks can be classified into the jamming game of the physical layer, the multiple access game of the medium access layer, the forwarder's dilemma and joint packet forwarding game of the network layer, and etc. In this paper, the game theoretic analysis about the multiple access game that selfish nodes exist in the IEEE 802.11 DCF(Distributed Coordination Function) wireless networks is addressed. In this' wireless networks, the modeling of the CSMA/CA protocol based DCF, the utility or payoff function calculation of the game, the system optimization (using optimization theory or convex optimization), and selection of Pareto-optimality and Nash Equilibrium in game strategies are the important elements for analyzing how nodes are operated in the steady state of system. Finally, the main issues about the game theory in the wireless network are introduced.

• Journal of Digital Contents Society
• /
• v.9 no.1
• /
• pp.61-67
• /
• 2008

In this paper, MAC algorithm for the IEEE 802.11 DCF improving the performance is proposed and analyzed by simulation. The MAC of IEEE 802.11 WLAN to control data transmission uses two control methods called DCF(Distributed Coordination Function) and PCF(Point Coordination Function). The DCF controls the transmission based on CSMA/CA(Carrier Sense Multiple Access with Collision Avoidance), that decides a random backoff time with the range of CW(Contention Window) for each station. Normally, each station increase the CW to double after collision, and reduces the CW to the minimum after successful transmission. The DCF shows excellent performance relatively in situation that competition station is less but has a problem that performance is fallen from throughput and delay viewpoint in situation that competition station is increased. This paper proposes an enhanced DCF algorithm that increases the CW to maximal CW after collision and decreases the CW smoothly after successful transmission in order to reduce the collision probability by utilizing the current status information of WLAN. To prove efficiency of proposed algorithm, a lots of simulations are conducted and analyzed.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.11a
• /
• pp.203-206
• /
• 2014

무선 LAN(Wireless Local Area Networks 의 DCF(Distributed Coordination Function) 방식은 랜덤 백 오프 방식으로 매체에 접근하기 때문에 지연이 발생하여 정해진 시간 내에 전송을 보장할 수 없다는 단점이 있다. [1] 이는 곧 실시간 멀티미디어 트래픽(비디오, 음성 등)의 QoS(Quality Of Service)를 보장할 수 없다는 것을 뜻한다. 또한 IEEF 802.11e 표준 [2]에서 제공하는 QoS 를 위한 EDCA(Enhanced Distributed Channel Access)라는 프로토콜은 제시되어있으나 실제로 구현되어있는 디바이스의 부재로 QoS 를 지원하기가 어렵다. 따라서 무선 랜에서 IEEE 802.11e 를 지원하지 않는 망내 디바이스, 즉 큐가 1 개인 STA, 즉 기본적인 802.11 표준 기술인 DCF 를 사용하는 STA 을 위해서 멀티미디어 트래픽의 실시간 전송을 보장하기 위한 기법을 제시한다.

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

최근 무선 네트워킹 장치들이 등장 하면서 제한된 배터리에 의존하는 무선 호스트들의 전력 절감은 중요한 이슈가 되었다. 특히 Ad­Hoc에서 배터리는 제한된 에너지를 제공하기 때문에 무선 호스트에 의해서 소모되어지는 에너지의 양을 감소시키기 위한 기술은 대단히 중요하다. 특히 MAC 과 라우팅 에서 전력 절감을 이루기 위한 논문들이 기존에 발표 되었다. 이 논문에서는 IEEE 802.11 표준의 DCF (Distributed Coordination Function) 에서의 전력 절감 메카니즘을 향상 시킨 논문 이다. DCF를 위한 IEEE 802.11 전력 절감 메카니즘에서는 비콘 간격 이라는 시간으로 나누어지며 또한 이러한 각각의 비콘 간격이 시작될 때 각각의 노드들은 ATIM 창 동안 깨어 있어야 한다. 물론 모든 노드는 같은 시간에 깨어 있기 위해서는 동기화 되는 것이 필요하다. ATIM 창 동안 노드들은 비콘 기간 동안 깨어 있는 상태로 있을 것인지를 결정하기 위해서 control packet을 교환 한다. 이러한 ATIM 창 크기는 각각의 노드들의 전력절감에 상당한 영향을 미친다. 따라서 이 논문은 ATIM 창 크기를 동적으로 증감시켜서 보다 에너지 효율을 발휘 하고자 하는 논문이다.

• Journal of information and communication convergence engineering
• /
• v.6 no.2
• /
• pp.228-232
• /
• 2008

In recent years, wireless ad hoc networks have become increasingly popular in both military and civilian applications due to their capability of building networks without the need for a pre-existing infrastructure. Recently, IEEE 802.11 Task Group e has been working on a new mechanism, the Enhanced Distributed Coordination Function (EDCF), to enhance the performance of 802.11 DCF. However, EDCF only reduces the internal collisions within a station, and external collisions between stations remain high in ad-hoc networks. In this paper, we propose to adopt an adaptive backoff window control technique, based on a dynamic value of the initial value of the range in which the backoff is chosen, so the backoff timer is randomly chosen in the range (InitRng, CW-1). We use ns-2 simulation to evaluate the throughput of our scheme. Results show that the throughput is improved for our scheme compared to the original DCF due to the reduced the number of collisions.

• Journal of Communications and Networks
• /
• v.16 no.3
• /
• pp.311-321
• /
• 2014

This paper focuses on contention-based medium access control (MAC) protocols used in wireless local area networks. We propose a novel MAC protocol called adaptive backoff tuning MAC (ABTMAC) based on IEEE 802.11 distributed coordination function (DCF). In our proposed MAC protocol, we utilize a fixed transmission attempt rate and each node dynamically adjusts its backoff window size considering the current network status. We determined the appropriate transmission attempt rate for both cases where the request-to-send/clear-to-send mechanism was and was not employed. Robustness against performance degradation caused by the difference between desired and actual values of the attempt rate parameter is considered when setting it. The performance of the protocol is evaluated analytically and through simulations. These results indicate that a wireless network utilizing ABTMAC performs better than one using IEEE 802.11 DCF.

• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.12
• /
• pp.4389-4410
• /
• 2014

Network coding is a promising technology that increases system throughput by reducing the number of packet transmissions from the source node to the destination node in a saturated traffic scenario. Nevertheless, some packets can suffer from end-to-end delay, because of a queuing delay in an intermediate node waiting for other packets to be encoded with exclusive or (XOR). In this paper, we analyze the delay according to packet arrival rate and propose two network coding schemes, iXOR (Intelligent XOR) and oXOR (Optimal XOR) with Markov Decision Process (MDP). They reduce the average delay, even under an unsaturated traffic load, through the Holding-${\chi}$ strategy. In particular, we are interested in the unsaturated network scenario. The unsaturated network is more practical because, in a real wireless network, nodes do not always have packets waiting to be sent. Through analysis and extensive simulations, we show that iXOR and oXOR are better than the Distributed Coordination Function (DCF) without XOR (the general forwarding scheme) and XOR with DCF with respect to average delay as well as delivery ratio.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10d
• /
• pp.232-235
• /
• 2006

일반적으로 선형 토폴로지 (chain topology) 무선메쉬네트워크의 종단간 최대 전송률은 경쟁관계 그래프 (contention graph)에 기반하여 트래픽 병목 구간의 노드 개수와 1 홉 링크의 평균 전송률을 결정하여 계산하는 방식이 널리 이용된다. 본 논문은 평균을 이용한 방법은 IEEE 802.11 DCF (Distributed Coordination Function)를 MAC 프로토콜로서 사용하는 무선메쉬네트워크에서 정확성에 한계가 있음을 보이며, 이와 같은 정확성의 한계를 유도하는 인자로서 전송률의 편차를 소개한다. 또한 전송률 편차를 고려하여, 단일 선형 토폴로지에서 종단간 최대 전송률을 구하는 방법을 ns2 시뮬레이션을 통해 검증한다.

• Proceedings of the KAIS Fall Conference
• /
• 2009.05a
• /
• pp.429-432
• /
• 2009

본 논문에서는 IEEE 802.11 WLAN(Wireless LAN)에서 기본 액세스 방식인 DCF(Distributed Coordination Function)의 성능을 높이기 위하여 개선된 알고리즘을 제안한다. CDMA/CA(Carrier Sense Multiple Access with Collision Avoidance)기반인 DCF는 스테이션의 적은 상황에서는 비교적 우수한 성능을 나타내지만 스테이션이 많은 혼잡상황에서는 처리율, 지연율, 충돌률 관점에서 성능이 큰 폭으로 저하된다. 본 논문에서는 패킷 전송 후 충돌이 발생하면 CW(Contention Window)를 4배 증가 시켜주고 패킷의 전송이 성공 시에는 CW를 서서히 줄여주어 연쇄적인 충돌과 잠재적인 충돌을 미연에 방지함으로써 패킷 충돌의 확률을 낮추어 주는 알고리즘을 제안하고 시뮬레이션을 이용하여 성능을 입증한다.