@article {Routaib201691,
	title = {A bargaining nash game based adaptive negotiation of context level agreements for pervasive systems},
	journal = {Lecture Notes in Electrical Engineering},
	volume = {366},
	year = {2016},
	note = {cited By 0},
	pages = {91-104},
	abstract = {With the growing popularity of Internet-enabled devices, the impressive progress in sensing technology, and the adoption of cloud computing for provisioning services, users increasingly demand services that can adapt to their recent context. In this paper, we propose a multi-attributes and adaptive approach for Context Level Agreements (CLAs) negotiation between a context provider and a context consumer using a context broker. The approach employs a Nash bargainingmodel and evaluates the global utility of each party as a linear function of normalized Quality of Context (QoC) attributes during the rounds of negotiation. The ultimate goal is to improve context-based adaptation of context-aware applications and services. One of the advantages of this approach is that it permits to resolve conflicts of interests between the context provider and the context consumer when the global utility of each party reaches a Pareto optimum. {\textcopyright} Springer Science+Business Media Singapore 2016.},
	doi = {10.1007/978-981-287-990-5_8},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959119600\&doi=10.1007\%2f978-981-287-990-5_8\&partnerID=40\&md5=ed4610375cc000b9197b7923d9434dd5},
	author = {Routaib, H.a and Badidi, E.b and Sabir, E.c and Elkoutbi, M.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}
}
@article {AitOualhaj2015126,
	title = {A ferry-assisted solution for forwarding function in Wireless Sensor Networks},
	journal = {Pervasive and Mobile Computing},
	volume = {22},
	year = {2015},
	note = {cited By 2},
	pages = {126-135},
	abstract = {For sure, Wireless Sensor Networks (WSNs) are becoming an ultimate part of next generation mobile networks. They are a master piece for Ubiquitous computing. Indeed, they sustain development of numerous paradigms/ technologies such as distributed ambient intelligence, context-awareness and future mobile networking (e.g., B4G and 5G). Battery life remains one of the crucial problems to handle. In this article we propose an infrastructure-based topology using mobile ferries (mobile micro-base stations). In real life, a ferry could be robot, bus, tram, train or any other engine scrutinizing periodically a given area. Yet, message ferries are moving along concentric annulus and may collect data generated by the static sensors (could be classic sensors, smart meters, wearable devices, etc.) randomly distributed on given area. Next, transmissions are performed in a ferry-to-ferry forwarding scheme till arriving at the sink. Considered ferries could sense themselves data and therefore behave as mobile sensors allowing better awareness on the area state [1-3]. Our scheme could also assist Machine-to-Machine communications to increase the network lifetime, with potentially some cognitive-radio capabilities and opportunistic detection and access. Our proposal can easily be integrated in a smart-city for better interaction and green communications. Next, we present a queueing model (queues with finite capacity) to handle the generated traffic and to analyze the behavior of mobile ferries. We provided a close-form expression for both end-to-end throughput and end-to-end delay. The main objective of this work is to improve the energy efficiency of the cognitive sensors by asking cognitive sensors to not care about forwarding data of each other except for urgent data, this latter point is out of the scope of the paper. These static sensors will only care about data sensing, which will reduce their individual energy consumption. {\textcopyright} 2015 Elsevier B.V.},
	doi = {10.1016/j.pmcj.2015.05.003},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84941024588\&doi=10.1016\%2fj.pmcj.2015.05.003\&partnerID=40\&md5=83a85e8d64da3c3ac9458a4eba519a14},
	author = {Ait Oualhaj, O.a and Kobbane, A.b and Sabir, E.c and Ben-Othman, J.d and Erradi, M.a}
}
@conference {Walid20142817,
	title = {A decentralized network selection algorithm for group vertical handover in heterogeneous networks},
	booktitle = {IEEE Wireless Communications and Networking Conference, WCNC},
	year = {2014},
	note = {cited By 5},
	pages = {2817-2821},
	abstract = {The traditional vertical handover schemes postulate that vertical handover of each user comes on an individual basis. This enables the users to know previously the decision already made by other users, and then the choice will be made accordingly. However, in the case of a group vertical handover, almost all the VHO decisions - which will certainly choose the best network, will be made at the same time which will lead to system performance degradation or network congestion. In this paper, we propose a totally decentralized algorithm for network selection which based on the Congestion Game to resolve the problem of network congestion in GVHO. Therefore, the proposed algorithm named Fully Decentralized Nash Learning Algorithm with incomplete information is a prediction done by each mobile in the group that helps them to reach the Nash equilibrium. Simulation results validate the algorithm and show its robustness under two scenarios. In the first one, we examine the algorithm with a fixed number of mobiles in group to evaluate the mixed strategy and the average perceived throughput of mobiles in WIMAX and HSDPA on the basis of iteration. In the second one, we examine the algorithm with different number of mobiles in group for testing the average number of iterations needed to reach the Nash equilibrium. We also compare it with the traditional vertical handover algorithm. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/WCNC.2014.6952895},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84912123155\&doi=10.1109\%2fWCNC.2014.6952895\&partnerID=40\&md5=35a46d7aee23563018fc6f10fc8506ab},
	author = {Walid, A.a and El Kamili, M.b and Kobbane, A.a and Mabrouk, A.a and Sabir, E.c and El Koutbi, M.a}
}
@conference {Elmachkour20145372,
	title = {Green opportunistic access for cognitive radio networks: A minority game approach},
	booktitle = {2014 IEEE International Conference on Communications, ICC 2014},
	year = {2014},
	note = {cited By 6},
	pages = {5372-5377},
	abstract = {We investigate energy conservation and system performance of decentralized resource allocation scheme in cognitive radio networks thoroughly based on secondary users competitive behavior. Indeed, the contention on data channel unoccupied by licensed user leads to a single winner, but also involves a loss of energy of all nodes. In this paper, we apply minority game (MG) to the most important phase from the opportunistic spectrum access (OSA) process: the sensing phase. We attempt to carry out a cooperation in a non-cooperative environment with no information exchange. We study the Nash equilibrium solution for pure and fully mixed strategies, and we use distributed learning algorithms enabling cognitive users to learn the Nash equilibrium. Finally, we provide numerical results to validate the proposed approach. The resource allocation based on minority game approach improves secondary users battery life and the performance of the network. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/ICC.2014.6884175},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84907000432\&doi=10.1109\%2fICC.2014.6884175\&partnerID=40\&md5=13fd149d57c8c1d76ace2aecdcd1d08a},
	author = {Elmachkour, M.a and Daha, I.b and Sabir, E.c and Kobbane, A.a d and Ben-Othman, J.d}
}
@conference {Routaib2014,
	title = {Modeling and evaluating a cloudlet-based architecture for Mobile Cloud Computing},
	booktitle = {2014 9th International Conference on Intelligent Systems: Theories and Applications, SITA 2014},
	year = {2014},
	note = {cited By 0},
	abstract = {With the rising popularity of Internet-enabled mobile devices, users are increasingly demanding better quality of service (QoS). However, the resources of these devices and their connectivity levels remain insufficient, even though they are improving, for offering acceptable levels of QoS to users. Cloud computing infrastructures offer large and scalable resources that allow shifting the physical location of computation and storage to the cloud. Nevertheless, the integration of mobile computing with cloud computing would not guarantee adequate levels of service for mobile users. It rather delivers scalability at the cost of higher delay and higher power consumption on the mobile device. Instead, using local resources based on users geographical locations has the potential to improve the performance and QoS for mobile users. In this paper, we present and study a centralized architecture that relies on the concept of local clouds, cloudlets, to leverage the geographical proximity of resources to mobile users and offer them a better user experience. We use a continuous time Markov-chain (CTMC) to model the different nodes of the architecture: user nodes, cloudlets, and the main cloud. We estimate the delay incurred in the proposed architecture by simulating search engine queries generated by mobile users using the CTMC state models. Initial simulation results show that the usage of a cloudlet-based architecture especially centralized architecture has an efficient gains in terms of latency delay and synchronisation mechanisms. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/SITA.2014.6847290},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84904645627\&doi=10.1109\%2fSITA.2014.6847290\&partnerID=40\&md5=54ed4186648b2b2f3a5de1747850ad4d},
	author = {Routaib, H.a and Badidi, E.b and Elmachkour, M.a and Sabir, E.c and Elkoutbi, M.a}
}
