Font Size: a A A

Research On Collision Algorithm And Safety Mechanism Of Rfid System

Posted on:2016-07-20Degree:DoctorType:Dissertation
Country:ChinaCandidate:X WangFull Text:PDF
GTID:1108330482457708Subject:Mechanical and electrical engineering
Abstract/Summary:PDF Full Text Request
The internet of things (IoT), as the third revolution in information technology wave, is the new competition commanding heights of the global information industry. And the IoT-focused information technology revolution has become national strategy in the field of information. Radio-frequency identification (RFID), as the IoT perception layer tentacles providing information source for the top-level application through identifying and tracking tags attached to objects, is the most key automatic identification technology in IoT framework. Therefore, RFID is widely used in automatic identification field such as transportation, logistics, aviation, and gradually replaced the bar codes base on the advantages of read-write, long-distance identification and batch read. However, the decreased tag cost, increased performance to identification efficiency and radio channel security privacy protection drive a widespread in RFID usage by market demand. Hence, how to propose the highly effective anti-collision algorithm and the strong safety security mechanism became the key problems in the field of RFID under passive tags of the weak storage capacity and computing power, which is very useful to promote RFID system widely used. This paper studied on the RFID anti-collision algorithm under the environment of unknown and specific application, the ultra-lightweight security authentication protocol based on having backend-server, and the security search protocol in the movement environment. The following key works are mainly researched:(1) Research on RFID adaptive N tree anti-collision algorithm based on bitmap construction. This chapter put forward two RFID adaptive N tree anti-collision algorithms based on bitmap construction (SFBTNA and MFBTNA) for the RFID collision problem caused by multiple access of shared channel under unknown environment. First of all, it estimated the number of tags effectively by the maximum likelihood tag numbers estimation method (MLBE).. Secondly, it proposed that the probe method constructed bitmap, and SFBTNA adaptively adjusted optimization value of N and built N trees through bitmap under one frame based on MLBE. MFBTNA adaptive adjusted optimization value of N and built N trees via frame-by-frame. Further, SFBTNA and MFBTNA identified the collision sub-trees using tracking tree (CT) algorithm. The combination of bitmap and CT eliminated idle time slot and greatly reduced the impact of collision time slot, and then greatly improved the identification efficiency of RFID system. This study derived the optimal frame length of SFBTNA and MFBTNA, and built the optimal N tree by the bitmap, and obtained the optimal throughput, respectively.(2) Research on adaptive grouping N-ray tree of RFID anti-collision algorithm under specific application environment. This chapter proposed adaptive grouping N-ray anti-collision algorithm (ACBGN) algorithm for some readers repeatedly identifying staying tags under the specific application environment. First of all, we divided the staying tags and arriving tags by the blocking mechanism, and then identified them in different stages for avoiding the collision between two kinds of tags. Secondly, we put forward the corresponding identification algorithm for improving identification efficiency of staying tags and arriving tags based on the identification feature of them, respectively. The arriving tags were identified under combining grouping and N-ray identify for reducing the collision probability between tags. Further, the idle slots were reduced through collision bit tracking in order to improve the throughput of the arriving tags identification. This paper derived the optimal number of groups under different rays, and obtained the optimal combination. The staying tags were identified by the multi-frame coupling algorithm for getting the optimal identification efficiency. The algorithm compressed mapping bitmap through identification strategy of single-tag sign in, two-tags coupling, and setting the Hash priority. This paper derived the optimal number of Hash mapping and improved the identification efficiency. The ACBGN algorithm obtained high identification efficiency and and was suitable for rapid automatic identification in the specific application scenario field based on high staying tags and arriving tags identification efficiency.(3) Research on the ultra-lightweight security protocol design and analysis. This chapter put forward two ultra-lightweight security protocols, URP (the ultra-lightweight security authentication protocol of resist on desynchronization attacks) and UTFP (the ultra-lightweight security transfer protocol), through analyzing common vulnerabilities in the existing ultra-lightweight security protocols in case with backend server. URP protocol resisted against desynchronization and replay attacks by adding new synchronization factor in interactive message and combining old and new dynamic ID updated ways. URP protocol could resist leak attack via combining the encryption features of MixBits and Per for better confusion effect. It protected the wireless link security between reader and tag only through simple bit operation. This paper verified that our proposed URP protocol satisfied the integrity and confidentiality of security features and could resist common attacks of radio channel. UTFP protocol could resynchronize the desynchronized URP protocol by generating pseudo-random number of passive tag. Also the protocol initiated resynchronization mechanism to update dynamic key and ID and then obtained higher security and privacy under the protocol suffer active attacks.(4) Research on provable secure service-less security search protocol. This chapter proposed a lightweight service-less security search protocol for the mobile reader scenario under the situation of without the background server. First of all, the protocol achieved the time rights management by strict time stamp, and then improved the security of mobile reader. Secondly, the protocol realized adjustable privacy intensity and search efficiency by the number of tags in the practical application environment based on Hash collision. Finally, the protocol adapted computing performance of low-cost tags via loose timestamp style, and could resist against replay attacks effectively. This paper verified that the protocol satisfied concurrent security under UC framework, and could effectively resist against replay, desynchronize, tracking and anonymity attacks in standard security model.
Keywords/Search Tags:radio frequency identification, anti-collision algorithm, bitmap construction, securiry anthentication protocol, security search protocol
PDF Full Text Request
Related items