A Novel Anti-collision Protocol Based on Binary Tree without Prior Information about RFID Tags

Abstract

In order to enhance radio frequency identification (RFID) tag identification efficiency, people proposes a anti-collision protocol in tree slot ALOHA .The new protocol adopts FKSS (Fast k-Slot Selection) algorithm and BFKSS (Binary Tree Fast k-Slot Selection) algorithm, the former which adjust the value of the slot’s number, or the frame size in dynamic, through judging whether the first k-slots are all idle or all collision in each frame; and the later decompose the collision slot in binary basing on the former. The most advantage of the proposed protocol is no prior information about RFID tags. No matter how abrupt the tag number increase or reduce, the system can always keep the frame length and the number of tags at a reasonable level, thus can let the system efficiency not be affected by the changes tag number; and the advantages of binary decomposition is that it won’t produce estimation error and reduces the computational complexity, meanwhile once again improve the system throughput. In our simulations, the proposed protocol’s system efficiency reached at 0.43, BFKSS in the most optimal value is little higher than FKSS when to 0.432, and above the conventional dynamic frame slotted ALOHA and Q algorithm protocol, furthermore, compared with TSA, the system efficiency curve is above during the tag number is not close to the initial frame size.