@conference {Walid2016,
	title = {Exploiting multi-homing in hyper dense LTE small-cells deployments},
	booktitle = {IEEE Wireless Communications and Networking Conference, WCNC},
	volume = {2016-September},
	year = {2016},
	note = {cited By 0},
	abstract = {It is expected that in two-Tier LTE heterogeneous networks, an extensive deployment of small cell networks (SCNs) will take place in the near future, especially in dense urban zones; hence a hyper density of SCNs randomly distributed within macro cell networks (MCNs) will emerge with many overlapping zones of neighboring SCNs. Therefore, the problems of interferences in co-channel deployment will be more complicated and then the overall throughput of downlink will substantially decrease. In order to mitigate the effect of interferences in a hyper density of SCNs scenarios, a solution based on a fully distributed algorithm for sharing time access to SCNs and multi-homing capabilities of macro cellular users is proposed to improve the overall data rate of downlink and at the same time to satisfy QoS throughput requirements of macro and home cellular users. Our tentative scheme will also reduce the signaling overhead due to the absence of coordination among small base stations (SBSs) and macro base station (MBS). Results validate our solution and show the improvement attained in a hyper density of SCNs within MCNs compared to open, closed and shared time access mechanisms based on single network selection. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/WCNC.2016.7565055},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84989854253\&doi=10.1109\%2fWCNC.2016.7565055\&partnerID=40\&md5=36cda03e307b208f10f73e923e3e5b77},
	author = {Walid, A.a and Sabir, E.b and Kobbane, A.a and Taleb, T.c and Koutbi, M.E.a}
}
@article {Walid20161256,
	title = {Group vertical handoff management in heterogeneous networks},
	journal = {Wireless Communications and Mobile Computing},
	volume = {16},
	number = {10},
	year = {2016},
	note = {cited By 0},
	pages = {1256-1270},
	abstract = {Traditional vertical handover schemes postulate that vertical handovers (VHOs) of users come on an individual basis. This enables users to know previously the decision already made by other users, and then the choice will be accordingly made. However, in case of group mobility, almost all VHO decisions of all users, in a given group (e.g., passengers on board a bus or a train equipped with smart phones or laptops), will be made at the same time. This concept is called group vertical handover (GVHO). When all VHO decisions of a large number of users are made at the same time, the system performance may degrade and network congestion may occur. In this paper, we propose two fully decentralized algorithms for network access selection, and that is based on the concept of congestion game to resolve the problem of network congestion in group mobility scenarios. Two learning algorithms, dubbed Sastry Algorithm and Q-Learning Algorithm, are envisioned. Each one of these algorithms helps mobile users in a group to reach the nash equilibrium in a stochastic environment. The nash equilibrium represents a fair and efficient solution according to which each mobile user is connected to a single network and has no intention to change his decision to improve his throughput. This shall help resolve the problem of network congestion caused by GVHO. Simulation results validate the proposed algorithms and show their efficiency in achieving convergence, even at a slower pace. To achieve fast convergence, we also propose a heuristic method inspired from simulated annealing and incorporated in a hybrid learning algorithm to speed up convergence time and maintain efficient solutions. The simulation results also show the adaptability of our hybrid algorithm with decreasing step size-simulated annealing (DSS-SA) for high mobility group scenario. Copyright {\textcopyright} 2015 John Wiley \& Sons, Ltd. Copyright {\textcopyright} 2015 John Wiley \& Sons, Ltd.},
	doi = {10.1002/wcm.2599},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84930151466\&doi=10.1002\%2fwcm.2599\&partnerID=40\&md5=a91b7ce3e8af4694e732a00f04f01d95},
	author = {Walid, A.a and Kobbane, A.a and Mabrouk, A.a and Sabir, E.b and Taleb, T.c and El Koutbi, M.a}
}
@conference {Walid20151168,
	title = {On improving network capacity for downlink and uplink of two-tier LTE-FDD networks},
	booktitle = {IWCMC 2015 - 11th International Wireless Communications and Mobile Computing Conference},
	year = {2015},
	note = {cited By 0},
	pages = {1168-1173},
	abstract = {A Long Term Evolution-Frequency Division Duplexing (LTE-FDD) small cell is one of the promising solutions for improving service quality and data rate in both the uplink and downlink of home users. Small cell (e.g., femtocell, picocell, microcell) is short range, low cost and low power base station installed by the indoor consumers. However, the avoidance of interferences is still an issue that needs to be addressed for successful deployment of small base stations (SBS) within existing macro cell networks mainly in co-channel deployment. Moreover, interferences are strongly dependent on the type of access control of small cells. Closed and open access are in conflict interests for macro users and home users in the uplink and downlink. To mitigate this conflict, we propose a fully distributed algorithm based on the shared time access and executed by LTE-FDD small cells, in order to reduce the effect of interferences, improve QoS of users, and maximize the overall capacity of downlink and uplink in two-tier LTE networks when small cells are deployed randomly. Simulation results validate our algorithm and show the improvement attained in offloading macro cell and satisfying QoS requirements of home users compared to the closed and open access mechanisms in both the uplink and downlink. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/IWCMC.2015.7289248},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84949503704\&doi=10.1109\%2fIWCMC.2015.7289248\&partnerID=40\&md5=3c58a33b86b3de8e31215575eda6ba0a},
	author = {Walid, A.a and Sabir, E.b and Kobbane, A.a and Taleb, T.c and El Koutbi, M.a}
}
