2008 IEEE International Conference on RFID 2008
DOI: 10.1109/rfid.2008.4519369
|View full text |Cite
|
Sign up to set email alerts
|

The Slotted-LBT: A RFID Reader Medium Access Scheme in Dense Reader Environments

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
10
0

Year Published

2009
2009
2017
2017

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 15 publications
(10 citation statements)
references
References 6 publications
0
10
0
Order By: Relevance
“…However, ALOHA efficiency is not as high as required in RFID applications, while carrier-sense features are prone to hidden/expose terminal problems and also suffer from complexity issues at the reader side in order to implement the sensing mechanism (Birari & Iyer (2005)). A proposal for a medium access technique for RFID readers is provided in (Quan et al (2008)) and is referred to as Slotted-LBT (S-LBT). Based on carrier-sensing or LBT, this algorithm makes use of several channels, and in case the selected channel is sensed as busy, a new channel is considered for the transmission.…”
Section: Reader Collision Resolution Algorithmsmentioning
confidence: 99%
“…However, ALOHA efficiency is not as high as required in RFID applications, while carrier-sense features are prone to hidden/expose terminal problems and also suffer from complexity issues at the reader side in order to implement the sensing mechanism (Birari & Iyer (2005)). A proposal for a medium access technique for RFID readers is provided in (Quan et al (2008)) and is referred to as Slotted-LBT (S-LBT). Based on carrier-sensing or LBT, this algorithm makes use of several channels, and in case the selected channel is sensed as busy, a new channel is considered for the transmission.…”
Section: Reader Collision Resolution Algorithmsmentioning
confidence: 99%
“…Since V r ⊆ I r ∪ S r for each r ∈ R, if neither type 1 nor type 2 reader-to-tag collisions occur, then reader-to-reader collision will not happen either. Thus, the set V r does not appear in (8). It is easy to verify that if τ r (N r ) > T/2 for all r ∈ R, then we can simply set γ r,n = 1 for each r ∈R and any n ∈I r .…”
Section: B Rfid Multi-channel Medium Access Controlmentioning
confidence: 99%
“…FDFA ALGORITHM Although the utilities in (11) are concave functions in P succ r for α >0, problem (P1) is not a convex optimization problem with respect to p, due to the product forms in (8). Thus, finding the optimal solutions of problem (P1) is not easy in general.…”
Section: Problem Formulationmentioning
confidence: 99%
See 2 more Smart Citations