基于数据块优先级的无线多跳Mesh网络数据分发算法

摘要

The Mesh-Pull distribution scheme is mostly used to improve the wireless multi-hop Mesh network data distribu-tion algorithm,which leads to the poor transmission performance,and insufficient distribution delay of massive data. The wire-less multi-hop Mesh network data distribution algorithm based on data block priority was designed. On the basis of Mesh-Pull method,the optimal selection mechanism is defined by considering the interference effect of data throughput and time delay. The data block priority is introduced to determine the request sequence of the transmitting data block in network. The bandwidth and signal to noise ratio(SNR)of Mesh network are estimated to find out the optimal neighbor node. The simulation data shows that,in comparison with the Mesh-Pull data distribution algorithm,the improved algorithm has lower network delay and higher network throughput.%为了解决当前无线多跳Mesh网络数据分发算法大都使用Mesh-Pull分发策略,导致其传输性能较弱,以及较大的数据分发时延的不足,设计了基于数据块优先级的无线多跳Mesh网络数据分发算法.首先,基于Mesh-Pull方法,考虑其吞吐量与时延的干扰作用,定义了最优化择取机制,并引入数据块的优先级,确定网络中的待传输数据块的请求排序,并通过评估Mesh网络的带宽和SNR值,寻找出最优邻居节点.实验数据显示,与当前Mesh-Pull数据分发算法相比,该算法具有更低的网络时延与更高的吞吐量.