• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.1
• /
• pp.185-201
• /
• 2023

Grant-free random access (GFRA) can reduce the access delay and signaling cost, and satisfy the short transmission packet and strict delay constraints requirement in internet of things (IoT). IoT is a major trend in the future, which is characterized by the variety of applications and devices. However, most existing studies on GFRA only consider a single type of device and omit the effect of access delay. In this paper, we study GFRA in multicell massive multipleinput multiple-output (MIMO) systems where different types of devices with various configurations and requirements co-exist. By introducing the backoff mechanism, each device is randomly activated according to the backoff parameter, and active devices randomly select an orthogonal pilot sequence from a predefined pilot pool. An analytical approximation of the average spectral efficiency for each type of device is derived. Based on it, we obtain the optimal backoff parameter for each type of devices under their delay constraints. It is found that the optimal backoff parameters are closely related to the device number and delay constraint. In general, devices that have larger quantity should have more backoff time before they are allowed to access. However, as the delay constraint become stricter, the required backoff time reduces gradually, and the device with larger quantity may have less backoff time than that with smaller quantity when its delay constraint is extremely strict. When the pilot length is short, the effect of delay constraints mentioned above works more obviously.

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

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.3
• /
• pp.1035-1048
• /
• 2023

The IEEE 802.11 WLAN adopts a random backoff algorithm for its collision avoidance mechanism, and it is well known that the contention-based algorithm may suffer from performance degradation especially in congested networks. In this paper, we design an efficient backoff algorithm that utilizes a reinforcement learning method to determine optimal values of backoffs. The mobile nodes share a common contention window (CW) in our scheme, and using a Q-learning algorithm, they can avoid collisions by finding and implicitly reserving their optimal time slot(s). In addition, we introduce Frame Size Control (FSC) algorithm to minimize the possible degradation of aggregate throughput when the number of nodes exceeds the CW size. Our simulation shows that the proposed backoff algorithm with FSC method outperforms the 802.11 protocol regardless of the traffic conditions, and an analytical modeling proves that our mechanism has a unique operating point that is fair and stable.

• Journal of information and communication convergence engineering
• /
• v.6 no.2
• /
• pp.228-232
• /
• 2008

In recent years, wireless ad hoc networks have become increasingly popular in both military and civilian applications due to their capability of building networks without the need for a pre-existing infrastructure. Recently, IEEE 802.11 Task Group e has been working on a new mechanism, the Enhanced Distributed Coordination Function (EDCF), to enhance the performance of 802.11 DCF. However, EDCF only reduces the internal collisions within a station, and external collisions between stations remain high in ad-hoc networks. In this paper, we propose to adopt an adaptive backoff window control technique, based on a dynamic value of the initial value of the range in which the backoff is chosen, so the backoff timer is randomly chosen in the range (InitRng, CW-1). We use ns-2 simulation to evaluate the throughput of our scheme. Results show that the throughput is improved for our scheme compared to the original DCF due to the reduced the number of collisions.

• Proceedings of the IEEK Conference
• /
• 2003.11c
• /
• pp.208-211
• /
• 2003

기존 IEEE 802.11 MAC (1)에서는 Fairness를 보장하며 Resource를 제공하는 것을 목표로 동일한 DIFS, Back-off 알고리즘, Source가 같은 경우 동일한 Frame size등을 사용하는 Specification을 작성하여 구현한다. 최근 Home Network과 같은 특수한 Ad-Hoc 환경에서의 이런 Fairness Resource Usage가 오히려 기대 성능을 떨어뜨리는 결과를 가져오고 있다. 이에 802.11 MAC에서 Backward Compatibility를 유지하면서 Prioritized DIFS/Backoff/Frame를 통해 차등화된 서비스를 제공하는 메커니즘을 제안하고자 하는 것이 본 논문의 목표이다.

• Journal of information and communication convergence engineering
• /
• v.1 no.4
• /
• pp.194-198
• /
• 2003

Recently, the use of TCP/IP protocols over wireless LANs poses significant problems. In this paper, we have analyzed transmission control protocol (TCP) packet transmission time for mobile IP over wireless local area networks (LANs) using a proposed a new random backoff scheme. We call it as a proxy backoff scheme. It is considered the transmission time of TCP packet on the orthogonal frequency division multiplexing (OFDM) in additive white gaussian noise (AWGN) channel. From the results, a proposed proxy backoff scheme produces a better performance than an original random backoff in mobile IP over wireless LANs environment. Also, in OFDM/quadrature phase shift keying (QPSK) medium access control (MAC), we have obtained that the transmission time in wireless channel decreases as the TCP packet size increases.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.1656-1660
• /
• 2006

Distributed coordination function(DCF) is the primary random access mechanism of IEEE 802.11, which is the basic protocol of wireless LAN based on the CSMA/CA protocol. It enables fast installation with minimal management and maintenance costs and is a very robust protocol for the best effort service in wireless medium. The current DCF, however, is known to be unsuitable for real-time applications such as voice message transmission. In this paper, we focus on the performance issues of IEEE 802.11 which accommodate the prioritized messages. Existing results use the initial window size and backoff window-increasing factor as tools to handle the priority of the messages. Instead, we introduce a novel scheme which chooses the backoff timer with arbitrary probabilities. By this, one can greatly reduce the backoff delay of the lower priority messages without degrading the performance of higher priority.

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

The characteristics of ad hoc networks, such as the absence of infrastructure, a dynamic topology, a shared wireless medium and a resource-constrained environment pose various security challenges. Most previous studies focused on the detection of misbehavior after it had occurred. However, in this paper we propose a new way of thinking to evade the occurrence of misbehavior. In our scheme, we firstly present a clustering algorithm that employs a powerful analytic hierarchy process methodology to elect a clusterhead for each cluster. The clusterhead in each cluster is then allowed to assign the backoff values to its members, i.e., originators, rather than permitting the originators to choose the backoff values by themselves. Through this media access control layer misbehavior detection mechanism, the misuse of the backoff in the media access control layer in the 802.11 distributed coordination function can be detected.

• Journal of Communications and Networks
• /
• v.12 no.1
• /
• pp.43-51
• /
• 2010

IEEE 802.11 defines distributed coordination function (DCF), which is characterized by CSMA/CA and binary exponential backoff (BEB) algorithm. Most modifications on DCF so far have focused on updating of the contention window (CW) size depending on the outcome of own frame transmission without considering freezing periods experienced in the backoff interval. We propose two simple but novel schemes which effectively utilize the number of freezing periods sensed during the current backoff interval. The proposed schemes can be applied to DCF and its family, such as double increment double decrement (DIDD). Saturation throughput of the proposed schemes is analyzed by means of Bianchi's Markovian model. Computer simulation validates the accuracy of the analysis. Numerical results based on IEEE 802.11b show that up to about 20% improvement of saturation throughput can be achieved by combining the proposed scheme with conventional schemes when applied to the basic access procedure.

• Proceedings of the IEEK Conference
• /
• 2003.11c
• /
• pp.157-163
• /
• 2003

IEEE 802.11a Distributed Coordination Function(DCF) Protocol을 사용하여 Real-Time MultiMedia Data의 전송을 수행할 경우, DCF Protocol의 적합하지 못한 Mechanism에 의하여, Data 전송의 극대화를 이루지 못한다. Retransmission이 반복되는 경우, Binary Slotted Exponential Backoff Mechanism은 거대한 Packet Delay와 Jitter의 원인이 되며 Automatic Repeat Request(ARQ) 방식의 Ack Mechanism은 MultiMedia Data를 전송하기에 적합하지 못하다. 본 논문은 위와 같은 문제점을 해결하기 위하여 Real-Time MultiMedia Data을 주로 전송하는 STA에 따른 Real-Time/Non-Real-Time(RT/NRT) Station(STA)의 구분과 보내고자 하는 Real-Time MultiMedia Data의 Network Traffic Load(The Required Bandwidth)를 고려하여, Modified DCF(mDCF) Protocol의 Modified Backoff(mBackOff), Modified BlockAck(mBlockAck) Mechanism을 제시함으로서, Data 전송의 극대화를 제공하며, 또한 IEEE 802.11a와의 호환성을 제공한다.