請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/60470完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 顏嗣鈞 | |
| dc.contributor.author | Tzu-Hsun Huang | en |
| dc.contributor.author | 黃子洵 | zh_TW |
| dc.date.accessioned | 2021-06-16T10:19:03Z | - |
| dc.date.available | 2014-08-20 | |
| dc.date.copyright | 2013-08-20 | |
| dc.date.issued | 2013 | |
| dc.date.submitted | 2013-08-16 | |
| dc.identifier.citation | [1] R. Want, “An Introduction to RFID Technology,” IEEE Pervasive Computing, vol. 5, no. 1, pp. 25-33, February 2006.
[2] K. Domdouzis, B. Kumar, and C. Anumba, “Radio Frequency Identification (RFID) Applications: A Brief Introduction,” Advanced Engineering Informatics, vol. 21, no. 4, pp. 350–355, October 2007. [3] K. Ali, H. Hassanein, and A.-E. M. Taha, “RFID Anti-collision Protocol for Dense Passive Tag Environments,” IEEE Conference on Local Computer Networks, pp. 819–824, October 2007. [4] Z. W. Yuan and L. D. Duan, “Research on the Tag Estimation and Frame Length of the ALOHA Algorithm,” International Conference on Biomedical Engineering and Informatics, pp. 1511-1514, October 2012. [5] F. C. Schoute, “Dynamic Frame Length ALOHA,” IEEE Transactions on Communications, vol. 31, no. 4, pp. 565-568, April 1983. [6] D. J. Deng and H. W. Tsao, “Optimal Dynamic Framed Slotted ALOHA Based Anti-collision Algorithm for RFID Systems,” wireless personal communications, vol. 59, no. 1, pp. 109-122, July 2011. [7] H. Vogt, “Multiple Object Identification with Passive RFID Tags,” IEEE International Conference on Systems, Man and CybernetiCS, vo1.3, pp.6-13, October 2002. [8] J. R. Cha and J. H. Kim, “Novel Anti-collision Algorithms for Fast Object Identification in RFID System,” in Proc. International Conference on Parallel and Distributed Systems, vol. 2, pp. 63–67, July 2005. [9] P. Pupunwiwat and B. Stantic, “A RFID Explicit Tag Estimation Scheme for Dynamic Framed-Slot ALOHA Anti-collision,” International Conference on Wireless Communications Networking and Mobile Computing, pp. 1-4, September 2010. [10] H. Vogt, ”Efficient Object Identification with Passive RFID tags,” International Conference on Pervasive Computing, pp. 98-113, April 2002. [11] Z. Li ,C. He, and H. Z. Tan, “An Enhanced Tag Estimation Method Applied to Tag Anti-collision Algorithm in RFID Systems,“ International Conference on Information Science and Technology, pp. 703-708, March 2011. [12] J. B. Eom and T. J. Lee, “Accurate Tag Estimation for Dynamic Framed-Slotted ALOHA in RFID Systems,” IEEE Communications Letters, vol. 14, no. 1, pp. 60-62, January 2010. [13] R. E. Kalman, 'A New Approach to Linear Filtering and Prediction Problems,' Transaction of the ASME - Journal of Basic Engineering, vol. 82, pp. 35-45, March 1960. [14] G. Welch and G. Bishop, “An Introduction to the Kalman Filter,” Notes ACM SIGGRAPH Tutorial Kalman Filter, pp. 19-34, August 2001. [15] H. Stockman, “Communication by Means of Reflected Power,” in Proc. of the IRE, vol. 36, no. 10, pp. 1196–1204, October 1948. [16] R.F. Harrington, “Theory of Loaded Scatterers,” in Proc. of the Institution of Electrical Engineers, vol. 111, no. 4, pp. 617–623, April 1964. [17] J. Landt, “The History of RFID,” IEEE Potentials, vol. 24, no. 4, pp. 8–11, December 2005. [18] S. A. Weis, “RFID (Radio Frequency Identification): Principles and Applications,” August 2011. http://www.eecs.harvard.edu/cs199r/readings/rfid-article.pdf [19] S. Roweis and Z. Ghahramani, “A Unifying Review of Linear Gaussian Models,” Neural Computation, Vol. 11, No. 2, pp. 305–345, February 1999. [20] H. Choi, J. Lim, and D. Hong, “Game Theory Based H Infinity Filter Approach for Estimating the Number of Competing Terminals in IEEE 802.11 Networks,” IEEE Consumer Communications and Networking Conference, pp. 953-957, January 2011. | |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/60470 | - |
| dc.description.abstract | 無線射頻技術(Radio Frequency Identification, RFID)如今已被廣泛運用於許多場合,具體應用包含了鈔票防偽、電子收費系統、悠遊卡、動物識別追蹤、倉庫的貨品盤點等。然而在RFID系統的標籤辨識工作進行時,仍有一項常被拿來討論的問題---如何減少標籤之間的碰撞。因此有許多防碰撞演算法被提出,可概分為Tree-based演算法與ALOHA-based演算法,但前者會造成辨識效率不佳,因此現今主要以ALOHA-based演算法之中的動態訊框時隙ALOHA(Dynamic Framed Slotted ALOHA, DFSA)演算法為最普遍被使用的防碰撞演算法。
為了讓防碰撞演算法能夠有效發揮其功用,必須還要搭配精準的標籤數量估測法,才能夠真正有效減少碰撞的發生並提升系統的效能。但現今用來作標籤數量估測的方法都仍有改善的空間。因此本篇論文提出了一種基於擴展卡爾曼濾波器(Extended Kalman Filter, EKF)來進行標籤數量估測的演算法,希望藉由其可以達到估測結果之均方差最小值的特性,來提升估測的精準度。並且我們也結合了下界法來對某些偏差的估測值做檢查及修正,以達到更進一步改善估測結果的目的。最後我們也透過實驗證明了本篇論文所提出的演算法在標籤數量估測上確實擁有相當高的精準度。 | zh_TW |
| dc.description.abstract | Radio Frequency Identification (RFID) systems are now widely used in many occasions, such as banknote security, Electronic Toll Collection (ETC) systems, Easy Card, animal tracking, tracking of goods, among many others. Generally, the so-called tag collision problem is still a significant issue in RFID tag identification systems. In order to solve this problem, many anti-collision algorithms have been proposed that can generally be divided into two categories, namely, Tree-based algorithms and ALOHA-based algorithms. Since the former has low performance in identification, advanced ALOHA-based algorithms with a Dynamic Framed Slotted design have been widely used in RFID anti-collision nowadays.
Although algorithms based on Dynamic Framed Slotted ALOHA (DFSA) work effectively as far as anti-collision is concerned, the number of tags must be accurately estimated in advance to reduce the incidence of collisions and to promote system performance. Even in state-of-the-art tag estimation methods proposed in the literature, one can find that there is still room for improvement. In this thesis, an efficient tag estimation algorithm is proposed using an extended Kalman filter to compute the Minimum Mean Square Error (MMSE) as an accurate estimation. For further refinement, we also employ a lower bound method to check the produced estimation. Experimental results show that the proposed tag estimation scheme has a very high accuracy in the application to RFID systems. | en |
| dc.description.provenance | Made available in DSpace on 2021-06-16T10:19:03Z (GMT). No. of bitstreams: 1 ntu-102-R00921075-1.pdf: 2466363 bytes, checksum: a04597c08b15353b0d803c7c9eb0fc09 (MD5) Previous issue date: 2013 | en |
| dc.description.tableofcontents | 口試委員會審定書 #
誌謝 i 中文摘要 ii ABSTRACT iii 目錄 iv 圖目錄 vii 表目錄 viii Chapter 1 緒論 1 Chapter 2 RFID簡介 4 2.1 RFID起源 4 2.2 RFID系統架構 4 2.3 RFID系統分類 5 2.4 RFID相關議題 6 Chapter 3 防碰撞演算法 7 3.1 Tree-based 防碰撞演算法 7 3.1.1 二元樹(Binary Tree)演算法 7 3.1.2 查詢樹(Query Tree)演算法 7 3.2 ALOHA-based防碰撞演算法 8 3.2.1 純ALOHA(Pure ALOHA, P-ALOHA)演算法 8 3.2.2 時隙ALOHA(Slotted ALOHA, SA)演算法 8 3.2.3 訊框時隙ALOHA(Framed Slotted ALOHA, FSA)演算法 9 3.2.4 動態訊框時隙ALOHA(Dynamic Framed Slotted ALOHA, DFSA)演算法 10 3.3 動態訊框時隙ALOHA演算法之最佳化 11 Chapter 4 標籤數量估測 13 4.1 下界法(Lower Bound) 13 4.2 最大產出法(Maximum Throughput) 13 4.3 RFID明確標籤估測法(RFID Explicit Tag Estimation Scheme) 14 4.4 切比雪夫法(Chebyshev-based Method) 15 4.5 傳統標籤估測法(Tag Estimation Method) 15 4.6 強化標籤估測法(Enhanced Tag Estimation Method) 16 4.7 精準標籤估測法(Accurate Tag Estimation Method) 17 Chapter 5 運用擴展卡爾曼濾波器進行標籤數量估測 19 5.1 卡爾曼濾波器簡介 19 5.1.1 卡爾曼濾波器(Kalman Filter) 19 5.1.2 擴展卡爾曼濾波器(Extended Kalman Filter) 23 5.2 擴展卡爾曼濾波器標籤數量估測法 24 5.2.1 過程模型與觀測模型 24 5.2.2 擴展卡爾曼濾波器估測法 26 5.2.3 使用完整的觀測資訊 28 5.2.4 結合下界法作為門檻值 31 Chapter 6 實驗結果與分析 32 6.1 模擬環境設定 32 6.2 各標籤數量估測法之精準度比較 33 6.3 探討結合下界法作為門檻值之影響 36 Chapter 7 結論與未來發展 39 REFERENCES 40 | |
| dc.language.iso | zh-TW | |
| dc.subject | 擴展卡爾曼濾波器 | zh_TW |
| dc.subject | 標籤辨識 | zh_TW |
| dc.subject | 無線射頻技術 | zh_TW |
| dc.subject | 下界法 | zh_TW |
| dc.subject | 防碰撞演算法 | zh_TW |
| dc.subject | Tree-based演算法 | zh_TW |
| dc.subject | ALOHA-based演算法 | zh_TW |
| dc.subject | 動態訊框時隙ALOHA演算法 | zh_TW |
| dc.subject | 標籤數量估測法 | zh_TW |
| dc.subject | tag estimation | en |
| dc.subject | tag identification | en |
| dc.subject | anti-collision algorithms | en |
| dc.subject | Tree-based algorithms | en |
| dc.subject | ALOHA-based algorithms | en |
| dc.subject | Dynamic Framed Slotted ALOHA algorithm | en |
| dc.subject | RFID | en |
| dc.subject | extended Kalman filter | en |
| dc.subject | lower bound method | en |
| dc.title | 基於擴展卡爾曼濾波器之RFID系統標籤數量估測 | zh_TW |
| dc.title | An Extended Kalman Filter Based Tag Estimation Method for RFID Systems | en |
| dc.type | Thesis | |
| dc.date.schoolyear | 101-2 | |
| dc.description.degree | 碩士 | |
| dc.contributor.oralexamcommittee | 鄧德雋,雷欽隆,郭斯彥,黃秋煌 | |
| dc.subject.keyword | 無線射頻技術,標籤辨識,防碰撞演算法,Tree-based演算法,ALOHA-based演算法,動態訊框時隙ALOHA演算法,標籤數量估測法,擴展卡爾曼濾波器,下界法, | zh_TW |
| dc.subject.keyword | RFID,tag identification,anti-collision algorithms,Tree-based algorithms,ALOHA-based algorithms,Dynamic Framed Slotted ALOHA algorithm,tag estimation,extended Kalman filter,lower bound method, | en |
| dc.relation.page | 42 | |
| dc.rights.note | 有償授權 | |
| dc.date.accepted | 2013-08-16 | |
| dc.contributor.author-college | 電機資訊學院 | zh_TW |
| dc.contributor.author-dept | 電機工程學研究所 | zh_TW |
| 顯示於系所單位: | 電機工程學系 | |
文件中的檔案:
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-102-1.pdf 未授權公開取用 | 2.41 MB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。
