检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:董辉[1] 盛魁[1] 马健[1] 姚宏亮[2] DONG Hui;SHENG Kui;MA Jian;YAO Hongliang(Department of Information Engineering,Bozhou Vocational and Technical College,Bouzhou236800,China;School of Computer and Information,Hefei University of Technology,Hefei230000,China)
机构地区:[1]亳州职业技术学院信息工程系,安徽亳州236800 [2]合肥工业大学计算机与信息学院,安徽合肥230000
出 处:《广西科技大学学报》2018年第1期61-68,共8页Journal of Guangxi University of Science and Technology
基 金:国家自然科学基金项目(61175051);安徽省科技攻关计划项目(1501zc03031);安徽省高校自然科学研究重点项目(KJ2016A493,KJ2015A417,KJ2014A171);安徽省高校振兴计划优秀青年人才支持计划项目(gxyqZD2016529);安徽省亳州市科技创新团队项目( 亳组2014(21) 号) ;安徽省亳州市产业创新团队项目(亳组[2015]20 号 -2)资助.
摘 要:为解决射频识别系统中多标签碰撞问题及提高系统性能,在综合分析基于时隙Aloha协议多种防碰撞算法的基础上,提出一种基于标签分组先来先服务的自适应帧时隙Aloha防碰撞算法(TG-FCFSADFSA).该算法通过对标签分组和先来先服务及帧时隙预约策略,自适应分配成功时隙来快速识别标签,极大地提高了RFID系统性能.MATLAB仿真结果证明:TG-FCFSADFSA算法在标签数量越多识别优势越明显,特别是标签数量超过1000时,该算法比DSFA,GDFSA算法标签吞吐率提高1倍以上,时隙开销降低50%以上,系统识别效率和稳定性明显提高.Based on the comprehensive analysis of various tag frame slotted Aloha tag anti-collision algorithms,the TG-FCFS ADFSA anti-collision algorithm is presented to solve the problem of collision between multi-tag and improve the efficiency in RFID system.The algorithm can quickly identify the tags by adaptively allocating the successful slots,which greatly improves the performance of the RFID system through the strategy of the tag groups FCFS(First Come First Service)and the reserved frame slots.Matlab simulation results show the identification advantage of the algorithm is obvious in the case of more tags,especially when the number of tags is over1000,throughput of the algorithm is over doubled than the DSFA or GDFSA algorithm,but the slot consumption is reduced by more than50%,the identification efficiency and stability of system are obviously improved.
分 类 号:TN911.23[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.40