首页> 外文期刊>Parallel and Distributed Systems, IEEE Transactions on >A Class of Cross-Layer Optimization Algorithms for Performance and Complexity Trade-Offs in Wireless Networks
【24h】

A Class of Cross-Layer Optimization Algorithms for Performance and Complexity Trade-Offs in Wireless Networks

机译:无线网络中性能和复杂度折衷的一类跨层优化算法

获取原文
获取原文并翻译 | 示例

摘要

In this paper, we solve the problem of a joint optimal design of congestion control and wireless MAC-layer scheduling using a column generation approach with imperfect scheduling. We point out that the general subgradient algorithm has difficulty in recovering the time-share variables and experiences slower convergence. We first propose a two-timescale algorithm that can recover the optimal time-share values. Most existing algorithms have a component, called global scheduling, which is usually NP-hard. We apply imperfect scheduling and prove that if the imperfect scheduling achieves an approximation ratio rho, then our algorithm produces a suboptimum of the overall problem with the same approximation ratio. By combining the idea of column generation and the two-timescale algorithm, we derive a family of algorithms that allows us to reduce the number of times the global scheduling is needed.
机译:在本文中,我们使用具有不完善调度的列生成方法解决了拥塞控制和无线MAC层调度的联合优化设计问题。我们指出,一般的次梯度算法难以恢复时分变量,并且收敛速度较慢。我们首先提出一种两时标算法,该算法可以恢复最佳时分值。现有的大多数算法都有一个称为全局调度的组件,该组件通常是NP难的。我们应用不完善的调度,并证明如果不完善的调度达到了近似比率rho,则我们的算法将以相同的近似比率产生整个问题的次优。通过结合列生成和两次时间尺度算法的思想,我们得出了一系列算法,这些算法使我们能够减少需要全局调度的次数。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号