2014
DOI: 10.12720/jcm.9.10.798-804
|View full text |Cite
|
Sign up to set email alerts
|

An Enhanced Posterior Probability Anti-Collision Algorithm Based on Dynamic Frame Slotted ALOHA for EPCglobal Class1 Gen2

Abstract: In a Radio Frequency Identification (RFID) System, collision between tags is one of the core problems that we must consider about. In general, a collision will occur when more than one tag communicates with the reader simultaneously, reducing the system efficiency. To solve this, dynamic frame slotted ALOHA (DFSA) is widely adopted nowadays, and as a variant of DFSA algorithm, Q-algorithm is accepted by the EPCglobal specifications for RFID air interface Class1 Gen2 protocol. Based on this, we provide a new al… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2018
2018
2018
2018

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 15 publications
0
2
0
Order By: Relevance
“…The first issue requires that the emphasis be placed on reducing the number of collisions while the second one on scanning a group of known tags and identifying missing tags in the current round [ 21 , 22 ]. When the number of tags is equal to the number of slots in the initial frame, BTSA achieves the highest efficiency value of 0.43 [ 23 ], which is greater than the pure binary tree protocol [ 24 ] and the dynamic frame slotted ALOHA (Dynamic FSA) [ 12 ] with the same efficiency as the tree slotted ALOHA protocol (TSA) [ 18 , 25 ]. Different protocols have applied BTSA, such as Modified Q [ 26 ], estimation based FSA and binary selection [ 27 ] and adoptive binary splitting (ABS) [ 28 ].…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…The first issue requires that the emphasis be placed on reducing the number of collisions while the second one on scanning a group of known tags and identifying missing tags in the current round [ 21 , 22 ]. When the number of tags is equal to the number of slots in the initial frame, BTSA achieves the highest efficiency value of 0.43 [ 23 ], which is greater than the pure binary tree protocol [ 24 ] and the dynamic frame slotted ALOHA (Dynamic FSA) [ 12 ] with the same efficiency as the tree slotted ALOHA protocol (TSA) [ 18 , 25 ]. Different protocols have applied BTSA, such as Modified Q [ 26 ], estimation based FSA and binary selection [ 27 ] and adoptive binary splitting (ABS) [ 28 ].…”
Section: Related Workmentioning
confidence: 99%
“…Dynamic FSA [ 6 , 13 , 17 , 31 , 32 ] adjusts frame length with consecutive frames, which may include slots, to set up the identification process. Dynamic FSA has been merged with tree algorithms [ 15 , 18 , 23 , 26 , 33 ] to improve identification efficiency.…”
Section: Related Workmentioning
confidence: 99%