@conference {ElFachtali2017824,
	title = {Power-optimized vertical handover scheme for 4th generation heterogeneous wireless network},
	booktitle = {Colloquium in Information Science and Technology, CIST},
	year = {2017},
	note = {cited By 0},
	pages = {824-829},
	abstract = {Minimizing the total power consumption required for vertical handovers in 4th generation heterogeneous wireless networks is as important as providing users with the best QoS(Quality of Service) continuously. This letter proposes a vertical handover scheme to minimize the total power consumption required for a vertical handover in 4th generation heterogeneous wireless networks, while guaranteeing a particular QoS. The proposed scheme is based on an updated Tabu-search scheme, which helps to efficiently explore the network in order to find an optimal solution and to provide a service performance that adheres to predefined service level agreements (SLA). Simulation results show that the proposed scheme can lead to lower total power consumption compared to the RSS (Received Signal Strength) based scheme. The proposed method can achieve promising results in terms of bandwidth, security and cost of service, while minimizing the power consumption. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/CIST.2016.7805001},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85010224341\&doi=10.1109\%2fCIST.2016.7805001\&partnerID=40\&md5=34fca482e3ee5b9533ec0539843e2bb7},
	author = {El Fachtali, I.a and Saadane, R.b and El Koutbi, M.a and Chaibi, H.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}
}
@article {Mabrouk20161,
	title = {Meeting Always-Best-Connected paradigm in heterogeneous vehicular networks: A graph theory and a signaling game analysis},
	journal = {Vehicular Communications},
	volume = {5},
	year = {2016},
	note = {cited By 0},
	pages = {1-8},
	abstract = {Due to the high mobility of vehicles and the dynamic topology changes of vehicular networks, it is difficult to satisfy drivers needs through a single wireless network. Consequently, by integrating different wireless access networks such as LTE and IEEE 802.11p, the vehicular network is expected to be a good platform called Heterogeneous Vehicular Network that can meet various vehicular user requirements. In such networks, vehicles need to have mechanisms in place to decide which access network is the most suitable for every application that the vehicular user requires. Always-Best-Connected is considered as a special concept to allow users getting connected to Internet using the access network that best suits their needs or profile at any point in time. Clearly, this concept provides multiple access networks simultaneous for mobile users moving in heterogeneous access network environment. In this paper, we propose two approaches called graph theory-based approach, and signaling game-based approach. The first approach is based on graph theory while the second one based on signaling game theory to compute the suitable path which provides Always-Best-Connected service for a smart vehicle moving in vehicular networks. {\textcopyright} 2016 Elsevier Inc.},
	doi = {10.1016/j.vehcom.2016.04.002},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84968902365\&doi=10.1016\%2fj.vehcom.2016.04.002\&partnerID=40\&md5=ba6b2fdee947b78c1a40f384b52a26b6},
	author = {Mabrouk, A.a and Kobbane, A.a and Sabir, E.b and Ben-Othman, J.c and El Koutbi, M.a}
}
@article {Mabrouk2015490,
	title = {Coalitional game theory for cooperative transmission in VANET: Internet access via fixed and mobile gateways},
	journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {9466},
	year = {2015},
	note = {cited By 0},
	pages = {490-495},
	abstract = {In Vehicular Ad-hoc Networks (VANETs), vehicles need to cooperate with each other or with a roadside infrastructure to transmit data. In this work, we study the cooperative transmission for VANETs using coalitional game theory. Each vehicle has a desire to access Internet via gateways that can be either fixed or mobiles. The gateways can enhance the vehicles{\textquoteright} transmissions by cooperatively relaying the vehicles{\textquoteright} data. Moreover, due to the mobility of the vehicles, we introduce the notion of encounter and predicted lifetime to indicate the availability of forwarding between the vehicle and gateway. We model the problem as a coalition formation game with non-transferable utility and we propose an algorithm for forming coalitions among the vehicles. To evaluate the proposed solution, we present and discuss the numerical results under two scenarios: fixed gateways scenario and mobile gateways scenario. The numerical results show that mobile gateways scenario is more effective than fixed gateways scenario in term of cooperative transmission. {\textcopyright} Springer International Publishing Switzerland 2015.},
	doi = {10.1007/978-3-319-26850-7_37},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84961155786\&doi=10.1007\%2f978-3-319-26850-7_37\&partnerID=40\&md5=1f9337ab54e8c5b7eedf4f0a81a41473},
	author = {Mabrouk, A.a and Kobbane, A.a and Sabir, E.b and El Koutbi, M.a}
}
@article {Elmachkour20151316,
	title = {Data traffic-based analysis of delay and energy consumption in cognitive radio networks with and without resource reservation},
	journal = {International Journal of Communication Systems},
	volume = {28},
	number = {7},
	year = {2015},
	note = {cited By 6},
	pages = {1316-1328},
	abstract = {A new opportunistic cross-layer MAC protocol involving channel allocation and packet scheduling for cognitive radio networks is proposed. Cognitive radio allows secondary users (SUs) to exploit the available portions of the licensed spectrum bands without interfering with primary users. In particular, we consider a cognitive radio system, where SUs are equipped with two transceivers: a control transceiver and a software-defined radio transceiver. Data traffic characteristics of SUs are considered to ameliorate system performance. So, we propose a mechanism of resource reservation to improve QoS requirements that favors successful SUs to transmit data during x time slots without interfering with primary users. The key novelty of this paper is giving priority for SUs with important data traffic and which frequently solicits data channels to transmit for the remaining time of the ongoing time slot and for the next time slots directly after checking the channel availability. We develop a new analytical model to evaluate delay parameter for two scenarios with and without resource reservation and we then investigate the impact of those scenarios on the energy consumption. We show through simulations that cognitive radio performances increase noticeably with the proposed scheme. Copyright {\textcopyright} 2014 John Wiley \& Sons, Ltd.},
	doi = {10.1002/dac.2764},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84925355761\&doi=10.1002\%2fdac.2764\&partnerID=40\&md5=ecf737b718373c4b7731373c0afd1200},
	author = {Elmachkour, M.a and Kobbane, A.a c and Sabir, E.b and Ben-Othman, J.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}
}
@conference {ElMezouary2015,
	title = {Modelling intelligent and reliable ferry routes in Wireless Sensor Networks using polling systems theory},
	booktitle = {2015 10th International Conference on Intelligent Systems: Theories and Applications, SITA 2015},
	year = {2015},
	note = {cited By 0},
	abstract = {This paper proposes a new model for finding intelligent and reliable ferry routes using a continuous polling system to ensure a better transportation of messages between wireless nodes and the corresponding sink. We consider that the Wireless Sensor Network (WSN) is composed by wireless static sensor nodes and several mobile ferries that collect information from all the sensors in the network. We have used a pure birth process to model the reliability aspect of the nodes in the network. We have considered several cases: with one ferry and N ferries moving in the same area. We have studied the impact of nodes density and the faulty rate occurrence to find the best and reliable path for the mobile ferry to cover all the nodes of the WSN. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/SITA.2015.7358398},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84962346090\&doi=10.1109\%2fSITA.2015.7358398\&partnerID=40\&md5=11e2db6bc8819a75b44989d3aa7dec48},
	author = {El Mezouary, R.a and Koulali, M.A.b and Kobbane, A.a and El Koutbi, M.a}
}
@conference {Mabrouk2015,
	title = {A signaling game-based mechanism to meet always best connected service in VANETs},
	booktitle = {2015 IEEE Global Communications Conference, GLOBECOM 2015},
	year = {2015},
	note = {cited By 0},
	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. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/GLOCOM.2014.7417000},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84964825756\&doi=10.1109\%2fGLOCOM.2014.7417000\&partnerID=40\&md5=0828f76d9a6461e859d500b7196f2452},
	author = {Mabrouk, A.a and Kobbane, A.a and Sabir, E.b and Ben-Othman, J.c and El Koutbi, M.a}
}
@conference {Mabrouk2014672,
	title = {A congestion game-based routing algorithm for communicating VANETs},
	booktitle = {IWCMC 2014 - 10th International Wireless Communications and Mobile Computing Conference},
	year = {2014},
	note = {cited By 2},
	pages = {672-677},
	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. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/IWCMC.2014.6906436},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84908611637\&doi=10.1109\%2fIWCMC.2014.6906436\&partnerID=40\&md5=c4ef74c689e207df64ad7a4808f8c773},
	author = {Mabrouk, A.a and Senhadji, M.a and Kobbane, A.a and Walid, A.a and Sabir, E.b and El Koutbi, M.a}
}
@conference {Walid20142817,
	title = {A decentralized network selection algorithm for group vertical handover in heterogeneous networks},
	booktitle = {IEEE Wireless Communications and Networking Conference, WCNC},
	year = {2014},
	note = {cited By 5},
	pages = {2817-2821},
	abstract = {The traditional vertical handover schemes postulate that vertical handover of each user comes on an individual basis. This enables the users to know previously the decision already made by other users, and then the choice will be made accordingly. However, in the case of a group vertical handover, almost all the VHO decisions - which will certainly choose the best network, will be made at the same time which will lead to system performance degradation or network congestion. In this paper, we propose a totally decentralized algorithm for network selection which based on the Congestion Game to resolve the problem of network congestion in GVHO. Therefore, the proposed algorithm named Fully Decentralized Nash Learning Algorithm with incomplete information is a prediction done by each mobile in the group that helps them to reach the Nash equilibrium. Simulation results validate the algorithm and show its robustness under two scenarios. In the first one, we examine the algorithm with a fixed number of mobiles in group to evaluate the mixed strategy and the average perceived throughput of mobiles in WIMAX and HSDPA on the basis of iteration. In the second one, we examine the algorithm with different number of mobiles in group for testing the average number of iterations needed to reach the Nash equilibrium. We also compare it with the traditional vertical handover algorithm. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/WCNC.2014.6952895},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84912123155\&doi=10.1109\%2fWCNC.2014.6952895\&partnerID=40\&md5=35a46d7aee23563018fc6f10fc8506ab},
	author = {Walid, A.a and El Kamili, M.b and Kobbane, A.a and Mabrouk, A.a and Sabir, E.c and El Koutbi, M.a}
}
@article {Mabrouk20141417,
	title = {Gateways{\textquoteright} mobility increases the capacity of communication in VANETs: Routing algorithm based on congestion game},
	journal = {International Review on Computers and Software},
	volume = {9},
	number = {8},
	year = {2014},
	note = {cited By 2},
	pages = {1417-1425},
	abstract = {Vehicular Ad Hoc Network (VANET) is considered as a special application of Mobile Ad Hoc Networks 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 provided several routing algorithms to extend Internet connectivity to VANETs through fixed gateways installed along the road. However, most of these algorithms have not been effective because of the high mobility of vehicles in the road. In this paper, we propose a routing algorithm which based both on the congestion game to resolve the problem of network congestion and on mobile gateways to resolve the problem of high mobility in VANET. Therefore, the proposed algorithm is a prediction done by each node in the network that helps them to reach the optimal route to access Internet. Simulation results validate the algorithm and show its robustness under two scenarios. In the first one, we examine the algorithm with fixed gateways installed along the road to validate the connectivity to the Internet. Whilst in the second scenario, we examine the algorithm with mobile gateways to show the effectiveness of gateways{\textquoteright} mobility on the capacity of communication and the Internet access in VANETs. {\textcopyright} 2014 Praise Worthy Prize S.r.l. - All rights reserved.},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84908347271\&partnerID=40\&md5=359209fd84ed425637bce48a01410d6b},
	author = {Mabrouk, A.a and Senhadji, M.b and Walid, A.a and Kobbane, A.b and El Koutbi, M.a}
}
@article {Elmachkour2014150,
	title = {The greening of spectrum sensing: A minority game-based mechanism design},
	journal = {IEEE Communications Magazine},
	volume = {52},
	number = {12},
	year = {2014},
	note = {cited By 5},
	pages = {150-156},
	abstract = {Cognitive radio technology allows the reuse of the underutilized frequency spectrum on an opportunistic and non-interfering basis by means of introducing, besides the legitimate primary users of the spectrum, a new kind of users called cognitive or secondary users. Thus, reliable spectrum sensing is critical to dynamically detect available licensed frequency bands and mitigate the primary signals, but it remains realistically difficult to carry out. In fact, although distributed collaborative sensing has turned out to be fruitful for the cognitive radio environment, its accuracy is often affected by the selfish and autonomous behavior of users. In this article, we model distributed spectrum sensing and channel allocation as a non-cooperative game, and apply the minority game to bring forth and study the cooperative behavior of users. The novelty brought by our study consists of alleviating the number of users contending for primary channels by giving them the opportunity to choose between the two, either sensing the channel or being inactive during the time slot. To address the trade-off faced by the SUs, we evaluate the performance of two secondary systems in a green communications context: energy consumption and transmission delay. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/MCOM.2014.6979967},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84919712749\&doi=10.1109\%2fMCOM.2014.6979967\&partnerID=40\&md5=72e3daa3f2e577d4633668e3bd67f25a},
	author = {Elmachkour, M.a and Sabir, E.b and Kobbane, A.a and Ben-Othman, J.c and El Koutbi, M.a}
}
@conference {Bennani201477,
	title = {Virtual MIMO systems: A game theoretical approach},
	booktitle = {WCCCS 2014 - Proceedings; 2014 5th Workshop on Codes, Cryptography and Communication Systems},
	year = {2014},
	note = {cited By 0},
	pages = {77-80},
	abstract = {In this work, we present a new game theoretic approach in order to build a Virtual MIMO system. The utility function used in this framework is defined so that the user throughput is divided into two components: the real, received by the base station, and the virtual throughput received by the neighboring users. A non-cooperative game is proposed where each user are allowed to choose its uplink receiver as well as to maximize its utility function. Simulation results validate our model and and illustrate numerically the proposed scheme under different scenarios. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/WCCCS.2014.7107924},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84983134494\&doi=10.1109\%2fWCCCS.2014.7107924\&partnerID=40\&md5=7908ed0bd120abe099e5dea1bce6962f},
	author = {Bennani, H.a and Sabir, E.b and Kobbane, A.a and El Koutbi, M.a}
}
@article {Choukri2013,
	title = {Efficient heuristic based on clustering approach for OLSR},
	journal = {Journal of Computer Networks and Communications},
	volume = {2013},
	year = {2013},
	note = {cited By 2},
	abstract = {Due to the dynamic nature of mobile ad hoc network (MANET), the quality of service (QoS) requires several improvements. The present papercomeswithin the framework of research to optimize QoS in MANET. In this paper, we propose a novel version of OLSR based on the clustering approach which is inspired from Lin and Chu heuristic and adapted to beimplemented inOLSR. We studied its stability and we compared its performances to those of standard OLSR. The metrics we used in evaluating network performances were average end-to-end delay, control routing overhead, and packet delivery ratio. Experimental results show that our alternative significantly reduces the traffic reserved to monitoring the network, which positively influences other performances such as throughput, delay, and loss. {\textcopyright} 2013 Ali Choukri et al.},
	doi = {10.1155/2013/597461},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84877308430\&doi=10.1155\%2f2013\%2f597461\&partnerID=40\&md5=3aa67a9fc125b4b786e82c243f57c7bc},
	author = {Choukri, A.a and Habbani, A.a b and El Koutbi, M.a}
}
