© The Institution of Engineering and Technology
A memoryless-based Collision window Tree plus (CwT+ ) protocol for simplified computation in anti-collision radio frequency identification (RFID) is proposed and presented. The CwT+ makes effective use of a threshold to accurately enhance bit-tracking and in turn lowers the identification time of the communication response. The threshold limits the bitstream of responding tags in an accurate fashion for simplified computation in the interrogation procedure. Simulation results show the outperformance of the CwT+ compared with earlier protocols.
References
-
-
1)
-
2. Jia, X., Feng, Q., Ma, C.: ‘An efficient anti-collision protocol for RFID tag identification’, IEEE Commun. Lett.2010, 14, (11), pp. 1014–1016 (doi: 10.1109/LCOMM.2010.091710.100793).
-
2)
-
4. Landaluce, H., Perallos, A., Zuazola, I.J.G.: ‘A fast RFID identification protocol with low tag complexity’, IEEE Commun. Lett., 2013, 17, (9), pp. 1704–1706 (doi: 10.1109/LCOMM.2013.070913.131111).
-
3)
-
3. Lai, Y.-C., Hsiao, L.-Y., Chen, H.-J., Lai, C.-N., Lin, J.-W.: ‘A novel query tree protocol with bit tracking in RFID tag identification’, IEEE Trans. Mobile Comput., 2013, 12, (10), pp. 2063–2075 (doi: 10.1109/TMC.2012.176).
-
4)
-
1. Law, C., Lee, K., Siu, K.-Y.: ‘Efficient memoryless protocol for tag identification’. Proc. 4th Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, Cambridge, MA, USA, 2000, pp. 75–84.
http://iet.metastore.ingenta.com/content/journals/10.1049/el.2014.1552
Related content
content/journals/10.1049/el.2014.1552
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Simplified computation in memoryless anti-collision RFID identification protocols