• Title/Summary/Keyword: DCF Throughput

Search Result 84, Processing Time 0.03 seconds

Performance Analysis of the IEEE 802.11 Distribution Coordination Function (DCF)

  • Ryou, Myung-Seon;Park, Hong-Seong;Kwon, Wook-Hyun
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.1474-1479
    • /
    • 2003
  • This paper proposes a transmission interval which includes collisions and retransmissions in the IEEE 802.11 DCF. The transmission probability is used for the calculation of collisions and retransmissions in the DCF. Since the noises are considered to analyze the transmission interval, retransmissions by the noises are included in the proposed transmission interval. The proposed transmission interval takes account of the retransmissions by packet errors, and makes it possible to analyze the maximum throughput of the DCF.

  • PDF

Throughput and Delay Analysis of a Reliable Cooperative MAC Protocol in Ad Hoc Networks

  • Jang, Jaeshin;Kim, Sang Wu;Wie, Sunghong
    • Journal of Communications and Networks
    • /
    • v.14 no.5
    • /
    • pp.524-532
    • /
    • 2012
  • In this paper, we present the performance evaluation of the reliable cooperative media access control (RCO-MAC) protocol, which has been proposed in [1] by us in order to enhance system throughput in bad wireless channel environments. The performance of this protocol is evaluated with computer simulation as well as mathematical analysis in this paper. The system throughput, two types of average delays, average channel access delay, and average system delay, which includes the queuing delay in the buffer, are used as performance metrics. In addition, two different traffic models are used for performance evaluation: The saturated traffic model for computing system throughput and average channel access delay, and the exponential data generation model for calculating average system delay. The numerical results show that the RCO-MAC protocol proposed by us provides over 20% more system throughput than the relay distributed coordination function (rDCF) scheme. The numerical results show that the RCO-MAC protocol provides a slightly higher average channel access delay over a greater number of source nodes than the rDCF. This is because a greater number of source nodes provide more opportunities for cooperative request to send (CRTS) frame collisions and because the value of the related retransmission timer is greater in the RCO-MAC protocol than in the rDCF protocol. The numerical results also confirm that the RCO-MAC protocol provides better average system delay over the whole gamut of the number of source nodes than the rDCF protocol.

A DCF Throughput Analysis of the Ideal and Fading Channel in the Wireless LAN (무선 LAN에서 이상 및 페이딩 채널 환경의 DCF 처리율 비교 분석)

  • Lee, Yong-Sik;Lee, Ha-Cheol;Lee, Byung-Ho
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.19 no.7
    • /
    • pp.741-753
    • /
    • 2008
  • This paper explores the throughput performance of CSMA/CA-based DCF protocol over both ideal channels and fading channels with payload size at the MAC layer in the 802.11a wireless LAN. In the ideal channel, there are no errors and at the transmission cycle there is one and only one active station which always has a packet to send and other stations can only accept packets and provide acknowledgements. In the fading channel, bit errors appear in the channel randomly and the number of stations is assumed to be fixed. And each station always has packets for transmission. In other words, we operate in saturation conditions. Up to now conventional research work about DCF throughput analysis of IEEE 802.11 a wireless LAN has been done over the ideal channel, but this paper is done over the Rayleigh/Ricean fading channel. So, the ratio of received average energy per bit-to-noise power spectral density $E_b/N_o$ is set to 25 dB and the ratio of direct-to-diffuse signal power in each sub-channel $\xi$ is set to 6 for combined Rayleigh/Ricean fading channel. In conclusion, it is shown that the saturation throughput is always less than the maximum throughput at all the payload size and the higher the transmission rate be, the higher the decreasing rate of saturation throughput compared to the maximum throughput be.

Modifications of DCF Scheme to Alleviate Jitter Property in WLANs (무선 랜의 지터 성능 개선을 위한 DCF 개선 방안)

  • Kang, Dong-Hun;Seok, Seung-Joon
    • Journal of Internet Computing and Services
    • /
    • v.9 no.5
    • /
    • pp.153-163
    • /
    • 2008
  • Almost literature has so far proposed the modifications to IEEE 802.11 DCF MAC protocol to improve system throughput and average delay. Jitter(variance in packet delays) is, however, considered as an important QoS parameter for real-time streaming service which is popularized increasingly. Unfortunately, legacy access protocol for WLAN can't support the jitter. This paper proposes two schemes modifying the DCF MAC protocol to reduce the average value of jitter for multimedia frames arrived at received nodes. The one scheme, referred to as DCW-DCF(Decreasing Contention Window-DCF), reduces CW(Contention Window) size by half whenever a transmitted frame collided against other frames and back-off happens. Also, it increase initial CW size according as the link utilization and the collision probability increase. The other scheme, referred to as D-DIFS(Differential-DIFS), assigns different values to DIFS. That is, the DIFS interval is deceased as the number of back-off for a frame increases. In this paper, the two schemes are evaluated through simulation using ns2 and simulation results show that the proposed schemes are effective for improving the jitter property of standard WLAN.

  • PDF

Network Coding delay analysis under Dynamic Traffic in DCF without XOR and DCF with XOR (DCF와 DCF with XOR에서 동적인 트래픽 상태에 따른 네트워크 코딩 지연시간 분석)

  • Oh, Ha-Young;Lee, Junjie;Kim, Chong-Kwon
    • Journal of KIISE:Information Networking
    • /
    • v.36 no.3
    • /
    • pp.251-255
    • /
    • 2009
  • Network coding is a promising technology that increases the system throughput via reducing the number of transmission for a packet delivered from the source node to the destination node. Nevertheless, it suffers from the metrics of end-to-end delay. Network Coding scheme takes more processing delay which occurs as coding node encodes (XOR) a certain number of packets that relayed by the coding node, and more queuing delay which occurs as a packet waits for other packets to be encoded with. Therefore, in this paper, we analyze the dependency of the queuing delay to the arrival rate of each packet. In addition, we analyze and compare the delay in DCF without XOR and DCF with XOR under dynamic traffic.

A Dynamic Minimum Contention Window for Collision Resolution in IEEE 802.11 Distributed Coordination Function) (IEEE 802.11 Distributed Coordination Function에서 충돌방지를 위한 동적인 최소 경쟁윈도우의 적용)

  • Woo, Sung-Je;Lee, Tae-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.9A
    • /
    • pp.1075-1082
    • /
    • 2004
  • Wireless LAN is a rather mature communication technology connecting mobile terminals. IEEE 802.11 is a representative protocol among Wireless LAN technologies. The basic medium access control (MAC) mechanism of IEEE 802.11 is called distnbuted coordination function (DCF). DCF shows poor throughput and high drop rate as the number of stations and offered traffic load increase. In this paper we propose an effective mechanism using dynamic mimmum contention window(CWmin) in wireless LAN~ and show that performance improves via simulations. Proposed dynamic CWmin scheme exhibits superior performance as the number of stations and offered load grow. As, our proposed scheme is expected to be more effective in highly densed wireless LAN environment.

Backoff Algorithm to improve DCF functionality in IEEE 802.11 (IEEE 802.11에서 DCF 성능 향상을 위한 백오프 알고리즘)

  • Nam, Jae-Hyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.6
    • /
    • pp.1386-1390
    • /
    • 2011
  • The IEEE 802.11 MAC uses DCF for media access among the participating network nodes. But DCF alone is neither capable nor suitable for fulfilling the QoS requirements of realtime applications. There are many ways in which QoS is provided by modifying DCF based MAC. This paper proposes (m,k)-collision scheme which is based on IEEE 802.11 and (m,k)-firm scheme tries to improve DCF functionality. The proposed scheme uses different Contention Window according to the number of collision in the node. The simulation result shows that the proposed scheme helps improve the throughput of the DCF.

Backoff Algorithm to improve DCF functionality in IEEE 802.11 (IEEE 802.11에서 DCF 성능 향상을 위한 백오프 알고리즘)

  • Nam, Jae-Hyun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2011.05a
    • /
    • pp.796-798
    • /
    • 2011
  • The IEEE 802.11 MAC uses DCF for media access among the participating network nodes. But DCF alone is neither capable nor suitable for fulfilling the QoS requirements of realtime applications. There are many ways in which QoS is provided by modifying DCF based MAC. This paper proposes (m,k)-collision scheme which is based on IEEE 802.11 and (m,k)-firm scheme tries to improve DCF functionality. The proposed scheme uses different Contention Window according to the number of collision in the node. The simulation result shows that the proposed scheme helps improve the throughput of the DCF.

  • PDF

Design and Performance Analysis of an Enhanced MAC Algorithm for the IEEE 802.11 DCF (IEEE 802.11 DCF 성능 개선을 위한 매체접근제어 알고리즘의 설계 및 성능 분석)

  • Hwang, An-Kyu;Lee, Jae-Yong;Kim, Byung-Chul
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.42 no.10 s.340
    • /
    • pp.39-50
    • /
    • 2005
  • In this paper, we propose a performance improving MAC algerian for the IEEE 802.11 DCF. WLAN based IEEE 802.11 uses two control methods called 'Distributed Coordination Function(UF)' and 'Point Coordination Function(PCF)'. The nF controls the Urnsmission based on carrier sense multiple access with collision detection(CSMA/CA), that decides a random backoff time with the range of contention window for each terminal. Normally, each terminal the CW double after collision, and reduces the CW to the minimum after successful transmission. This paper proposes an enhanced DCF algorithm that decreases the CW smoothly after successful transmission in order to reduce the collision Probability by utilizing the current status information of WLAN. We also analyze the throughput and delay performance for the unsaturated case mathematically. Simulation results show that our algorithm enhances the saturation throughput of WLAN. They also coincide well with the analytical results.

THE MAC LAYER PACKET SERVICE TIME DISTRIBUTIONS OF DCF IN THE IEEE 802.11 PROTOCOL

  • Han Dong-Hwan;Park Chul-Geun
    • Journal of applied mathematics & informatics
    • /
    • v.22 no.1_2
    • /
    • pp.501-515
    • /
    • 2006
  • The IEEE 802.11 protocol is the most mature technology for WLANs(Wireless Local Area Networks). However, as the number of stations increases, the delay and throughput performance of IEEE 802.11 MAC(Medium Access Control) degrades severely. In this paper, we present the comprehensive performance analysis of IEEE 802.11 MAC protocol by investigating the MAC layer packet service time when arrival packet sizes have a general probability distribution. We obtain the discrete probability distribution of the MAC layer service time. By using this, we analyze the system throughput and the MAC layer packet service time of IEEE 802.11 MAC protocol in wireless LAN environment. We take some numerical examples for the system throughput and the mean packet service time for several special distributions of arrival packet sizes.