| 한글제목(Korean Title) |
A Memory Efficient Anti-Collision Protocol to Identify Memoryless RFID Tags |
| 영문제목(English Title) |
A Memory Efficient Anti-Collision Protocol to Identify Memoryless RFID Tags |
| 저자(Author) |
Haejae Jung
|
| 원문수록처(Citation) |
VOL 11 NO. 01 PP. 0095 ~ 0103 (2015. 03) |
한글내용
(Korean Abstract) |
|
영문내용
(English Abstract) |
This paper presents a memory efficient tree based anti-collision protocol to identify memoryless RFID (Radio Frequency Identification) tags that may be attached to products. The proposed deterministic scheme utilizes two bit arrays instead of stack or queue and requires only ϴ(n) space, which is better than the earlier schemes that use at least O(n2) space, where n is the length of a tag ID in a bit. Also, the size n of each bit array is independent of the number of tags to identify. Our simulation results show that our bit array scheme consumes much less memory space than the earlier schemes utilizing queue or stack.
|
| 키워드(Keyword) |
RFID tag identification
anti-collision protocol
data structure
query tree
|
| 파일첨부 |
PDF 다운로드
|
