• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>IEEE International Symposium on Information Theory >Collision scheduling for cellular networks
【24h】

Collision scheduling for cellular networks

机译：蜂窝网络的冲突调度

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Consider a cellular network composed of several base stations with overlapping coverage areas. Conventional scheduling algorithms ensure that each base station hears only a single user over each orthogonal sub-channel, i.e., collisions are avoided. Recent work on compute-and-forward has demonstrated that it is possible for a receiver to decode a linear combination of interfering codewords. We examine how the adoption of the compute-and-forward technique affects the scheduling problem for cellular networks. Specifically, instead of avoiding collisions, the base stations can schedule collisions to obtain a set of linear combinations that can be solved for the original messages. For the special case of two base stations, we propose a simple scheduling algorithm that finds the minimal number of sub-channels needed for each user to successfully communicate one packet. For the general case, we formulate an integer program that can be solved using dynamic programming with pseudo-polynomial complexity with respect to the number of users.
机译：考虑由覆盖范围重叠的几个基站组成的蜂窝网络。常规调度算法确保每个基站在每个正交子信道上仅听到单个用户，即避免冲突。关于计算和转发的最新工作表明，接收机可以解码干扰码字的线性组合。我们研究了计算转发技术的采用如何影响蜂窝网络的调度问题。具体而言，代替避免冲突，基站可以调度冲突以获得可以为原始消息解决的一组线性组合。对于两个基站的特殊情况，我们提出了一种简单的调度算法，该算法可以找到每个用户成功通信一个数据包所需的最小子信道数。对于一般情况，我们制定了一个整数程序，该程序可以使用具有针对用户数量的伪多项式复杂性的动态规划来求解。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号