本論文指出一種嶄新的應用無線識別技術的網路環境，稱為稠密標籤網路 (Dense-Tag Network Environment, DTN) 環境 。DTN >環境的特色是在有著在操作環境中無線識別標籤數目多且變動不大，標籤識別碼接近連續等，迥異於一般無線識別技術應用的網路
環境亦即平常標籤網路 (Normal-Tag Network, NTN) 環境。SRA (Slotted Random Anti-collision) 是 EPCglobal 規範中提出應
用於 NTN 環境下競爭方式的防碰撞協定。在 DTN 環境下，SRA 因操作環境中大量無線識別標籤幾乎同時在某些隨機選取的時槽回
應而產生過多的閒置與碰撞，造成識別時間冗長。我們提出排程識別程序 (Schedule-based Identification Process, SBIP) 與>輪詢識別程序 (Polling-based Identification Process, PBIP) 兩種機制來解決識別時間冗長問題。在 SBIP 中為相容，我們提
出新的讀取器命令 QuerySche，在保留 SRA 的架構下根據無線識別標籤識別碼來安排無線識別標籤依序回應方式以取代
競爭。在 PBIP 中除沿用排程識別程序的排程方法外，也提出新的讀取器命令 QueryPoll，但改進 SRA 架構下因應競爭
方式的四向交握 (4-way handshaking) 程序為『詢問-回應』的二向交握 (2-way handshaking) 程序。根據模擬結果與效能分析>，比較 SRA 搭配最佳的估計無線識別標籤數目，SBIP 與 PBIP 三種方法。在 DTN 環境下，操作環境中標籤數目達 32768 時，錯
失讀取數目與標籤數目比例達數倍時，SBIP 與 PBIP 的識別時間仍然大幅縮短。故錯失讀取負擔在 DTN 環境中可忽略不計。

In this thesis, we address a novel new application of Radio Frequency Identification (RFID) technology in Dense-Tag Network (DTN) environment. The characteristic of DTN environment is that in operating environment the number of Tags is large, the element of Tags set do not vary often, and the range of Tags ID is likely sequential compared with Normal-tag network (NTN) environment that RFID is usually applied to. Slotted Random Anti-collision (SRA) is the contention-based identification process used in EPCglobal. The large number of Tags may simultaneously response at randomly chosen slots causing huge amount of extra idle and collision, thus it takes long identification time in SRA. To resolve the problem of the long identification time in DTN environment, we propose two schemes, the schedule-based identification process (SBIP) and polling-based identification process (PBIP). The proposed new Reader command QuerySche for SBIP retains the framework of 4-way handshaking in SRA; the responses of Tags are scheduled one after another according to its Tag ID instead of contention. Base on the proposed SBIP, we also propose new Reader command QueryPoll for PBIP; we improve the framework from contention to "Polling-Response". And the handshaking is improved from 4-way to 2-way. From simulation results and performance analysis, the ratio of the number of missed read to the number of Tags several times, the identification time of SBIP and PBIP compared to SRA-O, SRA with optimal Tag Estimation Scheme in operating environment, is significantly improved respectively in DTN environment. Thus the overhead of missed read is negligible.

[1] M. Crichton, Prey. Harper Collins, 2002.
[2] L. Schwiebert, S. Gupta, and J. Weinmann, “Research hallenges in wireless networks of biomedical sensors,” New York, NY, USA, 2001.
[3] F. Werblin and B. Roska,“The movies in our eyes.” Scientific American, vol. 296, pp. 72–79, Apr. 2007.
[4] H. Kolb, “How the retina works,”American Scientist, vol. 91, p. 28, 2003.
[5] L. Schwiebert, S. Gupta, P. Auner, G. Abrams, R. Iezzi, and P. McAllister, “A biomedical smart sensor for the visually impaired,” 2002.
[6] R. Soong, G. Bachand, H. Neves, A. Olkhovets, H. Craighead, and
C. Montemagno, “Powering an inorganic nanodevice with a biomolecular motor,” Science, vol. 290, no. 5496, pp. 1555–1558, 2000.
[7] M. Usami, M. Usami, H. Tanabe, A. Sato, I. Sakama, Y. Maki, T. Iwamatsu, T. Ipposhi, and Y. Inoue, “A 0.05 x 0.05mm2 rfid chip with easily scaled-down id-memory,” in Solid-State Circuits Conference, 2007. ISSCC 2007. Digest of Technical Papers. IEEE International, H. Tanabe, Ed., 2007, pp. 482–483.
[8] K. Okada, T. Yamada, T. Uezono, K. Masu, A. Oki, and Y. Horiike, “Near field communication chip using pim for bio mems sensors,” 2004.
[9] S. Meninger, J. Mur-Miranda, R. Amirtharajah, A. Chandrakasan, and J. Lang, Vibration-to-electric energy conversion,” Very Large Scale Integration (VLSI) Systems, IEEE Transactions on, vol. 9, no. 1, pp. 64–76, 2001.
[10] EPCglobal, “Epc radio-frequency identity protocols class-1 generation-2 uhf rfid protocol for communications at 860 mhz – 960 mhz version 1.0.9,” 2005.
[11] J.-R. Cha, J.-R. Cha, J.-H. Kim, and J.-H. Kim, “Novel anti-collision algorithms for fast object identification in rfid system,” in Parallel and Distributed Systems, 2005. Proceedings. 11th International Conference on, vol. 2, 2005, pp. 63–67 Vol. 2.
[12] EPCglobal,“Epcglobal tag data standards version 1.3,”2006.
[13] J. Park, M. Y. Chung, and T.-J. Lee, “Identification of rfid tags in framed-slotted aloha with robust estimation and binary selection,” Communications Letters, IEEE, vol. 11, no. 5, pp. 452–454, 2007.
[14] Y.-C. Lai and C.-C. Lin, “A pair-resolution blocking algorithm on adaptive binary splitting for rfid tag identification,”Communications Letters, IEEE, vol. 12, no. 6, pp. 432–434, 2008.
[15] J.-R. Cha and J.-H. Kim, “Dynamic framed slotted aloha algorithms using fast tag estimation method for rfid system,” 2006.
[16] M. Kodialam and T. Nandagopal, “Fast and reliable estimation schemes in rfid systems,” 2006.
[17] M. Kodialam, T. Nandagopal, and W. C. Lau, “Anonymous tracking using rfid tags,” in INFOCOM 2007. 26th IEEE International Conference on Computer Communications. IEEE, May 2007, pp. 1217–1225.
[18] S.-R. Lee, S.-R. Lee, S.-D. Joo, S.-D. Joo, and C.-W. Lee, “An enhanced dynamic framed slotted aloha algorithm for rfid tag identification,” in Mobile and Ubiquitous Systems: Networking and Services, 2005. MobiQuitous 2005. The Second Annual International Conference on, 2005, pp. 166–172.