Wireless Resource Virtualization With Device-to-Device Communication Underlaying LTE Network

Wireless Resource Virtualization With Device-to-Device Communication Underlaying LTE Network
复制标题

DOI:
10.1109/tbc.2015.2492458
复制
发表时间:
2015-11
影响因子:
4.5
通讯作者:
Abdallah Moubayed;A. Shami;H. Lutfiyya
Abdallah Moubayed;A. Shami;H. Lutfiyya
中科院分区:
计算机科学1区
文献类型:
--
作者:
Abdallah Moubayed;A. Shami;H. Lutfiyya

文献摘要

被引文献

相似文献

无线资源虚拟化是满足日益增长的移动数据服务需求的潜在解决方案。虚拟化可以更有效地利用频谱,减少资本支出和运营支出,并可以支持更高的峰值速率。作为蜂窝网络底层的设备到设备(D2D)通信也是满足数据需求的潜在解决方案。由于设备邻近,因此信号干扰比和噪声比更高,因此使用 D2D 通信可以实现更高的数据速率。这在多媒体共享的情况下非常有用,其中数据可以广播给附近的多个用户。然而,D2D 对对蜂窝用户引入的干扰应低于目标阈值,以免降低其性能。本文阐述了 LTE 网络下 D2D 通信的无线资源虚拟化问题。由于该问题是整数非线性规划问题,因此将其分为两个较小的线性整数规划并求解至最优。引入了两种复杂度较低的启发式算法,每种算法都解决一个子问题。结果表明,启发式方法实现了接近最优的结果,同时计算复杂度却低得多。
Wireless resource virtualization is a potential solution for meeting the increasing demand for mobile data services. Virtualization allows for more efficient utilization of the spectrum, reduces capital expenditures and operating expenditures, and can support higher peak rates. Device-to-device (D2D) communication as an underlay to cellular networks is also a potential solution to satisfy the data demand. Due to the proximity of devices and thus the higher signal-to-interference and noise ratio, higher data rates can be achieved using D2D communication. This is beneficial in cases of multimedia sharing where data can be broadcast to several nearby users. However, the interference that D2D pairs introduce to cellular users should be below a target threshold so as not to reduce their performance. In this paper, the problem of wireless resource virtualization with D2D communication underlaying the LTE network is formulated. Since the problem is an integer non-linear programming problem, it is divided into two smaller linear integer programs that are solved to optimality. Two lower complexity heuristic algorithms, each solving one of the subproblems are introduced. Results show that the heuristic achieves close to optimal results while having a much lower computational complexity.