Channel Access Probability in Unslotted IEEE 802.15.4 csma Under Correlated Clear Channel Assessments
dc.article.number | 136671 | |
dc.catalogador | gjm | |
dc.contributor.author | Espinoza Henríquez, Miguel Antonio | |
dc.contributor.author | Oberli Graf, Christian Robert | |
dc.contributor.author | Gutiérrez Gaitán, Miguel José | |
dc.contributor.author | Maass Martínez, Alejandro Ignacio | |
dc.date.accessioned | 2025-08-29T14:38:52Z | |
dc.date.available | 2025-08-29T14:38:52Z | |
dc.date.issued | 2025 | |
dc.description.abstract | Correlation between successive clear channel assessments in unslotted carrier sense multiple access with collision avoidance (CSMA/CA) is commonly assumed in the literature to be negligible for modeling the medium access control algorithm. However, in previous research, the authors found this assumption to be questionable under certain realistic conditions. In this paper, the correlation between successive clear channel assessments is studied and its effect on the probability and delay of accessing the medium by a node following the IEEE 802.15.4 Standard is modeled for the unslotted CSMA/CA mode. The results obtained are used for evaluating the delay probability distributions of the three outcome events of the CSMA/CA algorithm: frame transfer success, channel access failure and frame transfer failure. For scenarios in which the duration of contentions is similar to, or shorter than, the duration of the frames propagating in the air, the correlation effect is strong, making classical models to yield results that deviate from a realistic scenario. The theoretical results are validated by simulations. It is shown that neglecting correlation between successive clear channel assessments leads to overestimating the expected delay of frame transfer success and channel access failure by up to 15%. The results also reveal that the probability of frame transfer success can be overestimated by up to 30%, the probability of frame transfer failure by up to 80% and the probability of channel access failure is underestimated by up to a factor 6 when clear channel assessment correlation is ignored. | |
dc.fechaingreso.objetodigital | 2025-08-29 | |
dc.format.extent | 16 páginas | |
dc.fuente.origen | ORCID | |
dc.identifier.doi | 10.1109/ACCESS.2025.3593810 | |
dc.identifier.uri | https://repositorio.uc.cl/handle/11534/105363 | |
dc.identifier.uri | https://doi.org/10.1109/ACCESS.2025.3593810 | |
dc.information.autoruc | Escuela de Ingeniería; Espinoza Henríquez, Miguel Antonio; S/I; 1065119 | |
dc.information.autoruc | Escuela de Ingeniería; Oberli Graf, Christian Robert; 0000-0003-3068-096X; 63125 | |
dc.information.autoruc | Escuela de Ingeniería; Gutiérrez Gaitán, Miguel José; 0000-0002-3307-8731; 1352133 | |
dc.information.autoruc | Escuela de Ingeniería; Maass Martínez, Alejandro Ignacio; S/I; 1352967 | |
dc.language.iso | en | |
dc.nota.acceso | contenido completo | |
dc.revista | IEEE Access | |
dc.rights | acceso abierto | |
dc.rights.license | CC BY-NC-ND 4.0 Attribution-NonCommercial-NoDerivatives 4.0 International | |
dc.rights.uri | https://creativecommons.org/licenses/by-nc-nd/4.0/ | |
dc.subject | Access protocols | |
dc.subject | Delay estimation | |
dc.subject | Probability distribution | |
dc.subject | Wireless mesh networks | |
dc.subject.ddc | 620 | |
dc.subject.dewey | Ingeniería | es_ES |
dc.title | Channel Access Probability in Unslotted IEEE 802.15.4 csma Under Correlated Clear Channel Assessments | |
dc.type | artículo | |
dc.volumen | 13 | |
sipa.codpersvinculados | 1065119 | |
sipa.codpersvinculados | 63125 | |
sipa.codpersvinculados | 1352133 | |
sipa.codpersvinculados | 1352967 | |
sipa.trazabilidad | ORCID;2025-08-22 |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Channel_Access_Probability_in_Unslotted_IEEE_802.15.4_csma_Under_Correlated_Clear_Channel_Assessments.pdf
- Size:
- 1.51 MB
- Format:
- Adobe Portable Document Format
- Description:
License bundle
1 - 1 of 1
Loading...
- Name:
- license.txt
- Size:
- 1.98 KB
- Format:
- Item-specific license agreed upon to submission
- Description: