RFID(radio frequency identification)是一種使用射頻的方式來進行讀取器(Reader)與電子標籤(Tag)之間雙向通信的自動識別技術。在RFID的系統中，由於經常有一個以上的電子標籤同時處於讀取器的辨識範圍之內，且讀取器跟這些電子標籤皆在同一個共用的無線頻道上進行通信，故當這些電子標籤同時和讀寫器進行資料的傳送時，便會造成碰撞，使得讀取器不能正確的讀取資料，因而降低RFID辨識系統的效率，因此解決碰撞的問題一直是RFID系統所注重的議題。
NEAA演算法利用了電子標籤識別碼唯一的特性使得讀取器能同時讀取多個電子標籤。本篇論文提出一個演算法來增加NEAA的效能，此演算法利用TBCT(Two Bit Collision Timeslot)的觀念來增加NEAA演算法中同時讀取多個電子標籤的機率，進而減少NEAA演算法在讀取電子標籤時所造成的碰撞次數以及減少辨識電子標籤所需的時間，進而提升NEAA演算法的效能。

RFID is an automatic identification technology in reader and tags communication by using RF wave. In the RFID system, due to there are usually more than one tags in the interrogation zone of reader, when multiple tags transmitted their data to the reader simultaneously, signal will be collided because the reader and tags communicate over a shared wireless channel, the reader may not recognize all tags due to the collisions. Therefore, how to reduce collisions is a significant issue for tag-identification in RFID system.
New Enhance Anti-collision Algorithm (NEAA) is a novel anti-collision algorithm of tag ID identification in RFID system. Since the tag ID in RFID system is a unique binary number, NEAA use the characteristic of the tag ID is unique to identify multiple tags simultaneously. This paper proposes an anti-collision algorithm to improve the performance of NEAA by using TBCT (Two Bit Collision Timeslot) to increase the probability of M-readable. The proposed algorithm can also reduce the number of collisions and the identification latency.

[1] Bo Feng, Jin-Tao Li, Jun-Bo Guo, and Zhen-Hua Ding, “ID-binary tree stack anticollision algorithm for RFID,” Proc. Computers and Communications, ISCC '06, Page(s): 207 -212, June 2006.
[2] C. P. Wong, Q. Feng, Senior Member, IEEE, “Grouping Based Bit-Slot ALOHA Protocol for Tag Anti-collision in RFID System,” In Proc. IEEE Communications Letters, vol. 11, no. 12, Page(s): 946-948, December 2007.
[3] Dong-Her Shih, Po-Ling Sun, David C. Yen, and Shi-Ming Huang, “Taxonomy and survey of RFID anti-collision protocols,” Computer Communications, volume 29, issue 11, Page(s): 2150-2166, July 2006.
[4] H. Lee, and J. Kim, “QT-CBP : A New RFID Tag Anticollision Algorithm Using Collision Bit Positioning,” Emerging Directions in Embedded and Ubiquitous Computing(EUC), LNCS, Springer Vol. 4097, Page(s): 591-600, August 2006.
[5] J. Myung, Wonjun Lee, and T.K. Shih, “An Adaptive Memoryless Protocol for RFID Tag Collision Arbitration,” IEEE Transactions on Multimedia, Volume 8, Issue 5, Page(s):1096 – 1101, Oct. 2006 Digital Object Identifier 10.1109/TMM.2006.879817
[6] 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, 2007. ICC '07, Page(s):5981 – 5986, June 2007
[7] Jihoon Myung, Wonjun Lee, and Jaideep Srivastava, “Adaptive binary splitting for efficient RFID tag anti-collision,” Communications Letters, IEEE, Vol. 10, Issue 3, Page(s): 144-146, Mar. 2006.
[8] Jihoon Myung, Wonjun Lee, Jaideep Srivastava, and Timothy K. Shih, “Tag-splitting: adaptive collision arbitration protocols for RFID tag identification,” IEEE Transactions on Parallel and Distributed Systems, Vol. 18, No. 6, Page(s): 63-775, Jun. 2007.
[9] Jung-Sik Cho, Jea-Dong Shin, and Sung Kwon Kim, “RFID Tag Anti-Collision Protocol: Query Tree with Reversed IDs,” 10th International Conference on Advanced Communication Technology, 2008. ICACT 2008, Volume 1, Page(s):225 – 230, Feb. 2008 Digital Object Identifier 10.1109/ICACT.2008.4493750
[10] K. Finkenzeller “RFID handbook: radio-frequency identification fundamentals and applications,” John Wiley and Sons Ltd, second edition, 2003.
[11] Kong Wa Chiang, Cunqing Hua, and Tak-Shing Peter Yum, “Prefix-Randomized Query-Tree Protocol for RFID Systems,” IEEE International Conference on Communications, 2006, Volume 4, Page(s):1653 – 1657, June 2006 Digital Object Identifier 10.1109/ICC.2006.254956
[12] Leian Liu; Shengli Lai, “ALOHA-Based Anti-Collision Algorithms Used in RFID System,” International Conference on Wireless Communications, Networking and Mobile Computing, 2006, WiCOM 2006, Page(s):1 – 4, Sept. 2006 Digital Object Identifier 10.1109/WiCOM.2006.342
[13] M.A. Bonuccelli, F. Lonetti, and F. Martelli, “Tree slotted aloha: a new protocol for tag identification in RFID networks,” International Symposium on a World of Wireless, Mobile and Multimedia Networks, 2006. WoWMoM 2006, Page(s):6 pp. – 608, Digital Object Identifier 10.1109/WOWMOM.2006.112
[14] R. Want, “An introduction to RFID technology,” IEEE Pervasive Computing, Volume. 5, Issue 1, Page(s):25 – 33, Jan.-March 2006.
[15] SungSoo Kim, YongHwan Kim, SeongJoon Lee, and KwangSeon Ahn, “An Improved Anti Collision Algorithm using Parity Bit in RFID System,” Seventh IEEE International Symposium on Network Computing and Applications, 2008. NCA '08, Page(s): 224 – 227, Digital Object Identifier 10.1109/NCA.2008.9
[16] T. Wang, “Enhanced binary search with cut-through operation for anticollision in RFID systems,” IEEE Commun. Lett., Vol. 10, No. 4, Page(s): 236-238, Apr. 2006.
[17] Wei-chih Chen, “Enhanced Anti-collision Algorithm For RFID Based on Counter and Stack,” Department of Computer Science and Information Engineering in NTUST, 2007
[18] Wei-Chih Chen, Shi-Jinn Horng, and Pingzhi Fan, “An enhanced anti-collision algorithm in RFID based on counter and stack,” Proc. Second International Conference on Systems and Networks Communications (ICSNC 2007), Page(s): 1-4, 2007.
[19] X. Shi, F. Wei, Q. Huang, L. Wang, and X.-W. Shi, "Novel binary search algorithm of backtracking for rfid tag anti-collision," Progress In Electromagnetics Research B, Vol. 9, Page(s): 97-104, 2008.