Adaptive couple-resolution blocking protocol for repeated tag identification in RFID systems

Sunwoong Choi,Hae-Il Choi

doi:10.1186/s13638-016-0775-1

Abstract

RFID applications such as monitoring an object for a long time need to identify tags repeatedly within the scope of the reader. Re-identification process can be improved using the information obtained from the previous tag identification process. Couple-resolution blocking (CRB) protocol utilizes the blocking technique that prevents staying tags from being collided by newly arriving tags. Staying tags can be efficiently re-identified by utilizing the retained information. After staying tags are separately all identified, arriving tags are identified. In this paper, we argue that CRB may work more poorly than other protocols which do not consider the repeated tag identification, such as query tree (QT) and collision tree (CT) protocol, when only few tags stay. To tackle the problem, we propose an adaptive CRB (ACRB) protocol. In ACRB, the reader estimates the tag staying ratio during the re-identification process for staying tags. If the estimated ratio is lower than a certain threshold, the blocking technique is immediately abandoned. Instead, staying tags and arriving tags are identified together without considering the retained information. In addition, we propose to improve CRB further using CT protocol, instead of QT protocol. Through computer simulation, we show that ACRB improves the identification efficiency of CRB, especially when the tag staying ratio is low.

Highlights

A radio frequency identification (RFID) system consists of a reader and multiple tags
Our objective is to improve the performance of Couple-resolution blocking (CRB) when the tag staying ratio is low
We showed that CRB protocol which uses the blocking technique may work more poorly than other protocols such as query tree (QT) and collision tree (CT)

Summary

Introduction

A radio frequency identification (RFID) system consists of a reader and multiple tags. The reader broadcasts the query messages and identifies the tags based on the reply messages from the tags. Since the tags typically reply over the shared wireless medium and multiple tags can reply simultaneously to the reader, tag collision may occur at the reader. To resolve this collision problem and to successfully identify all the tags in RFID systems, many tag anti-collision protocols have been proposed. Tree-based protocols continuously split the set of tags into two subsets each time a collision occurs.

Objectives

Methods

Findings

Conclusion