scispace - formally typeset
Search or ask a question
Author

Lusheng Wang

Bio: Lusheng Wang is an academic researcher from Institut Eurécom. The author has contributed to research in topics: Wireless network & Heterogeneous network. The author has an hindex of 1, co-authored 1 publications receiving 290 citations.

Papers
More filters
Journal ArticleDOI
TL;DR: This paper systematically studies the most important mathematical theories used for modeling the network selection problem in the literature and compares the schemes of various mathematical theories and discusses the ways to benefit from combining multiple of them together.
Abstract: In heterogeneous wireless networks, an important task for mobile terminals is to select the best network for various communications at any time anywhere, usually called network selection. In recent years, this topic has been widely studied by using various mathematical theories. The employed theory decides the objective of optimization, complexity and performance, so it is a must to understand the potential mathematical theories and choose the appropriate one for obtaining the best result. Therefore, this paper systematically studies the most important mathematical theories used for modeling the network selection problem in the literature. With a carefully designed unified scenario, we compare the schemes of various mathematical theories and discuss the ways to benefit from combining multiple of them together. Furthermore, an integrated scheme using multiple attribute decision making as the core of the selection procedure is proposed.

314 citations


Cited by
More filters
Journal ArticleDOI
TL;DR: It is shown that the optimum fraction of traffic offloaded to maximize SINR coverage is not in general the same as the one that maximizes rate coverage, defined as the fraction of users achieving a given rate.
Abstract: Pushing data traffic from cellular to WiFi is an example of inter radio access technology (RAT) offloading. While this clearly alleviates congestion on the over-loaded cellular network, the ultimate potential of such offloading and its effect on overall system performance is not well understood. To address this, we develop a general and tractable model that consists of M different RATs, each deploying up to K different tiers of access points (APs), where each tier differs in transmit power, path loss exponent, deployment density and bandwidth. Each class of APs is modeled as an independent Poisson point process (PPP), with mobile user locations modeled as another independent PPP, all channels further consisting of i.i.d. Rayleigh fading. The distribution of rate over the entire network is then derived for a weighted association strategy, where such weights can be tuned to optimize a particular objective. We show that the optimum fraction of traffic offloaded to maximize SINR coverage is not in general the same as the one that maximizes rate coverage, defined as the fraction of users achieving a given rate.

799 citations

Journal ArticleDOI
TL;DR: A taxonomy is introduced as a framework for systematically studying the existing user association algorithms conceived for HetNets, massive MIMO, mmWave, and energy harvesting networks and provides design guidelines and potential solutions for sophisticated user association mechanisms.
Abstract: The fifth generation (5G) mobile networks are envisioned to support the deluge of data traffic with reduced energy consumption and improved quality of service (QoS) provision. To this end, key enabling technologies, such as heterogeneous networks (HetNets), massive multiple-input multiple-output (MIMO), and millimeter wave (mmWave) techniques, have been identified to bring 5G to fruition. Regardless of the technology adopted, a user association mechanism is needed to determine whether a user is associated with a particular base station (BS) before data transmission commences. User association plays a pivotal role in enhancing the load balancing, the spectrum efficiency, and the energy efficiency of networks. The emerging 5G networks introduce numerous challenges and opportunities for the design of sophisticated user association mechanisms. Hence, substantial research efforts are dedicated to the issues of user association in HetNets, massive MIMO networks, mmWave networks, and energy harvesting networks. We introduce a taxonomy as a framework for systematically studying the existing user association algorithms. Based on the proposed taxonomy, we then proceed to present an extensive overview of the state-of-the-art in user association algorithms conceived for HetNets, massive MIMO, mmWave, and energy harvesting networks. Finally, we summarize the challenges as well as opportunities of user association in 5G and provide design guidelines and potential solutions for sophisticated user association mechanisms.

499 citations

Proceedings ArticleDOI
14 Apr 2013
TL;DR: The dynamics of network selection in heterogeneous wireless networks (HetNets) is studied, and it is shown that RAT selection games converge to Nash equilibria in a small number of steps, and hence are amenable to practical implementation.
Abstract: We study the dynamics of network selection in heterogeneous wireless networks (HetNets). Users in such networks selfishly select the best radio access technology (RAT) with the objective of maximizing their own throughputs. We propose two general classes of throughput models that capture the basic properties of random access (e.g., Wi-Fi) and scheduled access (e.g., WiMAX, LTE, 3G) networks. Next, we formulate the problem as a non-cooperative game, and study its convergence, efficiency, and practicality. Our results reveal that: (i) Singleclass RAT selection games converge to Nash equilibria, while an improvement path can be repeated infinitely with a mixture of classes. We next introduce a hysteresis mechanism in RAT selection games, and prove that with appropriate hysteresis policies, convergence can still be guaranteed; (ii) We analyze the Pareto-efficiency of the Nash equilibria of these games. We derive the conditions under which Nash equilibria are Paretooptimal, and we quantify the distance of Nash equilibria with respect to the set of Pareto-dominant points when the conditions are not satisfied; (iii) Finally, with extensive measurement-driven simulations we show that RAT selection games converge to Nash equilibria in a small number of steps, and hence are amenable to practical implementation. We also investigate the impact of noisy throughput measurements, and propose solutions to handle them.

215 citations

Journal ArticleDOI
TL;DR: This paper jointly considers multiple decision factors to facilitate vehicle-to-infrastructure networking, where the energy efficiency of the networks is adopted as an important factor in the network selection process.
Abstract: The emerging technologies for connected vehicles have become hot topics. In addition, connected vehicle applications are generally found in heterogeneous wireless networks. In such a context, user terminals face the challenge of access network selection. The method of selecting the appropriate access network is quite important for connected vehicle applications. This paper jointly considers multiple decision factors to facilitate vehicle-to-infrastructure networking, where the energy efficiency of the networks is adopted as an important factor in the network selection process. To effectively characterize users’ preference and network performance, we exploit energy efficiency, signal intensity, network cost, delay, and bandwidth to establish utility functions. Then, these utility functions and multi-criteria utility theory are used to construct an energy-efficient network selection approach. We propose design strategies to establish a joint multi-criteria utility function for network selection. Then, we model network selection in connected vehicle applications as a multi-constraint optimization problem. Finally, a multi-criteria access selection algorithm is presented to solve the built model. Simulation results show that the proposed access network selection approach is feasible and effective.

198 citations