1. 南京信息工程大学计算机与软件学院,江苏,南京,210044
2. 重庆交通大学信息技术中心,重庆,400074
3. 电子科技大学通信与信息工程学院,四川,成都,611731
4. 南京信息工程大学计算机与软件学院,江苏,南京,210044
5. 重庆交通大学信息技术中心,重庆,400074
6. 电子科技大学通信与信息工程学院,四川,成都,611731
网络出版:2018-04-25,
纸质出版:2018
移动端阅览
苏健, 杨晓娇, 韩雨. 一种时间高效的易于实现的多标签射频识别技术[J]. 电子学报, 2018,46(4):903-910.
SU Jian, YANG Xiao-jiao, HAN Yu. A Time-Efficient and Easy-to-Implement RFID Technology for Multiple Tags[J]. Acta Electronica Sinica, 2018, 46(4): 903-910.
苏健, 杨晓娇, 韩雨. 一种时间高效的易于实现的多标签射频识别技术[J]. 电子学报, 2018,46(4):903-910. DOI: 10.3969/j.issn.0372-2112.2018.04.019.
SU Jian, YANG Xiao-jiao, HAN Yu. A Time-Efficient and Easy-to-Implement RFID Technology for Multiple Tags[J]. Acta Electronica Sinica, 2018, 46(4): 903-910. DOI: 10.3969/j.issn.0372-2112.2018.04.019.
多标签碰撞问题严重影响射频识别RFID系统的识别效率.在研究子帧观测机制的基础上,针对常规动态帧时隙Aloha多标签防碰撞算法存在的复杂度高、时间效率低等问题,提出了一种基于子帧的动态帧时隙Aloha算法,其在识别过程中采取设定的子帧观测,运用空闲与碰撞时隙数的关系估计剩余标签数,再依据预估的结果优化设置新的帧长,显著提升了大容量多标签RFID系统的识别效率.该算法的运算复杂度低、计算量小,易于在常规RFID读写器中实现,工程应用前景广阔.仿真结果表明:同传统的Aloha类防碰撞算法相比,提出的算法具有复杂度低、稳定好、识别效率高等优势.
Multiple tags collision problem severely degrade the identification efficiency of an RFID system. Based on the research of sub-frame observation mechanism
a sub-frame based dynamic framed slotted Aloha (SUBF-DFSA) algorithm is presented to tackle the high computation complexity and low time efficiency existing in the conventional DFSA algorithm. The SUBF-DFSA algorithm makes effective use of the idle and collision statistics during a sub-frame to estimate the tag backlog
determine the optimal frame size for the next identification round
so that it can dramatically improve the identification efficiency of an RFID system with large volume of tags. It is easier to implement into the conventional RFID reader because of the low computation overhead. Simulation results are supplemented to demonstrate the advantages of the proposed algorithm in achieving low computation complexity
good stability
and high identification efficiency compared to the traditional Aloha-based algorithms.
0
浏览量
193
下载量
3
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621