Abstract
A large number of tags are needed in many applications; this fact causes the tag collision problem which affects the system efficiency of identification. We propose a DBCA (tag distribution Distance Based Collision Avoidance) algorithm, which can effectively solve the tag collision problem for a large scale RFID environment. To identify tags with the best system efficiency, a new grouping structure, based on distribution distance, is presented. To reduce the identification time, we give a communication method for the reader and tags in the corresponding frame, based on the different frequencies belonging to the different tag properties. The simulation results and their analysis show preliminarily that our algorithm has better performance than the existing algorithms with respect to system efficiency and identification time.
| Original language | English |
|---|---|
| Pages (from-to) | 250-255 |
| Number of pages | 6 |
| Journal | Xibei Gongye Daxue Xuebao/Journal of Northwestern Polytechnical University |
| Volume | 34 |
| Issue number | 2 |
| State | Published - 1 Apr 2016 |
Keywords
- Algorithms
- Clustering algorithms
- Collision avoidance
- Computer network performance evaluation
- Computer simulation
- Constrained optimization
- Distribution distance
- Efficiency
- Electric power utilization
- Flowcharting
- Grouping
- Identification (control systems)
- MATLAB
- Network performance
- Network protocols
- Optimization, probability
- Radio frequency identification (RFID)
- Schematic diagrams, stochastic models
- Time delay
- Wavelength