@conference { ISI:000387181100093,
	title = {Strategic Data Gathering in Wireless Sensor Networks},
	booktitle = {2016 INTERNATIONAL WIRELESS COMMUNICATIONS AND MOBILE COMPUTING CONFERENCE (IWCMC)},
	series = {International Wireless Communications and Mobile Computing Conference},
	year = {2016},
	note = {12th International Wireless Communications \& Mobile Computing Conference (IWCMC), Paphos, CYPRUS, SEP 05-09, 2016},
	pages = {547-552},
	publisher = {IEEE; IEEE Cyprus Sect; Frederick Univ},
	organization = {IEEE; IEEE Cyprus Sect; Frederick Univ},
	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.},
	isbn = {978-1-5090-0304-4},
	issn = {2376-6492},
	author = {Brinis, Nour and Koulali, Mohamed-Amine and Saidane, Leila Azouz and Minet, Pascale and Kobbane, Abdellatif}
}
@conference { ISI:000381477900097,
	title = {A Game Theory-Based Approach for Robots Deploying Wireless Sensor Nodes},
	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 = {557-562},
	publisher = {IEEE; IEEE Croatia Sect; Univ Dubrovnik},
	organization = {IEEE; IEEE Croatia Sect; Univ Dubrovnik},
	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.},
	isbn = {978-1-4799-5344-8},
	issn = {2376-6492},
	author = {Khoufi, Ines and Minet, Pascale and Koulali, Mohamed-Amine and Erradi, Mohammed}
}
