• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.633-636
• /
• 2011

The paper deals with the performance of contention-based medium access control (MAC) protocols for underwater sensor networks. We extensively analyze the number of received-packets and the end-to-end delay of ALOHA, CSMA, CSMA-RTS-CTS and CSMA-RTS-CTS-ACK protocols using a Qualnet underwater network simulator which accommodates diverse underwater acoustic channel environments. Using simulation results, we support an engineering table to determine an adequate contention-based MAC protocol for underwater sensor networks.

• The KIPS Transactions:PartC
• /
• v.12C no.3 s.99
• /
• pp.387-394
• /
• 2005

Every MAC (Medium Access Control) sub-layers of IEEE 802.11x, including IEEE 802.11e, defines Connection-based and CF (Contention Free)-based service functions in common. In this paper, a New-CF method is proposed. In the proposed method, conventional Round Robin method, which is used as a polling method by IEEE 802.11x PCF (Point Coordination Function) or IEE 802.11e HCCA, is modified to give weights to channels with heavier traffic load and to provide those weighted channels with more services. Based on NS-2 simulations, it is verified the proposed method shows better throughput in general, particularly under unbalanced traffic load conditions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.1
• /
• pp.334-349
• /
• 2022

The effectiveness of Wi-Fi networks is greatly influenced by the optimization of contention window (CW) parameters. Unfortunately, the conventional approach employed by IEEE 802.11 wireless networks is not scalable enough to sustain consistent performance for the increasing number of stations. Yet, it is still the default when accessing channels for single-users of 802.11 transmissions. Recently, there has been a spike in attempts to enhance network performance using a machine learning (ML) technique known as reinforcement learning (RL). Its advantage is interacting with the surrounding environment and making decisions based on its own experience. Deep RL (DRL) uses deep neural networks (DNN) to deal with more complex environments (such as continuous state spaces or actions spaces) and to get optimum rewards. As a result, we present a new approach of CW control mechanism, which is termed as contention window threshold (CW_Threshold). It uses the DRL principle to define the threshold value and learn optimal settings under various network scenarios. We demonstrate our proposed method, known as a smart exponential-threshold-linear backoff algorithm with a deep Q-learning network (SETL-DQN). The simulation results show that our proposed SETL-DQN algorithm can effectively improve the throughput and reduce the collision rates.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1B
• /
• pp.42-48
• /
• 2002

In broadband wireless networks, the effective meeting of the QoS guarantees may strongly depend on the Contention Resolution Algorithm used in the uplink contention period. The time it takes a station to transmit a successful request to the base station, or request delay, must be kept low even during periods of high contention. If a request suffers many collisions, it cannot rely on the preemptive scheduler to receive low access delays. However, the conventional collision resolution algorithm has a problem that all collided stations are treated equally regardless of their delay from previous contention periods. Some requests may have very long request delay caused by continuous collisions. In this paper, we propose an adaptive collision resolution algorithm for fast random access in broadband wireless networks. The design goal is to provide quick access to the request with a high number of collisions. To do this, the proposed algorithm separates the whole contention region into multiple sub regions and permits access through each sub region only to the requests with equal number of collisions. The sub region is adaptively created according to the feedback information of previous random access. By simulation, the proposed algorithm can improve the performance in terms of throughput, random delay and complementary distribution of random delay by its ability to isolate higher priorities from lower ones. We can notice the algorithm provides efficiency and random access delay in random access environment.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1996.06a
• /
• pp.293-296
• /
• 1996

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.11
• /
• pp.10-16
• /
• 2003

In this paper, a dynamic contention periods based on the collision group(DCCG) algorithm is proposed for collision resolution in the IEEE 802.16 broadband wireless access network. The DCCG algorithm determines the contention periods according to the a number of collided slot and collided requests to the base station(BS). The DCCG algorithm is useful to improve the performance of throughput and system delay characteristic than binary backoff algorithm.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2009.01a
• /
• pp.289-292
• /
• 2009

IEEE 802.11 WLAN(Wireless LAN)은 효율성과 편리함으로 시장에 급격히 보급되었다. 이 IEEE 802.11 WLAN은 CSMA/CA를 기반으로 하는 DCF방식을 주로 사용하고 있으며, Contention Window, Backoff Size를 이용한 각 단말기들간의 자유 경쟁에 의한 전송 방식을 택하고 있다. 그 주된 방법으로 단말기는 CW를 설정하고 CW범위안에서 랜덤한 값을 정해 Backoff Counter를 줄여 채널을 점유하는 방식이다. DCF방식은 채널을 두고 여러 대의 단말기가 서로 경쟁을 함으로써 채널을 할당 받아 사용하게 된다. 본 논문에서는 이러한 채널 할당시 CW값을 조절하여 다른 단말기보다 채널을 빨리 할당받고 높은 처리량을 나타내는 탐욕적(Greedy) 노드문제에 대해서 분석하는 방법에 대해서 설명하려고 한다.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• pp.307-311
• /
• 2006

Distributed Coordination Function (DCF) in IEEE 802.11 and Enhanced Distributed Channel Access (EDCA) in IEEE 802.11e are contention-based access mechanism in Wireless LAN. Both DCF and EDCA reduce collisions based on inter-frame space (IFS) and backoff mechanisms. However, collisions are unavoidable even with the two mechanisms. Especially, in the EDCA model, the collision can be classified into interclass and intraclass collision. To eliminate interclass collision in Wireless LAN, we propose an interclass collision protection (ICP) scheme by employing contention protection period (CPP) after backoff, Analysis is performed for one dimensional EDCA model and for the proposed ICP based EDCA model.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11B
• /
• pp.974-979
• /
• 2004

In the IEEE 802.1 Ib, DCF provides contention based services and PCF provides contention free services for QoS suppof. DCF uses CSMA/CA (Carrier Sense Multiple Access/collision Avoidance) as an access protocol. In this paper, an enhanced PCF, which gives weights to channels with heavy traffic load, was proposed. The weight is depending on the partial queue length information from STAs. NS-2 simulation results show that the proposed scheme is an promising approach for enhancing the PCF.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.1
• /
• pp.36-42
• /
• 1997

This paper proposes a high-speed contention resolution scheme featuring high flexibility to the bursty traffic for an input buffering ATM switching architecture and its hardware strategy. The scheme is based on the threshold on the occupancy of the input buffer. As the proposed scheme utilizes the threshold, it has high flexibility to the fluctuations of the input traffic. The hardware strategy for the proposed policy is provided with the aim of the simple structure that achieves the reduction of the signal path and the power consumption. The performance on the average buffer size of the proposed policy is performed and compared with the conventional schame under the bursty traffic through both the analysis based on the markov hain and the simulation. The relations among the parameters on the proposed policy is analyzed to improve the performance.