Radio Frequency IDentification (RFID) systems are becoming more and more popular in the field of ubiquitous computing, in particular for objects identification. An RFID system is composed by one or more readers and a number of tags. One of the main issues in an RFID network is the fast and reliable identification of all tags in the reader range. The reader issues some queries, and tags properly answer. Then, the reader must identify the tags from such answers. This is crucial for most applications. Since the transmission medium is shared, the typical problem to be faced is a MAC-like one, i.e. to avoid or limit the number of tags transmission collisions. We propose a protocol which, under some assumptions about transmission techniques, always achieves a 100 perfomance. It is based on a proper recursive splitting of the concurrent tags sets, until all tags have been identified. The other approaches present in literature have performances of about 42 in the average at most. The counterpart is a more sophisticated hardware to be deployed in the manufacture of low cost tags.
@cite_14 @cite_8 @cite_18 proposed two adaptive tag anti-collision protocols: the Adaptive Query Splitting protocol which is an improvement of the Query Tree protocol, and the Adaptive Binary Splitting protocol which is based on the Binary Tree protocol. For reducing collisions, the proposed protocols use information obtained from the last process of tag identification, assuming that in most object tracking and monitoring applications the set of RFID tags encountered in successive reading from a reader does not change substantially and information from a reading process can be used for the next one. An improvement of Adaptive Binary Splitting protocol is proposed in @cite_13 .
@cite_18 @cite_14 @cite_13 @cite_8
2163278169 2101201152 2125504058 2150286589
Tag identification is an important tool in RFID systems with applications for monitoring and tracking. A RFID reader recognizes tags through communication over a shared wireless channel. When multiple tags transmit their IDs simultaneously, the tag-to-reader signals collide and this collision disturbs a reader's identification process. Therefore, tag collision arbitration for passive tags is a significant issue for fast identification. This paper presents two adaptive tag anticollision protocols: an Adaptive Query Splitting protocol (AQS), which is an improvement on the query tree protocol, and an Adaptive Binary Splitting protocol (ABS), which is based on the binary tree protocol and is a de facto standard for RFID anticollision protocols. To reduce collisions and identify tags efficiently, adaptive tag anticollision protocols use information obtained from the last process of tag identification. Our performance evaluation shows that AQS and ABS outperform other tree-based tag anticollision protocols. Tag identification is an important tool in RFID systems with applications for monitoring and tracking. A RFID reader recognizes tags through communication over a shared wireless channel. When multiple tags simultaneously transmit their IDs to a reader, the tag signals collide and this collision disturbs the reader's identification process. Therefore, tag collision arbitration for passive RFID tags is a significant issue for fast identification. This paper presents two adaptive tag anti-collision protocols, an Adaptive Query Splitting protocol (AQS), which is an improvement on the query tree protocol and an Adaptive Binary Splitting protocol (ABS), which is based on the binary tree protocol, which is a de facto standard for RFID anti-collision protocols. To reduce collisions and identify tags efficiently, adaptive splitting protocols use information obtained from the last process of tag identification. Our performance evaluation shows that AQS and ABS outperform other tree based tag anti-collision protocols. Tag collision arbitration for passive RFID tags is a significant issue for fast tag identification. This letter presents a novel tag anti-collision scheme called adaptive binary splitting (ABS). For reducing collisions, ABS assigns distinct timeslots to tags by using information obtained from the last identification process. Our performance evaluation shows that ABS outperforms other tree based tag anti-collision protocols. In this paper we present a new tree search-based protocol for the anti-collision problem of RFID systems. This protocol builds a binary search tree according to the prefixes chosen randomly by tags rather than using their ID-based prefixes. Therefore, the tag identification time of the proposed protocol is no longer limited by the tag ID distribution and ID length as the conventional tree search protocol. The time complexity of the protocol is derived and shown that it can identify tags faster than the Query-Tree protocol.