Ad Hoc网络中基于动态优先级的数据调度算法

A Wireless Packets Distributing Algorithm Based on Dynamic Priority Level for Ad Hoc Networks

提出了无线Ad Hoc网络中一种通信信道最优化调度算法。该算法首先根据信道原始数据传输优先级,确定局部网络按数据包优先等级的比例分布;然后,划分节点虚拟队列,计算网络信道平均利用期望优先级;最后,根据当前时刻网络资源使用与系统最大通信容量上限的关系,考虑数据包在节点等待时间及其优先等级分布,制定各信道调度优先级。仿真结果表明,算法在考虑数据优先级及信道状态变化条件下,实现了整体网络通信性能最优化。

A wireless packets distributing algorithm based on dynamic priority Level for Ad Hoc Networks is proposed in the paper. Firstly, according to channel original data transmission priority level, in term of priority level proportion distribution of data package for local network is confirmed by the algorithm, and then, to divide dummy queue of node, calculate expectation priority level of network channel average utilization. Finally, according to the relationship between network resource utilization and upper limit of the system maximal communication capacity of the current time, taking into account the waiting time of data package at the node and its priority level distribution, set down dispatch priority level for each channel. The simulation result shows that under the condition of considering data priority level and channel state change, the optimization performance of integrate network communication is realized by the algorithm.