The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Dans les systèmes RFID, la résolution des collisions est un problème important dans l’identification rapide des étiquettes. Cette lettre présente un algorithme ALOHA dynamique à fentes de trame qui utilise un facteur de collision (DFSA-CF). Cette méthode permet une identification rapide des balises en estimant la taille de la trame suivante avec le facteur de collision dans la trame actuelle. Les résultats de la simulation montrent que la méthode proposée réduit les temps de créneau requis pour l'identification RFID. Lorsque le nombre de balises est supérieur à la taille de la trame, l’efficacité de la méthode proposée est supérieure à celle des algorithmes conventionnels.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Seung Sik CHOI, Sangkyung KIM, "A Dynamic Framed Slotted ALOHA Algorithm Using Collision Factor for RFID Identification" in IEICE TRANSACTIONS on Communications,
vol. E92-B, no. 3, pp. 1023-1026, March 2009, doi: 10.1587/transcom.E92.B.1023.
Abstract: In RFID systems, collision resolution is a significant issue in fast tag identification. This letter presents a dynamic frame-slotted ALOHA algorithm that uses a collision factor (DFSA-CF). This method enables fast tag identification by estimating the next frame size with the collision factor in the current frame. Simulation results show that the proposed method reduces slot times Required for RFID identification. When the number of tags is larger than the frame size, the efficiency of the proposed method is greater than those of conventional algorithms.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E92.B.1023/_p
Copier
@ARTICLE{e92-b_3_1023,
author={Seung Sik CHOI, Sangkyung KIM, },
journal={IEICE TRANSACTIONS on Communications},
title={A Dynamic Framed Slotted ALOHA Algorithm Using Collision Factor for RFID Identification},
year={2009},
volume={E92-B},
number={3},
pages={1023-1026},
abstract={In RFID systems, collision resolution is a significant issue in fast tag identification. This letter presents a dynamic frame-slotted ALOHA algorithm that uses a collision factor (DFSA-CF). This method enables fast tag identification by estimating the next frame size with the collision factor in the current frame. Simulation results show that the proposed method reduces slot times Required for RFID identification. When the number of tags is larger than the frame size, the efficiency of the proposed method is greater than those of conventional algorithms.},
keywords={},
doi={10.1587/transcom.E92.B.1023},
ISSN={1745-1345},
month={March},}
Copier
TY - JOUR
TI - A Dynamic Framed Slotted ALOHA Algorithm Using Collision Factor for RFID Identification
T2 - IEICE TRANSACTIONS on Communications
SP - 1023
EP - 1026
AU - Seung Sik CHOI
AU - Sangkyung KIM
PY - 2009
DO - 10.1587/transcom.E92.B.1023
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E92-B
IS - 3
JA - IEICE TRANSACTIONS on Communications
Y1 - March 2009
AB - In RFID systems, collision resolution is a significant issue in fast tag identification. This letter presents a dynamic frame-slotted ALOHA algorithm that uses a collision factor (DFSA-CF). This method enables fast tag identification by estimating the next frame size with the collision factor in the current frame. Simulation results show that the proposed method reduces slot times Required for RFID identification. When the number of tags is larger than the frame size, the efficiency of the proposed method is greater than those of conventional algorithms.
ER -