Abstract
In this paper, we propose tree-based hybrid query tree architecture utilizing time slot. 4-Bit Pattern Slot Allocation(4-SL) has a 8-ary tree structure and when tag ID responses according to query of the reader, it applies a digital coding method, the Manchester code, in order to extract the location and the number of collided bits. Also, this algorithm can recognize multiple Tags by single query using 4 fixed time slots. The architecture allows the reader to identify 8 tags at the same time by responding 4 time slots utilizing the first bit([prefix+1], F ∈ {‘0’ or ‘1’}) and bit pattern from second ~ third bits([prefix+2] ~ [prefix+3], B2 ∈ {“00” or “11”}, B1 ∈ {“01” or “10”}) in tag ID. we analyze worst case of the number of query nodes(prefix) in algorithm to extract delay time for recognizing multiple tags. The identification ∙제1저자 : 김용환 ∙교신저자 : 정경호 ∙투고일 : 2014. 11. 15, 심사일 : 2014. 11. 25, 게재확정일 : 2014. 12. 3. * 경운대학교 컴퓨터공학과(Dept. of Computer Engineering, Kyungwoon University) ** 경운대학교 모바일공학과(Dept. of Mobile Engineering, Kyungwoon University) 112 Journal of The Korea Society of Computer and Information December 2014 delay time of the proposed algorithm was based on the number of query-responses and query bits, and was calculated by each algorithm. ▸
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of the Korea Society of Computer and Information
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
