probabilistic optimal tree hopping for rfid identification muhammad shahzad alex x. liu dept. of...
TRANSCRIPT
![Page 1: Probabilistic Optimal Tree Hopping for RFID Identification Muhammad Shahzad Alex X. Liu Dept. of Computer Science and Engineering Michigan State University](https://reader036.vdocuments.mx/reader036/viewer/2022062719/56649ed15503460f94bdfffc/html5/thumbnails/1.jpg)
Probabilistic Optimal Tree Hoppingfor RFID Identification
Muhammad Shahzad Alex X. LiuDept. of Computer Science and Engineering
Michigan State UniversityEast Lansing, Michigan, 48824, USA
![Page 2: Probabilistic Optimal Tree Hopping for RFID Identification Muhammad Shahzad Alex X. Liu Dept. of Computer Science and Engineering Michigan State University](https://reader036.vdocuments.mx/reader036/viewer/2022062719/56649ed15503460f94bdfffc/html5/thumbnails/2.jpg)
2
RFID is everywhere
Muhammad Shahzad
![Page 3: Probabilistic Optimal Tree Hopping for RFID Identification Muhammad Shahzad Alex X. Liu Dept. of Computer Science and Engineering Michigan State University](https://reader036.vdocuments.mx/reader036/viewer/2022062719/56649ed15503460f94bdfffc/html5/thumbnails/3.jpg)
3
Radio Frequency Identification
010100110000 1000 11010110 101110101001
Muhammad Shahzad
![Page 4: Probabilistic Optimal Tree Hopping for RFID Identification Muhammad Shahzad Alex X. Liu Dept. of Computer Science and Engineering Michigan State University](https://reader036.vdocuments.mx/reader036/viewer/2022062719/56649ed15503460f94bdfffc/html5/thumbnails/4.jpg)
4
Tree Walking (EPCGlobal Standard)
0
00
000 001
01
1
10 11
010 011 100 101
100
0
100
1101
0
101
1Number of queries: 16
1
2
3 4
5
6 7
8
9
10
11 12
13
14 15
16
Muhammad Shahzad
![Page 5: Probabilistic Optimal Tree Hopping for RFID Identification Muhammad Shahzad Alex X. Liu Dept. of Computer Science and Engineering Michigan State University](https://reader036.vdocuments.mx/reader036/viewer/2022062719/56649ed15503460f94bdfffc/html5/thumbnails/5.jpg)
5
Optimizing Tree Walking
Muhammad Shahzad
Total queries = successful + collisions + empty Minimize total queries
![Page 6: Probabilistic Optimal Tree Hopping for RFID Identification Muhammad Shahzad Alex X. Liu Dept. of Computer Science and Engineering Michigan State University](https://reader036.vdocuments.mx/reader036/viewer/2022062719/56649ed15503460f94bdfffc/html5/thumbnails/6.jpg)
6
Limitations of Prior Art
All prior work proposes heuristics to reduce identification time─ MobiHoc’06, PerCom’07, INFOCOM’09, ICDCS’10
No formal model of the Tree Walking process─ No optimality results
Muhammad Shahzad
![Page 7: Probabilistic Optimal Tree Hopping for RFID Identification Muhammad Shahzad Alex X. Liu Dept. of Computer Science and Engineering Michigan State University](https://reader036.vdocuments.mx/reader036/viewer/2022062719/56649ed15503460f94bdfffc/html5/thumbnails/7.jpg)
7
Our Modeling of Tree Walking
𝑇=∑𝑙=1
𝑏
∑𝑝=0
2𝑙− 1
𝐼 ( 𝑙 ,𝑝)
E [𝑇 ]=∑𝑙=1
𝑏
∑𝑝=0
2𝑙−1
𝑃 {(𝑙 ,𝑝 ) }
equals the probability that parent of node is a collision
𝑃 {¿ tags=𝑘 }=(𝑚𝑘 )(𝑛−𝑚𝑧−𝑘 )
(𝑛𝑧)(Hypergeometric distribution)
Level l
Position p
n=16
m=4
Muhammad Shahzad
𝑃𝑐=𝑃 {𝑘>1 }
![Page 8: Probabilistic Optimal Tree Hopping for RFID Identification Muhammad Shahzad Alex X. Liu Dept. of Computer Science and Engineering Michigan State University](https://reader036.vdocuments.mx/reader036/viewer/2022062719/56649ed15503460f94bdfffc/html5/thumbnails/8.jpg)
8
Proposed Approach
1. Estimate unidentified tag population size2. Find optimal level and the first unvisited node3. Perform Tree Walking. Go to step 1
Muhammad Shahzad
![Page 9: Probabilistic Optimal Tree Hopping for RFID Identification Muhammad Shahzad Alex X. Liu Dept. of Computer Science and Engineering Michigan State University](https://reader036.vdocuments.mx/reader036/viewer/2022062719/56649ed15503460f94bdfffc/html5/thumbnails/9.jpg)
9
Population Size Estimation First time estimation: rough, but fast
─ We adapt a fast scheme proposed by Flajolet and Martin in the database community in 1985.
─ Did not use accurate RFID estimation schemes
Subsequent estimation = estimated tags - identified tags
Muhammad Shahzad
![Page 10: Probabilistic Optimal Tree Hopping for RFID Identification Muhammad Shahzad Alex X. Liu Dept. of Computer Science and Engineering Michigan State University](https://reader036.vdocuments.mx/reader036/viewer/2022062719/56649ed15503460f94bdfffc/html5/thumbnails/10.jpg)
10
Calculating Optimal Level
E [𝑇 ]=2𝛾+ ∑𝑙=𝛾+1
𝑏
∑𝑝=0
2𝑙
𝑃 {(𝑙 ,𝑝 ) }
Calculate if we start from level between and
Minimize to obtain optimal
Muhammad Shahzad
![Page 11: Probabilistic Optimal Tree Hopping for RFID Identification Muhammad Shahzad Alex X. Liu Dept. of Computer Science and Engineering Michigan State University](https://reader036.vdocuments.mx/reader036/viewer/2022062719/56649ed15503460f94bdfffc/html5/thumbnails/11.jpg)
11
Effect of obtaining optimal
Muhammad Shahzad
![Page 12: Probabilistic Optimal Tree Hopping for RFID Identification Muhammad Shahzad Alex X. Liu Dept. of Computer Science and Engineering Michigan State University](https://reader036.vdocuments.mx/reader036/viewer/2022062719/56649ed15503460f94bdfffc/html5/thumbnails/12.jpg)
12
Tree Hopping vs. Tree Walking
Muhammad Shahzad
![Page 13: Probabilistic Optimal Tree Hopping for RFID Identification Muhammad Shahzad Alex X. Liu Dept. of Computer Science and Engineering Michigan State University](https://reader036.vdocuments.mx/reader036/viewer/2022062719/56649ed15503460f94bdfffc/html5/thumbnails/13.jpg)
13
Tree Hopping Example
000 001 010 011 100 101
11
100
0
100
1101
0
101
1
Number of queries: 11 (compared to 16 of TW)
1 2 3 4
11
6 7 9 10
5 8
Muhammad Shahzad
![Page 14: Probabilistic Optimal Tree Hopping for RFID Identification Muhammad Shahzad Alex X. Liu Dept. of Computer Science and Engineering Michigan State University](https://reader036.vdocuments.mx/reader036/viewer/2022062719/56649ed15503460f94bdfffc/html5/thumbnails/14.jpg)
14
Experimental Evaluation Implemented 8 protocols in addition to TH
1. BS (IEEE Trans. on Information Theory , 1979)2. ABS (MobiHoc, 2006)3. TW (DIAL-M 2000)4. ATW (Tanenbaum, 2002)5. STT (Infocom, 2009)6. MAS (PerCom, 2007)7. ASAP (ICDCS 2010)8. Frame Slotted Aloha (IEEE Transactions on
Communications, 2005)
Muhammad Shahzad
![Page 15: Probabilistic Optimal Tree Hopping for RFID Identification Muhammad Shahzad Alex X. Liu Dept. of Computer Science and Engineering Michigan State University](https://reader036.vdocuments.mx/reader036/viewer/2022062719/56649ed15503460f94bdfffc/html5/thumbnails/15.jpg)
15
Improvement of TH over prior art Uniformly distributed populations
─ Total number of queries: 50%─ Identification time: 10%─ Average responses per tag: 30%
Non-uniformly distributed populations─ Total number of queries: 26%─ Identification time: 37%─ Average responses per tag: 26%
Muhammad Shahzad
![Page 16: Probabilistic Optimal Tree Hopping for RFID Identification Muhammad Shahzad Alex X. Liu Dept. of Computer Science and Engineering Michigan State University](https://reader036.vdocuments.mx/reader036/viewer/2022062719/56649ed15503460f94bdfffc/html5/thumbnails/16.jpg)
16
Normalized Queries
Muhammad Shahzad
![Page 17: Probabilistic Optimal Tree Hopping for RFID Identification Muhammad Shahzad Alex X. Liu Dept. of Computer Science and Engineering Michigan State University](https://reader036.vdocuments.mx/reader036/viewer/2022062719/56649ed15503460f94bdfffc/html5/thumbnails/17.jpg)
17
Identification Speed
Muhammad Shahzad
![Page 18: Probabilistic Optimal Tree Hopping for RFID Identification Muhammad Shahzad Alex X. Liu Dept. of Computer Science and Engineering Michigan State University](https://reader036.vdocuments.mx/reader036/viewer/2022062719/56649ed15503460f94bdfffc/html5/thumbnails/18.jpg)
18
Normalized Collisions
Muhammad Shahzad
![Page 19: Probabilistic Optimal Tree Hopping for RFID Identification Muhammad Shahzad Alex X. Liu Dept. of Computer Science and Engineering Michigan State University](https://reader036.vdocuments.mx/reader036/viewer/2022062719/56649ed15503460f94bdfffc/html5/thumbnails/19.jpg)
19
Normalized Empty Reads
Muhammad Shahzad
![Page 20: Probabilistic Optimal Tree Hopping for RFID Identification Muhammad Shahzad Alex X. Liu Dept. of Computer Science and Engineering Michigan State University](https://reader036.vdocuments.mx/reader036/viewer/2022062719/56649ed15503460f94bdfffc/html5/thumbnails/20.jpg)
20
Conclusion First effort towards modeling the Tree Walking
process Proposed a method to minimize the expected
number of queries More in the paper
─ Method to make TH reliable in the presence of communication errors
─ Continuous scanning of dynamically changing tag populations
─ Multiple readers environment with overlapping regions Comprehensive side-by-side comparison of TH with
8 major prior tag identification protocols
Muhammad Shahzad
![Page 21: Probabilistic Optimal Tree Hopping for RFID Identification Muhammad Shahzad Alex X. Liu Dept. of Computer Science and Engineering Michigan State University](https://reader036.vdocuments.mx/reader036/viewer/2022062719/56649ed15503460f94bdfffc/html5/thumbnails/21.jpg)
21
Questions?
Muhammad Shahzad