@article { ISI:000379694400006,
	title = {Group vertical handoff management in heterogeneous networks},
	journal = {WIRELESS COMMUNICATIONS \& MOBILE COMPUTING},
	volume = {16},
	number = {10},
	year = {2016},
	month = {JUL},
	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 (c) 2015 John Wiley \& Sons, Ltd.},
	issn = {1530-8669},
	doi = {10.1002/wcm.2599},
	author = {Walid, Abdellaziz and Kobbane, Abdellatif and Mabrouk, Abdelfettah and Sabir, Essaid and Taleb, Tarik and El Koutbi, Mohammed}
}
@conference { ISI:000382389300061,
	title = {A Signaling Game-based Mechanism to Meet Always Best Connected Service in VANETs},
	booktitle = {2015 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM)},
	series = {IEEE Global Communications Conference},
	year = {2015},
	note = {IEEE Global Communications Conference (GLOBECOM), San Diego, CA, DEC 06-10, 2015},
	publisher = {IEEE; QUALCOMM; Keysight Technologies; Huawei; Natl Instruments; Intel; InterDigital; LG Elect; IEEE Big Data; IEEE Stand Assoc; ViaSat; IEEE Commun Soc},
	organization = {IEEE; QUALCOMM; Keysight Technologies; Huawei; Natl Instruments; Intel; InterDigital; LG Elect; IEEE Big Data; IEEE Stand Assoc; ViaSat; IEEE Commun Soc},
	abstract = {In heterogeneous network environments, users need to have mechanisms in place to decide which network is the most suitable at each moment in time for every application that the user requires. Always Best Connected is considered as a special concept to allow users to get connected to Internet using the access technology that best suits their needs or profile at any point in time. Clearly, this concept provides multiple access simultaneously for mobile users moving in heterogeneous access network environment. In this paper, we introduce a signaling game approach to achieve an always best connected service in vehicular networks. Under the considered scenario, we consider two smart vehicles named player 1 and player 2 moving in a road network area equipped with heterogeneous access networks. We assume that player 1 (super player) only has complete information on the road network, whilst player 2 has not any information. Player 1 plays first and sends a signal to player 2 which can be accurate or distorted. Based on the received signal and his belief about that signal, player 2 chooses its own action: it computes its suitable path which provides it an always best connected service.},
	isbn = {978-1-4799-5952-5},
	issn = {2334-0983},
	author = {Mabrouk, Abdelfettah and Kobbane, Abdellatif and Sabir, Essaid and Ben-Othman, Jalel and El Koutbi, Mohammed}
}
@conference { ISI:000361140000114,
	title = {A Congestion Game-based Routing Algorithm for Communicating VANETs},
	booktitle = {2014 INTERNATIONAL WIRELESS COMMUNICATIONS AND MOBILE COMPUTING CONFERENCE (IWCMC)},
	series = {International Wireless Communications and Mobile Computing Conference},
	year = {2014},
	note = {10th International Wireless Communications \& Mobile Computing Conference (IWCMC), Nicosia, CYPRUS, AUG 04-08, 2014},
	pages = {672-677},
	publisher = {IEEE; IEEE Cyprus Sect; Frederick Univ},
	organization = {IEEE; IEEE Cyprus Sect; Frederick Univ},
	abstract = {Vehicular Ad Hoc Network (VANET) is considered as a special application of Mobile Ad Hoc Networks (MANETs) in road traffic, which can autonomously organize networks without infrastructure. VANETs enable vehicles on the road to communicate with each other and with road infrastructure using wireless capabilities. In the last few years, extensive research has been performed to extend Internet connectivity to VANETs. Indeed, several routing protocols have been proposed to determine routes between vehicles and gateways. In this paper, we propose a routing algorithm which is based on the Congestion Game to resolve the problem of network congestion in VANET and to provide the optimal Internet access paths. The simulation results show that the proposed routing algorithm has better feasibility and effectiveness for communicating VANETs.},
	isbn = {978-1-4799-0959-9},
	issn = {2376-6492},
	author = {Mabrouk, Abdelfettah and Senhadji, Mohamed and Kobbane, Abdellatif and Walid, Abdellaziz and Sabir, Essaid and Koutbi, Mohammed E. L.}
}
@conference { ISI:000380438500019,
	title = {Providing Always Best Connected Service in VANET with Complete and Partial Information},
	booktitle = {3RD INTERNATIONAL CONFERENCE ON ADVANCED COMPUTER SCIENCE APPLICATIONS AND TECHNOLOGIES ACSAT 2014},
	series = {International Conference on Advanced Computer Science Applications and Technologies},
	year = {2014},
	note = {3rd International Conference on Advanced Computer Science Applications and Technologies (ACSAT), Amman, JORDAN, DEC 29-30, 2014},
	pages = {108-112},
	publisher = {Design Sci Renaissance; Unitech; Philadelphia Univ; Patrons Peoamp; Ittihad Univ; Univ Siswa Bangsa Int},
	organization = {Design Sci Renaissance; Unitech; Philadelphia Univ; Patrons Peoamp; Ittihad Univ; Univ Siswa Bangsa Int},
	abstract = {Mobile communication has become the preferred choice of personal communication today. With the rapid proliferation of wireless network technologies, heterogeneous wireless network environments increase more and more. Such environments provide multiple access networks simultaneously for mobile users. Each mobile user wishes to get connected to Internet using the access technology that best suits his needs at any point in time. Always Best Connected is considered as a special concept for mobile users to select their suitable access networks. In this paper, we have presented two scenarios which are based on Always Best Connected concept to provide, for a smart vehicle moving in a road network installed with multiple access technologies, an always best connected service at any point in time. In the first scenario, we assume that the mobile user (vehicle) has complete information on the road network (all access technologies installed in the road network). Whilst the second scenario is the same as the first one except that the mobile user periodically receives a partial information on the road network (only the access technologies installed in the edges which are immediately accessible by mobile user). For both scenarios, we have proposed a graph model to characterize the observed mobility pattern. Also, two algorithms are proposed to find the optimal path that provides always best connected service for vehicles in both scenarios.},
	isbn = {978-1-4799-1845-4},
	issn = {2379-7738},
	doi = {10.1109/ACSAT.2014.26},
	author = {Mabrouk, Abdelfettah and Kobbane, Abdellatif and El Koutbi, Mohammed and Sabir, Essaid}
}
