首页> 外文会议>Annual Allerton Conference on Communication, Control, and Computing vol.2 >On Best-Case Throughput of Cellular Data Networks with Cooperating Base Stations
【24h】

On Best-Case Throughput of Cellular Data Networks with Cooperating Base Stations

机译:与基站协作的蜂窝数据网络的最佳情况吞吐量

获取原文
获取外文期刊封面目录资料

摘要

In this paper, we consider a cellular radio system in which base stations cooperate over noise-free, infinite capacity wireline links. Attention is confined to the forward direction. A simple Poisson packet arrival process is assumed, and the ratio of traffic intended for each user is specified in advance. The channel between each base station and each mobile is randomly drawn but otherwise static. For this system, we combine physical level multi-user communication theory (in particular, Dirty Paper Coding) with a coupled queueing model to evaluate achievable delay and throughput. The service rates of the user queues are coupled by virtue of the system's multiuser capacity surface. An exact expression is found for the maximum achievable throughput for this system. A service discipline dependent on the emptyon-empty status of each queue is proposed and a fixed-point approximation is derived and applied to compute the average delay. Simulations confirm that the fixed-point approximation is an excellent approximation to the average delay.
机译:在本文中,我们考虑一个蜂窝无线系统,其中基站通过无噪声,无限容量的有线链路进行协作。注意仅限于前进方向。假设一个简单的泊松包到达过程,并且预先指定了针对每个用户的流量比例。每个基站和每个移动站之间的信道是随机绘制的,但否则是静态的。对于此系统,我们将物理级别的多用户通信理论(特别是脏纸编码)与耦合排队模型相结合,以评估可实现的延迟和吞吐量。用户队列的服务速率通过系统的多用户容量界面进行耦合。找到了该系统可实现的最大吞吐量的精确表达式。提出了一种依赖于每个队列的空/非空状态的服务规则,并推导了定点近似值并将其应用于计算平均延迟。仿真证实,定点近似值是平均延迟的极佳近似值。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号