Computer Science > Networking and Internet Architecture
[Submitted on 18 Sep 2018]
Title:Joint User Association and Resource Allocation Optimization for Ultra Reliable Low Latency HetNets
View PDFAbstract:Ensuring ultra-reliable and low latency communications (URLLC) is necessary for enabling delay critical applications in 5G HetNets. We propose a joint user to BS association and resource optimization method that is attractive for URLLC in HetNets with Cellular Base Stations (CBSs) and Small Cell Base Stations (SBSs), while also reducing energy and bandwidth consumption. In our scheme, CBSs share portions of the available spectrum with SBSs, and they in exchange, provide data service to the users in their coverage area. We first show that the CBSs optimal resource allocation (ORA) problem is NP-hard and computationally intractable for large number of users. Then, to reduce its time complexity, we propose a relaxed heuristic method (RHM) which breaks down the original ORA problem into a heuristic user association (HUA) algorithm and a convex resource allocation (CRA) optimization problem. Simulation results show that the proposed heuristic method decreases the time complexity of finding the optimal solution for CBS's significantly, thereby benefiting URLLC. It also helps the CBSs to save energy by offloading users to SBSs. In our simulations, the spectrum access delay for cellular users is reduced by 93\% and the energy consumption is reduced by 33\%, while maintaining the full service rate.
Submission history
From: Mohammad Yousefvand [view email][v1] Tue, 18 Sep 2018 06:35:29 UTC (2,627 KB)
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.