首页> 外文会议>IEEE Annual Conference on Decision and Control >Stability of longest-queue-first scheduling in linear wireless networks with multihop traffic and one-hop interference
【24h】

Stability of longest-queue-first scheduling in linear wireless networks with multihop traffic and one-hop interference

机译:具有多跳流量和单跳干扰的线性无线网络中最长队列优先调度的稳定性

获取原文

摘要

We consider the stability of the longest-queue-first (LQF) scheduling policy in wireless networks with multihop traffic under the one-hop interference model. Although it is well known that the back-pressure (BP) algorithm achieves the maximal stability, its computational complexity is very high. In this paper, we consider LQF, a low-complexity scheduling algorithm, which has been shown to have near optimal throughput performance in many networks with single-hop traffic flows. We are interested in the performance of LQF for multihop traffic flows. In this scenario, the analysis of local-pooling factors for LQF does not carry through because of the complicated coupling between queues due to multihop traffic flows. Using fluid limit techniques, we show that LQF achieves the maximal stability for linear networks with multihop traffic and a single destination under the one-hop interference.
机译:在单跳干扰模型下,我们考虑了具有多跳流量的无线网络中最长队列优先(LQF)调度策略的稳定性。尽管众所周知,背压(BP)算法可实现最大的稳定性,但其计算复杂度很高。在本文中,我们考虑了LQF(一种低复杂度的调度算法),该算法已被证明在具有单跳流量的许多网络中具有接近最佳的吞吐性能。我们对多跳流量的LQF性能感兴趣。在这种情况下,由于多跳业务流导致队列之间的耦合很复杂,因此无法进行LQF的本地池因子分析。使用流体限制技术,我们证明了LQF在单跳干扰下为多跳流量和单个目标的线性网络实现了最大稳定性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号