In a radio frequency identification (rfid) system, when more than one tag communicates with a reader at the same time, a collision will occur resulting in the failure of that communication. Many anti-collision algorit...
详细信息
In a radio frequency identification (rfid) system, when more than one tag communicates with a reader at the same time, a collision will occur resulting in the failure of that communication. Many anti-collision algorithms, such as binary tree (BT), FSA, and DFSA have been used in ISO and EPC standards to prevent such a collision. This paper develops a new anti-collision algorithm based on the BT and the DFSA algorithms. Specifically, all tags are divided into many groups using the DSFA algorithm. Then, the tags in each group are identified using the BT algorithm. Results indicate that the proposed algorithm performs better than the existing ones in terms of the number of used time slots (the less the used time slot, the faster the algorithm).
A collision occurs when more than two tags present in the reader's field of a radio frequency identification system. Anti-collision algorithms such as binary trees and dynamic framed slotted aloha (DFSA) have been...
详细信息
A collision occurs when more than two tags present in the reader's field of a radio frequency identification system. Anti-collision algorithms such as binary trees and dynamic framed slotted aloha (DFSA) have been employed to prevent such a collision. The identification number of tag consists of 64 bits and certain parts of 64 bits can be considered a priori-information. This paper proposes a new anti-collision algorithm based on a-priori information about the manufacturer code. This prior-information reduces the number of bits to analyze in the algorithm, hence reduces the operation time for the faster read-performance. Results indicate that the proposed anti-collision algorithm required a less number of used time slots, thus minimizing the operation time more than 50% comparing to the existing ones.
暂无评论