@conference {Amine2020,
	title = {New Network Slicing Scheme for UE Association Solution in 5G Ultra Dense HetNets},
	booktitle = {IEEE International Conference on Communications},
	volume = {2020-June},
	year = {2020},
	note = {cited By 5},
	abstract = {Network slicing (NS) will have an essential role to enhance the isolation and the flexibility of the future generation of cellular networks (5G) with heterogeneous capabilities, notably in ultra-dense (UD) urban zones. Thus, it may be the principal component necessary to respond to 5G UD heterogeneous networks (UD-HetNets) technical requirements. The aim of this paper is to propose a new NS architecture to resolve user equipment (UE)-association problem in 5G UD-HetNets. Accordingly, we formulated the problem as a one-to-many matching game based on matching theory, while exploiting the isolation character of slicing to eliminate interferences between pico-cells and those among macro-cell and pico-cells. Next, we proposed the UE-slice association algorithm (U-S.AA) to find the stable matching among user equipments (UEs) and different network slices. Numerical simulation results validate our theoretical model, and prove the efficient of the proposed user-slice association solution to enhance the global network performance, respecting the UEs quality of service (QoS), as well as improving the energy efficiency (EE) of UEs. {\textcopyright} 2020 IEEE.},
	keywords = {5G mobile communication systems, Association algorithms, Cellular network, energy efficiency, Future generations, Heterogeneous networks, Matching theory, Network performance, Principal Components, Stable matching, Technical requirement, Theoretical modeling},
	doi = {10.1109/ICC40277.2020.9148844},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85089429385\&doi=10.1109\%2fICC40277.2020.9148844\&partnerID=40\&md5=1c1af15932312ae46b6294cfb76fd07d},
	author = {Amine, M. and Kobbane, A. and Ben-Othman, J.}
}
@article {Amine2020,
	title = {Two-sided matching framework for optimal user association in 5G multi-RAT UDNs},
	journal = {International Journal of Communication Systems},
	volume = {33},
	number = {8},
	year = {2020},
	note = {cited By 2},
	abstract = {Recently, academic and industrial research communities are paying more explicit attention to the 5G multiple radio access technology ultra-dense networks (5G multi-RAT UDNs) for boosting network capacity, especially in UD urban zones. To this aim, in this paper, we intend to tackle the user association problem in 5G multi-RAT UDNs. By considering the decoupled uplink/downlink access (DUDA), we divide our user association problem into two distinct subproblems representing, respectively, the uplink and the downlink channels. Next, we formulated each one as a nonlinear optimization problem with binary variables. Then, to solve them, we were restricted by the hard complexity, as well as the hard feasibility of centralized user association schemes. Thus, to resolve our user association problem in a reasonable time and distributed manner, we formulated each subproblem as a many-to-one matching game based on matching theory. Next, we provide two fully distributed association algorithms to compute the uplink and downlink stable matching among user equipments (UEs) and base stations (BSs). Simulation results corroborate our theoretical model and show the effectiveness and improvement of our achieved results in terms of the overall network performance, quality of service (QoS), and energy efficiency (EE) of UEs. {\textcopyright} 2020 John Wiley \& Sons, Ltd.},
	keywords = {5G mobile communication systems, 5G multi-RAT UDNs, Association algorithms, decoupled uplink/downlink access (DUDA), energy efficiency, Game theory, Industrial research, Matching game, Matching theory, Network performance, Nonlinear programming, Optimization, Quality of service, Rats, Stable matching},
	doi = {10.1002/dac.4346},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85078931379\&doi=10.1002\%2fdac.4346\&partnerID=40\&md5=159a3a40021d6b340c2873e4db73e2ac},
	author = {Amine, M. and Kobbane, A. and Ben-Othman, J. and Walid, A.}
}
