Abstract
In Radio Frequency Identification facilities the identification delay of a set of tags is mainly caused by the random access nature of the reading protocol, yielding a random identification time of the set of tags. In this paper, the cumulative distribution function of the identification time is evaluated using a discrete time Markov chain for single-set time-constrained passive RFID systems, namely those ones where a single group of tags is assumed to be in the reading area and only for a bounded time (sojourn time) before leaving. In these scenarios some tags in a set may leave the reader coverage area unidentified. The probability of this event is obtained from the cumulative distribution function of the identification time as a function of the sojourn time. This result provides a suitable criterion to minimize the probability of losing tags. Besides, an identification strategy based on splitting the set of tags in smaller subsets is also considered. Results demonstrate that there are optimal splitting configurations that reduce the overall identification time while keeping the same probability of losing tags.
Highlights
Radio Frequency IDentification (RFID) enables the identification of nearby objects or people by means of Radio-Frequency (RF) signals
The results provided in this paper are useful to help manufacturers and system operators to improve the RFID system performance in mixed scenarios
In [21] and [6] we analyze the identification performance of RFID systems in scenarios characterized by an incoming flow of tags entering the coverage area of a reader, moving at constant speed and, considering that new tags can enter the workspace other tags are still being identified
Summary
Radio Frequency IDentification (RFID) enables the identification of nearby objects or people by means of Radio-Frequency (RF) signals. RFID is increasingly being used to identify and track objects in supply chains and manufacturing process [1] These scenarios consider a large number of tags attached to items which pass through checking areas, usually carried in sets by conveyor belts, pallets, lorries, etc. A conveyor belt continuously running with tags randomly scattered on it In this case, some tags may leave the reader coverage area unidentified. Our goal is to compute the minimum suitable sojourn time that guarantee that the percentage of groups correctly identified is above some level In this paper, this level is termed Identification Confidence Level (ICL). Let us remark that the results derived are valid for any FSA protocol with fixed frame size This includes most active and passive RFID standards used in logistic currently.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
