設計快速辨識已知標籤集之無線射頻辨識系統

由於全球知名的零售商沃爾瑪的大力推動。過去十年來，無線射頻辨識引起密集的研究。無線射頻辨識是一種自動辨識技術，這種技術利用無線電頻率去獲得電子標籤內的資訊。在多個電子標籤的環境中，數電子標籤同時回應讀取器將會成碰撞的問題而危及識別的速度。故此，某些為調解衝突與改善讀取時間的機制是必要的。本文提出一新的機制以改善上述問題。另外，此機制可以被訓練來加快辨識已知的電子標籤。僅管有一些相似的機制能夠達到同樣的效果，但此機制可以識別未知的電子標籤等罕見狀況。在模擬情況中，本文針對數個電子標籤防碰撞機制進行績效評估。更精確而言，本文著重在完成讀取所須的時間和訊息數。我們觀察得知本機制能有效減少讀取時間和讀取訊息。在最佳情況下，相較於詢問樹演算法本機制能節省50%的時間；相較於二元樹演算法本機制能節省70%的時間。這些改善不只加快了讀取的速度，也節省了讀取器中之電力。

關鍵字

無線射頻辨識；防碰撞機制；電子標籤識別；電子標籤碰撞；讀取器碰撞

並列摘要

Owing to the major push by the world reknown retailer, Walmart.　Radio Frequency Identification (RFID) attracted intensive research interest for the last decade.　RFID is an automatic identification technology which exercises the radio frequency to retrieve the information saved in electronic tags.　In a multi-tag environment, the collision problem caused by a number of tags simultaneously responding to a reading will jeopardize the speed of identification.　Some scheme is necessary to reconcile the conflict and improve the reading time.　A novel scheme is proposed in this thesis to address this collision problem.　In addition, our scheme can be trained to accelerate the identification of a subset of the known tags.　Although there are similar schemes capable of achieving this function, our proposal accommodates rare presence of those tags outside the known set.　In the simulation, we evaluate the performance of several tag anti-collision protocols.　Specifically, we focus on the total reading time and the amount of messages required to accomplish the reading.　We observe that our scheme can effectively reduce both the reading time and the number of reading messages. In the best case, the proposed scheme saves 50% and 70% time when compared with the query tree algorithm (QTA) and binary tree algorithm (BTA) methods respectively.　These improvements not only accelerate the reading speed but also save the on-board power in the reader.

並列關鍵字

Radio Frequency Identification ； Anti-Collision Scheme ； Electronic Tag Identification ； Electronic Tag Collision ； Reader Collision

參考文獻

[1] J. Landt, “The History of RFID,” IEEE Potentials, vol. 24, issue 4, pp. 8-10, Oct.-Nov. 2005.

[7] J. Cha and J. Kim, “Novel anti-collision algorithms for fast object identification in RFID system,” in Proc. Parallel and Distibuted System, vol. 2, pp. 63-67, Jul. 2005.

[8] J. Park, M. Y. Chung and T. J. Lee, “Identification of RFID Tags in Framed-Slotted ALOHA with Robust Estimation and Binary Selection,” IEEE Communication Letters, vol. 11, issue 5, pp. 452-454, Jan. 2007.

[11] T. P. Wang, “Enhanced Binary Search with Cut-Through Operation for Anti-collision in RFID Systems,” IEEE Communication Letters, vol. 10, issue 4, pp. 236-238, Apr. 2006.

[12] J. H. Choi, D. Lee and H. Lee, “Bi-Slotted Tree Based Anti-Collision Protocols for Fast Tag Identification in RFID Systems,” IEEE Communication Letters, vol. 10, issue 12, pp. 861-863, Dec. 2006.

國際替代計量

設計快速辨識已知標籤集之無線射頻辨識系統

未授權

主題瀏覽