@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 {Oualhaj2015987,
	title = {A coalitional-game-based incentive mechanism for content caching in heterogeneous Delay Tolerant Networks},
	booktitle = {IWCMC 2015 - 11th International Wireless Communications and Mobile Computing Conference},
	year = {2015},
	note = {cited By 1},
	pages = {987-992},
	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. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/IWCMC.2015.7289217},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84949490492\&doi=10.1109\%2fIWCMC.2015.7289217\&partnerID=40\&md5=743073fbd086e6b2dc5623cb07de9531},
	author = {Oualhaj, O.A.a and Kobbane, A.a b and Elmachkour, M.a and Sabir, E.c and Ben-Othman, J.b}
}
