@conference {Khoufi2016,
	title = {Path planning of mobile sinks in charge of data gathering: A coalitional game theory approach},
	booktitle = {2016 IEEE 35th International Performance Computing and Communications Conference, IPCCC 2016},
	year = {2016},
	note = {cited By 0},
	abstract = {Game theory is often used to find equilibria where no player can unilaterally increase its own payoff by changing its strategy without changing the strategies of other players. In this paper, we propose to use coalition formation to compute the optimized tours of mobile sinks in charge of collecting data from static wireless sensor nodes. Mobile sinks constitute a very attractive solution for wireless sensor networks, WSNs, where the application requirements in terms of node autonomy are very strong unlike the requirement in terms of latency. Mobile sinks allow wireless sensor nodes to save energy The associated coalition formation problem has a stable solution given by the final partition obtained. However, the order in which the players play has a major impact on the final result. We determine the best order to minimize the number of mobile sinks needed. We evaluate the complexity of this coalitional game as well as the impact of the number of collect points per surface unit on the number of mobile sinks needed and on the maximum tour duration of these mobile sinks. In addition, we show how to extend the coalitional game to support different latencies for different types of data. Finally, we formalize our problem as an optimization problem and we perform a comparative evaluation. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/PCCC.2016.7820637},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85013413857\&doi=10.1109\%2fPCCC.2016.7820637\&partnerID=40\&md5=3c4a3fe9d6f76ca57b380ffcb337856d},
	author = {Khoufi, I.a and Minet, P.a and Koulali, M.-A.b and Kobbane, A.c}
}
@conference {Brinis2016547,
	title = {Strategic data gathering in wireless sensor networks},
	booktitle = {2016 International Wireless Communications and Mobile Computing Conference, IWCMC 2016},
	year = {2016},
	note = {cited By 0},
	pages = {547-552},
	abstract = {Prolonging the network lifetime is a challenging problem in wireless sensor networks. Using additional mobile agents able to gather data from static sensor nodes reveals to be one of the convenient solutions in order to conserve static sensor nodes energy. In this paper, we focus on a conflictual situation between two Data Collectors (DCs) tending to gather maximum sensed data and deliver them to a sink node before a required deadline. A non-cooperative game is used to model this behavior and evaluate the performance of the gathering scheme when two DCs are competing with each other to gain more sensed data. Under this scheme, aggressive behavior is discouraged since each data gathering operation incurs sensor nodes energy decrease and data delivery delay increase. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/IWCMC.2016.7577116},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84994137830\&doi=10.1109\%2fIWCMC.2016.7577116\&partnerID=40\&md5=9c385bde486970ab7cb87df7e747837e},
	author = {Brinis, N.a and Koulali, M.-A.b and Saidane, L.A.a and Minet, P.c and Kobbane, A.d}
}
@conference {Khoufi2015557,
	title = {A game theory-based approach for robots deploying wireless sensor nodes},
	booktitle = {IWCMC 2015 - 11th International Wireless Communications and Mobile Computing Conference},
	year = {2015},
	note = {cited By 1},
	pages = {557-562},
	abstract = {Wireless Sensor Networks (WSNs) are deployed in many fields of application. Depending on the application requirements, sensor nodes can either be mobile and autonomous or static. In both cases, they are able to cooperate together in order to monitor a given area or some given Points of Interest (PoIs). Static sensor nodes need one or several agent(s) (humans or robots) to deploy them. In this paper, we focus on the deployment of static sensor nodes in an area containing obstacles, using two mobile robots. We want to minimize the time needed by the two robots to deploy all the sensor nodes and to return to their starting position. We require that each sensor node is placed at a PoI position, no PoI position is empty and no PoI position is occupied by more than one sensor node. The problem consists in determining the best strategy for each robot in order to meet these constraints. We adopt a game theory approach to solve this problem. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/IWCMC.2015.7289144},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84949491266\&doi=10.1109\%2fIWCMC.2015.7289144\&partnerID=40\&md5=1f85f3af906970d1ae54fbb89ee6ec33},
	author = {Khoufi, I.a and Minet, P.a and Koulali, M.-A.b and Erradi, M.c}
}
