無線射頻辨識系統(RFID)由讀取器(Reader)、標籤(Tag)及伺服器(Sever)所組成,無線射頻辨識系統的優劣在於讀取器能否快速的辨識這些標籤。在RFID的辨識過程中,若某時槽(slot)無任何標籤選用,則會發生閒置(idle)情形,降低系統的辨識效能。為了有效改善系統的辨識效能,本論文提出了一個能夠有效減少閒置情形發生的演算法,稱之為快速時槽掃描低閒置之RFID傳送競爭演算法(Fast Time-slots Scanning and Low Idle Transmission Contention Algorithm, FTSLI)。在FTSLI中,每個標籤會建立並傳送一個二元位元序列(binary bits sequence)給讀取器,讀取器收到各標籤的二元位元序列後,會計算出一個標籤時槽選用碰撞序列(slot collision sequence),據以跳過未被選用slot之詢問,降低閒置情形的發生。經電腦模擬的結果顯示,本論文所提出的演算法能夠有效的降低閒置情形的發生,進而提升RFID系統辨識效能。
Radio Frequency Identification (RFID) system consists of reader, tag and sever. The pros and cons of RFID depends on if readers can quickly identify these tags. In the identification process of RFID, if any slot is not selected by any tag, there will be idle, which reduces the identification performance of system. To effectively improve the identification performance, this thesis proposes an algorithm that can effectively reduce the occurrence of idle, called Fast Time-slots Scanning and Low Idle Transmission Contention Algorithm(FTSLI). In FTSLI, each tag establishes and transmits a binary bits sequence to reader. Reader will calculate a slot collision sequence. With the values in slot collision sequence, the queries of unselected slots are skipped to reduce the occurrence of idle. The results of simulation show that the algorithm proposed in this thesis can effectively reduce the occurrence of idle to further enhance the identification performance of RFID system.