检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]华中科技大学电子与信息工程系,湖北武汉430074
出 处:《华中科技大学学报(自然科学版)》2007年第6期14-16,共3页Journal of Huazhong University of Science and Technology(Natural Science Edition)
基 金:国家高技术研究发展计划资助项目(2005AA420050-05)
摘 要:在对现有ALOHA算法分析的基础上提出一种改进的动态帧时隙ALOHA算法.算法根据实时估计的读写器附近的标签数量动态调整帧长,使系统工作在最大吞吐量下,从而缩短标签读取时间.仿真结果表明,该算法在标签数量大于500时,相比其他ALOHA算法在吞吐量上有近100%的提高,同时读取时间下降近50%,从而适用在实时性强的射频识别场合.ALOHA algorithm is an anti-collision algorithm widely used in RFID system. An enhanced dynamic frame slotted ALOHA algorithm was proposed, after the existing ALOHA algorithms and was analysed, which can dynamically changes the frame length through estimating real-time tag quantity near the readers and keeps working around the maximum throughput to decrease tag identification time. The simulation indicated that compared to other ALOHA algorithms, when the tag quantity exceeds 500, this algorithm has nearly 100 % boost in throughput and 50 % drop in the time of tag identification, and therefore is applicable for RFID cases that require strong real-time process.
分 类 号:TN911[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.200