The Research Of The Effective Information Collection Algorithm In A Large RFID System

RFID(Radio Frequency Identification)is an interdisciplinary technique, which mainly devotes to exchange information between readers and tags in a contactless way via wireless signal. RFID regards electronic information technology as its unique feature and aims to fulfill the ultimate purpose of application. With the development of global economic, the RFID technology which has higher recognition speed and recognition accuracy is widely used in various fields. The tags integrated with micro sensors can not only provide their unique IDs, but also they can report dynamic, real-time information about the status of the homologous tags or the conditions of the environment, which is beneficial to many practical applications.Along with the improvement of human quality requirement, the issue of guarantee the quality of the food needs to solve desiderately. For example, if stick the tag that integrated with micro temperature sensor on frozen food, we can use the RFID technology to collect the real-time temperature information. Undoubtedly this can solve the problem of refrigerated food quality and ensure food quality and safety.In recent years, more and more experts and scholars began to study information collection algorithm, the existing information collection algorithms have a long time delay of tag identification, which can lead a longer time to complete information collection. In order to solve the shortcomings of existing algorithm, this paper puts forward two new information collection algorithms: Information Collection algorithm based on Sampled Bloom-filter(ICSB) and Category Information Collection algorithm based on Conflict Tolerance(CIC-CT), the main purpose of these two kinds of algorithm is rapidly collecting information we are interested in.Both ICSB and CIC-CT algorithms want to collecting information rapidly from large RFID system. The ICSB algorithm using sampling bloom filter can rapidly identification tag, which is suitable for the scenario can tolerate small error. The CIC-CT algorithm abandoned the traditional avoid conflict time slot but changed to use conflict time slot,which can identify different categories of tags accurately, is suitable for the scenario in a wide range of species. Both theoretical analysis and simulation results demonstrate that two algorithms have the advantage of time efficiency and can achieve real-time, dynamic monitoring which greatly reducing the merchant’s economic loss.