基于哈希算法的动态TDMA时隙分配研究

动态时隙分配机制是Ad Hoc网络提高组网效率的重要方面。提出了一种基于哈希算法的动态时隙资源分配机制-HP_TDMA算法。该算法将节点的时隙需求划分为3种情况:节点不需要使用时隙、只需要使用主时隙和需要竞争额外时隙。在时隙竞争阶段采用哈希算法获得节点对时隙使用的优先级顺序表,按照优先级表配置节点对时隙的使用。经过仿真分析得出采用哈希算法的时隙分配策略能够高效地利用时隙资源,提高信道利用率。

Study on Dynamic TDMA Slots Assignment based on Hash Algorithm

Dynamic slots assignment mechanism is very important for improvement of Ad Hoc networking efficiency.A dynamic slots assignment algorithm based on hash algorithm named HP_TDMA is proposed in this paper.This algorithm divides the nodes slots requirements into three types,that is,the nodes require no slots,require their own slots and require competition of extra slots.Hash algorithm is used to obtain a priority table for deciding the priority of the nodes,and the slots are assigned in accordance with this table.Simulation and analysis indicate that the slots assignment by HP_TDMA algorithm has a good performance in effective use of slots resources.