摘要
为了研究无线自组网中多速率调度问题,首先将它模型化为一个优化问题,然后根据是否考虑节点缓冲区因素提出了两个多速率条件下的调度算法——HRFWICB和HRFWCB,它们的基本思想是在保证数据流基本公平性的前提下,优先调度高速率数据流来降低包的传输时间和延迟。实验结果证明,同Luo算法和GPPF算法相比,HRFWICB算法和HRFWCB算法能够明显地降低包的传输时间和延迟。
This paper studies the muhirate scheduling in wireless Ad-Hoe network. Firstly, we formulate it as an optimization problem. Moreover, the HRFWICB （highest rate first without considering buffer） algorithm and the HRFWCB （highest rate first with considering buffer） algorithm are present. Their main idea is scheduling prior the flow with higher transmission rate to decrease the transmission time and delay subject to that the minimum channel allocation for each flow is guaranteed. Finally the simulations are performed to compare our algorithms with Luo algorithm and GPPF（greatest potential packet first） algorithm. The result shows our algorithms can greatly decrease the transmission time and delay.
出处
《电信科学》
北大核心
2009年第5期40-44,共5页
Telecommunications Science
基金
国家自然科学基金资助项目(No.60873195)
教育部博士点基金资助项目(No.20050359004)
安徽省高校青年教师资助项目(No.2008jq1005)
合肥工业大学博士专项基金资助项目(No.2007GDBJ027)
合肥工业大学科学研究发展基金资助项目(No.081005F
No.061005F)
关键词
无线自组网
多速率
调度
加权流冲突图
wireless Ad Hoc network, multirate, scheduling, weighted flow contention graph
