DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Lee, Hyuck-Jae | - |
dc.contributor.advisor | 이혁재 | - |
dc.contributor.author | Ha, Gi-yeok | - |
dc.contributor.author | 하기역 | - |
dc.date.accessioned | 2011-12-14T01:34:17Z | - |
dc.date.available | 2011-12-14T01:34:17Z | - |
dc.date.issued | 2010 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=419096&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/36564 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 전기 및 전자공학과, 2010.2, [ viii, 49 p. ] | - |
dc.description.abstract | Radio Frequency IDentification (RFID) is the wireless identification technology using RF waves. In the research areas for RFID systems, the tag anti-collision algorithm is the important issue for reliable identication. Tag anti-collision algorithm solves the tag collision problem that multiple tags atempt to send their IDs. Tag anti-collision protocols is classified into tree based algorithms and ALOHA based algorithms. In this thesis, we consider only the tree based anti-collision algorithms, since the tree based tag anti-collision algorithm achieve 100% read rate. In this thesis, two schemes is proposed for improving existing algorithm ,single-slotted tree switching algorithm, and bi-slotted tree switching algorithm. First of all, single-slotted tree switching algorithm, which switch the 4-ary query tree algorithm to the binary query tree algorithm, is proposed. In single-slotted tree switching algorithm, the reader starts tree searching with 4-ary query tree algorithm. When one tree level is ended, if collision probability is less than threshold (0.75), the reader switches the 4-ary query tree algorithm to the binary query tree algorihm from next tree level, otherwise the reader remains the 4-ary query tree algorithm. Using this proposed algorithm, the iteration and required bits efficiency is 10%. Next, bi-slotted tree switching algorithm, which uses bi-response slots, is proposed. In this proposed algorithm, all process is same as single-slotted tree switching algorithm excepting using bi-response slots. Using this proposed algorithm, the iteration and required bits efficiency is 43% compared with the binary query tree algorith. In other word, the identification time is reduced by 43% using this proposed algorithm rather than using binary query tree algorithm. In conclusion, the proposed algorithms improve the tag identification speed than the existing anti-collision algorithm. | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | tree level | - |
dc.subject | switching | - |
dc.subject | tree algorithm | - |
dc.subject | anti-collision | - |
dc.subject | RFID | - |
dc.subject | RFID | - |
dc.subject | 트리 레벨 | - |
dc.subject | 교환 | - |
dc.subject | 트리 기술 | - |
dc.subject | 충돌 방지 | - |
dc.title | Tree switching algorithm for efficient passive RFID tag anti-collision remedy | - |
dc.title.alternative | 수동형 RFID 태그 충돌 방지를 위한 트리 교환 기술 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 419096/325007 | - |
dc.description.department | 한국과학기술원 : 전기 및 전자공학과, | - |
dc.identifier.uid | 020084265 | - |
dc.contributor.localauthor | Lee, Hyuck-Jae | - |
dc.contributor.localauthor | 이혁재 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.