• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.8A
• /
• pp.928-936
• /
• 2004

This paper proposes simple and effective Contention Window (CW) adjusting algorithm to solve the fairness problem of the IEEE 802.11 under the Distributed Coordination Function (DCF). This adjusting algorithm can support variable packet length as well as both RTS/CTS access method and hidden nodes. Simulation results show that fairness problem can be very severe in the original MAC protocol of the wireless network. In case of implement our algorithm, fair sharing was enlarged prominently and the fairness sharing was improved about maximum 30%.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.3
• /
• pp.534-541
• /
• 2018

The number of stations existing in the same wireless channel is increasing due to the spread of the wireless LAN devices. CSMA/CA, a conventional wireless LAN protocol, uses a random backoff method. In the random backoff scheme, collision between stations is frequent in a dense region where the number of stations existing in the same channel is several tens or more, and the performance of the performance degradation of such a protocol, the IEEE 802.11ah standard proposed a Restricted Access Window(RAW) wireless access method. RAW improves performance by limiting the number of concurrent access stations by dividing the stations into several groups. In this paper, we propose a method to improve the performance of channel connection by using new group creation, group removal and group relocation algorithm according to traffic change by improving existing RAW method.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.8
• /
• pp.9-18
• /
• 2004

The IEEE 802.11 Distributed Coordination Function(DCF) protocol provides a contention-based distribution channel access mechanism for stations to share the wireless medium. However, the performance of the DCF drops dramatically in terms of throughput, delay and delay jitter as the number of active stations becomes large. In this paper, we propose a simple and effective scheme, called DCF/VG(Distributed Coordination Function with Virtual Group), for improving the performance of the IEEE 802.11 DCF mechanism. In this scheme, each station independently decides the virtual group cycle using the information provided by the carrier sensing mechanism. The virtual group cycle consists of one or more virtual groups and a virtual group includes an idle period and a busy period. Each station operates in only one out of several virtual groups of the virtual group cycle and does not operate in the others. In other words, each station decreases its backoff counter and tries to transmit a packet only in its virtual group like the IEEE 802.11 DCF. Performance of the proposed scheme is investigated by numerical analysis and simulation. Numerical and simulation results show that the proposed scheme is very effective and has high throughput and low delay and jitter under a wide range of contention level.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.4
• /
• pp.53-63
• /
• 2008

Reader collision may occur when neighboring RFID readers use the same channel at the same time. Especially when the readers are operated in dense mode, even though many channels are available, because of frequent reader collisions we can not guarantee the performance of RFID readers. Conventional solutions such as FH(Frequency Hopping) or LBT(Listen Before Talk) are not effective in this situation because they can not schedule RFID readers effectively when RFID readers are operated in multi-channel, dense reader mode, In this paper, we propose a new RFID reader anti-collision algorithm which employs LBT, random backoff before channel access, and probabilistic channel hopping at the same time. While LBT and Random backoff before channel access reduces collisions between competing readers, probabilistic channel hopping increases channel utilization by adaptively changing the hopping probability by reflecting the reader density and utilization. Simulation results shows that our algorithm outperforms conventional methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.3A
• /
• pp.267-277
• /
• 2011

Like other wireless network protocols, IEEE 802.15.4 adopts CA (Collision Avoidance)algorithm to avoid the early collision of a new packet by randomizing its first transmission time rather than its immediate delivery. The traditional CA scheme of IEEE 802.15.4, however, selects the random access time from the predetermined range without considering the degree of current congestion. It probably causes either a long delay to settle in the suitable range for the current network load or frequent clashes especially during the long lasting heavy traffic period. This paper proposes an ACA(Adaptive Collision Avoidance) algorithm adapting the initial backoff range to the undergoing collision variations. It also introduces a mathematical model to predict the performance of ACA algorithm added to IEEE 802.15.4. With only small deviations from corresponding simulations, our analytical model shows that ACA technique can improve the throughput of IEEE 802.15.4 by up-to 41% maximally in addition to shortening the packet delays.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.34 no.3
• /
• pp.137-153
• /
• 2009

In this paper, we present an analytic model that evaluates the performance of B-MAC protocol under contention transmission conditions of two senders in a single-hop wireless sensor network. Our model considers the impact of several important factors such as sleep cycle, the backoff mechanism and incoming traffic loads. After obtaining the service delay distribution of a sending node and expected delay of a receiving node, an iterative algorithm is presented for calculating the performance measures such as expected energy consumption usage per packet and latency. Simulation results show that the proposed analytic model can accurately estimate the performance measures under different traffic conditions.

• Journal of information and communication convergence engineering
• /
• v.15 no.1
• /
• pp.28-36
• /
• 2017

The medium access control (MAC) protocol based on dynamic time division multiple access/time division duplex (TDMA/TDD) is responsible for random access control and radio resource allocation in dynamic traffic environments. These functions of random access and resource allocation are very important to prevent wastage of resources and improve MAC performance according to various network conditions. In this paper, we propose new random access and resource allocation schemes to guarantee quality of service (QoS) and provide priority services in a dynamic TDMA/TDD system. First, for the QoS guarantee, we propose an adaptive random access and resource allocation scheme by introducing an access probability. Second, for providing priority service, we propose a priority-based random access and resource allocation scheme by extending the first adaptive scheme in both a centralized and a distributed manner. The analysis and simulation results show that the proposed MAC protocol outperforms the legacy MAC protocol using a simple binary exponential backoff algorithm, and provides good differential performance according to priorities with respect to the throughput and delay.

• Journal of Digital Contents Society
• /
• v.9 no.4
• /
• pp.679-686
• /
• 2008

Wireless LAN(WLAN) is a rather mature communication technology connecting mobile terminals. IEEE 802.11 is a representative protocol among WLAN technologies. With the rising popularity of delay-sensitive real-time multimedia applications(video, voice and data) in IEEE 802.11 wireless LAN, it is important to study the MAC layer delay performance of WLANs. In this paper, performance for packet delay model that recently have been proposed schemes is analysed in wireless LAN and proved performance results via simulation.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.28 no.1
• /
• pp.129-133
• /
• 2005

Slotted ALOHA(S-ALOHA) is widely used in local wireless network. We analyze the performance of contention-based model in wireless LAN using S-ALOHA protocol. We analyze the performance of binary exponential backoff (BEB) algorithm under the slotted ALOHA protocol: whenever a node's message which tries to reserve a channel is involved in a collision for the ith time, it chooses one of the next $2^i$ frames with equal probability and attempts the reservation again. We derive the expected access delay and throughput which is defined as the expected number of messages that reserve a channel in a frame. A simulation study is performed to verify our method.

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