@article {Bennani20161,
	title = {Achieving QoS in Virtual MIMO systems: a satisfaction equilibrium analysis},
	journal = {Eurasip Journal on Wireless Communications and Networking},
	volume = {2016},
	number = {1},
	year = {2016},
	note = {cited By 0},
	pages = {1-13},
	abstract = {This paper presents a game theoretic framework to analyze a cellular-WLAN heterogeneous network from a virtual multiple-input multiple-output (VMIMO) perspective. Namely, we restrict to the uplink case and consider a non-cooperative game where each user seeks to meet some quality of service (QoS). Moreover, mobile users are allowed to re-inject, through their WLAN interfaces, a part of their throughput in the induced game. Thus, the interaction among users defines a distributed VMIMO with a possibly throughput exchange. This mechanism will help all users to meet their respective QoS expressed by the perceived average throughput. The average throughput is considered to be the utility function used in this framework. Now, each mobile user experiences a certain throughput composed of two parts: (1) the throughput received from cellular subsystem and (2) the throughput received from WLAN subsystem. Naturally, we use the concept of satisfaction equilibrium to predict the behavior of the network. Indeed, we provided a sufficient condition for the existence of such an equilibrium. Next, we prove the uniqueness of the equilibrium and compute it explicitly. Afterward, we propose a fully distributed algorithm inspired from the well-known Banach-Picard learning algorithm. Our scheme has many good features facilitating its implementation and usability. Indeed, it accurately converges to the equilibrium (if exists), it is very fast, and it requires no external information. Simulation results validate the algorithm and show its robustness and illustrate numerically the proposed learning scheme for quality-of-service management in such a heterogeneous network. {\textcopyright} 2016, Bennani et al.},
	doi = {10.1186/s13638-016-0612-6},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84966280664\&doi=10.1186\%2fs13638-016-0612-6\&partnerID=40\&md5=e67ac437a619c2d9ac7539dace4426e6},
	author = {Bennani, H.a and Sabir, E.b and Kobbane, A.a and Ben-Othman, J.c and El-koutbi, M.a}
}
@conference {Oualhaj2016,
	title = {A college admissions game for content caching in heterogeneous delay tolerant networks},
	booktitle = {2016 23rd International Conference on Telecommunications, ICT 2016},
	year = {2016},
	note = {cited By 0},
	abstract = {In recent years, Delay Tolerant Networks (DTNs) have been successfully presented as a possible extension of the Internet architecture in order to provide communication support to existing networks. However, these networks have a major issue which is the coordination among relays. In this paper, we propose a novel mechanism source-relay association approach for heterogeneous DTNs that exploits the information about the history and predictability of the relay nodes while also we focus on the source packet dissemination to a destination using tow-hop relaying scheme, considering network resource constraints: the relay buffer, the packet life time, and the energy consumption according to the mobile technologies. We formulate the problem as a college admissions game in which a number of colleges, i.e., data source seek to recruit a number of students, i.e., relays nodes. In this game, the data source and relays nodes rank one another based on preference functions that capture the data sources need to optimize their utilities which are functions of packet success rate and delay. We propose a novel distributed algorithm that leads to a stable matching among data sources and relays nodes. We show that the proposed approach can yields the better performance improvement of the traffic among the source and destination node. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/ICT.2016.7500348},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84979210767\&doi=10.1109\%2fICT.2016.7500348\&partnerID=40\&md5=641b2fc904d804463ca747bb6dedfe63},
	author = {Oualhaj, O.A.a and Sabir, E.b and Kobbane, A.a c and Ben-Othman, J.c and Koutbi, M.E.a}
}
@conference {Gmira2016,
	title = {A game theoretic approach for an hybrid overlay-underlay spectrum access mode},
	booktitle = {2016 IEEE International Conference on Communications, ICC 2016},
	year = {2016},
	note = {cited By 0},
	abstract = {Cognitive radio is emerging as a promising technique to improve the utilization of the radio frequency spectrum in wireless networks. In this paper, we propose a hybrid CR (cognitive radio) system where underlay and overlay CR approaches are combined under SINR (Signal to Interference plus Noise Ratio) constraints. This new access type allows to optimize the spectrum sensing time with throughput improvement. The goal of this paper is to provide a new access mode in order to enhance the cognitive system performance while reducing the power spent for detecting the presence of the primary user and the spectrum holes. We consider the problem of spectrum sharing among primary (or licensed) users (PUs) and secondary (or unlicensed) users (SUs). In this scheme, the spectrum allocation problem is modeled as a non cooperative game, with each CR user acting as a player. Nash equilibrium is considered as the solution of this game. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/ICC.2016.7511026},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84981337899\&doi=10.1109\%2fICC.2016.7511026\&partnerID=40\&md5=b33c0dff4da1e3292042d7b39a65c27e},
	author = {Gmira, S.a and Kobbane, A.a and Sabir, E.b and Ben-Othman, J.c}
}
@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 {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 {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 {Omar2014,
	title = {A ferry-assisted solution for forwarding function in Wireless Sensor Networks},
	booktitle = {Proceedings - International Symposium on Computers and Communications},
	volume = {Workshops},
	year = {2014},
	note = {cited By 0},
	abstract = {To ensure connectivity in highly sparse Wireless Sensor Networks (WSNs), we consider a Ferry-assisted Wireless Sensor Network(FWSN). In our FWSN, message ferries moving along concentric annulus collect the static sensors generated packets and propagate them throughout a ferry-to-ferry forwarding schema to the sink. In this paper we present a queueing model to study and analyze the FWSN behavior. We will adapt a queuing model with finite queues which will allow us to analyze the network behavior in tens of packet loss using an analytic model. The objective of this work is to provide a way to optimize the energy consumption for each individual sensor. In our approach we consider a sensor Ferry, which is a mobile sensor with the capacity to provide the control operation upon the other fixed sensors within to network. Therefor, these fixed sensors will have to perform less control operations which will reduce their individual energy consumption. By doing so, this will automatically impact positively on to the lifetime of the network. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/ISCC.2014.6912648},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84908132136\&doi=10.1109\%2fISCC.2014.6912648\&partnerID=40\&md5=5d5c3b3309f7b9a5ed0c66f13985600c},
	author = {Omar, A.O.a and Kobbane, A.a and Sabir, E.a b and Erradi, M.a and Ben-Othman, J.c}
}
@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 {Bennani201456,
	title = {A tax-inspired mechanism design to achieve QoS in VMIMO systems: Give to receive!},
	booktitle = {IWCMC 2014 - 10th International Wireless Communications and Mobile Computing Conference},
	year = {2014},
	note = {cited By 0},
	pages = {56-62},
	abstract = {In this paper, we model a Virtual MIMO system using a game-theoretic approach. We are interested in the uplink, considering a non-coopertive game, where each user try to satisfy a quality of service. The uplink of a direct-sequence code division multiple access (DS-CDMA) data network is considered and a non-cooperative game is proposed in which users are allowed to choose their uplink receivers as well as to satisfy their quality of service. The utility function used in this framework is defined so that the throughput used by the user is divided into two components: the throughput received from cellular Network, and throughput received from Virtual MIMO System. In addition, this framework is used to study a constrained Nash equilibrium for the proposed game, and the impact of the interaction among users. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/IWCMC.2014.6906332},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84908622993\&doi=10.1109\%2fIWCMC.2014.6906332\&partnerID=40\&md5=8f8afb3e0c78e9a74a2e145125d111ac},
	author = {Bennani, H.a and Sabir, E.b and Kobbane, A.a and Walid, A.a and Ben-Othman, J.c}
}
