Idle Slots Elimination Based Binary Splitting Anti Collision Algorithm for RFID
Tag collision avoidance is critical to the success of data communications in radio frequency identification (RFID) system. This letter presents an efficient idle slots elimination based binary splitting (ISE BS) algorithm to improve the performance of the RFID system. In ISE BS, by introducing 1 b random number Q and 16 b random number serial identifier, which are transmitted before data exchange, tag collisions can be informed and unnecessary data exchange between reader and tags can be further eliminated. Moreover, ISE BS exploits Q to separate conflicting tags into 0 1 subsets randomly. Specifically, the tags in subset 0 will start to transmit in the next period, where the success flag signal reflects the immediate data transmission. The tags in subset 1 will wait in the pipeline. In such a way, the idle slots introduced by conventional binary splitting anticollision algorithms can be removed with the schedule of ISE BS. Extensive simulation results show that ISE BS outperforms the existing proposed algorithms.
IEEE Communications Letters