In this whitepaper, we focus on the anti-collision schemes to improve the readability, identification speed, of low-cost passive RFID systems. Generally, the tree based algorithms send a prefix twice except the last bit in the same tree depth. Focusing on this characteristic, both the prefix overhead and the iteration overhead are reduced by the time divided responses depending on whether the collided bit is ‘0’ or ‘1’. Thus we call the protocols taking\r\nthe time-divided responses as bi-slotted query tree algorithm (BSQTA) and bi-slotted collision tracking tree algorithm (BSCTTA). We demonstrate via simulation results that the proposed bi-slotted query tree based reservation protocol achieves considerably better performance than the existing tag anticollision protocols implemented in EPC Class 0, Class 1, and Class 1 Gen2. Besides, the proposed algorithm requires less time consumption for tag identification than the conventional schemes.
It is the goal of this workshop to bring together researchers from the fields of recommender systems, pervasive computing, mobile computing, urban sensing, social networking, context-aware systems and...
For a List of RSS 2.0 Feeds: Please Click Here