Adaptive splitting and pre-signaling for RFID tag anti-collision

作者：Yeh Ming Kuei; Jiang Jehn Ruey^*; Huang Shing Tsaan

来源：Computer Communications, 2009, 32(17): 1862-1870.

DOI：10.1016/j.comcom.2009.07.011

• Collision resolution
• RFID
• Anti-collision
• Tag identification

In an RFID system a reader requests tags to send their IDs by RF signal backscattering for the purpose of identification. When multiple tags respond to the request simultaneously. tag collisions occur and the tag identification performance is degraded. There are several tag anti-collision protocols proposed for reducing tag collisions. The protocols can be categorized into two classes: ALOHA-based and tree-based protocols that include deterministic tree-based and probabilistic counter-based subclasses of protocols. ALOHA-based protocols have the tag starvation problem; deterministic tree-based protocols have the problem that their performances are influenced by the length and/or the distribution of tag IDs. On the contrary, probabilistic counter-based protocols do not have such problems. In this paper, we propose a probabilistic counter-based tag anti-collision protocol, called ASPS, to reduce tag collisions by adaptively splitting tags encountering collisions into several groups according to the estimated number of tags to be split, and to reduce the number of messages sent between the reader and tags by utilizing a pre-signaling bit. We simulate and analyze ASPS and compare it with related ones to show its advantages.

• 出版日期2009-11-15
• 单位中央民族大学