A novel anti-collision algorithm in RFID wireless network is proposed.As it is put forward on the basis of collision tree(CT)and improved collision tree(lCT) anti-collision protocols,we call it adaptive collision tree protocol(ACT).The main novelty of this paper is that the AD strategy is introduced and used in ACT to decrease collisions and improve the tag system throughput.AD strategy means that query strings will divide into two or four branches adaptively according to the label quantity.This scheme can decrease both depth of query and collision timeslots,and avoid producing too much idle timeslots at the same time.Both theoretical analysis and simulation results indicate that the novel proposed anticollision protocol ACT outperforms the previous CT and ICT protocols in term of time complexity,system throughput,and communication complexity.
为了简化使用完美马尔科夫均衡方法可能引起的复杂计算过程,本文依据博弈论方法,提出一种平均场均衡的无线自组织网络路由协议(mean field equilibrium AODV,MFEA)。该方法要求每个节点利用所有其他节点的信息来分析自己的最优策略,而不需要知道每一个局中人的信息,并且在足够大的局中人数目情况下性能更加近似马尔科夫均衡。仿真实验显示:提出的MFEA路由协议在包投递率、时延和归一化开销方面均优于AODV(Ad hoc on-demand distance vector routing)协议,在节点密集的无线自组织网络中仍可获得比较好效果。
