2021
DOI: 10.1155/2021/6638936
|View full text |Cite
|
Sign up to set email alerts
|

Time Slot Detection‐Based M‐ary Tree Anticollision Identification Protocol for RFID Tags in the Internet of Things

Abstract: Recently, a number of articles have proposed query tree algorithms based on bit tracking to solve the multitag collision problem in radio frequency identification systems. However, these algorithms still have problems such as idle slots and redundant prefixes. In this paper, a time slot detection-based M -ary tree (Time Slot Detection based M … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 29 publications
0
1
0
Order By: Relevance
“…Anti-collision algorithms are divided into two categories: the tree-based algorithm [ 17 , 18 , 19 ] (including query tree and tree splitting) and the ALOHA-based algorithm [ 20 , 21 , 22 , 23 ]. The former requires high computing costs when solving the problem of tag starvation.…”
Section: Introductionmentioning
confidence: 99%
“…Anti-collision algorithms are divided into two categories: the tree-based algorithm [ 17 , 18 , 19 ] (including query tree and tree splitting) and the ALOHA-based algorithm [ 20 , 21 , 22 , 23 ]. The former requires high computing costs when solving the problem of tag starvation.…”
Section: Introductionmentioning
confidence: 99%