Performances Comparison of RFID Anti-collision Algorithms

被引:0
作者
Aissa, Kalache Mohamed [1 ]
Lamya, Fergani [1 ]
机构
[1] Univ Sci & Technol Houari Boumediene, Fac Elect & Comp Sci, Speech Commun & Signal Proc Lab, Algiers, Algeria
来源
2014 INTERNATIONAL CONFERENCE ON MULTIMEDIA COMPUTING AND SYSTEMS (ICMCS) | 2014年
关键词
RFID; Tag; anti-collision; ALOHA; Tree;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In RFID systems, one of the problems that we must solve is the collision between tags which lowers their efficiency. Two main approaches to tag collision are generally adopted: ALOHA and Tree algorithms. This paper reviews several existing anti-collision algorithms and compares their performances through different simulation experiments.
引用
收藏
页码:808 / 813
页数:6
相关论文
共 14 条
[11]  
Pupunwiwat P., 2010, DYNAMIC FRAMED SLOT, P19
[12]  
Quan CH, 2006, LECT NOTES COMPUT SC, V4097, P382
[13]  
Vogt H., 2002, Pervasive Computing. First International Conference, Pervasive 2002. Proceedings (Lecture Notes in Computer Science Vol.2414), P98
[14]  
Zhaung Y., 2010, RFID SENSOR NETWORKS