An Efficient and Easy-to-Implement Tag Identification Algorithm for UHF RFID Systems

Chen, Yongrui; Su, Jian; Yi, Weidong

doi:10.1109/lcomm.2017.2649490

Cited by 23 publications

(50 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…e frame length L of the next frame is calculated according to (9). Because (16) needs to rely on the identification result of two frames, the parameters of the frame length L and SIDw of the first two frames are run according to the initial value and then calculated frame by frame.…”

Section: Mobile Information Systemsmentioning

confidence: 99%

“…In dynamic arrival scenarios, the miss rate is an important indicator for evaluating the reliability of the algorithm. e smaller the waiting time threshold, the greater the (12) if (SIDt � � SIDc and TagSate is Wait) (13) response RN16; (14) else if (Instruction is IndicateArrival) begin (15) if (SIDt � � SIDc and (TagSate is Wait or Arrival)) (16) response RN16; (17) else if (TagSate is NewArrival) begin (18) SIDt � Generate random slot number;/ * SIDt between SIDl + 1 and L. * / (19) Set TagSate to Arrival; (20) if(SIDt � � SIDc) (21) response RN16; (22) end (23) end (24) else if (Instruction is Ack) (25) if (RN16 is itself ) begin (26) Set IsIdentified to ture; (27) Set TagSate probability of tag miss. In general, when the miss rate of the algorithm is 0, all tags are guaranteed to be identified and the algorithm is considered to be reliable.…”

Section: Miss Ratementioning

confidence: 99%

“…On the contrary, the DAS-DFSA algorithm inherits the essence of MT-EDFSA and CDFSA and overcomes their shortcomings. Unequal-length slots are adopted to reduce the communication time overhead, and blocking technology is used to isolate new arrival tags from waiting tags, so it can Broadcast IndicateWait/IndicateArrival instruction; (14) Identification process and read answers; (15) Update identification results Ss/Sc/Se; (16) SIDc++; (17) if (SIDc ≥ SIDl) (18) Set SIDl to SIDc + 1; (19) if (SIDc ≥ L) (20) Set FrameIsEnd is true; (21) } (22) if (Frame_counts ≥ 2) begin (23) Calculate or use the arrival rate λ of this frame; (24) Calculate the frame length L of next frame;…”

Section: Waiting Timementioning

confidence: 99%

“…However, when multiple tags respond simultaneously, the collision of signals will lead to the failure to identify any tags [13], which reduces the system efficiency. e anticollision algorithm provides a solution to this problem and has achieved many research results [8,11,[14][15][16][17]. RFID tag anticollision algorithms are mainly divided into tree-based and ALOHAbased algorithms [8,11,[18][19][20].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A Fast RFID Tag Anticollision Algorithm for Dynamic Arrival Scenarios Based on First-Come-First-Serve

Zhang

Tao

et al. 2019

Mobile Information Systems

View full text Add to dashboard Cite

Radio-frequency identification (RFID) tag anticollision algorithm is a key technology that affects the performance of RFID systems. In dynamic arrival scenarios, when the tags arrive the reader’s interrogation zone, they cannot participate in the ongoing identification immediately, resulting in longer waiting time and tag miss. Focusing on solving this problem, based on blocking technology, dynamic frame-slotted ALOHA (DFSA) algorithm, and the first-come-first-serve (FCFS) idea, a fast RFID tag anticollision algorithm for dynamic arrival scenarios is proposed, named as “DAS-DFSA algorithm”. By optimizing the instruction structure and identification process, the DAS-DFSA allows the new arrival tag to immediately participate in the ongoing identification process, the tag’s waiting time is shortened, and the miss rate is reduced. DAS-DFSA not only adopts blocking technology to prevent the collision between the arrival tag and waiting tag but also uses unequal-length slots to reduce the communication time overhead. Simulation results show that the identification speed of the algorithm is significantly improved and high system efficiency is guaranteed. Under the same operating conditions, compared with similar algorithms, the waiting time is shortened by more than 44.548% and the identification speed is improved by at least 39.053%. More importantly, it can provide the instant-on-service for dynamic arrival tags and can fully meet the requirements of fast identification of tags in different dynamic arrival scenarios.

show abstract

Section: Mobile Information Systemsmentioning

confidence: 99%

Section: Miss Ratementioning

confidence: 99%

Section: Waiting Timementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Fast RFID Tag Anticollision Algorithm for Dynamic Arrival Scenarios Based on First-Come-First-Serve

Zhang

Tao

et al. 2019

Mobile Information Systems

View full text Add to dashboard Cite

show abstract

“…M Mayer and N Goertz 19 designed a novel scheme of RFID tag identification with compressed sensing techniques, and simulations show that this new scheme significantly outperforms FSA protocol regarding identification speed and noise robustness. YR Chen et al 20 proposed a novel sub-frame-based DFSA protocol, which can improve the system utility to approximately 0.36 and reduce the computation complexity. V Namboodiri and LX Gao 21 proposed three novel protocols which combine the idea of binary tree search protocol with that of FSA protocol and developed an analytical framework to predict the performance of their protocols in terms of the average reader energy consumption, average tag energy consumption, and so on.…”

Section: Introductionmentioning

confidence: 99%

A multi-tag anti-collision protocol based on 8-ary adaptive pruning query tree

Chu

Qian

Wang

2018

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

In order to solve the problem of multi-tag anti-collision in radio frequency identification systems, a multi-tag anti-collision protocol based on 8-ary adaptive pruning query tree is proposed in this article. According to Manchester code, the highest collision bit can be detected. In the process of tag identification, the protocol only locks the target on the three consecutive bits which start from the highest collision bit. The protocol has two tag identification mechanisms, and which one is chosen is determined by the value of collision coefficient. Using the collision information characteristics of the three bits, idle timeslots are evitable, and some collision timeslots are eliminated at the same time. The 8-ary adaptive pruning query tree protocol fully takes into account several important performance indicators such as the number of query timeslots, communication complexity, transmission delay, and throughput. Both theoretical analysis and simulation results show that this protocol performs better than other tree-based anti-collision protocols. The throughput of 8-ary adaptive pruning query tree protocol remains approximately 0.625.

show abstract

Internet of Things technology in mineral remote sensing monitoring

Liu

Dhakal

2020

Circuit Theory & Apps

View full text Add to dashboard Cite

At present, the rapid development of the national economy consumes a lot of mineral resources, but the national resource extraction efficiency is low. The traditional prospecting methods consume time, money, and personnel, which cannot meet the national demand for resources in a short time. Therefore, technological innovation is needed to reduce consumption in all aspects. With the continuous development of Internet of Things technology, its application is also more extensive. This paper studies the application of Internet of Things technology in mineral remote sensing monitoring. First of all, this research mainly uses the wireless communication technology in the Internet of Things to achieve data transmission and sharing in a short distance and, second, based on the remote sensing monitoring results of the mine environment to comprehensively understand the mining area and find the suitable mining mineral resources at the fastest speed; finally, the dynamic frame time slot ALOHA algorithm is used to estimate the existing data to ensure the availability of the data. The experimental data show that vector point encryption is performed on the center line of the mine at intervals of 10, 15, 20, 30, and 50 m, respectively, and the dynamic frame slot algorithm is used to calculate the appropriate mine mining curve radius. The experimental results show that the application of Internet of Things technology in mineral remote sensing monitoring can accelerate the mining of mineral resources.

show abstract

An Efficient and Easy-to-Implement Tag Identification Algorithm for UHF RFID Systems

Cited by 23 publications

References 10 publications

A Fast RFID Tag Anticollision Algorithm for Dynamic Arrival Scenarios Based on First-Come-First-Serve

A Fast RFID Tag Anticollision Algorithm for Dynamic Arrival Scenarios Based on First-Come-First-Serve

A multi-tag anti-collision protocol based on 8-ary adaptive pruning query tree

Internet of Things technology in mineral remote sensing monitoring

Contact Info

Product

Resources

About