@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}
}
@conference {Koutbi2015,
	title = {Welcome message from the general chairs},
	booktitle = {International Conference on Wireless Networks and Mobile Communications, WINCOM 2015},
	year = {2015},
	note = {cited By 0},
	doi = {10.1109/WINCOM.2015.7381347},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84965066083\&doi=10.1109\%2fWINCOM.2015.7381347\&partnerID=40\&md5=3b663be9ac57f7c5675e1e314ab6fa14},
	author = {Koutbi, M.E.a and Ben-Othman, J.b and Kobbane, A.c}
}
@conference {Raiss-El-Fenni20141742,
	title = {POMDP game framework for service providers inciting mobile users},
	booktitle = {2014 IEEE International Conference on Communications, ICC 2014},
	year = {2014},
	note = {cited By 1},
	pages = {1742-1747},
	abstract = {The trend today is to access Internet through mobile devices, and people start using smartphones more than computers. This kind of services requires frequent updates through small messages from editors like in social networks. Although the use of such applications is subject to fees and consumes energy from limited batteries of smartphones. If a user activates his mobile device and has a useful contact opportunity with an access point, an update is received at the expense of monetary and energy costs. Thus, users face a tradeoff between such costs and their utilities. The goal of this paper is to show how a user can cope with such a tradeoff, by deriving a threshold policies. We consider the multi-user case, where each user try to maximize its reward based on a bonus given by the provider. We study the optimal policy in the Nash equilibrium. An optimal policy consists of deciding, based on the age of the last message received and the availability of access points whether to activate the mobile device or not. We model our problem using a POMDP with an average reward criterion. The accuracy of our model is illustrated through simulations. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/ICC.2014.6883574},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84906996789\&doi=10.1109\%2fICC.2014.6883574\&partnerID=40\&md5=d80a5db4123fdf313b32fe7931b128c4},
	author = {Raiss-El-Fenni, M.a and El-Kamili, M.a and Ben-Othman, J.b and Kobbane, A.c}
}
@conference {Kobbane20132949,
	title = {Packet dropping for real-time applications in wireless networks},
	booktitle = {IEEE International Conference on Communications},
	year = {2013},
	note = {cited By 2},
	pages = {2949-2953},
	abstract = {In this paper, we consider a multimedia data transmission system over a wireless channel, where packets are queued at the transmitter. Multimedia data transmission over wireless networks often suffers from delay, jitter and packet loss. The main problem to implement a wireless network is the high and variable bit error rate in the radio link (fading, shadowing etc). Among the most important performance measures for real time applications are the packet loss probability. In order to improve the radio link, one often retransmits packets that have not been well received (using the Automatic Retransmission reQuest). This however may lead to queuing phenomena and increased delay due to retransmissions, and to losses of packets due to buffer overflow. In this paper, we allow that the number of retransmission is finite. We model the system state by a three-dimensional Markov chain which represents the evolution the radio link state, the number of packets in the buffer and the number of transmission of a packet in the service. We use an advanced approach based on the theory of singular perturbation in order to compute some performance of interest. {\textcopyright} 2013 IEEE.},
	doi = {10.1109/ICC.2013.6654990},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84891363277\&doi=10.1109\%2fICC.2013.6654990\&partnerID=40\&md5=51aa5757d77f2d32f9bb86c4d220b891},
	author = {Kobbane, A.a and Ben-Othman, J.b and Koutbi, M.E.a}
}
