摘要
在射频识别(radio frequency identification, RFID)系统中,动态帧时隙ALOHA算法是解决标签碰撞问题的常用算法。针对现有ALOHA算法存在调整至最佳帧长消耗步数过长和再识别过程中空时隙过多问题,文章提出了一种基于动态帧时隙ALOHA的改进算法。该算法根据当前时刻静态标签数确定阈值和调整帧长,减少了达到最佳帧长的步数,再识别过程中利用分治算法思想,对冲突标签按冲突时隙数划分成若干相互独立、规模较小的最优子结构,使每次轮询空时隙降到最低,从而实现了以最少时延完成识别。仿真结果表明,本文提出的算法能有效地降低时延,提高系统运行效率。
Dynamic Framed Slotted ALOHA(DFSA) algorithm is mainly used to solve the tag collision problem in radio frequency identification(RFID) system. Aiming at the problems existing in the algorithm, such as consuming too many steps to reach the optimal frame size and containing too many empty slots during recognition process, an improved DFSA algorithm is proposed through modeling analysis and mathematical deduction. This algorithm adjusts the frame length using the threshold results, and reduces the number of steps to reaching the optimal frame size for constant tags. Divide and conquer algorithm is used to group the tags by collision slot. With several independent and smaller optimal substructures, this algorithm achieves the goal of recognition with minimum time delay by reducing the waste of time slot. Simulation shows that the proposed algorithm can effectively reduce the time delay and improve the system efficiency.
作者
刘正琼
纪泽宇
王小巧
周文霞
丁力
LIU Zhengqiong;JI Zeyu;WANG Xiaoqiao;ZHOU Wenxia;DING Li(School of Computer and Information,Hefei University of Technology,Hefei 230601,China;School of Mechanical Engineering,Hefei University of Technology,Hefei 230009,China)
出处
《合肥工业大学学报（自然科学版）》
CAS
北大核心
2019年第8期1072-1076,共5页
Journal of Hefei University of Technology：Natural Science
基金
安徽省重点研究与开发计划资助项目(1604a0902182)
关键词
动态帧时隙
ALOHA算法
最佳帧长
分治算法
吞吐率
时间时延
dynamic frame slot
ALOHA algorithm
optimal frame size
divide and conquer algorithm
throughput
time delay
