簡易檢索 / 詳目顯示
| 研究生： |
王良晉 Liang-chin Wang |
|---|---|
| 論文名稱： |
用於全球產品電子代碼管理中心之第二代規範射頻辨識系統防衝突演算法研究 A Study on Anti-collision Algorithms for EPCglobal Gen2 RFID Systems |
| 指導教授： |
劉馨勤
Hsin-Chin, Liu |
| 口試委員: |
楊成發
Chang-Fa, Yang 李學智 Li, Hsueh-Jyh 馬自莊 Tzyh-Ghuang Ma |
| 學位類別： |
碩士 Master |
| 系所名稱： |
電資學院 - 電機工程系 Department of Electrical Engineering |
| 論文出版年： | 2006 |
| 畢業學年度： | 94 |
| 語文別： | 中文 |
| 論文頁數： | 54 |
| 中文關鍵詞： | 射頻辨識系統 、防碰撞演算法 、時槽數選擇演算法 、快速時槽數選擇演算法 、傳輸率 、傳輸負載 |
| 外文關鍵詞： | RFID, Anti-collision, Slot count selection, Fast slot count selection, Throughput, Transmission overheads. |
| 相關次數： | 點閱：377 下載：2 |
| 分享至: |
| 查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報 |
在本篇論文中，我們提出一個新式防止碰撞的方法，稱為快速時槽數選擇演算法。這個方法延續全球產品電子代碼管理中心之第二代射頻辨識標籤規格書上所提出的時槽數選擇演算法的觀念，時槽數選擇演算法又稱為Q演算法。
快速時槽數選擇演算法會在存貨過程中估計標籤數目和根據估計的標籤數目選取一個適當的Q值。因此，快速時槽數選擇演算法的系統傳輸率會比時槽數選擇演算法的系統傳輸率來的高。為了補償估計上的缺陷，我們將使用連串偵測機制。這個機制不但可以避免估計上的問題外，而且也可以防止訊框裡的時槽發生較多的碰撞或是無回應。除此之外，快速時槽數選擇演算法讀取機指令的資料傳輸量會比時槽數選擇演算法讀取機指令的資料傳輸量來的少。
我們將藉由不同Q值及標籤數目等變數進行對快速時槽數選擇演算法性能上的分析。模擬結果驗證了快速時槽數選擇演算法的優點。
In this thesis, we propose a new anti-collision algorithm called Fast Slot-Count Selection (FSCS) algorithm. FSCS algorithm is compliant with Slot-Count Selection algorithm, also known as Q-algorithm in EPCglobal Generation-2 (Gen2) UHF RFID specification [8].
FSCS algorithm estimate the number of tags in an inventory process and select the most appropriate value of Q according to the estimate. Consequently, the throughput of FSCS is higher than that of an ordinary Q-algorithm. In order to compensate the defect of the estimation, a burst detection mechanism (BDM) is imposed. The BDM can not only avoid the estimation problem but also prevent an invalid frame that consists of all collisional slots or all idle slots. In addition, the transmission overhead in FSCS algorithm is less than that of an ordinary Q-algorithm.
In this work, we analyze the performance of FSCS algorithm with different initial Q’s and various numbers of tags. Simulation results validate the features of the FSCS algorithm.
[1] K. Finkenzeller, RFID Handbook; Fundamentals and Applications in Contact-less Smart Cards and Identification, Second Edition, Wiley, 2003.
[2] H. S. Choi, J. R. Cha and J. H. Kim, “Fast Wireless Anti-collision Algorithm in Ubiquitous ID System,” IEEE Vehicular Technology Conference 2004, Sept. 2004, pp. 26-29.
[3] J. R. Cha, J. H. Kim, “Dynamic Framed Slotted ALOHA Algorithms using Fast Tag Estimation Method for RFID System,” IEEE Consumer Communications and Networking Conference 2006, Vol. 2, 8-10 Jan. 2006, pp. 768–772.
[4] J. R. Cha, J. H. Kim, “Novel Anti-collision Algorithms for Fast Object Identification in RFID System,” 2005 International Conference on Parallel and Distributed Systems, Vol. 2, 20-22, July, 2005, pp. 63–67.
[5] S. R. Lee, S. D. Joo, C. W. Lee, “An Enhanced Dynamic Framed Slotted ALOHA Algorithm for RFID Tag Identification,”2005 International Conference on Mobile and Ubiquitous Systems: Networking and Services, 17-21 July 2005 pp. 166-172.
[6] Y. KAWAKITA, J. MITSUGI,“Anti-collision Performance of Gen2 Air Protocol in Random Error Communication Link,”2006 International Symposium on Applications and the Internet Workshops, 23-27 Jan. 2006 pp.68-71.
[7] C. Floerkemeier, M. Wille, “Comparison of Transmission Schemes for Framed ALOHA Based RFID Protocols,”2006 International Symposium on Applications and the Internet Workshops, 23-27 Jan. 2006 pp.92-97.
[8] “Class1 Generation 2 UHF Air Interface Protocol Stardand Version 1.0.9, ”EPCglobal, 2005.
[9] N. Ye, Y. Zhang, C. M. Borror, “Robustness of the Markov-Chain Model for Cyber-Attack Detection,” Reliability, IEEE Transactions on, Vol. 53, Mar. 2004 pp.116-123.
[10] A. S. Tanenbaum, Computer Network, Fourth Edition, PHPTR, 2003.
