A New Autonomous Adaptive MAC Protocol in Wireless Networks

Oh, Youngrock; Kim, Yunbae; Kim, Jeongseop; Park, Seungkeun

doi:10.1109/access.2018.2805334

Cited by 5 publications

(8 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As described above, we need to specify two kinds of backoff counter selection distributions: after a successful transmission and after a collision. The CPB takes advantage of the RAP [15], [21] in that a backoff counter value is chosen from a Poisson selection distribution. A Poisson selection distribution has a single parameter, the mean.…”

Section: B Channel Access Parametersmentioning

confidence: 99%

“…Each station using the AMOCW operates with different access parameters based on its own estimate, and still achieves good network performance. The adaptive version of the RAP called the A-RAP given in [21] is advantageous in complexity over the above techniques in that each station adjusts its access parameters with only its own transmission result. This adjustment method is similar to the BEB, the Quadratic Backoff (QB) [22], or the Exponential Increase and Exponential Decrease (EIED) [23].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Performance Improvement of Random Access by Prioritizing Collisions

Kim

Park

2023

IEEE Access

Self Cite

View full text Add to dashboard Cite

The importance of unlicensed spectrum is highlighted in terms of the flexibility of network deployment for various services envisioned in 5G and beyond. Since listen before talk is mandatory for channel access in unlicensed spectrum and it causes an unavoidable waste of resources due to collisions, an efficient random backoff mechanism is required. In the existing backoff schemes that impose waiting penalties on collided packets, a degraded fairness performance is observed. In this work, we analyze how prioritizing collided packets can improve performance compared to existing schemes. To this end, we devise a random backoff scheme called the Collision Priority Backoff (CPB) under the concept of giving priority to collided packets. We apply Bayesian optimization to carefully determine channel access parameters of the CPB to maximize network throughput. Since the optimized access parameters require the number of stations in the network, we also devise an adaptive version of the CPB called the Adaptive CPB (ACPB). We deal with an environment where the number of stations changes as a switching bandit problem, and employ a variant of upper confidence bound policy in the ACPB. Various simulation results validate that the proposed backoff scheme shows high throughput and fairness performance.INDEX TERMS Random access, backoff, Bayesian optimization, switching bandit, fairness, throughput.

show abstract

Section: B Channel Access Parametersmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Performance Improvement of Random Access by Prioritizing Collisions

Kim

Park

2023

IEEE Access

Self Cite

View full text Add to dashboard Cite

show abstract

“…The main shortcoming of this method is that it assumes a fixed number of stations. Oh et al 80 address this limitation by introducing an adaptive RAP algorithm.…”

Section: Related Workmentioning

confidence: 99%

Enhanced collision resolution and throughput analysis for the 802.11 distributed coordination function

Kobbaey

Hamzaoui

Ahmad

et al. 2021

Int J Communication

View full text Add to dashboard Cite

Summary The IEEE 802 standards rely on the distributed coordination function (DCF) as the fundamental medium access control method. DCF uses the binary exponential backoff (BEB) algorithm to regulate channel access. The backoff time determined by BEB depends on a contention window (CW) whose size is doubled if a station suffers a collision and reset to its minimum value after a successful transmission. Doubling the size of CW reduces channel access time, which decreases the throughput. Resetting it to its minimum value harms fairness since the station will have a better chance of accessing the channel compared to stations that suffered a collision. We propose an algorithm that addresses collisions without instantly increasing the CW size. Our algorithm aims to reduce the collision probability without affecting the channel access time and delay. We present extensive simulations for fixed and mobile scenarios. The results show that, on average, our algorithm outperforms BEB in terms of throughput and fairness. Compared to exponential increase exponential decrease (EIED), our algorithm improves, on average, throughput and delay performance. We also propose analytical models for BEB, EIED and our algorithm. Our models extend Bianchi's popular Markov chain‐based model by using a collision probability that is dependent on the station transmission history. Our models provide a better estimation of the probability that a station transmits in a random slot time, which allows a more accurate throughput analysis. Using our models, we show that both the saturation throughput and maximum throughput of our algorithm are higher than those of BEB and EIED.

show abstract

“…Random Access protocols are also a research focus, as they offer high efficiency and low overhead when network load is little. In [6], the Adaptive Renewal Access Protocol (A-RAP) is proposed. It is based on the Renewal Access Protocol, in which the optimal distribution for the CSMA/CA backoff value is computed under the condition that the total number of nodes is known.…”

mentioning

confidence: 99%

“…The distribution of cycle slots for each traffic class is based on the feedback information collected in the previous cycle (6). The basic idea is to assign each traffic class a number of slots proportional to the average packet queuing delay for packets originating from the nodes in that traffic class during the previous cycle.…”

mentioning

confidence: 99%

Node Classification-Based Bandwidth Allocation: A New Scheduling Algorithm for TDMA-Based LANs

et al. 2022

View full text Add to dashboard Cite

Local area networks often comprise nodes that run applications that belong to different traffic classes, with each class having different bandwidth requirements. Traditional Medium Access Control (MAC) protocols treat all nodes in the same manner. This may lead to a disproportionate allocation of bandwidth to the nodes and, consequently, to significant performance degradation. In this paper, a new MAC algorithm, is presented, that allocates different amounts of bandwidth to the nodes according to their traffic class. The bandwidth allocated to the nodes of each traffic class is proportional to the bandwidth requirements of the nodes of that class. The performance of the proposed Node Classification-based Bandwidth Allocation (NCBA) algorithm is studied via extensive simulation results, which indicate that it achieves a significant performance improvement compared to the well-known TDMA scheme. Overall, the new protocol achieves higher throughput, lower delay and exhibits a higher delay Fairness compared to TDMA for various network configurations, under asymmetric bursty traffic. 12 INDEX TERMS Traffic-based node classification, adaptive MAC, broadcast LAN, TDMA. above approach satisfactorily solves the problem of lack of 49 fairness in the bandwidth allocation process, as is the case 50 in traditional MAC protocols, owing to the equal treatment 51 of all nodes, despite their heterogeneity in terms of band-52 width requirement. Specifically, a new collision-free family 53 TDMA-based protocols, that partially base the decision of 54 time slot allocation, on an a priori classification of the nodes, 55 by their traffic profiles are introduced. Another contribu-56 tion of this study is the use of a metric equalization-based 57 optimization process, specifically the incorporation of delay 58 feedback into the bandwidth allocation process. The proposed 59 classification-based MAC uses traffic class information in 60 conjunction with queuing delay to adjust the allocated chan-61 nel resources to each class and node. The approach is demon-62 strated via extensive simulation results to outperform TDMA 63 under asymmetric bursty traffic conditions. 64 The rest of the paper is structured as follows: Section II 65 summarizes related work by presenting the proposed MAC 66 protocols, aimed at the efficient operation of broadcast net-67 works. Section III describes the system environment, defines 68 the categorization scheme of nodes in the broadcast network 69 and describes the type of traffic generated within the net-70 work. The proposed MAC protocol is presented in section IV.

show abstract

A New Autonomous Adaptive MAC Protocol in Wireless Networks

Cited by 5 publications

References 29 publications

Performance Improvement of Random Access by Prioritizing Collisions

Performance Improvement of Random Access by Prioritizing Collisions

Enhanced collision resolution and throughput analysis for the 802.11 distributed coordination function

Node Classification-Based Bandwidth Allocation: A New Scheduling Algorithm for TDMA-Based LANs

Contact Info

Product

Resources

About