Idle slots elimination based binary splitting ISE BS anti collision algorithm for RFID
Tag collision avoidance is critical to the success of data communications in radio frequency identification (RFID) system. This paper presents an efficient idle slots elimination based binary splitting (ISE BS) algorithm to improve the performance of RFID system. In ISE BS, by introducing 1 bit random number Q and 16 bits random number serial identifier (SID) 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 anti collision algorithms can be removed with schedule of ISEBS. Extensive simulation results show that ISE BS outperforms the existing proposed algorithms.