首页> 外文会议>IEEE Wireless Communications and Networking Conference >Cross-layer scheduling with secrecy demands in delay-aware OFDMA network
【24h】

Cross-layer scheduling with secrecy demands in delay-aware OFDMA network

机译:意识到延迟的OFDMA网络中具有保密要求的跨层调度

获取原文

摘要

An Orthogonal Frequency Division Multiple Access (OFDMA) downlink system with secure transmissions and delay constraints is investigated, in which a base station (BS) transmits both open data with delay limitations and private data with secrecy demands to each user. The time-varying channel is modeled as slow-fading and all channel state information (CSI) is assumed to be known to BS. An online cross-layer scheduling algorithm composed of flow control and resource allocation is proposed in this paper to maximize the downlink throughput with delay and power constraint. Furthermore, the algorithm makes decisions on current CSI instead of channel statistics. In addition, virtual queues of delay and power are constructed to track them so that those time-average constraints are fulfilled. In the end, it is proven by means of Lyapunov optimization technique that our algorithms will obtain a performance which can be extremely close to optimality and reduce operation complexity significantly.
机译:研究了具有安全传输和延迟约束的正交频分多址(OFDMA)下行链路系统,其中基站(BS)向每个用户发送具有延迟限制的开放数据和具有保密要求的私有数据。时变信道被建模为慢衰落,并且所有信道状态信息(CSI)被假定为BS已知。提出了一种由流量控制和资源分配组成的在线跨层调度算法,以最大化具有延迟和功率约束的下行链路吞吐量。此外,该算法根据当前CSI(而不是信道统计信息)做出决策。另外,构建了延迟和功率的虚拟队列以对其进行跟踪,从而满足了这些时间平均约束。最后,通过Lyapunov优化技术证明,我们的算法将获得非常接近最优的性能,并显着降低操作复杂性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号