检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西南交通大学信息科学与技术学院,四川成都610031 [2]西南民族大学计算机科学与技术学院,四川成都610041
出 处:《计算机集成制造系统》2012年第9期2076-2081,共6页Computer Integrated Manufacturing Systems
基 金:国家863计划资助项目(2012AA012305);国家自然科学基金重大资助项目(60990320,60990323);中央高校基本科研业务费专项资金资助项目(12NZYQN20,11NZYTH06);四川省应用基础研究计划资助项目(2012JY0096)~~
摘 要:为解决目前无线射频识别标签防碰撞算法在标签持续到达时识别效率下降的问题,在给出标签到达与识别过程模型的基础上,提出一种支持标签持续到达的防碰撞算法。利用标签到达与识别过程模型,算法比较准确地估算了阅读器识别区域内的标签数。运用泊松过程叠加原理和帧效率优化理论来确定帧长,实现了识别过程的高效性。运用排队论研究了标签到达率上限,为算法稳定运行提供了科学依据。仿真实验表明,在标签持续到达的整个过程中,所提算法的平均识别效率接近于识别过程中无标签到达时DFSA算法的识别效率。To solve the problem that the identification efficiency of RFID anti-collision algorithm was reduced when tags continuously arrived, a Continuous arrival Dynamic Frame Slot Algorithm(CDFSA)which supported tags continuous arrival was proposed based on arrival and indentification process model, and the tag number in reader identification area was estimated accurately. The frame size was determined by poisson process superposition theory and frame efficiency optimization theory, thus the high efficiency of identification process was realized. The upper limit of tags arrival rate was obtained by queue theory, and the scientific basis for algorithm stable operation was provided. Simulation results showed that CDFSA average identification efficiency under tags continuous arrival process was approached to DFSA efficiency under no tags arrival in the process identification.
分 类 号:TN91[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28