Overlap Aware Redundant Reader Elimination
E09802002
101 7
RFID (Radio Frequency Identification)
:(1) RFID (2) RFID
RFID
RFID
RFID :RFID
RFID RFID
Overlap Aware Redundant Reader Elimination (OA)
OA
OA RFID
RRE LEO LEO+RRE DRRE SDRRE OA
RFID RFID RFID
ABSTRACT
Radio Frequency Identification (RFID), is one of the wireless non-contact identification technologies. The RFID system mainly consists of two major components: (1) RFID tag, which is used to store information, and (2) RFID reader, which is used to access the information that are stored into RFID tags through radio wave. An object where a RFID tag is attached can be identified and tracked through a RFID reader without physical contact. Due to its convenience, RFID is progressively becoming common in recent years. However, there are problems that exist in RFID systems need to be solved, such as tag collision, reader collision, and the problem of redundant reader. The problem of redundant reader was proposed in recent years. Eliminating redundant reader not only decreases the number of probability of reader collision but also reduces the power consumption. In this paper, we mainly addressed the redundant reader problem, and hence a redundant reader elimination algorithm named Overlap Aware Redundant Reader Elimination (OA) was proposed. It analyzes the relationships between readers and tags to eliminate the redundant readers. In order to accurately evaluate the performance of the proposed method, it was performed in a variety of scenarios. The experiment results show that the proposed method eliminates the most number of redundant readers as compared with the RRE, the LEO, the LEO+RRE, the SDRRE, and the DRRE.
Keywords: RFID, RFID reader collision, redundant reader problem
!
...i
ABSTRACT...ii
...iii
...iv
...v
...vii
...1
1.1 ...1
1.2 ...2
1.3 ...2
...3
2.1 RRE ...4
2.2 LEO ...6
2.3 DBO ...8
2.4.1 DRRE ...9
2.4.2 SDRRE ...12
...21
...24
...28
...36
...37
...40
2-1 RRE ...4
2-2 LEO ...6
2-3 DBO ...9
2-4 DRRE ...11
3-1 ...14
3-2 SDRRE ...15
4-1 OA ...17
4-2 OA ...17
4-3 OA ...18
4-4 OA ...19
4-5 OA ...20
4-6 OA ...20
4-7 OA ...21
4-8 OA ...22
4-9 OA ...23
4-10 OA ...24
4-11 OA ...25
4-12 OA ...26
5-1 100 1000 ...29
5-2 100 1000 ...30
5-3 1000 10000 ...31
5-4 1000 10000 ...32
5-5 100 500 ...33
5-6 100 500 ...33 5-7 100 500 ...34 5-8 100 500 ...34
2-1 RRE ...5
2-2 LEO ...7
2-4 LEO ...7
2-4 RRE ...8
2-5 DRRE ...11
3-1 SDRRE ...15
4-1 4-7 ...23
4-2 4-7 ...23
4-3 4-9 ...25
4-4 4-11 ...26
4-5 4-12 ...27
5-1 ...28
A-1 100 1000 ...40
A-2 100 1000 ...40
A-3 1000 10000 ...41
A-4 1000 10000 ...41
A-5 100 500 ...41
A-6 100 500 ...42
A-7 100 500 ...42
A-8 100 500 ...42
1.1
RFID (Radio Frequency Identification)
RFID :
1. RFID Reader :
2. RFID Tag :
RFID RFID
RFID
(ETC) RFID
[2 4 9 11 12 15]
RFID
1.2
RFID
RFID
[10 14 22 24 25]
[19 20]
[1 6 7 18] [1 6 7 18]
1.3
RFID
(OA)
RFID TDMA( )
TDMA ALOHA
[10 14 22 24 25] Query Tree [3 5 13 16 17 21 23]
ALOHA (slotted)
slot Query Tree Binary Tree
0 1
(Tag ID)
( ) Binary Tree
ALOHA ALOHA
Colorwave [19 20]
Colorwave TDMA 0 Max Color
( ) kick
kick
RFID
[1 6 7 18] [1 6 7 18]
[1 6 7 18] [1 6 7 18]
2.1 RRE
Redundant Reader Eliminatio (RRE) [1]
RFID
RRE RRE
:
1. Holder: (Reader ID)
2. Tag_Count:
RRE :
:
: Tag_Count
Tag_Count
Holder Tag_Count
: Holder
Holder
2-1 RRE
2-1 RRE 2-1 Tn Rn RRE RRE
R1 R2 R3 RRE
2-1
2-1 RRE
Step Reader T1 T2 T3 T4
2
R1(2) (R1, 2) (R1, 2)
R2(4) (R2, 4) (R2, 4) (R2, 4) (R2,4) R3(1)
Result (R2, 4) (R2, 4) (R2, 4) (R2,4)
Redundant Reader(s) : R1,R3
2-1 Holder
Tag_Count
2-1 R2 RRE R2
T1 T4 Tag_Count R2 T1 T4 Holder Tag_Count R2
R3 T4 Tag_Count
T4 RRE 2-1
R1 R3 Holder R1 R3
RRE 2-1 RRE
2-1 RRE 2-1
R1 R3 RRE 100% 2-1
RRE
R1 R2 T1 2-1 R1
R2 T1 R1
T1 4 RRE
2.2 LEO
A Layered Optimization Approach (LEO) [6]
LEO :
1. Holder (Reader ID)
LEO :
: Holder
Holder Holder
2-2 LEO
2-2 LEO LEO R1 R3 R2
LEO 2-2
2-2 LEO
Step Reader T1 T2 T3 T4 T5 T6
R1 R1 R1 R1
R3 R3 R3 R3
R2
Final Result R1 R1 R1 R3 R3 R3
Redundant Reader(s) : R2
2-2 LEO 1
2-2 R2 LEO
Holder R2
LEO R1 R2 R3
2-3
2-3 LEO
Step Reader T1 T2 T3 T4 T5 T6
1
R1 R1 R1 R1
R2 R2 R2
R3 R3
Final Result R1 R1 R1 R2 R2 R3
Redundant Reader(s) : n/a
LEO 2-3
Holder
LEO
2-2 R1 R3 R2 LEO
LEO 33% LEO RRE 100%
2-1 LEO 66%
33%. RRE LEO 33% 2-2
RRE R1 R3 R2
RRE 2-5
2-4 RRE
Step Reader T1 T2 T3 T4 T5 T6
2
R1(3) (R1, 3) (R1, 3) (R1, 3)
R3(3) (R3, 3) (R3, 3) (R3, 3)
R2(4) (R2, 4) (R2,4) (R2, 4) (R2, 4)
Final Result (R1, 3) (R2, 4) (R2,4) (R2, 4) (R2, 4) (R3, 3)
Redundant Reader(s) : n/a
2-4 R1 R3 R2 RRE 2-2
RRE 2-2
RRE 2-4 RRE
2-2 0% LEO RRE LEO RRE
LEO RRE Holder Tag_Count
[6] LEO+RRE LEO
RRE RRE 100% LEO
RRE RRE
2.3 DBO
Distance Based Optimization (DBO) [7] LEO
LEO LEO 2-3
R1 R3 R2 R2 LEO
2-3 33% DBO
T1 T2
R2
R1 R3
T3 T4
· r
2-3 DBO
2-3 r (0< 1) DBO
LEO Holder
r
2-3 R1 R3 DBO
R1 R3 R2 R2
DBO 2-3 66%
[7]
DBO LEO 10% 15% DBO
DBO
2.4.1 DRRE
A Density-based Algorithm for Redundant Reader Elimination (DRRE) [18] RRE RRE
DRRE DRRE
DRRE :
1. Owner : (Reader ID)
2. Priority : 3. Ignore : 4. Reader_Num:
5. RID :
DRRE :
: Reader_Num
Reader_Num RID
: Reader_Num RID
Reader_Num
1 Ignore
DRRE
: Priority Ignore Ignore
Priority
Priority
Owner Priority
: Owner
Owner
2-4 DRRE
2-4 DRRE DRRE Reader_Num
0 R1 R2 R3 DRRE
2-5
2-5 DRRE
Step Reader T1 T2 T3
1
R1 [1, R1]
R2 [2, R1, R2] [1, R2]
R3 [2, R2, R3] [1, R3]
2
R1 R2
R3 Ignore Ignore
3 R1(1) (R1, 1) R2(2) (R2, 2)
Final Result [2, R1, R2], (R2, 2) [2, R2, R3], Ignore [1, R3], Ignore
Redundant Reader(s) : R1
2-5 DRRE Reader_Num
RID
DRRE DRRE
Owner Priority DRRE Reader_Num
[Reader_Num, RID+Reader_Num] R1 T1
Reader_Num 0 R1 [0+1, R1] T1 [Reader_Num, RID+0] R2
T1 T2 Reader_Num 1 0 R2 [1+1, R2] [1+0, R2]
T1 T2 [Reader_Num, RID+1] [Reader_Num, RID+0]
DRRE 2-5 DRRE R1 R2
R3 1 2 1 2-5 T3 Reader_Num
1 DRRE T3 R3
T2 T3 Ignore DRRE
DRRE R1 (R1, 1) T1 (Owner, Priority)
R2 R2 2 T1 Priority 1 R2
(R2, 2) T1 (Owner, Priority)
T2 R2 2-5
Owner R2 R3 DRRE
DRRE R1 DRRE
RRE DRRE
DRRE T1
2-5 T1 8
2.4.2 SDRRE
Simply Density-based Algorithm (SDRRE) [19]
DRRE SDRRE :
1. Partial Writing : SDRRE DRRE
0 1
P_Num DRRE P_Num
Reader_Num RID DRRE
(1- )
2. Back-Off Operation : SDRRE DRRE I_Time
Owner I_Time
DRRE
RRE LEO LEO+RRE DBO DRRE SDRRE
RRE RRE
RRE
RRE RFID
RFID
3-1 3-1 RRE
RRE
3-1
LEO RRE LEO
LEO LEO
LEO RRE
RRE LEO+RRE LEO RRE RRE
DBO DBO LEO
DBO
DRRE
Partial Writing Back-Off Operation SDRRE
SDRRE
3-2 SDRRE
3-2 SDRRE
SDRRE Partial_Writing 66%
R1 R2 R3 SDRRE
3-1
3-1 SDRRE
Step Reader T1 T2 T3 T4 T5 T6
2
R1 (1, R1) (1, R1)
R2 (1, R2) (1, R2)
R3 (2, R3) (2, R3)
Redundant Reader(s) : n/a
3-1 Reader_Num
1 SDRRE
SDRRE
SDRRE
SDRRE SDRRE
Overlap Aware Redundant Reader Elimination (OA)
4-1 OA
OA LEO
4-1 RRE 4-1 RRE
0% LEO LEO+RRE 33.3%
4-1 4-1
4-1 4-1 R2
R2
4-2
4-2 OA
4-2 T2 T5
T1 T6
: 1.
2.
4-2 R1 R3
4-3
4-3 OA
4-3 R1 R3 R2
OA
OA OA
OA :
1. Holder: (Reader ID)
2. Overlap:
3. Locked:
OA :
: Holder
Holder Holder
Holder Overlap
Overlap 4-4
FOR each reader
let the finish flag be equal to false
WHILE reader has not checked all the covered tags and the finish flag is equal to false IF the holder information of the tag is equal to null THEN
WHILE reader has not rechecked all the covered tags IF the holder information of the tag is equal to null THEN
let the holder information of the tag be equal to the reader ID ELSE IF the overlap information of the tag is equal to false THEN
let the overlap information of the tag be equal to true ENDIF
ENDWHILE
let the finish flag be equal to true ENDIF
ENDWHILE ENDFOR
4-4 OA
: Holder Overlap
Overlap
Locked Locked
4-5
FOR each reader
let the finish flag be equal to false
WHILE reader has not checked all the covered tags and the finish flag is equal to false IF the holder information of the tag is equal to the reader ID and
the overlap information of the tag is equal to false THEN WHILE reader has not rechecked all the covered tags
IF the holder information of the tag is not equal to the reader ID and the locked information of the tag is equal to false THEN
let the locked information of the tag be equal to true ENDIF
ENDWHILE
let the finish flag be equal to true ENDIF
ENDWHILE ENDFOR
4-5 OA
: Holder Locked
Locked Holder
Holder
4-6 FOR each reader
let redundant flag be equal true
WHILE reader has not checked all the covered tags and the redundant flag is equal to true
IF the holder information of the tag is equal to the reader ID and the locked information of the tag is equal to false THEN
let redundant be equal to false ENDIF
ENDWHILE
IF redundant is equal to true THEN let the reader enter sleep mode END IF
ENDFOR
4-6 OA
DRRE OA
OA
OA Holder
Holder OA
Holder OA
Overlap Overlap OA
Overlap OA
Locked Locked OA
Locked OA
4-7 OA
4-7 OA
O
Overlap Overlap L Locked Locked
R1 R2 R3 OA
4-8
OA
OA OA
4-8 OA
OA R1 OA
T1 T2 T3 Holder R1
R2 OA T4 T5 Holder
R2 T4 T5 Holder R1 T2 T3 Overlap
R3 OA T6 Holder T4 T5 Overlap
4-9 OA R1 R3
Overlap T1 T6 R1 R3 OA
R1 OA
R1 R1 OA Locked
R3 OA T4 T5 R2
R3 T4 T5 OA R2 T2
T3 R1 T4 T5 R3 R2
Holder 4- 8 OA
OA OA R1 R2 R3
4-7 R2 3!=6 6
4-7 4-1 4-1
4-7 4-2
DRRE OA 100% 4-7
4-1 4-7
Execution Order LEO RRE LRRE DRRE OA
R1 R2 R3 R2 R2
R1 R3 R2 R2 R2 R2 R2
R2 R1 R3 R2 R2
R2 R3 R1 R2 R2
R3 R1 R2 R2 R2 R2 R2
R3 R2 R1 R2 R2
4-2 4-7
Redundant Reader LEO RRE LRRE DRRE OA
R2 33% 0% 33% 100% 100%
4-9 OA
4-9 R1 R2 R3 OA 4-10
OA
OA OA
4-10 OA
OA R1 OA
T1 T2 Holder R1
R2 OA T3 T4 Holder R2
T3 T4 Holder R1 T1 T2 Overlap
R3 OA R3 OA
Holder Overlap 4-10 OA
R2 R3 Overlap
T3 T4 R3 R2 OA
R2 OA
T1 T2 R1 R2 T1 T2
OA R1 T1 T1
R2 R3 T4 R2 R1 R3
Holder 4-10 OA
4-9 4-3
4-3 4-9
Redundant Reader LEO RRE LRRE DRRE OA
R1 33.3% 0% 0% 0% 0%
R3 33.3% 0% 0% 0% 0%
R1,R3 33.3% 100% 100% 100% 100%
4-3 LEO 100% 4-9
DRRE OA 100% 4-7 4-9
4-11 OA
4-11 OA 4-11
4-11 4-4
4-4 4-11
Redundant Reader LEO RRE LRRE DRRE OA
R1 16.6% 0% 0% 0% 0%
R2 33.3% 0% 33.3% 0% 33.3%
R3 16.6% 0% 0% 0% 0%
R1,R3 33.3% 100% 66.6% 100% 66.6%
4-11 OA
4-4 OA 66% DRRE
4-2 4-4 100%
DRRE
DRRE
T2 T1
T3
T4
R2
R3 R1
R4
4-12 OA
4-12 4-12 R3 R4
DRRE R3 R4 4-12 R2
R4 DRRE
4-12 4-12
4-5 4-5 DRRE
OA
4-5 4-12
Redundant Reader LEO RRE LRRE DRRE OA
R2 29.1% 70.8% 33.3% 50% 0%
R3 33.3% 0% 33.3% 0% 33.3%
R4 12.5% 0% 0% 0% 4.16%
R2,R4 20.8% 29.1% 33.3% 50% 62.5%
OA
4-2 4-5
DRRE OA
DRRE 4-4
4-11 4-11
DRRE OA 4-4
OA DRRE
OA
OA LEO RRE
OA
OA
OA RRE LEO LRRE (LEO+RRE) DRRE SDRRE( =50%)
MinGW
C++ Code Block 10000
10000 ( : ) :
1. RC :
2. Radius : ( : )
3. TC :
:
1. : RC = 500 , Radius = 500 , TC = 100 1000
2. : RC = 500 , Radius = 500 , TC = 1000 10000
3. : RC = 100 500 , Radius = 500 , TC = 10000
4. : RC = 500 , Radius = 100 500 , TC = 10000
5-1
5-1
Algorithm Address N Address N+0 Address N+1 Address N+2 Address N+3 RRE Holder Tag_Count
LEO Holder
LEO+RRE Holder Tag_Count
DRRE Owner Priority Ignore Reader_Num *RID
SDRRE Owner Ignore Reader_Num *RID
OA Holder Overlap Locked
5-1
DRRE SDRRE RID
Reader_Num
100 1000
5-1
5-1 100 1000
5-1 100 RRE LRRE DRRE SDRRE OA
300 OA
LEO
RRE LRRE RRE
5-1
LEO RRE DRRE
DRRE
RRE 50% SDRRE DRRE
200 250 300 350 400 450 500
100 200 300 400 500 600 700 800 900 1000
NumberofRedundantReader
Tag Count
RRE LEO LRRE DRRE SDRRE OA
5-2 100 1000
5-2 5-2
DRRE 50%
SDRRE DRRE 50%
LEO RRE LRRE RRE
RRE OA OA
3 5-2 OA LEO 140%
1000 10000 5-3
0 2000 4000 6000 8000 10000 12000
100 200 300 400 500 600 700 800 900 1000
WriteCount
Tag Count
RRE LEO LRRE DRRE SDRRE OA
5-3 1000 10000
5-3 OA
OA RRE
LEO 2000 RRE LEO
LEO RRE
5-1 5-3 RRE LEO
DRRE SDRRE
50% SDRRE 5-3
DRRE SDRRE
50 100 150 200 250 300 350
1000 2000 3000 4000 5000 6000 7000 8000 9000 10000
NumberofRedundantReader
Tag Count
RRE LEO LRRE DRRE SDRRE OA
5-4 1000 10000
5-4 5-4
5-2
OA 5-1 5-4 OA
100 500
5-5 5-6
0 20000 40000 60000 80000 100000 120000
1000 2000 3000 4000 5000 6000 7000 8000 9000 10000
WriteCount
Tag Count
RRE LEO LRRE DRRE SDRRE OA
5-5 100 500
5-6 100 500
5-5 5-6
OA
LEO OA
RRE DRRE
0 50 100 150 200 250 300
100 200 300 400 500
NumberofRedundantReader
Reader Count
RRE LEO LRRE DRRE SDRRE OA
0 20000 40000 60000 80000 100000 120000
100 200 300 400 500
WriteCount
Reader Count
RRE LEO LRRE DRRE SDRRE OA
100 500
5-7 5-8
5-7 100 500
5-8 100 500
0 50 100 150 200 250 300
100 200 300 400 500
NumberofRedundantReader
Reader Coverage Radius
RRE LEO LRRE DRRE SDRRE OA
0 20000 40000 60000 80000 100000 120000
100 200 300 400 500
WriteCounts
Reader Coverage Radius RRE LEO LRRE DRRE SDRRE OA
5-7 5-8 OA OA
OA LEO
LEO RRE
RRE
DRRE DRRE
DRRE 5-8
RRE
RRE
DRRE RRE
LEO RRE LRRE
OA
DRRE OA
DRRE
OA 4-5
OA OA
OA OA
RRE LEO
LEO+RRE DRRE SDRRE OA 86% 46% 24%
28% 31% 36% -143% 41% 76% 50%
LEO OA
OA
RFID
[1] Bogdan C arbunar, Murali Krishna Ramanathan, Mehmet Koyut¨urk, Christoph Hoffmann and Ananth Grama, “Redundant Reader Elimination in RFID Systems,” Proceedings of IEEE SECON, pp. 176-184, 2005.
[2] Paolo D’Arco and Alfredo De Santis, “On Ultralightweight RFID Authentication Protocols,”
IEEE Transactions on Dependable and Secure Computing, Vol. 8, No. 4, pp. 548 – 563, 2011.
[3] Haosong Gou, Hyo-cheol Jeong, and Younghwan Yoo, “A Bit collision detection based Query Tree protocol for anti-collision in RFID system,” Proceedings of the IEEE International Conference on Wireless and Mobile Computing, pp. 421-428, 2010.
[4] Yu-Jung Huang, Chi-Huan Jiang, Hsuan-Hsun Wu, Yi-Hao Hong, and Kai-Jen Liu,
“Mutual Authentication Protocol for RFID System,” Proceedings of the IEEE International Conference on Computational Science and Engineering, pp. 73-80, 2011.
[5] Ching-Hsien Hsu, Ming-Tsang Chen, “A Pre-Detection Query Tree Protocol for Tag Collision Arbitration in RFID Systems,” Master thesis, Dept. of Computer Science and Information Engineering, Chung-Hua University, 2011.
[6] Ching-Hsien Hsu, Yi-Min Chen and Chao-Tung Yang, “A Layered Optimization Approach for Redundant Reader Elimination in Wireless RFID Networks,” Proceedings of the IEEE APSCC, pp. 138–145, 2007.
[7] Ching-Hsien Hsu, Chia-Ying Wie, “Distance Based Optimization for Eliminating Redundant Readers in RFID Networks,” Master thesis, Dept. of Computer Science and Information Engineering, Chung-Hua University, 2011.
[8] Nazish Irfan and Mustapha C.E. Yagoub, “Ef cient Approach for Redundant Reader Elimination in Large-Scale RFID,” Proceedings of the IEEE International Conference on Integrated Intelligent Computing, pp. 102-107, 2010.
[9] Imran A Jokhio, Sana H Arisar, Jie Xu, “Data Privacy Management in a Multi-organizational,” Proceedings of the IEEE International Conference on Wireless Communications Networking and Mobile Computing, pp. 1-4, 2010.
[10] Chun-Fu Lin and Frank Yeong-Sung Lin, “Efficient Estimation and Collision Group-Based Anticollision Algorithms for Dynamic Frame-Slotted ALOHA in RFID Networks,” IEEE Transactions on Automation Science and Engineering, Vol. 7, No. 4, pp. 840-848, 2010.
[11] Hoopad Mobahat , “Authentication and lightweight cryptography in low cost RFID,”
Proceedings of the IEEE International Conference on Software Technology and Engineering, Vol. 2, pp. 123-129, 2010.
[12] Md. Monzur Morshed, Anthony Atkins, and Hongnian Yu, ” An efficient and secure authentication protocol for RFID systems,” Proceedings of the IEEE International Conference on Automation & Computing, pp. 51-56, 2011.
[13] Jiho Ryu, Hojin Lee, Yongho Seok, Taekyoung Kwon and Yanghee Choi,“ A Hybrid Query Tree Protocol for Tag Collision Arbitration in RFID systems,” Proceedings of the IEEE International Conference on Communications, pp. 5981-5986, 2007.
[14] Masoud Shakiba, Azam Zavvari, and Elankovan Sundararajan, “Fitted dynamic framed slotted ALOHA anti-collision algorithm in RFID systems,” Proceedings of the IEEE International Conference on Information Technology and Multimedia, pp. 1-6, 2011.
[15] Jian Shen, Dongmin Choi, Sangman Moh, and Ilyong Chung, “A Novel Anonymous RFID Authentication Protocol Providing Strong Privacy and Security,” Proceedings of the IEEE International Conference on Multimedia Information Networking and Security, pp.
584-588, 2010.
[16] Xinqing Yan, Yan Xu, and Bin Li, “A Biased Modified Binary Query Tree Protocol for RFID Tag Collision Resolution,” Proceedings of the IEEE International Conference on Trust, Security and Privacy in Computing and Communications, pp. 1715-1720, 2011.
[17] Ching-Nung Yang, Yu-Ching Kun, Jyun-Yan He, Chih-Cheng Wu, “A practical implementation of ternary query tree for RFID tag anti-collision,” Proceedings of the IEEE International Conference on Information Theory and Information Security, pp. 286-286, 2010.
[18] Kun-Ming Yu, Chang Wu Yu and Zheng-Yi Lin, “A Density-Based Algorithm for Redundant Reader Elimination in a RFID Network,” Proceedings of the IEEE FGCN, pp.89, 2008.
[19] James Waldrop, Daniel W. Engels and Sanjay E. Sarma, “Colorwave: A MAC for RFID reader networks,” Proceedings of the IEEE Wireless Communications and Networking Conference, pp. 1701-1704, 2003.
[20] James Waldrop, Daniel W. Engels and Sanjay E. Sarma, “Colorwave: an anticollision algorithm for the reader collision problem,” Proceedings of the IEEE International Conference on Communications, pp. 1206-1210, 2003.
[21] Gang Wang, Yong Peng, and Zhaomin Zhu, “Anti-collision algorithm for RFID tag identification using fast query tree,” Proceedings of the IEEE International Symposium on IT in Medicine and Education, pp. 369-399, 2011.
[22] Haifeng Wu and Yu Zeng, “Efficient Framed Slotted Aloha Protocol for RFID Tag Anticollision,” IEEE Transactions on Automation Science and Engineering, Vol. 8 , No. 3, pp. 581-588, 2011.
[23] Wael Zein_Elabdeen and Eman Shaaban, “An enhanced binary tree anti-collision technique for dynamically added tags in RFID systems,” Proceedings of the IEEE International Conference on Computer Engineering and Technology, Vol. 7, pp. 349-353, 2010.
[24] Lei Zhuand and Tak-Shing Peter Yum, “Optimal Framed Aloha Based Anti-Collision Algorithms for RFID Systems,” IEEE Transactions on Communications, Vol. 58, No. 12, pp. 3583-3592, 2010.
[25] Hsuan-Wei Tsao, Der-Jiunn Deng, Hsing-Wen Wang, and Jung-Hsin Chang, “Runtime optimization of framed slotted ALOHA based RFID Systems,” Proceedings of the IEEE International Symposium on Wireless and Pervasive Computing, pp. 1-6, 2011.
A-1 100 1000
Tag Count RRE LEO LRRE DRRE SDRRE OA
100 440 426 437 438 435 439
200 407 376 403 400 380 404
300 367 345 368 359 344 375
400 342 321 349 345 325 363
500 327 319 343 311 309 357
600 303 281 319 309 299 340
700 301 273 321 284 287 340
800 294 280 311 282 292 334
900 281 275 304 276 270 327
1000 267 262 297 255 248 318
A-2 100 1000
Tag Count RRE LEO LRRE DRRE SDRRE OA
100 272 99 331 1060 635 140
200 588 194 692 2105 1068 332
300 900 286 980 3187 1402 483
400 1194 386 1386 4065 1766 729
500 1658 487 1683 5601 2357 894
600 1914 585 2211 6348 2717 1244
700 2316 679 2537 7000 3093 1425
800 2808 781 2985 8482 3721 1610
900 3192 878 3276 9448 4104 1858
1000 3366 969 3639 10230 4611 2084
A-3 1000 10000
Tag Count RRE LEO LRRE DRRE SDRRE OA
1000 267 262 297 255 248 318
2000 192 217 249 218 233 285
3000 188 192 236 214 210 276
4000 152 185 217 208 216 278
5000 150 186 217 204 202 274
6000 119 163 192 196 191 257
7000 120 166 197 218 208 249
8000 120 178 204 205 184 262
9000 110 170 197 195 178 256
10000 125 164 199 204 198 261
A-4 1000 10000
Tag Count RRE LEO LRRE DRRE SDRRE OA
1000 3366 969 3639 10230 4611 2084
2000 7132 1947 7565 20661 9555 4491
3000 10632 2907 11623 29542 14189 7049
4000 15010 3866 16154 39395 19590 9635
5000 19036 4885 20591 49199 24079 11955
6000 22478 5852 24434 57926 28762 14598
7000 25616 6820 28774 65831 33200 16625
8000 31536 7708 32096 77606 38792 19318
9000 33758 8696 37112 86727 43590 21841
10000 37608 9708 41480 95977 48284 24738
A-5 100 500
Reader Count RRE LEO LRRE DRRE SDRRE OA
100 2 2 2 3 2 3
200 11 12 17 24 10 24
300 36 47 59 90 65 95
400 67 103 124 141 125 170
500 126 157 188 192 184 249
A-6 100 500
Reader Count RRE LEO LRRE DRRE SDRRE OA
100 12092 5180 17270 20231 12654 8787
200 22770 7920 29808 39193 23332 17130
300 26660 8815 34163 56379 31807 20978
400 33670 9345 39215 77489 40609 22699
500 36398 9798 40450 96550 48108 24927
A-7 100 500
Radius RRE LEO LRRE DRRE SDRRE OA
100 41 32 41 43 30 43
200 20 16 21 38 28 38
300 37 39 52 83 61 87
400 74 82 112 150 123 163
500 127 166 198 207 183 243
A-8 100 500
Radius RRE LEO LRRE DRRE SDRRE OA
100 41 32 41 43 30 43
200 20 16 21 38 28 38
300 37 39 52 83 61 87
400 74 82 112 150 123 163
500 127 166 198 207 183 243