Answers are grounded in this paper and cite their sources.
A tag-collision problem in Radio Frequency Identification (RFID) system is the event that a reader cannot identify a tag if many tags respond to a reader at the same time. Although binary Electronic Product Code (EPC) is the most natural for a computer, most people are accustomed to the decimal system. In RFID applications, we need to convert binary EPC to decimal numbers. Since converting binary-coded decimal (BCD) data into the decimal numbers is much less complex than converting binary data into decimal numbers. This motivates us to represent EPC by BCD. However, using BCD-based EPC delivers two problems: (i) Is the existing query tree algorithm suitable for identifying BCD-based EPC? (ii) How do we design a new query tree algorithm to enhance the tag-identification efficiency? In this work, we solved the problems.
No takes yet. Share an insight, caveat, or question.
Yang et al. (2012) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: