A new anti‐collision algorithm for RFID tag

Abstract

SUMMARY We present a new radio frequency identification tag anti‐collision algorithm in this paper. The main idea of this algorithm is that we should find the collided bit at first, and every tag contains a register RC, which has length the same as the tag's ID length to store the conflict bit, then all the subsequent processing are based on the conflict bit. In this new algorithm, tag uses a binary pulse string to transfer data to the reader, compared with the traditional query tree‐based algorithms, which is based on the tag's ID; this new algorithm is more efficient and requires fewer read cycles for tag's identification. Copyright © 2013 John Wiley & Sons, Ltd.

A new anti‐collision protocol based on information of collided tags in RFID systems

“…The methodology of the present study furthers the study conducted by Zhang et al [19], which also employs the information of the collided data for tags identification. In [19], there is an assumption that the data of tags arrive to the reader exactly in the same time.…”

Research on the Dynamic Scenes' Ability to Adjust to the RFID Anti-Collision Calculation Method

“…This calculation method is based on the following presumed conditions: (1) The reader is free to move; it can be added or taken away (2) There is an active reader in every reader and it can adjust the power according to the parameter of the transmission The calculation method is as shown in Figure 3 The steps are shown below: 1) Every time a tag is detected within the range of a reader, a data-listening channel is started to check if the statistics channel is free. If it is, the decoding process of the tag will then commence.…”

“…When the numbers of tags are involved small, it can satisfy the decoding performance needed [2]. As the calculation method is being divided into the groups, the data received during each stage needs to be temporarily saved to create a binary tree, which is similar to a data structure.…”

A new clustering routing method based on PECE for WSN

“…Many recent research efforts on open vehicle routing (OVR) problems [21][22][23][24][25][26] have been studied, which are active areas in operations research and based on similar assumptions and constraints compared to sensor networks. Several new insights motivate the scholars [27][28][29][30][31][32][33][34][35][36][37] to adapt these schemes so that they can solve or prove certain challenging problems in WSN applications, such as the data collection protocol called EDAL, which stands for Energy-efficient Delay-aware Lifetime-balancing data collection [38][39][40][41][42][43][44][45].…”

“…It mainly requires two types of agents that are used for routing [21][22][23][24][25][26]: the scouts find out the new route to sink node as required, and the foragers will transmit the data packets and evaluate the quality of the route that has been found by the predictive energy consumption of the routing path and the end-to-end delay [27][28][29][30][31][32][33][34][35][36]. The foragers perceive the network state and evaluate the different routes in WSN according to the measured indicators, and then choose the suitable path for routing data packets with the intent to maximize the survival time of the network [37][38][39][40][41][42][43][44][45].…”