首页> 外文会议>2017 IEEE 28th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications >Optimal uplink and downlink resource allocation for wireless powered cellular networks
【24h】

Optimal uplink and downlink resource allocation for wireless powered cellular networks

机译:无线蜂窝网络的最佳上下行资源分配

获取原文
获取原文并翻译 | 示例

摘要

In this paper, we characterize optimal resource allocation for the uplink and downlink of wireless powered cellular networks (WPCNs). In particular, we investigate a time-slotted WPCN, where a hybrid access point (HAP) is in charge of energy replenishing of M cellular users (CUs), along with transmission/reception of information to/from them. Unlike prior works, which give attention to information transmission in only one direction (either uplink or downlink), our work incorporates information transmission in both directions, along with energy transfer over the downlink. Besides harvesting energy explicitly from the HAP, each user opportunistically harvests the RF energy borne by the information sent by the HAP over the downlink to the remaining M-1 users, in order to boost its uplink throughput. Towards this objective, we formulate the total (uplink and downlink) sum throughput maximization problem to characterize the optimal time allocation for energy, downlink information, and uplink information slots, subject to time allocation constraints. Furthermore, we establish the convexity of the problem, and an efficient algorithm based on the gradient projection method is proposed. The obtained numerical results reveal valuable insights about the fairness-throughput trade-offs. Moreover, and among others, the network dynamics are introduced, which clarify how the optimal time allocation pattern is changed in accordance with the change of the users' placement, and the HAP's transmission power, in both energy and information slots.
机译:在本文中,我们描述了无线蜂窝网络(WPCN)的上行链路和下行链路的最佳资源分配。特别是,我们调查了一个时隙WPCN,其中混合接入点(HAP)负责M个蜂窝用户(CU)的能量补充,以及往/从他们的信息传输/接收。与先前的工作只关注一个方向(上行链路或下行链路)的信息传输不同,我们的工作结合了两个方向的信息传输以及下行链路的能量传输。除了明确地从HAP收集能量之外,每个用户还机会性地收集由HAP在下行链路上发送给其余M-1用户的信息所承载的RF能量,以提高其上行链路吞吐量。为了实现这一目标,我们制定了总的(上行链路和下行链路)总吞吐量最大化问题,以表征受时间分配约束的能量,下行链路信息和上行链路信息时隙的最佳时间分配。此外,我们建立了问题的凸性,并提出了一种基于梯度投影方法的高效算法。获得的数值结果揭示了有关公平吞吐量权衡的有价值的见解。而且,除其他外,引入了网络动力学,其阐明了如何根据能量和信息时隙中用户位置和HAP传输功率的变化来改变最佳时间分配模式。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号