@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 {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}
}
@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 {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 {BenChekroun2015320,
	title = {A distributed open-close access for Small-Cell networks: A random matrix game analysis},
	booktitle = {IWCMC 2015 - 11th International Wireless Communications and Mobile Computing Conference},
	year = {2015},
	note = {cited By 0},
	pages = {320-325},
	abstract = {Nowadays, Small-Cells are widely being deployed to assist and improve performance of mobile networks. Indeed, they are a promising solution to improve coverage and to offload data traffic in mobile networks. In this paper, we propose a signaling-less architecture of the heterogeneous network composed of one single Macro Base Station and a Single Small-Cell. First, we construct a game theoretic framework for channel-state independent interaction. We present many conditions for the existence of Pure Nash equilibrium. Next, and in order to capture the continuous change of the channel state, we build a random matrix game where the channel state is considered to be random (potentially ruled by some given distribution). A characterization of Nash equilibrium is provided in terms of pure strategies and mixed strategies. Convergence to Nash equilibrium is furthermore guaranteed using a variant of the well-known Combined fully distributed payoff and strategy learning. Our algorithm converges faster (only 10-20 iterations are required to converge to Nash equilibrium) and only need a limited amount of local information. This is quite promising since it says that our scheme is almost applicable for all environments (fast fading included). {\textcopyright} 2015 IEEE.},
	doi = {10.1109/IWCMC.2015.7289103},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84949516312\&doi=10.1109\%2fIWCMC.2015.7289103\&partnerID=40\&md5=09ea6932ff0311a5cea7e0dc62597821},
	author = {Ben Chekroun, S.a and Sabir, E.b and Kobbane, A.c and Tembine, H.d and Bouyakhf, E.-H.a and Ibrahimi, K.e}
}
@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 {Gmira2015,
	title = {A new optimal hybrid spectrum access in cognitive radio: Overlay-underlay mode},
	booktitle = {International Conference on Wireless Networks and Mobile Communications, WINCOM 2015},
	year = {2015},
	note = {cited By 2},
	abstract = {In this paper, we propose a hybrid cognitive radio (CR) system where underlay and overlay CR approaches are combined under SIRN constraints. This new access type allows to optimize the spectrum sensing time with throughput improvement. Our proposed access type is based on a merger of these two modes depending on the number of secondary users (SU) in the Underlay Mode and on the access probabilities for these two modes. The number of all users in the Underlay access mode should not exceed a certain number of users. When a new SU arrives and if the number of SUs in Underlay mode is already equal to the predifined max number, the SU decides to switch to the Overlay mode to access the canal using this method. The SU states will be modeled with a Markov chain, the aim of this work is attempting to show that this new method allows to increase the throughput of the SU with energy optimization. The exact outage probability of secondary system is also derived for this model. Simulation results show that the performance, especiallay the throughput can be significantly increased by the proposed hybrid system. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/WINCOM.2015.7381314},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84965043094\&doi=10.1109\%2fWINCOM.2015.7381314\&partnerID=40\&md5=5d077bbb24ef8194362f761a7665f204},
	author = {Gmira, S.a and Kobbane, A.a and Sabir, E.b}
}
@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 {Koulali2014845,
	title = {Ferry-based architecture for Participatory Sensing},
	booktitle = {IWCMC 2014 - 10th International Wireless Communications and Mobile Computing Conference},
	year = {2014},
	note = {cited By 0},
	pages = {845-849},
	abstract = {The concept of Participatory Sensing is centered on individuals that collect data using their smart phones (or other dedicated devices) to track the evolution of their work/living places. The main objective is to use the gathered data in order to enhance the offered quality of life. To maximize people involvement in this process we propose a ferry based architecture to leverage the contributors from charges associated with accessing service providers infrastructure to forward collected data. Opportunistic contact with message ferries will be exploited to gather data that will be carried from ferry-To-ferry till it reaches a centralized processing and decision-Taking authority. We provide a closed formula for the End-To-End throughput of the proposed gathering network architecture. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/IWCMC.2014.6906466},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84908610867\&doi=10.1109\%2fIWCMC.2014.6906466\&partnerID=40\&md5=20f82b554230199456e13e347b4ecbe0},
	author = {Koulali, S.a and Sabir, E.b and Kobbane, A.c and Azizi, 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 {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}
}
@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}
}
