A novel anti-collision algorithm in RFID wireless network is proposed.As it is put forward on the basis of collision tree(CT)and improved collision tree(lCT) anti-collision protocols,we call it adaptive collision tree...A novel anti-collision algorithm in RFID wireless network is proposed.As it is put forward on the basis of collision tree(CT)and improved collision tree(lCT) anti-collision protocols,we call it adaptive collision tree protocol(ACT).The main novelty of this paper is that the AD strategy is introduced and used in ACT to decrease collisions and improve the tag system throughput.AD strategy means that query strings will divide into two or four branches adaptively according to the label quantity.This scheme can decrease both depth of query and collision timeslots,and avoid producing too much idle timeslots at the same time.Both theoretical analysis and simulation results indicate that the novel proposed anticollision protocol ACT outperforms the previous CT and ICT protocols in term of time complexity,system throughput,and communication complexity.展开更多
Collision and security issues are considered as barriers to RFID applications.In this paper,a parallelizable anti-collision based on chaotic sequence combined dynamic frame slotted aloha to build a high-efficiency RFI...Collision and security issues are considered as barriers to RFID applications.In this paper,a parallelizable anti-collision based on chaotic sequence combined dynamic frame slotted aloha to build a high-efficiency RFID system is proposed.In the tags parallelizable identification,we design a Discrete Markov process to analyze the success identification rate.Then a mutual authentication security protocol merging chaotic anti-collision is presented.The theoretical analysis and simulation results show that the proposed identification scheme has less than 45.1%of the identification time slots compared with the OVSF-system when the length of the chaos sequence is 31.The success identification rate of the proposed chaotic anti-collision can achieve 63%when the number of the tag is100.We test the energy consumption of the presented authentication protocol,which can simultaneously solve the anti-collision and security of the UHF RFID system.展开更多
In this paper, the authors make a summary of current situation of research on the Auto Anti-Collision, briefly introduce the components and functions of the NSACA Simulation Platform and bring forward the project to r...In this paper, the authors make a summary of current situation of research on the Auto Anti-Collision, briefly introduce the components and functions of the NSACA Simulation Platform and bring forward the project to realize the simulation of an Automatic Anti-Collision control, based on the NSACA Simulation Platform. Finally give typical examples from a great deal of simulating tests and analyze them.展开更多
The Long Term Evolution Advanced (LTE-A) and Internet of Things (IoT) are two of the most popular topics that receive vast attentions in the filed of information technologies. Radio Frequency Identification (RFID) gre...The Long Term Evolution Advanced (LTE-A) and Internet of Things (IoT) are two of the most popular topics that receive vast attentions in the filed of information technologies. Radio Frequency Identification (RFID) greatly pushes IoT forward to practical utilization. In RFID system, one of the key issues is the collision among tags when reader tries to identify several of them simultaneously. In this paper, the authors proposed a RFID tag management scheme for cargo identification and tracking based on the LTE-A structure. Compared to the conventional measures, this scheme has taken advantages of the IoT and LTE-A's convergence, and also efficiently suppresses the tags identifying collision at the reader.展开更多
The projection matrix model is used to describe the physical relationship between reconstructed object and projection.Such a model has a strong influence on projection and backprojection,two vital operations in iterat...The projection matrix model is used to describe the physical relationship between reconstructed object and projection.Such a model has a strong influence on projection and backprojection,two vital operations in iterative computed tomographic reconstruction.The distance-driven model（DDM） is a state-of-the-art technology that simulates forward and back projections.This model has a low computational complexity and a relatively high spatial resolution;however,it includes only a few methods in a parallel operation with a matched model scheme.This study introduces a fast and parallelizable algorithm to improve the traditional DDM for computing the parallel projection and backprojection operations.Our proposed model has been implemented on a GPU（graphic processing unit） platform and has achieved satisfactory computational efficiency with no approximation.The runtime for the projection and backprojection operations with our model is approximately 4.5 s and 10.5 s per loop,respectively,with an image size of 256×256×256 and 360 projections with a size of 512×512.We compare several general algorithms that have been proposed for maximizing GPU efficiency by using the unmatched projection/backprojection models in a parallel computation.The imaging resolution is not sacrificed and remains accurate during computed tomographic reconstruction.展开更多
Identifying speed,tag average response times and reliability are the most important capabilities in passive RFID(radio frequency identification) system.QT(query tree) is a famous algorithm for lowest-cost RFID tags,bu...Identifying speed,tag average response times and reliability are the most important capabilities in passive RFID(radio frequency identification) system.QT(query tree) is a famous algorithm for lowest-cost RFID tags,but its shortcoming is high searching delay and high tag average response times.A prefix subsection matching binary(PSMB) algorithm based on QTalgorithm is proposed.The key idea of PSMB anti-collision algorithm is that,during searching phase,a given reader uses the particular tags ID,which has been searched out formerly,to shorten searching delay and depress tag average response times.The idea of PSMB algorithm can be described as follows.Usually,tag ID is composed of several subsections which have different meanings.Based on the tags ID searched out formerly,a given reader builds a prefix database.In subsequent searching phase,the reader uses its prefix database to deduce searching space of tag ID.Simulation results show that identification delay of PSMB algorithm is about 1/3 of QTalgorithm,tag average response times is about 1/4 of QTalgorithm,and system throughput rate is treble QTalgorithm.展开更多
基金This work is supported by the National Natu ral Science Foundation of China under grant No.61071073 and No. 61371092, Doctoral Fund of Ministry of Education of China （No.20090061110043）.
文摘A novel anti-collision algorithm in RFID wireless network is proposed.As it is put forward on the basis of collision tree(CT)and improved collision tree(lCT) anti-collision protocols,we call it adaptive collision tree protocol(ACT).The main novelty of this paper is that the AD strategy is introduced and used in ACT to decrease collisions and improve the tag system throughput.AD strategy means that query strings will divide into two or four branches adaptively according to the label quantity.This scheme can decrease both depth of query and collision timeslots,and avoid producing too much idle timeslots at the same time.Both theoretical analysis and simulation results indicate that the novel proposed anticollision protocol ACT outperforms the previous CT and ICT protocols in term of time complexity,system throughput,and communication complexity.
基金supported by National Basic Research Program of China(973 Program, No.2010CB327403)
文摘Collision and security issues are considered as barriers to RFID applications.In this paper,a parallelizable anti-collision based on chaotic sequence combined dynamic frame slotted aloha to build a high-efficiency RFID system is proposed.In the tags parallelizable identification,we design a Discrete Markov process to analyze the success identification rate.Then a mutual authentication security protocol merging chaotic anti-collision is presented.The theoretical analysis and simulation results show that the proposed identification scheme has less than 45.1%of the identification time slots compared with the OVSF-system when the length of the chaos sequence is 31.The success identification rate of the proposed chaotic anti-collision can achieve 63%when the number of the tag is100.We test the energy consumption of the presented authentication protocol,which can simultaneously solve the anti-collision and security of the UHF RFID system.
文摘In this paper, the authors make a summary of current situation of research on the Auto Anti-Collision, briefly introduce the components and functions of the NSACA Simulation Platform and bring forward the project to realize the simulation of an Automatic Anti-Collision control, based on the NSACA Simulation Platform. Finally give typical examples from a great deal of simulating tests and analyze them.
基金supported by BUPT Innovative Funds for Young Scholars under Grant No. 2010-2011National Natural Science Foundation of China under Grant No.60972080National S&T Major Project under Grant No.2010ZX03002-008-01
文摘The Long Term Evolution Advanced (LTE-A) and Internet of Things (IoT) are two of the most popular topics that receive vast attentions in the filed of information technologies. Radio Frequency Identification (RFID) greatly pushes IoT forward to practical utilization. In RFID system, one of the key issues is the collision among tags when reader tries to identify several of them simultaneously. In this paper, the authors proposed a RFID tag management scheme for cargo identification and tracking based on the LTE-A structure. Compared to the conventional measures, this scheme has taken advantages of the IoT and LTE-A's convergence, and also efficiently suppresses the tags identifying collision at the reader.
基金supported by the National High Technology Research and Development Program of China(Grant No.2012AA011603)the National Natural Science Foundation of China(Grant No.61372172)
文摘The projection matrix model is used to describe the physical relationship between reconstructed object and projection.Such a model has a strong influence on projection and backprojection,two vital operations in iterative computed tomographic reconstruction.The distance-driven model（DDM） is a state-of-the-art technology that simulates forward and back projections.This model has a low computational complexity and a relatively high spatial resolution;however,it includes only a few methods in a parallel operation with a matched model scheme.This study introduces a fast and parallelizable algorithm to improve the traditional DDM for computing the parallel projection and backprojection operations.Our proposed model has been implemented on a GPU（graphic processing unit） platform and has achieved satisfactory computational efficiency with no approximation.The runtime for the projection and backprojection operations with our model is approximately 4.5 s and 10.5 s per loop,respectively,with an image size of 256×256×256 and 360 projections with a size of 512×512.We compare several general algorithms that have been proposed for maximizing GPU efficiency by using the unmatched projection/backprojection models in a parallel computation.The imaging resolution is not sacrificed and remains accurate during computed tomographic reconstruction.
基金Sponsored by the National Natural Science Foundation of China(60372042)
文摘Identifying speed,tag average response times and reliability are the most important capabilities in passive RFID(radio frequency identification) system.QT(query tree) is a famous algorithm for lowest-cost RFID tags,but its shortcoming is high searching delay and high tag average response times.A prefix subsection matching binary(PSMB) algorithm based on QTalgorithm is proposed.The key idea of PSMB anti-collision algorithm is that,during searching phase,a given reader uses the particular tags ID,which has been searched out formerly,to shorten searching delay and depress tag average response times.The idea of PSMB algorithm can be described as follows.Usually,tag ID is composed of several subsections which have different meanings.Based on the tags ID searched out formerly,a given reader builds a prefix database.In subsequent searching phase,the reader uses its prefix database to deduce searching space of tag ID.Simulation results show that identification delay of PSMB algorithm is about 1/3 of QTalgorithm,tag average response times is about 1/4 of QTalgorithm,and system throughput rate is treble QTalgorithm.
