2014
DOI: 10.1007/s11036-014-0524-9
|View full text |Cite
|
Sign up to set email alerts
|

Check out the Rules: Towards Time-Efficient Rule Checking over RFID Tags

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2017
2017
2018
2018

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 14 publications
0
1
0
Order By: Relevance
“…Tags are allocated to various classes based on the early tag approximation and then occurrence several read cycle for identification. We have total identification time slots for ALOHA algorithms [36][37][38] are given by (24):…”
Section: T Hr E(x 1 )T 1 E(x 0 )T 0 + E(x 1 )T 1 + E(x C )T Cmentioning
confidence: 99%
“…Tags are allocated to various classes based on the early tag approximation and then occurrence several read cycle for identification. We have total identification time slots for ALOHA algorithms [36][37][38] are given by (24):…”
Section: T Hr E(x 1 )T 1 E(x 0 )T 0 + E(x 1 )T 1 + E(x C )T Cmentioning
confidence: 99%