Flood Diversion Algorithm for Anticollision in RFID System

Abstract

Radio frequency identification (RFID) provides a contactless approach for object identification. If there are multiple tags in the interrogation zone of a reader, tag collision occurs due to radio signal interference. To solve tags identification collision and improve identification efficiency in RFID system, a flood division anticollision (FDAC) algorithm has been presented. Firstly, the algorithm launches an estimation of the number of tags and according to the estimation result decides whether a flood diversion processing needs to be started or not. Secondly, when the flood diversion processing needs to be done, all tags are grouped and assigned to different models in which the tags are to be processed and identified in parallel. Thirdly, in the identification processing, for reducing data transmission, the reader needs only to send a three-dimensional-vector command to tags, tags respond to the command with part of collision-bit parameters, and stack and queue are adopted to store precious request command and tags' ID to avoid repeatedly transmitting them between the reader and the tags. Simulation experiment results show that FDAC is superior to the dynamic frame slotted (DFS) Aloha algorithm, the binary-retreat tree algorithm (BRT) and the dynamic binary-search tree (DBST) algorithm, in the performances of data bits transmission, identification time delay, and energy consumption by the reader.

Improved Anti-Collision Algorithm for Tag Identification in Future Internet of Things

“…Hua Huo, Jun Qiang Liu, and Yong Jie Wang proposed a new anti-collision algorithm based on flood division idea to reduce data bits transmitted and identification time delay [12]. In Chang-Su Kim1, Bong-Im Jang and Hoe-Kyung Jung analyzed tag identification time to minimize tag collisions and improve tag identification time by applying various tag anti-collision algorithms in the suggested method based on an optimum number of readers used in the RFID system environment [13].…”

“…Some research goes to improve RFID anti-collision algorithms through the algorithm search times, communication capacity and throughput of index analysis [11]. Other research goes to solve tags identification collision and improve identification efficiency in RFID system, by using a flood division anti-collision (FDAC) algorithm, these algorithm launches an estimation of the number of tags, then all tags are grouped, and avoid repeatedly transmitting them between the reader and the tags [12].…”

Efficient DFSA Algorithm in RFID Systems for the Internet of Things

“…In [19][20][21][22], the authors developed the following equations to estimate the number of unidentified tags in RFID systems. The parameters 0 , 1 , and are the expected values of idle, success, and collision slots in a contending frame, and , , and are the observed idle, success, and collision slots.…”

A Novel Channel Coding Scheme for RFID Generation-2 Systems

“…For example, all the messages exchanged add a significant overhead on the channel, and its dynamic slot updates require time to converge to the best configuration. Several studies have been carried out in order to improve the performance of Aloha-based protocols in the presence of collisions [11][12][13][14]. However, most of these works depend on the estimation of the tag population in the reader's range, leveraging on results obtained in the previous time slots.…”