DocumentCode :
3508837
Title :
Mathematical Analysis for Binary Tree Algorithm in RFID
Author :
Cui, Yinghua ; Zhao, Yuping
Author_Institution :
Sch. of Electron. Eng. & Comput. Sci., Peking Univ., Beijing
fYear :
2008
fDate :
11-14 May 2008
Firstpage :
2725
Lastpage :
2729
Abstract :
The system efficiency is one of the key factors for RFID (Radio Frequency Identification) systems. This paper gives theoretical study on binary tree algorithm that is adopted by the international standard ISO 18000-6B. The close form for calculating system efficiency is derived. Simulation is performed and results agree with theoretical one. In addition, the simplified expression for very large tag number is also provided.
Keywords :
ISO standards; mathematical analysis; radiofrequency identification; trees (mathematics); ISO 18000-6B; RFID systems; binary tree algorithm; mathematical analysis; radio frequency identification; Binary trees; Computational modeling; Computer science; Counting circuits; Flowcharts; ISO standards; Mathematical analysis; Protocols; Radiofrequency identification; System identification;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Vehicular Technology Conference, 2008. VTC Spring 2008. IEEE
Conference_Location :
Singapore
ISSN :
1550-2252
Print_ISBN :
978-1-4244-1644-8
Electronic_ISBN :
1550-2252
Type :
conf
DOI :
10.1109/VETECS.2008.596
Filename :
4526152
Link To Document :
بازگشت