Abstract
This paper proposes a type of improved adaptive N-tree anti-collision algorithm based on the traditional one for RFID system by combination with maximum likelihood estimation and probe pre-detection. This algorithm inherits some features from Alpha- and tree-based anti-collision algorithms and effectively restrain the star-vation of the two algorithms. It has also filled in the gaps of tag collision with higher probability. The study turns out that the improved adaptive N-tree anti-collision algorithm as proposed can feature adaptive choice of the value N of the tree, length breaks of free timeslots, restraints on defects such as more tag classification and higher collision probability just as what the traditional tree-based algorithm has. N-tree built by level-to-level frame identification eliminates the free timeslots, and improves the tag identification precision for the RFID system. The results from simulation experiment reveal that the algorithm proposed in this paper has lower Error Sampling Reckon (ESR) and Throughput Rate Deviation (TRD), and features large throughput rate (87%), low delay of tag recognition and minimum timeslots, and etc. hence to be better applied in large-scale logistics and other fields where fast information recognition is involved.
Highlights
Radio Frequency Identification (RFID) is an untouched detection and recognition technology, which access to a certain range of target information by way of the scanning of radio frequency signals that is completely controlled by computer
A type of improved adaptive N-tree anti-collision algorithm is built based on the traditional one for RFID system, and with the incorporation of maximum likelihood estimation and probe pre-detection. This algorithm inherits some features from Alohaand tree-based anti-collision algorithms, and more importantly, it fills in the gaps that the two algorithms fail to actively suppress the starvation and allow higher probability of tag collision
This paper provides a new idea for scholars to study the subject about the RFID system anti-collision
Summary
Radio Frequency Identification (RFID) is an untouched detection and recognition technology, which access to a certain range of target information by way of the scanning of radio frequency signals that is completely controlled by computer. It features high efficiency, easy to use and high adaptability to various harsh environments. A type of improved adaptive N-tree anti-collision algorithm is built based on the traditional one for RFID system, and with the incorporation of maximum likelihood estimation and probe pre-detection This algorithm inherits some features from Alohaand tree-based anti-collision algorithms, and more importantly, it fills in the gaps that the two algorithms fail to actively suppress the starvation and allow higher probability of tag collision. This paper provides a new idea for scholars to study the subject about the RFID system anti-collision
Sign-in/Register to view highlights & summary 
Published Version (
Free)
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