• The KIPS Transactions:PartC
• /
• v.14C no.6
• /
• pp.475-480
• /
• 2007

Recently, wireless networking devices that depend on the limited Battery and power-saving of wireless hosts became important issue. Batteries can provide a finite amount of energy, therefore, to increase battery lifetime, it is important to design techniques to reduce energy consumption by wireless hosts. This paper improved power saying mechanism in Distributed Coordination Function(DCF) of IEEE 802.11. In the IEEE 802.11 power saving mechanism specified for DCF, time is divided into so-called beacon intervals. At the start of each beacon interval, each node in the power saving mode periodically wakes up during duration called the ATIM Window. The nodes are required to be synchronized to ensure that all nodes wake up at the same time. During the ATIM window, the nodes exchange control packets to determine whether they need to stay awake for the rest of the beacon interval. The size of the ATIM window has considerably affected power-saving. This paper can provide more power-saving than IEEE 802.11 power saving mode because ATIM window size is efficiently increased or decreased.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.8A
• /
• pp.600-609
• /
• 2009

The traditional carrier sense multiple access (CSMA) protocol like IEEE 802.11 Distributed Coordination Function (DCF) does not handle the constraints adequately, leading to degraded delay latency and throughput as the network scales are enlarged. We present more efficient method of a medium access for real-time wireless sensor networks. Proposed MAC protocol is like the randomized CSMA protocol, but unlike previous legacy protocols, it does not use a time-varying contention window from which a node randomly picks a transmission slot. To reduce the latency for the delivery of event reports, we carefully decide to select a fixed-size contention window with non-uniform probability distribution of transmitting in each slot. We show that the proposed method can offer up to severaansimes latency reduction compared to legacy of IEEE 802.11 as the size of the sensor network scales up to 256 nodes using widely using network simulation package,caS-2. We finally show that proposed MAC scheme comes close to meet bounds on the best latency being achieved by a decentralized CSMA-based MAC protocol for real-time wireless sensor networks which is sensitive to delay latency.

• 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 Korea Information Processing Society Conference
• /
• 2015.10a
• /
• pp.390-392
• /
• 2015

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

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.8 no.6
• /
• pp.1410-1418
• /
• 2007

This paper analyzes the throughput of DCF protocol at the MAC layer in the 802.11a wireless LAN. The throughput of DCF protocol is related on probability of backoff, depends on retransmission of each terminal. This paper applied to nonmarcov discrete model for each terminal BER in the base station versus the packet throughput is progressing with the data rate of 6,12,24,54 Mbps, We find the fact that the less the data rate be the higher the throughput. We also find from the throughput calculation by means of traffic intensity in OFDM wireless LAN.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5A
• /
• pp.460-466
• /
• 2007

There are two coordination functions in IEEE 802.11 standard. One is PCF, polling based function, and the other is DCF, contention based function. DCF is simpler than PCF but the performance is similar with the latter. That's the reason why DCF is more popular than PCF. However, DCF has a risk of collision with other nodes in the network because the function is a distributed contention based one. CSMA/CA of DCF has collision avoidance algorithm in it, but the performance of avoidance algorithm has limitations. In this paper we proposed a new scheme called TAR(Tone-based Access scheme with Repetitive conention). In TAR, there is narrow contention-only channel other than original data transmitting channel, so that both a data transmission and the contention can be performed simultaneously. The TAR uses the same contention concept with the CSMA/CA, but it has the originality for the narrow contention channel and the repetitive contention scheme which greatly reduce the collision probability. We proved the performance of TAR by some simulations, and it showed good results.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.52 no.8
• /
• pp.492-499
• /
• 2003

This paper presents the analysis and the implementation of the asynchronous communication portion of the IEEE 802.11 MAC protocol. We have used PRISM2 chipsets from INTERSIL to build baseband, IF, and RF parts and PCI controller from PLX to interface LLC Layer. We have implemented DCF(Distributed Coordination Function) service using CSMA/CA(Carrier Sense Multiple Access with Collision Acoidance) with backoff algorithm and RTS/CTS protocol. Also, we have implemented TSF(Timing Synchronization Function) which can be used for power management frequency hop synchronization, and other management function. This study can be used as a reference for the MAC protocol implementation and MAC controller design in very high speed wireless LAN which complies with the IEEE 802.11 standard.

• Journal of Korea Multimedia Society
• /
• v.8 no.4
• /
• pp.509-515
• /
• 2005

This paper explores the throughput of DCF protocol with both the traffic intensity and MSDU size at the MAC layer in the 802.11a wireless LAN. By exploring the throughput of DCF protocol with the data rate of 6Mbps, 12 Mbps, 24 Mbps and 54 Mbps, we find the fact that the less the data rate be, the higher the throughput be. We also find, from the throughput calculation by means of traffic intensity and MSDU size, that the longer the MSDU size is, the higher the throughput is. We also found the traffic intensity that the throughput is at the maximum point with the fixed MSDU size.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.9A
• /
• pp.803-813
• /
• 2005

This paper explores the throughput performance of CSMA/CA-based DCF protocol over frequency-selective, slow Ricean fading channels with both the $E_{b}/N_{o}$ and BER at the MAC layer in the 802.1 la wireless LAN. By exploring the throughput of DCF protocol with the data rate of 6Mbps, 12 Mbps, 24 Mbps and 54 Mbps, we find the fact that the higher the $E_{b}/N_{o}$ be and the less the BER be, the higher the throughput be.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.12
• /
• pp.2159-2166
• /
• 2016

In the IEEE 802.11 DCF (Distributed Coordination Function) protocol, the binary exponential backoff algorithm is used to avoid data collisions. However, as the number of stations increases of, the collision probability tends to grow and the overall network performance is reduced. To solve this problem, this paper proposes a data transmission scheme based on the channel reservation method. In the proposed scheme, channel time is divided into reservation period and contention period. During the reservation period, stations succeeded in channel reservation transmit their own data packets in sequence without contention. During the contention period, each station sends its data packets through contentions as in DCF. During both the reservation period and the contention period, each station sends a request for channel reservation for the next reservation period to an AP (Access Point). After receiving such a channel reservation request from each station, the AP decides whether the reservation is succeeded and sends the result via a beacon frame to each station. Performance of the proposed scheme is analyzed through simulations. The simulation results show that the proposed scheme tends to reduce the collision probability of DCF and to improve the overall network performance.