One of problems that we faced for Radio frequency identification (RFID) systems is that the collision between tags which lowers the efficiency of the RFID systems. One of the popular anti-collision algorithms is ALOHA-type algorithms, which are simple and have good performance when the number of tags to be read is reasonable small. In this paper, an enhanced dynamic framed slotted ALOHA algorithm for RFID is extended to a more general close form, hence reference [9] becomes only one special case described in our paper. The improved ALOHA algorithm for RFID tag identifications has much larger capacity to handle the cases when the tag numbers increasing largely while every frame keeping the optimum system efficiency 35.5%. Simulation results show that the proposed algorithm improves the efficiency nicely in comparison with the conventional algorithms keeping >80% as the previous paper shown. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Huang, X. (2006). An improved ALOHA algorithm for RFID tag identification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4253 LNAI-III, pp. 1157–1162). Springer Verlag. https://doi.org/10.1007/11893011_146
Mendeley helps you to discover research relevant for your work.