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

Cooperative communications and network coding schemes have been proposed to increase system throughput for ad hoc networks. In this paper, we present throughput and delay analysis of the new network coding-enabled cooperative MAC protocol called NC-MAC, which has been proposed by us in order to significantly enhance system performance. This protocol introduces an approach that can accommodate both cooperative communication and network coding for wireless ad hoc networks by slightly increasing overhead and modifying standards. The protocol's performance is evaluated using mathematical analysis and computer simulation and two performance measures, system throughput and average channel access delay, are used for a performance comparison with previous schemes. It is assumed that all the frames exchanged over a wireless channel are susceptible to transmission errors, which is a new but more reasonable assumption differentiating this research from previous research. Numerical results show this protocol provides significantly enhanced system performance compared with conventional cooperative MAC protocols used in previous research. For instance, system performance is 47% higher using the NC-MAC protocol than when using the rDCF protocol.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.394-396
• /
• 2005

IEEE 802.11를 비롯한 여러 무선 네트워크에서는 multi-rate을 활용한 시스템 성능향상에 관한 연구가 진행되고 있다. 그 중에 한가지 연구결과로 제안된 방법이 rDCF.이다. 만약 Mesh 네트워크에서 rDCF를 동작시킨다면, 시스템 throughput의 증가, Packet delay의 감소와 항께 채널상태에 따라 포워딩 전략을 다르게 함으로써 채널 error의 영향이 줄어들 것으로 기대해 볼 수 있다. 하지만 기존의 rDCF를 아무런 revision 없이 Mesh 네트워크에 적용하기에는 spatial reuse 측면에서 비효율적이다. Mesh 네트워크에서는 외부 네트워크와 access point 지점이 되는 portal쪽으로 traffic이 집중되는 것이 일반적이므로 portal에 가까울수록 traffic간의 contention도 가중되므로 시스템 전체 성능에 영향을 미치게 된다. 이러한 문제를 줄이기 위하여 무선 네트워크 환경에서 spatial reuse 측면을 향상시킴으로써 동시에 진행되는 communication 수를 늘리는 방법이 있다. 그러므로 본 논문에서 rDCF의 spatial reuse를 늘임으로써 좀더 Mesh Network위에서도 효율적으로 작동할 수 있는 기법을 제시하고자 한다.

• Proceedings of the IEEK Conference
• /
• 2003.11c
• /
• pp.191-194
• /
• 2003

In IEEE 802.11b, Medium Access Control Sublayer consists of DCF (Distributed Coordination Function) and PCF (Point Coordination Function). DCF provides contention based services and PCF provides contention free services for QoS satisfaction. DCF uses CSMA/CA (Carrier Sense Multiple Access/Collision Avoidance) as an access protocol. And PCF uses Polling Scheme. In this paper, a modified New-PCF, which gives weights to channels with heavier traffic load, was suggested. NS-2 simulations were conducted to compare the service performances with original DCF, PCF and the modified New-PCF respectively. Simulation results has shown the increased overall throughput with the proposed New-PCF compared with other cases.

• The Journal of the Korea Contents Association
• /
• v.11 no.11
• /
• pp.34-41
• /
• 2011

The MAC of IEEE 802.11 WLAN to control data transmission uses two control methods called DCF and PCF. The DCF uses BEB backoff algorithm based on CSMA/CA. The BEB backoff algorithm shows excellent performance relatively in situation that competition between stations is less, but its performance is decreases as the competition increases. This paper proposes and analyses mathematically an enhanced backoff algorithm. To reduce the collision probability, the proposed algorithm increases the contention window to maximum after collision and decreases the contention window smoothly after successful transmission. To prove efficiency of proposed algorithm, simulations are conducted and analyzed.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.2
• /
• pp.261-266
• /
• 2009

We analyze the performances of the DCF, which is the medium access control protocol of IEEE 802.11 WLAN, assuming normal traffic condition. There have been much less research efforts under the normal condition than those under the saturated one. This paper proposes an analytical method of approximating the transmission attempt rate under normal condition as proportional to that under saturated condition. In result, we show that we can obtain the transmission attempt rate and the packet collision probability which quickly converge using iterative computations of relatively simple equations, and using these results we derive the network throughput and medium access delay. Numerical results show that our method is much less complex than those based on the Markov Chain while it can predict the performances quite accurately.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.11
• /
• pp.1001-1011
• /
• 2012

In this paper, the effects to system performance are evaluated in IEEE 802.11 system when the number of competing terminals are estimated and reflected to the system. The IEEE 802.11 system uses DCF (Distributed Coordination Function) for the multiple access method, and the system throughput performance depends on the accuracy of the estimated number of competing terminals. We propose extended H infinity filter (EHIF) approach which does not require the noise information for estimating the number of competing terminals. Simulation results show that EHIF outperforms the extended Kalman filter in both saturated and non-saturated network conditions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3446-3464
• /
• 2017

Backoff mechanism serves as one of the key technologies in the MAC-layer of wireless mobile networks. The traditional Binary Exponential Backoff (BEB) mechanism in IEEE 802.11 Distributed Coordination Function (DCF) and other existing backoff mechanisms poses several performance issues. For instance, the Contention Window (CW) oscillations occur frequently; a low delay QoS guarantee cannot be provided for real-time transmission, and services with different priorities are not differentiated. For these problems, we present a novel Multi-Priority service differentiated and Adaptive Backoff (MPAB) algorithm over IEEE 802.11 DCF for wireless mobile networks in this paper. In this algorithm, the backoff stage is chosen adaptively according to the channel status and traffic priority, and the forwarding and receding transition probability between the adjacent backoff stages for different priority traffic can be controlled and adjusted for demands at any time. We further employ the 2-dimensional Markov chain model to analyze the algorithm, and derive the analytical expressions of the saturation throughput and average medium access delay. Both the accuracy of the expressions and the algorithm performance are verified through simulations. The results show that the performance of the MPAB algorithm can offer a higher throughput and lower delay than the BEB algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.4 s.36
• /
• pp.249-257
• /
• 2005

A Markov model for the IEEE 802.11 standard which is the most widely deployed wireless LAN protocol, is designed and the channel throughput is evaluated. The DCF of 802.11, which is based on CSMA/CA protocol, coordinates transmissions onto the shared communication channel. In this paper, under a finite load traffic condition and the assumption of packet loss after the final backoff stage. We present an algorithm to find the transmission probability and derive the formula for the channel throughput. The proposed model is validated through simulation and is compared with the case without packet losses.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.6
• /
• pp.307-315
• /
• 2010

Although a substantial amount of studies have been carried out in order to improve the performance of IEEE 802.11, most of them focused on how to slowly decrease the Contention Window size, instead of resetting it to its initial value. Slow decreasing of the window size reduces the collision probability and increases the channel throughput. Therefore, it is difficult to achieve good results in a heterogeneous network which coexists with the original DCF. For instance, a Gentle DCF(GDCF) has good performance in a homogeneous environment, while it can hardly transmit frames in a heterogeneous environment including the original DCF. It is because the slow decreasing of the window size reduces the transmission probability. In this paper, we propose a Fast Recovery DCF(FRDCF) to solve this problem. In the FRDCF, the reset mechanism of the original DCF is maintained to keep the transmission probability high, while a new counter is used to enhance the performance of the wireless LAN. We prove that, compared with the GDCF, the FRDCF has better performance in a heterogeneous wireless LAN.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.61-62
• /
• 2006

In this paper, using Bianchi's model with channel idle probability we analyze performance of power management scheme of IEEE 802.11 DCF according to ATIM window size and number of nodes for wireless ad hoc networks. The analytical results show that, when the number of nodes is given, the selected ATIM window size limits the performance.