首页> 外文会议>2010 6th International Conference on Wireless Communications Networking and Mobile Computing >Congestion Based Opportunistic Packet Scheduling Algorithm with Variable Size Packets Support in Ad Hoc Networks
【24h】

Congestion Based Opportunistic Packet Scheduling Algorithm with Variable Size Packets Support in Ad Hoc Networks

机译:Ad Hoc网络中基于拥塞的可变分组支持的机会分组调度算法。

获取原文

摘要

In wireless multi-hop Ad hoc networks, contending existing at MAC layer could easily results in congestion, and the first-in-first-out queue within the nodes could make the head of the queue blocked, which affects the transmitting of the following packets. In this paper, we present a variable packet size supporting and congestion-based opportunistic packet scheduling (VS-CBOS) algorithm, in which the sender sends multicast RTS frame targeted to several next-hop receivers, the receiver will reply with priority-based CTS by the probability according to its queue congestion level, and reservation subheader is added to DATA frame to support variable packet size. The performance analysis and simulation results show that VS-CBOS can remarkably increase the signaling handshake success ratio, the network end-to-end saturation throughput and the fairness among traffic flows.
机译:在无线多跳Ad hoc网络中,存在于MAC层的竞争很容易导致拥塞,并且节点内的先进先出队列可能会使队列的头部阻塞,从而影响后续数据包的传输。 。在本文中,我们提出了一种可变的数据包大小支持和基于拥塞的机会数据包调度(VS-CBOS)算法,其中发送方发送针对多个下一跳接收方的多播RTS帧,接收方将使用基于优先级的CTS进行回复通过根据其队列拥塞级别的概率,将保留子报头添加到DATA帧以支持可变的数据包大小。性能分析和仿真结果表明,VS-CBOS可以显着提高信令握手成功率,网络端到端饱和吞吐量和业务流之间的公平性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号