.png){kind=icon}
.png){kind=icon}
Return
Resource Allocation in Moving Small Cell Network
.png){kind=icon}
PRE
AI
DOI：10.1109/TWC.2016.2542246.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Mobile users in public vehicles ( train, buses, etc.) suffer from low signal quality due to the enclosed nature of the vehicles. Small cells may be used to provide good signal quality in enclosed regions. Therefore, deployment of small cells in public vehicles can be a promising solution to the quality-of-service issue. However, deploying such moving small cells makes the resource allocation in the network a challenging problem, due to the time-varying interference experienced and created by them. In this paper, we solve the joint resource allocation ( resource blocks and power) problem in a cellular network with moving small cells, with the objective of enhancing the quality-of-service in the network. To capture the effect of mobility on the conflict relationship of the users in the moving small cell network, we propose representing the interference relationship as a time interval dependent interference ( TIDI) graph. We formulated a joint resource allocation problem, which is decomposed into the subproblems of resource block ( RB) allocation for a fixed power allocation and transmission power allocation for a fixed RB allocation to make the problem tractable. We propose an iterative resource allocation algorithm ( IRAA) to solve the joint resource allocation problem.
Keywords:
Moving small cells
resource allocation
vehicular users
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.7
Papers:
1.3W
Citations:
5.3W