An Efficient Framed Slotted ALOHA Algorithm for RFID Tag Identification
碩士 === 國立臺灣科技大學 === 資訊管理系 === 98 === An efficient RFID system need to avoid tag-collision when doing tag identification. Tag-collision leads to the failure of signal transmission making tag identification failed. Therefore, how to enhance the efficiency of tag identification by avoiding tag-collisio...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/16505442551876553541 |
| Summary: | 碩士 === 國立臺灣科技大學 === 資訊管理系 === 98 === An efficient RFID system need to avoid tag-collision when doing tag
identification. Tag-collision leads to the failure of signal transmission making tag identification failed. Therefore, how to enhance the efficiency of tag identification by avoiding tag-collision becomes a popular topic in the research of RFID technology in recent years.
Using anti-collision algorithm is the key of RFID system to identify tags rapidly. In this research, we propose a new framed slotted ALOHA algorithm initially proposed by Vogt. Vogt analyzed the identification process of the framed slotted ALOHA algorithm by a Markov chain model. To be more close to the real situation, we revise Vogt’s Markov model by controlling the number of tags to be identified in each round. Empirical results show that the proposed method significantly reduces the number of read cycles, and significantly improves the identification efficiency.
|
|---|