Cargando…
A Dynamic Access Probability Adjustment Strategy for Coded Random Access Schemes
In this paper, a dynamic access probability adjustment strategy for coded random access schemes based on successive interference cancellation (SIC) is proposed. The developed protocol consists of judiciously tuning the access probability, therefore controlling the number of transmitting users, in or...
Autores principales: | , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2019
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6806141/ https://www.ncbi.nlm.nih.gov/pubmed/31569800 http://dx.doi.org/10.3390/s19194206 |
_version_ | 1783461559514693632 |
---|---|
author | Sun, Jingyun Liu, Rongke Paolini, Enrico |
author_facet | Sun, Jingyun Liu, Rongke Paolini, Enrico |
author_sort | Sun, Jingyun |
collection | PubMed |
description | In this paper, a dynamic access probability adjustment strategy for coded random access schemes based on successive interference cancellation (SIC) is proposed. The developed protocol consists of judiciously tuning the access probability, therefore controlling the number of transmitting users, in order to resolve medium access control (MAC) layer congestion states in high load conditions. The protocol is comprised of two steps: Estimation of the number of transmitting users during the current MAC frame and adjustment of the access probability to the subsequent MAC frame, based on the performed estimation. The estimation algorithm exploits a posteriori information, i.e., available information at the end of the SIC process, in particular it relies on both the frame configuration (residual number of collision slots) and the recovered users configuration (vector of recovered users) to effectively reduce mean-square error (MSE). During the access probability adjustment phase, a target load threshold is employed, tailored to the packet loss rate in the finite frame length case. Simulation results revealed that the developed estimator was able to achieve remarkable performance owing to the information gathered from the SIC procedure. It also illustrated how the proposed dynamic access probability strategy can resolve congestion states efficiently. |
format | Online Article Text |
id | pubmed-6806141 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2019 |
publisher | MDPI |
record_format | MEDLINE/PubMed |
spelling | pubmed-68061412019-11-07 A Dynamic Access Probability Adjustment Strategy for Coded Random Access Schemes Sun, Jingyun Liu, Rongke Paolini, Enrico Sensors (Basel) Article In this paper, a dynamic access probability adjustment strategy for coded random access schemes based on successive interference cancellation (SIC) is proposed. The developed protocol consists of judiciously tuning the access probability, therefore controlling the number of transmitting users, in order to resolve medium access control (MAC) layer congestion states in high load conditions. The protocol is comprised of two steps: Estimation of the number of transmitting users during the current MAC frame and adjustment of the access probability to the subsequent MAC frame, based on the performed estimation. The estimation algorithm exploits a posteriori information, i.e., available information at the end of the SIC process, in particular it relies on both the frame configuration (residual number of collision slots) and the recovered users configuration (vector of recovered users) to effectively reduce mean-square error (MSE). During the access probability adjustment phase, a target load threshold is employed, tailored to the packet loss rate in the finite frame length case. Simulation results revealed that the developed estimator was able to achieve remarkable performance owing to the information gathered from the SIC procedure. It also illustrated how the proposed dynamic access probability strategy can resolve congestion states efficiently. MDPI 2019-09-27 /pmc/articles/PMC6806141/ /pubmed/31569800 http://dx.doi.org/10.3390/s19194206 Text en © 2019 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/). |
spellingShingle | Article Sun, Jingyun Liu, Rongke Paolini, Enrico A Dynamic Access Probability Adjustment Strategy for Coded Random Access Schemes |
title | A Dynamic Access Probability Adjustment Strategy for Coded Random Access Schemes |
title_full | A Dynamic Access Probability Adjustment Strategy for Coded Random Access Schemes |
title_fullStr | A Dynamic Access Probability Adjustment Strategy for Coded Random Access Schemes |
title_full_unstemmed | A Dynamic Access Probability Adjustment Strategy for Coded Random Access Schemes |
title_short | A Dynamic Access Probability Adjustment Strategy for Coded Random Access Schemes |
title_sort | dynamic access probability adjustment strategy for coded random access schemes |
topic | Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6806141/ https://www.ncbi.nlm.nih.gov/pubmed/31569800 http://dx.doi.org/10.3390/s19194206 |
work_keys_str_mv | AT sunjingyun adynamicaccessprobabilityadjustmentstrategyforcodedrandomaccessschemes AT liurongke adynamicaccessprobabilityadjustmentstrategyforcodedrandomaccessschemes AT paolinienrico adynamicaccessprobabilityadjustmentstrategyforcodedrandomaccessschemes AT sunjingyun dynamicaccessprobabilityadjustmentstrategyforcodedrandomaccessschemes AT liurongke dynamicaccessprobabilityadjustmentstrategyforcodedrandomaccessschemes AT paolinienrico dynamicaccessprobabilityadjustmentstrategyforcodedrandomaccessschemes |