欢迎访问中国科学院大学学报,今天是

中国科学院大学学报 ›› 2016, Vol. 33 ›› Issue (3): 427-432.DOI: 10.7523/j.issn.2095-6134.2016.03.021

• 信息与电子科学 • 上一篇    

H2H与M2M共存场景的准入控制及资源分配

王鑫, 邱玲   

  1. 中国科学技术大学中国科学院无线光电通信重点实验室, 合肥 230027
  • 收稿日期:2015-09-08 修回日期:2015-12-28 发布日期:2016-05-15
  • 通讯作者: 邱玲
  • 基金资助:

    863计划项目(2014AA01A707)资助

Admission control and resource allocation of H2H&M2M co-existence scenario

WANG Xin, QIU Ling   

  1. Key Laboratory of Wireless-Optical Communications of Chinese Academy of Sciences, University of Science and Technology of China, Hefei 230027, China
  • Received:2015-09-08 Revised:2015-12-28 Published:2016-05-15

摘要:

考虑到MTCD数量巨大的特性,针对OFDMA蜂窝网络中H2H与M2M共存场景系统过载的情况,提出一种准入控制及资源分配联合优化算法.针对共存场景系统过载的情况,考虑控制信道的影响,本文形成了最大化准入MTCD数目的MINLP问题.由于难以求得其最优解,通过凸松弛将其转化为标准的凸问题,由此得到原问题解的上界,并进一步提出一种低复杂度的求解算法.仿真结果表明所提算法与上界相比性能损失小,且明显优于两种对比算法.

关键词: 机器通信, 准入控制, 资源分配, 控制信道

Abstract:

This study focuses on the massive device characteristic of M2M communication. Considering the overload situation in H2H&M2M co-existence scenario of OFDMA cellular networks, we propose an admission control and resource allocation joint optimization algorithm. Considering the effect of control channel, we formulate a MINLP problem of maximizing the number of MTCDs admitted. Because of the complexity of MINLP problems, relaxed constraints are used to transform the MINLP problem into a convex problem, which is the upper-bound of the original problem. Furthermore, a low-complicity algorithm is proposed. Simulation results show that the algorithm has minor degradation compared with the upper-bound and is better than two other algorithms.

Key words: M2M, admission control, resource allocation, control channel

中图分类号: