Abstract
In the RFID system, a reader recognizes tags through communications over a shared wireless channel. When multiple tags transmit their IDs at the same time, the tag-to-reader signals lead to collision. Tag collision arbitration for passive RFID tags is significant for fast identification since collisions disturb the reader's identification process. This paper presents an Adaptive Binary Splitting (ABS) protocol which is an improvement on the binary tree protocol. To reduce collisions and identify tags efficiently, ABS uses information which is obtained from the last processes of tag identification. Our performance evaluation shows that ABS outperforms other tree based tag anti-collision protocols.
| Original language | English |
|---|---|
| Pages (from-to) | 711-722 |
| Number of pages | 12 |
| Journal | Mobile Networks and Applications |
| Volume | 11 |
| Issue number | 5 |
| DOIs | |
| Publication status | Published - 2006 Oct |
Bibliographical note
Funding Information:This work was supported by Korea Research Foundation Grant (KRF-2005-041-D00680). J.Myung.W. Lee (*) Department of Computer Science and Engineering, Korea University, Asan Science Building, Room 507, 1, 5-ka, Anam-dong, Sungbak-ku, 136-701, Seoul, Republic of Korea e-mail: [email protected]
Funding Information:
Acknowledgments This work was jointly supported by a grant by KOSEF [Grant No. R01-2005-000-10267-0] and by a grant from SK Telecom, Korea [Project No. KU-R040572].
Keywords
- Collision resolution
- RFID
- Tag anti-collision
- Tag identification
ASJC Scopus subject areas
- Software
- Information Systems
- Hardware and Architecture
- Computer Networks and Communications