摘要
物联网感知层是实现实物与互联网建立关联关系的关键层,在这层中利用扫描RFID标签将实物信息输入计算机,通常一次可以扫描多组标签,这就产生了标签碰撞问题。因此,论文研究物联网感知层数据分配算法,主要在二叉树和四叉树搜索算法的基础上,结合HQT算法和自适应多叉树算法对物联网感知层数据分配算法进行设计,提出位匹配算法(ABM),并将该算法与目前常用的Aloha算法、HQT算法进行仿真比对,证明ABM算法设计的可行性。
The Internet of things perception layer is the key layer to realize the relationship between real object and the Internet,in this layer by scanning RFID tags will be input real information into the computer,usually one can scan multiple labels,which produces a tag collision problem.Therefore,things perception layer data allocation algorithms are studied in this paper,mainly on the basis of the binary tree and quadtree search algorithm,combined with HQT algorithm and adaptive multi-tree algorithm,it proposes a algorithm based on collision-bit Match(ABM),which contrasts with Aloha algorithm,HQT algorithm simulation to prove the feasibility.
出处
《计算机与数字工程》
2015年第12期2239-2242,共4页
Computer & Digital Engineering
关键词
物联网感知层
标签碰撞
位匹配算法
数据分配算法
things perception layer
tag collision
bit-matching algorithm
data allocation algorithm