Adaptive frame on binary splitting for radio frequency identification anticollision

Abstract

SUMMARYIn many radio frequency identification applications, the reader must repeatedly identify the same staying tags. Existing anticollision protocols, adaptive binary splitting (ABS) and adaptive query tree, can rapidly identify the staying tags by remembering the order in which the tags were recognized in the previous identification process. This paper proposes a novel protocol called adaptive frame ABS (AFA), based on ABS. AFA utilizes the dynamic regulation approach that estimates the numbers of staying tags and newly‐arriving tags and optimally adjusts the numbers of slots allocated for them to reduce idle slots when many recognized tags leave and reduce collision slots when many newly‐arriving tags enter. Following the regulation process, multiple staying tags may share the same slot and cause a collision among them. Thus, an efficient ordering splitting is proposed to deterministically split the collided staying tags according to the order in which they were recognized. The analytical and simulation results show that AFA outperforms ABS in most of the considered environments. Copyright © 2012 John Wiley & Sons, Ltd.