排序方式: 共有167条查询结果,搜索用时 15 毫秒
111.
在无线射频(RFID)广泛应用过程中产生海量数据,由于其数据与一般数据存在差异而且占用较大的存储空间,所以对RFID数据的存储问题亟待解决,对此首先对车联网(IOV)收集的RFID路径数据从地点维和时间维两方面进行了预处理,之后采用改进的LZW方法进行压缩存储,对阈值的判断方法进行改进,从而高效地完成RFID路径数据的压缩存储.实验结果表明,该算法达到了路径数据存储占用较少空间的目的,同时也为以后的路径数据挖掘工作打下良好的基础. 相似文献
112.
113.
In the radio frequency identification (RFID) system based on surface acoustic wave (SAW) technique, some tags often locate in the field of a transceiver at the same time. These tags produce simultaneous echo signals which "collide" when they arrive back at the transceiver, which leads to difficult identification. In this paper, smart antenna technique is presented to implement anti-collision in SAW RFID system. The direction of arrivals (DOAs) are used to denote the locations of tags, and genetic algorithm (GA) is suggested to find the optimal estimates of the DOAs in complex multimodal search spaces. Once the DOAs are obtained, the array weights are formed and the signals of tags are recovered to implement decoding. The experimental results show that the GA-based smart antenna technique works well in some occasions. 相似文献
114.
为缓解世博会期间大量游客给城市交通和宾馆住宿带来的巨大压力,并消除游客由于携带大宗行李带来的旅游不便,采用RFID技术,从信息环境、系统调度、集约运输等方面为2010年上海世博会构建行李跟随系统。研究表明,行李跟随系统可由8个相关子系统构成,在RFID技术支持下形成完整的作业流程,既便于集中管理行李,又方便游客即时查询行李跟随情况,保证行李准时到达。世博会游客通过行李跟随服务,便于安排旅游行程计划,同时将缓解世博会交通压力。 相似文献
115.
从地铁施工灾害风险源入手,采用多维关联规则数据挖掘方法甄选出关键警兆指标;EPC编码标签和监控看板对关键警兆指标信息进行标识;RFID射频识别技术实现信息的自动识别和远程监控.以期达到地铁施工现场各类分散风险信息的准确采集、实时监控和动态跟踪. 相似文献
116.
117.
RFID技术在供应链中的应用 总被引:8,自引:0,他引:8
介绍了RFID的发展历程和关键技术,对电子标签的应用及工作原理、优点等进行了阐述.从信息与利润共享入手论述了电子标签对供应链产生的影响,对RFID技术在供应链中的应用做了分析和预测,并结合中国实际对如何发展RFID在物流供应链中的应用提出了一些建议. 相似文献
118.
时隙Aloha防冲突算法的马尔可夫链模型研究 总被引:2,自引:1,他引:2
分析了时隙Aloha防冲突算法的过程及马尔可夫特性,根据下一识读时间段识别出的应答器数量只与当前识读时间段识别出的应答器数量有关,与前面识读时间段识别出的应答器数量无关的特点,构建了时隙Aloha防冲突算法的马尔可夫链模型,并给出了马尔可夫链模型的求解过程,得出了应答器数量、时隙数、成功识别率之间的数学关系,并通过仿真计算得出他们之间的曲线关系. 相似文献
119.
分析了影响RFID系统性能的因素,提出了一些优化RFID系统性能的措施,并详细阐述了通过设计RFID系统的接收电路以及优化RFID系统的防冲突算法来提高RFID系统性能的措施. 相似文献
120.
A radio frequency identification (RFID) reader will fail to identify tags if a collision occurs. This paper proposes a bi-slotted binary tree algorithm (BSBTA) with stack for RFID tag anti-collision to improve the performance of binary tree algorithm (BTA). In BSBTA, the reader detects collisions by Manchester code and stores colliding prefixes in a stack. The query is composed of a two-bit prefix and an index value. Following every reader query, there are two timeslots for tags whose pointers and identities (IDs) match the query to respond, one for the tag whose next bit is 0 and the other for the tag with 1 as its next bit. Performance analysis and evaluation are also given. The time complexity and the communication complexity of BTA and BSBTA are derived. The simulation results compare the performance of BSBTA with several related anti-collision algorithms. It is shown that BSBTA outperforms BTA in terms of the average number of responded bits and timeslots for one tag identification. 相似文献