Name
Abstract | ||
|---|---|---|
To reduce the searching time of the whole transponders in the interrogator's operation range, this paper uses a tree-based searching scheme with multi-collision reflected frame request and multi-responding tag scheduling scheme. This scheme enables efficient burst UID receptions of the transponders, and eliminates unnecessary frame overhead. To show the feasibility of this scheme, total searching time is simulated as a parameter of UID length and tag density. The results are compared with that of the basic tree-based anti-collision scheme, and the better performance is reported. Especially for the same UID length, the proposed scheme can reduces the searching time up to 50%. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/CCNC.2009.4784901 | CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference |
Keywords | Field | DocType |
efficient burst uid reception,uid length,basic tree-based anti-collision scheme,frame request,unnecessary frame overhead,tag density,efficient rfid anti-collision scheme,whole transponders,proposed scheme,better performance,multi-responding tag scheduling scheme,decision trees,probability density function,transponders,protocols,search algorithm,indexing terms,data mining,rfid | Decision tree,Scheduling (computing),Computer science,Transponder,Collision,Real-time computing,Power demand,Probability density function | Conference |
Citations | PageRank | References |
1 | 0.41 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sang-Ho Seo | 1 | 3 | 2.54 |
| Sin-Chong Park | 2 | 80 | 22.58 |