@conference {Jouhari2016388,
	title = {New greedy forwarding strategy for UWSNs geographic routing protocols},
	booktitle = {2016 International Wireless Communications and Mobile Computing Conference, IWCMC 2016},
	year = {2016},
	note = {cited By 0},
	pages = {388-393},
	abstract = {Recently Underwater wireless Sensor Networks (UWSNs) have been suggested as a powerful technology for many civilian and military applications, such that tactical surveillance. Geographic routing that uses the position information of nodes to route the packet toward a destination is preferable for UWSNs. In this paper, we propose a New Greedy Forwarding (NGF) strategy using splitting mechanism based on Chinese remainder theorem(CRT) for UWSNs. In the approach, source node reduced the number of bits transmitted using the proposed splitting mechanism based on CRT if there are more than two nodes participate in the forwarding of one packet. This strategy distribute the forwarding task between more nodes instead of selecting one node as next-hop, that reduce the energy consumption per node and maintain node communication for a long time. Thus resulting the increase of network life time and decrease the number of isolated/void nodes. We use topology control through depth adjustment to cope with the problem of isolated and void nodes appeared in geographic routing protocols. Simulation results shows that with the anycast greedy forwarding strategy the network life time is about 500 rounds whereas it is about 1000 rounds using the new greedy forwarding strategy, which means the new strategy increase the network life time and increase the network performance in energy saving. {\textcopyright} 2016 IEEE.},
	doi = {10.1109/IWCMC.2016.7577089},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84994166915\&doi=10.1109\%2fIWCMC.2016.7577089\&partnerID=40\&md5=e43d0d319dbeeaa82e6ac9c64cee322d},
	author = {Jouhari, M.a and Ibrahimi, K.a and Benattou, M.b and Kobbane, A.c}
}
@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 {BenChekroun2015320,
	title = {A distributed open-close access for Small-Cell networks: A random matrix game analysis},
	booktitle = {IWCMC 2015 - 11th International Wireless Communications and Mobile Computing Conference},
	year = {2015},
	note = {cited By 0},
	pages = {320-325},
	abstract = {Nowadays, Small-Cells are widely being deployed to assist and improve performance of mobile networks. Indeed, they are a promising solution to improve coverage and to offload data traffic in mobile networks. In this paper, we propose a signaling-less architecture of the heterogeneous network composed of one single Macro Base Station and a Single Small-Cell. First, we construct a game theoretic framework for channel-state independent interaction. We present many conditions for the existence of Pure Nash equilibrium. Next, and in order to capture the continuous change of the channel state, we build a random matrix game where the channel state is considered to be random (potentially ruled by some given distribution). A characterization of Nash equilibrium is provided in terms of pure strategies and mixed strategies. Convergence to Nash equilibrium is furthermore guaranteed using a variant of the well-known Combined fully distributed payoff and strategy learning. Our algorithm converges faster (only 10-20 iterations are required to converge to Nash equilibrium) and only need a limited amount of local information. This is quite promising since it says that our scheme is almost applicable for all environments (fast fading included). {\textcopyright} 2015 IEEE.},
	doi = {10.1109/IWCMC.2015.7289103},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84949516312\&doi=10.1109\%2fIWCMC.2015.7289103\&partnerID=40\&md5=09ea6932ff0311a5cea7e0dc62597821},
	author = {Ben Chekroun, S.a and Sabir, E.b and Kobbane, A.c and Tembine, H.d and Bouyakhf, E.-H.a and Ibrahimi, K.e}
}
@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 {Koulali2014845,
	title = {Ferry-based architecture for Participatory Sensing},
	booktitle = {IWCMC 2014 - 10th International Wireless Communications and Mobile Computing Conference},
	year = {2014},
	note = {cited By 0},
	pages = {845-849},
	abstract = {The concept of Participatory Sensing is centered on individuals that collect data using their smart phones (or other dedicated devices) to track the evolution of their work/living places. The main objective is to use the gathered data in order to enhance the offered quality of life. To maximize people involvement in this process we propose a ferry based architecture to leverage the contributors from charges associated with accessing service providers infrastructure to forward collected data. Opportunistic contact with message ferries will be exploited to gather data that will be carried from ferry-To-ferry till it reaches a centralized processing and decision-Taking authority. We provide a closed formula for the End-To-End throughput of the proposed gathering network architecture. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/IWCMC.2014.6906466},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84908610867\&doi=10.1109\%2fIWCMC.2014.6906466\&partnerID=40\&md5=20f82b554230199456e13e347b4ecbe0},
	author = {Koulali, S.a and Sabir, E.b and Kobbane, A.c and Azizi, M.a}
}
@conference {Rahmouni201494,
	title = {Optimal buffer management policies in DTNs: A POMDP approach},
	booktitle = {2014 IEEE International Conference on Communications, ICC 2014},
	year = {2014},
	note = {cited By 0},
	pages = {94-99},
	abstract = {Using Delay Tolerant Networks (DTNs) would facilitate the connection of devices and areas across the world that are under-served by current networks. The DTNs are based on the concept of store-carry-and-forward protocols. A node may store a message in its buffer and carry it for a short or a long period of time, until an appropriate forwarding opportunity arises. A critical challenge is to determine routes through the network without even having an end-to-end connection. In order to increase the probability of message delivery, a known approach is implemented using epidemic message replication. This combination of long-term storage and message replication imposes a high storage and bandwidth overhead. Thus, efficient scheduling and dropping policies are necessary to decide which messages should be discarded when nodes{\textquoteright} buffers operate close to their capacity. If a relay buffer is full and needs to store a new packet, it has to decide either to keep the current message or to drop it. This decision depends on the number of transmissions of the message in its buffer and the message which has just arrived. In this paper, a Partially Observed Markov Decision Process (POMDP) framework is proposed to solve the problem of buffer management in DTNs. This modeling technique predicts some properties of the optimal buffer management policy. In addition, numerical examples are presented to illustrate the findings. {\textcopyright} 2014 IEEE.},
	doi = {10.1109/ICC.2014.6883301},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84906995806\&doi=10.1109\%2fICC.2014.6883301\&partnerID=40\&md5=382f58d0b8f3dc6541db001ac2f98769},
	author = {Rahmouni, I.a and Kamili, M.E.a and Fenni, M.R.E.b and Omari, L.a 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}
}
