时隙Aloha防冲突算法的马尔可夫链模型研究  

Markov Chain Model of Frame-Slotted-Aloha Anti-collision Algorithm

作　　者：曹小华[1] 陶德馨[1] 李文锋[1] 

机构地区：[1]武汉理工大学物流工程学院,武汉430063

出　　处：《武汉理工大学学报（交通科学与工程版）》2007年第5期796-799,共4页Journal of Wuhan University of Technology（Transportation Science & Engineering）

基　　金：湖北省自然科学基金项目资助(批准号:2006ABA302)

摘　　要：分析了时隙Aloha防冲突算法的过程及马尔可夫特性,根据下一识读时间段识别出的应答器数量只与当前识读时间段识别出的应答器数量有关,与前面识读时间段识别出的应答器数量无关的特点,构建了时隙Aloha防冲突算法的马尔可夫链模型,并给出了马尔可夫链模型的求解过程,得出了应答器数量、时隙数、成功识别率之间的数学关系,并通过仿真计算得出他们之间的曲线关系.This paper analyzes the process of frame-slotted-aloha anti-collision algorithm and its Markov trait. As the number of readout responders in the next period is related to the ones in the current peri- od but isn＇t related to the ones in the previous period, the Markov chain model is created with frame- slotted-aloha anti-collision algorithm. The process of solution of the Markov chain model is presented in detail. The mathematical relation is obtained among the number of responders, the number of slots and the rate of success readout. Their relationship curve is got by simulation, which is benefit to the design and analysis of RFID system.

关 键 词：时隙ALOHA 马尔可夫链 防冲突 射频识别 

分 类 号：TN45[电子电信—微电子学与固体电子学]