2016_wcl_ISE-BS.pdf (296.92 kB)
Idle-slots elimination based binary splitting anti-collision algorithm for RFID
journal contributionposted on 2023-06-09, 02:11 authored by Jian Su, Zhengguo ShengZhengguo Sheng, Liangbo Xie, Guangjun Wen
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.
- Accepted version
JournalIEEE Communications Letters
PublisherInstitute of Electrical and Electronics Engineers
Department affiliated with
- Engineering and Design Publications
Notes(c) 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.
Full text available