(3.238.249.17) 您好!臺灣時間:2021/04/14 13:55
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果

詳目顯示:::

我願授權國圖
: 
twitterline
研究生:趙建民
研究生(外文):Chen-Min Chao
論文名稱:RFID之多項前偵測查詢技術
論文名稱(外文):Multi-Way Pre-Detection Query Tree Protocol
指導教授:許慶賢
指導教授(外文):Ching-Hsien Hsu
學位類別:碩士
校院名稱:中華大學
系所名稱:資訊工程學系碩士在職專班
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2012
畢業學年度:100
語文別:中文
論文頁數:39
中文關鍵詞:無線射頻辨識系統ALOHA協定電子標籤防碰撞演算法樹狀架構混合查詢樹協定查詢樹協定
外文關鍵詞:Query Tree ProtocolALOHA ProtocolTag Anti-collision AlgorithmHybrid Query Tree Protocol
相關次數:
  • 被引用被引用:0
  • 點閱點閱:129
  • 評分評分:系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔
  • 下載下載:15
  • 收藏至我的研究室書目清單書目收藏:1
無線射頻辨識系統(RFID:Radio Frequency Identification)是針對接觸式系統的缺點所發展出來的,並且被廣泛發展於各種自動化辨識系統,是利用射頻訊號以無線方式來傳送及接收數據資料且同時使用此射頻訊號來做無線傳能,識別的工作也不需要人工來實現,而且可以工作於任何的惡劣環境,所以在無線網路環境中是一門重要的技術。其中碰撞問題與減少多餘的查詢的協定為影響辨識效能成為了一項很重要的研究議題。
本篇論文提出一個多項前偵測查詢技術,是結合ALOHA時槽特性與查詢樹的概念所產生的協定。所提出的一個新的想法,以前人所提出的預先偵測查詢樹協定(PDQT)方法為基礎,一開始便先以2位元(4-ary)方式詢問,於發生碰撞時期時,便於下次預偵測位元加一變成3位元(8-ary),如果還是遭遇碰撞,便將預偵測位元再加一變成4位元(16-ary),之後持續以4位元(16-ary)方式做預偵測,直到最後一階時切回2位元(4-ary),演算法主要精髓在於因為預偵測位元是以2位元、3位元、4位元方式,以128bit長度來說,最後一階會剩餘3位元,此時只需2位元(4-ary)做偵測,如遇碰撞便可得知最後一位元0與1皆存在,此方法利用PDQT可消除所有閒置時間外,還以增加位元數做預偵測,減少碰撞和命令時期來降低辨識延遲,進而提昇RFID系統的整體辨識效能。
我們以電腦模擬一個RFID系統的環境分析本論文方法,並和已知的相關研究演算法進行比較,實驗的結果顯示多項前偵測查詢技術,不但可以改善碰撞問題,更大幅減少了讀取器發出詢問的次數,相較其他的方法有更佳的效能。

Radio Frequency Identification (RFID: Radio Frequency Identification) is developed for the shortcomings of the contact system, and the extensive development of a variety of automatic identification system, the use of radio frequency signals to send and receive data wirelessly while using this RF signals do wireless energy transfer, identify the work does not need to manually to achieve, and can work in any harsh environment, so is an important technology in the wireless network environment. By in recent years, the research issues, which the collision problem and reduce redundant queries Agreement affect the recognition performance has become a very important research topic

This thesis proposed a Multi-Way Pre-Detection Query Tree Protocol, a protocol combining the features of ALOHA time slot and the concept of partitioning query tree. It put forward a novel idea: Begin by 2bit (4-ary) to ask when the collision period, to facilitate the next pre-detection bits plus one become 3bit (8-ary), If still encounter collision, the pre-detection bits plus one into 4bit (16-ary), the last phase Changed back to 2bit (4-ary),the last phase will be the remaining 3 bits, case of collision will be aware of last-bit 0 and 1 are the existence. this method uses PDQT eliminate all idle cycle, also to increase the number of bits to do the pre-detection, reduce the period of collision and command to reduce the identification delay, and thus enhance the overall recognition performance of the RFID system.

We simulate an RFID system environmental to analyze the proposal, and compare the proposal with the tag anti-collision algorithm. Experimental results show that the Multi-Way Pre-Detection Query Tree Protocol and can not only improve the problem of collisions, also significantly reduced the number of inquiries issued by the reader, better performance compared to other methods.

摘要................................................... I
ABSTRACT.............................................. II
誌謝.................................................. III
目錄.................................................. IV
表目錄.................................................VI
圖目錄.................................................VII
第一章 序論............................................ 1

1 研究背景及動機........................................ 1
2 研究目的............................................. 4
3 論文架構............................................. 5

第二章 相關技術與研究之簡介.............................. 6

2.1 電子標籤的通訊時期.................................. 6
2.2 ALOHA-based協定簡介................................ 7
2.3 二元查詢樹協定簡介.................................. 8
2.4 四元查詢樹協定簡介.................................. 10
2.5 問題研究........................................... 12

第三章 相關查詢樹技術................................... 13

3.1 四元查詢樹防碰撞相關技術介紹......................... 13
3.1.1 混合查詢樹協定.................................... 13
3.1.2 查詢實例......................................... 15
3.1.3 預先偵測查詢樹協定................................ 16
3.1.4 查詢實例......................................... 18

第四章 多項前偵測查詢技術................................ 20

4.1 Multi-Way Pre-Detection Query Tree Protocol ...... 20
4.2 MPQT Method ...................................... 21
4.3 查詢實例........................................... 23

第五章 效能評估與結果分析................................ 27

5.1 效能評估........................................... 27
5.2 結果分析........................................... 28
第六章 結論與未來研究方向................................ 36

6.1 結論.............................................. 36
6.2 未來研究方向....................................... 36

參考文獻................................................37


參考文獻

[1]Maurizio A. Bonuccelli, Francesca Lonetti , and Francesca Martelli, 「Tree Slotted Aloha: a New Protocol for Tag Identification in RFID Networks,」 in IEEE World of Wireless, Mobile and Multimedia Networks, pp. 603-608, June 2006.
[2]Yinghua Cui and Huiyang Wang 「A new anti-collision method for RFID systems ,」in Computational Intelligence and Informatics (CINTI), 2011 IEEE 12th International Symposium on 2011 , Page(s): 51 - 55.
[3]Jae-Ryong Cha and Jae-Hyun Kim, 「Dynamic Framed Slotted ALOHA Algorithm using Fast Tag Estimation method for RFID System,」 in proceedings Consumer Communications and Networking Conference, Vol. 2, pp. 768-772, January 2006.
[4]Jae-Ryong Cha and Jae-Hyun Kim, 「Novel Anti-collision Algorithms for Fast Object Identification in RFID System,」 in proceedings of the 11th IEEE International Conference on Parallel and Distributed System, pp. 63-67, July 2005.
[5]Klaus Finkenzeller, RFID Handbook: Fundamentals and Applications in Contactless Smart Cards and Identification, 2nd edtion, New York: Wiley, 2003.
[6]Vinod Namboodiri and Lixin Gao, 」Energy-Aware Tag Anti-Collision Protocols for RFID Systems」, in proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications, pp. 23-36, 2007.
[7]Ching-Hsien Hsu, Han-Chieh Chao, and Jong Hyuk Park, 」Threshold Jumping and Wrap-Around Scan Techniques toward Efficient Tag Identification in High Density RFID Systems,」 Information Systems Frontiers, August 2009, DOI: 10.1007/s10796-009-9209-5.
[8]Ching-Hsien Hsu and I-Chung Hsu, 「An Incremental Splitting Scheme for Efficient Tag Identification,」 Proceedings of the IEEE International Joint Conference on Computational Sciences and Optimization, pp. 698-701, 2009.
[9]Ching-Hsien Hsu, Ming-Chong Chen, 「A Pre-Detection Query Tree Protocol for Tag Collision Arbitration in RFID Systems,」 Master Thesis in CHU, July 2011.
[10]Soo-Cheol Kimy, Jung-Sik Choz and Sung-Kwon Kim, 「Performance Improvement of Hybrid Tag Anti-Collision Protocol for RFID Systems,」 in International journal of communication systems Int. J. Commun. Syst. 2011; 00:1–15 Published online in Wiley InterScience
[11] D. K. Klair, K.-W. Chin and R. Raad, 「An investigation into the energy efficiency of pure and slotted aloha based RFID anti-collision protocols,」 in proceedings of the IEEE WoWMoM』07, June 18-21, Helsinki, Finland, 2007.
[12] Yuan-Cheng Lai and Ling-Yen Hsiao, 「Genal Binary Tree Protocol for Coping with the Capture Effect in RFID Tag Identification,」 IEEE Communications Letters, Vol. 14, No. 3, pp. 208-210, 2010.
[13] Yuan-Cheng Lai and Chih-Chung Lin, 「A Pair-Resolution Blocking Algorithm on Adaptive Binary Splitting for RFID Tag Identification,」 in IEEE Communications Letters, Vol. 12, No. 6, pp. 432-434, June 2008.
[14] Ching Law, Kayi Lee, and Kai-Yeung Siu, 「Efficient Memoryless Protocol for Tag Identification,」 in ACM Discrete Algoritms and Methods for MOBILE Computing and Communications, pp. 75-84, August 2000.
[15] Zhi-Hong Lan , Xiao-Zheng Lai , Jian Yu , Sheng-Li Lai 「A Data structures in memory of Mobile RFID reader ,」in IEEE Conference Publications Page(s):432 - 436 ,2011.
[16] Jihoon Myung, Wonjun Lee, Jaideep Srivastava, and Timothy K. Shih, 「Tag-Splitting: Adaptive Collision Arbitration Protocols for RFID Tag Identification,」 in IEEE Transactions on Parallel and Distributed Systems, Vol. 18, No. 6, pp. 763-775, June 2007.
[17] Hoque, M.E. Rahman , F. Ahamed, S.I.「AnonPri: An efficient anonymous private authentication protocol,」in IEEE Conference Publications Page(s):102 - 1105,2011.
[18] Jihoon Myung and Wonjun Lee, 「Adaptive Splitting Protocols for RFID Tag Collision Arbitration,」 in ACM Mobile ad hoc networking and computing, pp. 202-213, May 2006.
[19] Jihoon Myung, Wonjun Lee, and Timothy K. Shih, 「An Adaptive Memoryless Protocol for RFID Tag Collision Arbitration,」 in IEEE Transactions on Multimedia, Vol. 8, No. 5, pp. 1096-1101, October 2006.
[20] Shakiba, M. Zavvari, A. Sundararajan, E.「Fitted dynamic framed slotted ALOHA anti-collision algorithm in RFID systems,」Information Technology and Multimedia (ICIM), 2011 International Conference on 2011 ,Page(s): 1 - 6
[21] Jiho Ryu, Hojin Lee, Yongho Seok, Taekyoung Kwon, and Yanghee Choi, 「A Hybrid Query Tree Protocol for Tag Collision Arbitration in RFID systems,」 in proceedings of IEEE International Conference on Communications, pp. 5981-5986, June 2007.
[22] Kenneth H. Rosen, 「Discrete Mathematics and Its Applications,」 5th edition, McGraw-Hill.
[23] Jiho Ryu, Hojin Lee, Yongho Seok, Taekyoung Kwon and Yanghee Choi, 「A Hybrid Query Tree Protocol for Tag Collision Arbitration in RFID systems」,IEEE International Conference on Communications (ICC-07), 24-28 June 2007 pp. 5981 – 5986, 2007.
[24] Frits C. Schoute, 「Dynamic Frame Length ALOHA,」 in IEEE Transaction Communication, Vol. 31, No. 4, pp. 565-568, April 1983.
[25] Xinqing Yan, Yan Xu, 「Analytic Properties of the Binary Tree Based Multiple Access Protocol with Application to RFID Tag Collision Resolution,」in IEEE Conference Publications Page(s):: 376 - 382 ,2011.
[26] Ming-Kuei Yeh, Jehn-Ruey Jiang, Shing-Tsaan Huang「Parallel Response Query Tree Splitting for RFID Tag Anti-collision,」in IEEE Conference Publications Page(s): 6 - 15,2011.
[27] Lei Zhu, Yum, T.-S.P.「Optimal Framed Aloha Based Anti-Collision Algorithms for RFID Systems,」Communications, IEEE Transactions on 2010 , Page(s): 3583 - 3592.

連結至畢業學校之論文網頁點我開啟連結
註: 此連結為研究生畢業學校所提供,不一定有電子全文可供下載,若連結有誤,請點選上方之〝勘誤回報〞功能,我們會盡快修正,謝謝!
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
系統版面圖檔 系統版面圖檔