@article { ISI:000384105900002,
	title = {Coalitional game-based behavior analysis for spectrum access in cognitive radios},
	journal = {WIRELESS COMMUNICATIONS \& MOBILE COMPUTING},
	volume = {16},
	number = {14},
	year = {2016},
	month = {OCT 10},
	pages = {1910-1921},
	abstract = {The core of cognitive radio paradigm is to introduce cognitive devices able to opportunistically access the licensed radio bands. The coexistence of licensed and unlicensed users prescribes an effective spectrum hole-detection and a non-interfering sharing of those frequencies. Collaborative resource allocation and spectrum information exchange are required but often costly in terms of energy and delay. In this paper, each secondary user (SU) can achieve spectrum sensing and data transmission through a coalitional game-based mechanism. SUs are called upon to report their sensing results to the elected coalition head, which properly decides on the channel state and the transmitter in each time slot according to a proposed algorithm. The goal of this paper is to provide a more holistic view on the spectrum and enhance the cognitive system performance through SUs behavior analysis. We formulate the problem as a coalitional game in partition form with non-transferable utility, and we investigate on the impact of both coalition formation and the combining reports costs. We discuss the Nash Equilibrium solution for our coalitional game and propose a distributed strategic learning algorithm to illustrate a concrete case of coalition formation and the SUs competitive and cooperative behaviors inter-coalitions and intra-coalitions. We show through simulations that cognitive network performances, the energy consumption and transmission delay, improve evidently with the proposed scheme. Copyright (c) 2016 John Wiley \& Sons, Ltd.},
	issn = {1530-8669},
	doi = {10.1002/wcm.2658},
	author = {Belghiti, Imane Daha and Elmachkour, Mouna and Berrada, Ismail and Kobbane, Abdellatif and Ben-Othman, Jalel}
}
@conference { ISI:000386851600006,
	title = {A College Admissions Game for Content Caching in Heterogeneous Delay Tolerant Networks},
	booktitle = {2016 23RD INTERNATIONAL CONFERENCE ON TELECOMMUNICATIONS (ICT)},
	year = {2016},
	note = {23rd International Conference on Telecommunications (ICT), Thessaloniki, GREECE, MAY 16-18, 2016},
	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.},
	isbn = {978-1-5090-1990-8},
	author = {Oualhaj, Omar Ait and Sabir, Essaid and Kobbane, Abdellatif and Ben-Othman, Jalel and El Koutbi, Mohammed}
}
@conference { ISI:000381477900169,
	title = {A Coalitional-Game-Based Incentive Mechanism for Content Caching in Heterogeneous Delay Tolerant Networks},
	booktitle = {2015 INTERNATIONAL WIRELESS COMMUNICATIONS \& MOBILE COMPUTING CONFERENCE (IWCMC)},
	series = {International Wireless Communications and Mobile Computing Conference},
	year = {2015},
	note = {11th IEEE International Wireless Communications and Mobile Computing Conference (IEEE IWCMC), Dubrovnik, CROATIA, AUG 24-25, 2015},
	pages = {987-992},
	publisher = {IEEE; IEEE Croatia Sect; Univ Dubrovnik},
	organization = {IEEE; IEEE Croatia Sect; Univ Dubrovnik},
	abstract = {In recent years, Delay Tolerant Networks (DTNs) have 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 work, we study the cooperative transmission for DTNs using coalitional game theory. We design a new incentive mechanism for heterogeneous system to induce coordination among DTN relays. In particular, we focus on the source packet dissemination to a destination using tow-hop relaying scheme, considering networks resource constraints: the relay buffer, the packet life time, and the energy consumption according to the mobile technologies. Rational mobiles are organized into separate coalition structures to meet a trade off between the source reward and the energy conservation. We discus the Nash equilibria for our game and the stable strategy state in which no mobile can get a higher payoff through changing unilaterally its coalition. Then, we use the distributed imitative Boltzmann-Gibbs learning algorithm enabling relays to learn the Nash equilibrium strategy; grand coalition. The improvement of the global system performance is examined, and a comparison between different inter-node collaboration states is presented.},
	isbn = {978-1-4799-5344-8},
	issn = {2376-6492},
	author = {Oualhaj, Omar Ait and Kobbane, Abdellatif and Elmachkour, Mouna and Sabir, Essaid and Ben-Othman, Jalel}
}
@conference { ISI:000312146500145,
	title = {Channel Allocation Strategies in Opportunistic-based Cognitive Networks},
	booktitle = {2012 8TH INTERNATIONAL WIRELESS COMMUNICATIONS AND MOBILE COMPUTING CONFERENCE (IWCMC)},
	series = {International Wireless Communications and Mobile Computing Conference},
	year = {2012},
	note = {8th IEEE International Wireless Communications and Mobile Computing Conference (IWCMC), Limassol, CYPRUS, AUG 27-31, 2012},
	pages = {872-877},
	publisher = {IEEE; IEEE Cyprus Sect; Frederick Univ},
	organization = {IEEE; IEEE Cyprus Sect; Frederick Univ},
	abstract = {The idea to allow unlicensed users to utilize licensed bands whenever it would not cause any interference is one of the fundaments of cognitive radio. In this paper we propose some allocation channel strategies to provide more QoS for unlicensed users. We assume that one channel is dedicated for unlicensed users that can eventually use licensed users channels if idle. The first allocation channel strategy reconsiders, in case of unavailable licensed users{\textquoteright}s channels, the request of unlicensed users to be processed by the dedicated channel. The second strategy doesn{\textquoteright}t reconsider it and simply reject it. QoS performances of the two patterns are evaluated and discussed using analytical models and simulations. For the first communication strategy, we based our model on the work of Habachi and Hayel which we enhance. We proceed to some corrections of mathematical and formulations errors. Analytical and simulation results show that the performances offered by the primary channels to secondary user are better than performances offered by the dedicated channel, however, the performance offered by the primary channels are negatively impacted by the cost of sensing.},
	isbn = {978-1-4577-1379-8},
	issn = {2376-6492},
	author = {Belkasmi, Yassin and Kobbane, Abdellatif and El Koutbi, Mohammed and Ben-Othman, Jalel}
}
