Online Distributed User Association for Heterogeneous Radio Access Network
Autor: | Lokesh Sharma, Shih-Lin Wu, B. Bikram Kumar |
---|---|
Rok vydání: | 2019 |
Předmět: |
Dynamic network analysis
Computer science load balancing distributed scheme Visible light communication 02 engineering and technology lcsh:Chemical technology Biochemistry Article Analytical Chemistry law.invention Base station 0203 mechanical engineering law HetNet 0202 electrical engineering electronic engineering information engineering lcsh:TP1-1185 Wi-Fi Electrical and Electronic Engineering Instrumentation Radio access network business.industry online user association 020206 networking & telecommunications 020302 automobile design & engineering Load balancing (computing) Atomic and Molecular Physics and Optics User equipment business Heterogeneous network Computer network Communication channel |
Zdroj: | Sensors, Vol 19, Iss 6, p 1412 (2019) Sensors Volume 19 Issue 6 Sensors (Basel, Switzerland) |
ISSN: | 1424-8220 |
Popis: | Future-generation radio access networks (RAN) are projected to fulfill the diverse requirements of user equipment (UE) by adopting a heterogeneous network (HetNet) environment. Necessary integration of different radio access technologies (RAT), such as 2G, 3G, 4G, wireless local area network (WLAN), and visible light communication (VLC) is inevitable. Moreover, UEs equipped with diverse requirements will be capable of accessing some or all the RATs. The complex HetNet environment with diverse requirements of UEs will present many challenges. The HetNet is likely to suffer severely from load imbalance among the base stations (BSs) from inheriting the traditional user association scheme such as max-SINR (signal-to-interference-plus-noise ratio)/max-RSSI (received signal strength indicator), unless some sophisticated schemes are invented. In this paper, a novel scheme is devised for a joint-user association for load balancing, where BSs are densely deployed and UEs typically have a certain degree of mobility. Unlike most of the present works, a dynamic network is considered where the position and channel condition of the UEs are not fixed. We develop two complex and distributed association schemes based on probability and d-choices, while carefully considering both loads of the BSs and SINR experienced by the UEs. Numerical results validate the efficiency of the proposed schemes by showing a received data-rate fairness among UEs and an improvement in the UE&rsquo s minimum received data rate. |
Databáze: | OpenAIRE |
Externí odkaz: | |
Nepřihlášeným uživatelům se plný text nezobrazuje | K zobrazení výsledku je třeba se přihlásit. |