RFID Anti-collision algorithm Based on Bi-directional Binary Exponential Index
There are two basic approaches to solve the tag collision: deterministic collision resolution and stochastic collision resolution. These resolutions are all in the assumption that the number of the tags in the area doesn’t change. This algorithm gets over this disadvantage; the tags can enter into the reader’s area in the dynamic mode at any moment. According to the reader’s identified result each time, the tags can modify their responsive probability in the incremental or degressive mode. This bi-directional operation considers the impartiality of identification. This algorithm adopts Markov chain, and provides the analysis of the efficiency in the situation that tags appear in different patterns.
Binary exponential index RFID Anti-collision algorithm Markov chain
Song-sen YU Yiju Zhan Yong-hua Wang
Department of Computer University of Nanchang Nanchang,Jianxi Province, P.R.China School of Technology SUN YAT-SEN University Guangzhou, Guangdong Province P.R.China School of Infornation science and Technology SUN YAT-SEN University Guangzhou, Guangdong Province P.
国际会议
2007 IEEE International Conference on Automation and Lofistics
山东济南
英文
2007-08-18(万方平台首次上网日期,不代表论文的发表时间)