Efficient and practical resource block allocation for LTE-based D2D network via graph coloring |
| |
Authors: | Mahdi Hajiaghayi Carl Wijting Cassio Ribeiro Mohammad T. Hajiaghayi |
| |
Affiliation: | 1. Department of Electrical and Computer Engineering, University of Toronto, Toronto, Canada 2. Radio Systems Lab, Nokia Research Center, Helsinki, Finland 3. Department of Computer Science, University of Maryland, College Park, USA
|
| |
Abstract: | In this paper, we construct a practical framework for efficiently allocating long term evolution (LTE) resource blocks (RB) among the users in a device-to-device (D2D) network. For such network that presumably operates under the LTE cellular network, our aim is to improve the overall throughput of D2D connections using opportunistic or fairness-based approach. Taking the practical considerations into account, our proposed framework allows a number of connections to share a single RB whenever possible, thus utilizing the radio resources. To do so, our solution first identifies a superior set of the interference-free D2D reuse groups via graph modeling and graph coloring approach. In particular, we model a D2D network with a two-overlapping disk graph for which a suitable coloring algorithm is proposed and its performance bound is calculated. Once the reuse groups are known, our solution optimizes the RB allocation among these groups based on their reported channel condition as well as the scheduling criterion, whether it is fairness-based or opportunistic. Through numerical experiments, we show that our solution can significantly improve the throughput performance of a D2D network. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|