...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Information Theory >Optimal Scheduling for Emptying a Wireless Network: Solution Characterization, Applications, Including Deadline Constraints
【24h】

Optimal Scheduling for Emptying a Wireless Network: Solution Characterization, Applications, Including Deadline Constraints

机译：清空无线网络的最佳计划：解决方案特性，应用，包括最后期限约束

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Link scheduling, i.e., which links should transmit together and for how long, has been and remains a cornerstone optimization problem in wireless networking. In minimum-time scheduling, the task is to minimize the amount of time before emptying the data demand residing at the source nodes. We derive a complete structural characterization of the solution that unifies and significantly extends the known results. First, we approach link scheduling with a general system model without restrictions on the shape of the achievable rate region. Then, we give and prove a solution characterization of optimality that is conceptually simple yet powerful. We demonstrate several applications of this characterization for analysis of optimality and problem tractability. Next, we consider a significant extension by including deadline constraints, under which optimal scheduling becomes much more complex. Yet, we show how our formulation yields a solution description for that problem as well.
机译：链路调度，即，哪些链路应该一起传输以及传输多长时间，已经并且仍然是无线网络中的基石优化问题。在最短时间调度中，任务是在清空驻留在源节点上的数据需求之前，最大程度地减少时间。我们得出解决方案的完整结构特征，以统一并显着扩展已知结果。首先，我们采用通用系统模型处理链路调度，而不受可实现速率区域形状的限制。然后，我们给出并证明最优性的解决方案表征，该表征在概念上简单但功能强大。我们演示了这种表征在最优性和问题易处理性分析中的几种应用。接下来，我们考虑通过包括截止期限约束来进行重大扩展，在这种情况下，最佳调度变得更加复杂。然而，我们展示了我们的配方如何也可以解决该问题。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号