A Novel Approach to Mapped Correlation of ID for RFID Anti-Collision

One of the key problems that should be solved is the collision between tags which lowers the efficiency of the RFID system. The existed popular anti-collision algorithms are ALOHA-type algorithms and QT. But these methods show good performance when the number of tags to read is small and not dynamic. However, when the number of tags to read is large and dynamic, the efficiency of recognition is very low. A novel approach to mapped correlation of ID for RFID anti-collision has been proposed to solve the problem in this paper. This method can increase the association between tags so that tags can send their own ID under certain trigger conditions, by mapped correlation of ID, querying on multi-tree becomes more efficient. In the case of not too big number of tags, by replacing the actual ID with the temporary ID, the method can greatly reduce the number of times that the reader reads and writes to tag's ID. In the case of dynamic ALOHA-type applications, the reader can determine the locations of the empty slots according to the position of the binary pulse, so it can avoid the decrease in efficiency which is caused by reading empty slots when reading slots. Experiments have shown this method can greatly improve the recognition efficiency of the system.

[1]  De-gan Zhang.  A new approach and system for attentive mobile learning based on seamless migration , 2010, Applied Intelligence.

[2]  Christian Floerkemeier,et al.  Comparison of transmission schemes for framed ALOHA based RFID protocols , 2006, International Symposium on Applications and the Internet Workshops (SAINTW'06).

[3]  Yuping Zhao,et al.  Performance evaluation of a multi-branch tree algorithm in RFID , 2010, IEEE Transactions on Communications.

[4]  Guang Li,et al.  A new anti‐collision algorithm for RFID tag , 2014, Int. J. Commun. Syst..

[5]  Xuejing Kang,et al.  A novel image de-noising method based on spherical coordinates system , 2012, EURASIP J. Adv. Signal Process..

[6]  Abhishek Ranjan,et al.  An Empirical Study of Error Patterns in Industrial Business Process Models , 2014, IEEE Transactions on Services Computing.

[7]  Quanyuan Feng,et al.  An Efficient Anti-Collision Protocol for RFID Tag Identification , 2010, IEEE Communications Letters.

[8]  James Aweya.  Technique for Differential Timing Transfer Over Packet Networks , 2013, IEEE Transactions on Industrial Informatics.

[9]  Mauro Conti,et al.  An Anonymous End-to-End Communication Protocol for Mobile Cloud Environments , 2014, IEEE Transactions on Services Computing.

[10]  F. Schoute,et al.  Dynamic Frame Length ALOHA , 1983, IEEE Trans. Commun..

[11]  Harald Vogt,et al.  Efficient Object Identification with Passive RFID Tags , 2002, Pervasive.

[12]  Chae-Woo Lee,et al.  An enhanced dynamic framed slotted ALOHA algorithm for RFID tag identification , 2005, The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services.

[13]  Xiaoyun Chen,et al.  IBTA: An IBT-Tree Based Algorithm for RFID Anti-collision , 2010, 2010 International Forum on Information Technology and Applications.

[14]  Wenbo Dai,et al.  A new constructing approach for a weighted topology of wireless sensor networks based on local-world theory for the Internet of Things (IOT) , 2012, Comput. Math. Appl..

[15]  De-gan Zhang,et al.  A kind of novel method of service-aware computing for uncertain mobile applications , 2013, Math. Comput. Model..

[16]  Alan R. Hevner,et al.  IEEE Transactions on Services Computing , 2010 .

[17]  Ching-Hsien Hsu,et al.  An Enhanced Query Tree (EQT) Protocol for Memoryless Tag Anti-collision in RFID Systems , 2008, 2008 Second International Conference on Future Generation Communication and Networking.

[18]  Guang Li,et al.  An Energy-Balanced Routing Method Based on Forward-Aware Factor for Wireless Sensor Networks , 2014, IEEE Transactions on Industrial Informatics.

[19]  Marimuthu Palaniswami,et al.  Handling inelastic traffic in wireless sensor networks , 2010, IEEE Journal on Selected Areas in Communications.

[20]  Yun Tian,et al.  An Effective Temporary ID Based Query Tree Algorithm for RFID Tag Anti-collision , 2012 .

[21]  Weilian Su,et al.  Multiple RFID Tags Access Algorithm , 2010, IEEE Transactions on Mobile Computing.

[22]  Harald Vogt,et al.  Multiple object identification with passive RFID tags , 2002, IEEE International Conference on Systems, Man and Cybernetics.

[23]  Francesca Lonetti,et al.  Tree slotted aloha: a new protocol for tag identification in RFID networks , 2006, 2006 International Symposium on a World of Wireless, Mobile and Multimedia Networks(WoWMoM'06).

[24]  Min Young Chung,et al.  Identification of RFID Tags in Framed-Slotted ALOHA with Robust Estimation and Binary Selection , 2007, IEEE Communications Letters.

[25]  Xiao-dan Zhang,et al.  Design and implementation of embedded un-interruptible power supply system (EUPSS) for web-based mobile application , 2012, Enterp. Inf. Syst..

[26]  De-gan Zhang,et al.  A new medium access control protocol based on perceived data reliability and spatial correlation in wireless sensor network , 2012, Comput. Electr. Eng..

[27]  Hyuckjae Lee,et al.  Query tree-based reservation for efficient RFID tag anti-collision , 2007, IEEE Communications Letters.

[28]  Jae-Hyun Kim,et al.  Dynamic framed slotted ALOHA algorithms using fast tag estimation method for RFID system , 2006, CCNC 2006. 2006 3rd IEEE Consumer Communications and Networking Conference, 2006..

[29]  Ching-Nung Yang,et al.  An Effective 16-bit Random Number Aided Query Tree Algorithm for RFID Tag Anti-Collision , 2011, IEEE Communications Letters.