Computer Engineering and Applications ›› 2006, Vol. 42 ›› Issue (14): 22-.

• 博士论坛 • Previous Articles     Next Articles

DPQS:An Effective Queue Scheduling Mechanism for Mobile Ad Hoc Networks


  1. 中南大学信息科学与技术学院,韶关大学计算机系
  • Received:2006-02-27 Revised:1900-01-01 Online:2006-05-11 Published:2006-05-11



  1. 中南大学信息科学与技术学院,韶关大学计算机系
  • 通讯作者: 霍英 sgkidi

Abstract: A dynamic priority queue scheduling mechanism, DPQS, dedicating to the mobile ad hoc network was proposed. The buffer is divided into three different load phases by setting Minth and Maxth two thresholds. The packets priority is dynamic assigned according to the current buffer load. The simulation results showed that DPQS mechanism can effectively decrease the network transmission delay and to a certain extent promote the network throughput.

Key words: mobile ad hoc networks, queue scheduling, priority

摘要: 提出一种针对移动自组网的动态优先权队列调度机制(Dynamic Priority Queue Scheduling, DPQS)。为缓冲区设置最大、最小两个阈值,将其分为三个不同的负载阶段,然后根据当前缓冲区的负载情况动态调整各种类型数据包的优先等级,从而在不影响快速建立路由的前提下,降低数据包在网络中的传输延时,提高网络的性能。仿真结果表明DPQS机制有效地降低了网络传输延时,并对网络的吞吐量也有一定的提高。

关键词: 移动自组网, 队列调度, 优先权