摘要
由于实际应用对标签数量的需求日益增大,导致标签碰撞问题成为严重影响RFID系统识别效率的重要因素。提出了一种基于标签分布距离的碰撞避免算法(DBCA),该算法可很好地解决大规模RFID环境下的标签碰撞问题。根据标签与阅读器的分布距离,建立新型的标签分组结构,确保组内标签的高效识别;利用组内标签不同属性,给出以不同频率在相应帧时隙通信的方法,缩减识别时间和碰撞发生概率。算法分析及仿真结果表明,相比已有算法,该算法可有效提高系统的识别效率,减少识别时间。
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.
出处
《西北工业大学学报》
EI
CAS
CSCD
北大核心
2016年第2期250-255,共6页
Journal of Northwestern Polytechnical University
基金
国家自然科学基金(61301092
61571370
61401360)
中央高校基金(3102015ZY093)资助
关键词
RFID
碰撞避免
分布距离
分组
algorithms
clustering algorithms
collision avoidance
computer network performance evaluation
computer simulation
constrained optimization
efficiency
electric power utilization
flowcharting
identification（control systems）
MATLAB
network performance
network protocols
optimization
probability
radio frequency identification（RFID）
schematic diagrams
stochastic models
time delay
wavelength
distribution distance
grouping
