首页> 外文会议>Annual European Symposium on Algorithms >On the Complexity of Sequential Rectangle Placement in IEEE 802.16/WiMAX Systems
【24h】

On the Complexity of Sequential Rectangle Placement in IEEE 802.16/WiMAX Systems

机译:关于IEEE 802.16 / WiMAX系统中顺序矩形放置的复杂性

获取原文

摘要

We study the problem of scheduling transmissions on the Downlink of IEEE 802.16/WiMAX systems that use the OFDMA technology. These transmissions are scheduled using a matrix whose dimensions are frequency and time, where every matrix cell is a time slot on some carrier channel. The IEEE 802.16 standard mandates that (i) every transmission occupies a rectangular set of cells, and (ii) transmissions must be scheduled according to a given order. We show that if the number of cells required by a transmission is not limited (up to the matrix size), the problem of maximizing matrix utilization is very hard to approximate. On the positive side we show that if the number of cells of every transmission is limited to some constant fraction of the matrix area, the problem can be approximated to within a constant factor. As far as we know this is the first paper that considers this sequential rectangle placement problem.
机译:我们研究了使用OFDMA技术的IEEE 802.16 / WiMAX系统下行链路上的调度传输问题。使用矩阵调度这些传输,其尺寸为频率和时间,其中每个矩阵单元是某些载波信道上的时隙。 IEEE 802.16标准要求(i)每个传输占用矩形小区集,并且必须根据给定顺序调度(ii)传输。我们表明,如果传输所需的单元数不限于(直到矩阵大小),则最大化矩阵利用率的问题非常难以近似。在正面,我们表明,如果每个传输的单元的数量限制在矩阵区域的某个恒定部分,则可以近似于恒定因子。据我们所知,这是一种考虑这个顺序矩形放置问题的论文。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号