Tyck till om SwePub Sök
här!
Sökning: id:"swepub:oai:DiVA.org:kau-69109" >
Joint User Associat...
Joint User Association and Backhaul Routing for Green 5G Mesh Millimeter Wave Backhaul Networks
-
- Agapi, Mesodiakaki (författare)
- Karlstads universitet,Institutionen för matematik och datavetenskap (from 2013)
-
- Zola, Enrica (författare)
- UPC BarcelonaTECH, Barcelona Spain
-
- Kassler, Andreas, 1968- (författare)
- Karlstads universitet,Centrum för HumanIT,Institutionen för matematik och datavetenskap (from 2013),DISCO
-
(creator_code:org_t)
- 2017-11-21
- 2017
- Engelska.
-
Ingår i: Proceedings Of The 20Th Acm International Conference On Modelling, Analysis And Simulation Of Wireless And Mobile Systems. - New York, NY, USA : Association for Computing Machinery (ACM). - 9781450351645 ; , s. 179-186
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- With the advance of fifth generation (5G) networks, network density needs to grow significantly in order to meet the required capacity demands. A massive deployment of small cells may lead to a high cost for providing. ber connectivity to each node. Consequently, many small cells are expected to be connected through wireless links to the umbrella eNodeB, leading to a mesh backhaul topology. This backhaul solution will most probably be composed of high capacity point-to-point links, typically operating in the millimeter wave (mmWave) frequency band due to its massive bandwidth availability. In this paper, we propose a mathematical model that jointly solves the user association and backhaul routing problem in the aforementioned context, aiming at the energy efficiency maximization of the network. Our study considers the energy consumption of both the access and backhaul links, while taking into account the capacity constraints of all the nodes as well as the fulfillment of the service-level agreements (SLAs). Due to the high complexity of the optimal solution, we also propose an energy efficient heuristic algorithm (Joint), which solves the discussed joint problem, while inducing low complexity in the system. We numerically evaluate the algorithm performance by comparing it not only with the optimal solution but also with reference approaches under different traffic load scenarios and backhaul parameters. Our results demonstrate that Joint outperforms the state-of-the-art, while being able to find good solutions, close to optimal, in short time.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Nyckelord
- Computer Science
- Datavetenskap
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)
Hitta via bibliotek
Till lärosätets databas