检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Haipeng Chen Kexiong Liu Chunyang Ma Yu Han Jian Su
机构地区:[1]Department of Electrical Engineering,Northeast Electric Power University,Jilin,132012,China [2]School of Technology,Beijing Forestry University,Beijing,100083,China [3]Department of Electro-Optics and Photonics,University of Dayton,Dayton,OH 45469,USA [4]School of Information and Communication Engineering,University of Electronic Science and Technology,Chengdu,611731,China [5]School of Computer and Software,Nanjing University of Information Science and Technology,Nanjing,210044,China
出 处:《Computers, Materials & Continua》2018年第11期195-204,共10页计算机、材料和连续体(英文)
摘 要:Recently,object identification with radio frequency identification(RFID)technology is becoming increasingly popular.Identification time is a key performance metric to evaluate the RFID system.The present paper analyzes the deficiencies of the state-of-the-arts algorithms and proposes a novel sub-frame-based algorithm with adaptive frame breaking policy to lower the tag identification time for EPC global C1 Gen2 UHF RFID standard.Through the observation of slot statistics in a sub-frame,the reader estimates the tag quantity and efficiently calculates an optimal frame size to fit the unread tags.Only when the expected average identification time in the calculated frame size is less than that in the previous frame size,the reader starts the new frame.Moreover,the estimation of the proposed algorithm is implemented by the look-up tables,which allows dramatically reduction in the computational complexity.Simulation results show noticeable throughput and time efficiency improvements of the proposed solution over the existing approaches.
关 键 词:Radio frequency identification ANTI-COLLISION ALPHA time efficiency
分 类 号:TP3[自动化与计算机技术—计算机科学与技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49