Ad hoc网络中基于拥塞的机会调度算法  

Opportunistic Scheduling Algorithm Based on Congestion in Wireless Ad hoc Networks

作　　者：夏海轮[1] 丁炜[1] 

机构地区：[1]北京邮电大学宽带通信网络实验室,北京海淀区100876

出　　处：《电子科技大学学报》2008年第5期761-764,共4页Journal of University of Electronic Science and Technology of China

基　　金：国家自然科学基金(60372101)

摘　　要：无线多跳Ad hoc网络中的节点在业务发送过程中需要竞争共享信道,容易发生局部拥塞导致网络性能下降,而且节点内部采用的先入先出(FIFO)队列容易使队头出现阻塞现象,影响队列中后续分组的发送。为此提出了一种基于拥塞的机会调度算法,发送节点发送RTS帧时目标指向多个下一跳接收节点,这些节点在正确解码RTS帧后根据自身拥塞程度按一定概率依照调度优先级顺序发送CTS帧。仿真结果表明,该算法提高了网络端到端的饱和吞吐量和信道利用率,也提高了业务流之间的公平性。In wireless multi-hop Ad hoe networks, nodes need to contend for the shared wireless channel, this could result in partial congestion in the network and degrade the network performance. And first in first out （FIFO） queue within a node could easily cause the head-of-line blocking problem. A novel congestion-based opportunistic scheduling （CBOS） algorithm is proposed. In CBOS, the sender sends multicast request to send （RTS） frame targeted to several receivers, and the receivers would reply priority-based clear to send （CTS） by the probability according to its queue congestion status. The simulation results show that CBOS can remarkably increase the network end-to-end saturation throughput and the utilization ratio of wireless channel, and can increase the fairness among traffic flows.

关 键 词：无线自组网 拥塞控制 队头阻塞 机会调度 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]