【24h】

Maximum Independent Set of Links with Power Control

机译:具有电源控制功能的最大独立链路集

获取原文

摘要

This paper addresses the joint selection and power assignment of a largest number of given links which can communicate successfully at the same time under the physical interference model. For this optimization problem, we present a constant-approximation algorithm with improved performance over existing approximation algorithms. In addition, both the algorithm design and analysis are applicable to arbitrary path-loss exponent and arbitrary dimension of the deployment space.
机译:本文讨论了在物理干扰模型下可以同时成功通信的最大数量给定链路的联合选择和功率分配。针对此优化问题,我们提出了一种常数近似算法,该算法具有比现有近似算法更高的性能。另外,算法设计和分析均适用于任意路径损耗指数和部署空间的任意尺寸。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号