| Summary: | 碩士 === 國立臺灣科技大學 === 資訊工程系 === 95 === For the modern society, it becomes very important to reduce the power consumption, cost and promote efficiency for any commercial products. RFID (Radio Frequency Identification) has been developed for many years and it got much attention from researchers recently as there are lots of applications such as medical, stock, farming, animal husbandry and etc. being used practically in the real world. Owing to the shared wireless channel between tags and reader during communication, the tag collision arbitration is a significant issue for reducing the communication overhead. This thesis presents two novel anti-collision algorithms; one is named as EAA (Enhanced Anti-collision Algorithm) which is based on ABS (Adaptive Binary Splitting) algorithm, the other is named as NEAA (New Enhanced Anti-collision Algorithm Based on Counter and Stack). EAA improves the ABS algorithm, and inherits the advantages of the ABS algorithm. EAA uses counter, stack, and Manchester code to reduce the probability of collision efficiently. Compared to the methods proposed by other researchers, the performance evaluation shows that the proposed EAA uses fewer timeslots for indentifying tags.
NEAA is based on EAA. NEAA uses counter, stack, and Manchester code to make collision become significant. Since the ID (identification) of a tag is a unique binary number, NEAA uses this characteristic to identify lots of tags in a timeslot. In general case, the performance of NEAA approximates to that of EAA. NEAA will cause fewer collisions, and consume fewer timeslots for identifying tags, if the amount of tags is very large.
|
|---|
