Email:

• Cette adresse email est protégée contre les robots des spammeurs, vous devez activer Javascript pour la voir.

Formations:

• 2004 – à ce jours: Thèse de Doctorat – ENSI Tunis.
• 2001 – 2002: Obtention du Titre Ingénieur Expert en Informatique INRIA - France.
• 2000 – 2001: DEA Programmation et Systèmes (INP/enseeiht Toulouse).
• 1998 – 2000: Maîtrise en Mathématiques Appliquées (Faculté des Sciences – Monastir).
• 1995 – 1998: DEUG Mathématiques et Sciences Appliquées – Fac des Sciences Tunisie.
• Juin 1994: Bac Sciences Expérimentales.

Formation via la recherche:

• Depuis 2003: Membre de l’unité de recherche PRINCE.
• 2001 - 2002: Membre de l’équipe de recherche SOLIDOR & ARLES à l’INRIA, Rocquencourt France.

Expérience professionnelle:

• Juin 2008 - Juin 2011: Faculté des Sciences de Gafsa, Directeur du département Informatique
• Septembre 2005 - A Nos Jours: Faculté des Sciences de Gafsa, Assistant Permanent en informatique
• Octobre 2002 - Septembre 2005: Institut Supérieur d’Informatique et des Techniques de Communication H.Sousse, Assistant Contractuel en informatique.
• Novembre 2001 - Août 2002: INRIA- Rocquencourt France, Ingénieur Expert : Réseaux & Multimédia.
• Octobre 2001 - Juin 2001: IN Polytechnique / enseeiht, Assistant stagiaire au laboratoire Ingénierie de Réseaux & Telecom.
• Janvier 2001 - Juin 2001: CNAM/IPST Toulouse, Assistant de travaux pratiques (programmation ADA & Multimédia Université de Paul Sabatier, Assistant de travaux pratiques (programmation Ocaml & Multimédia) Institut Universitaire de Technologie, Assistant de travaux dirigés (programmation C/C++).
• Juillet 2000 - Octobre 2000: Centrale Service Informatique, Responsable des ventes.
• Septembre 1998 - Juin 2000: Ministère de L’Education Nationale, Professeur adjoint de mathématiques

Activités Extra-Professionnelles:

• Animation Culturelle: Animateur de jeune (obtenu après 3 années de formation), Football.
• Astronomie: Etudes sur les forces inter – planétaires (1998 – 2010).

Langues:

• Français: très bon niveau
• Anglais technique: bon niveau
• Allemand: niveau moyen

Articles/Papiers Scientifiques/Recherche:

Publications:

• Mai 2010: Autonomic Architecture for Wireless Routing Protocols. (2010 ACS/IEEE International Conference on Computer Systems and Applications): Wireless ad-hoc networks are highly dynamic networks for which routing is a challenging task. Existing routing protocols whether reactive, proactive or hybrid showed limitations in various situations. To optimize the behavior of the routing nodes, the academic community is recommending the reliance on an autonomic approach that would guarantee self–adaptation, self–configuration, self – management, and self –protection mechanisms of all the network nodes. In this paper we propose an autonomic architecture geared towards improving the routing service within wireless ad-hoc networks. This architecture provides a formal framework where each node has a routing agent whose role is to monitor routing activities within the network, which are used to tune the routing decisions of the node, in harmony with other nodes. Simulation results with an autonomic implementation of AODV show remarkable performance improvement with respect to efficiency (Packet Delivery Ratio improved on average by 20.65%), overhead (average reduction of 16.7%), quality of paths (average path delay reduced by 37.14% in low mobility and 19.68% in high mobility), and reliability (an average of 789.35 for 900sec of simulation)
• Juin 2009: Self-Organization in Wireless Networks using The Autonomic Behavior. (2nd IEEE International Workshop on ITS for an UBIquitous ROADS (UBIROADS): During the lifetime of a wireless ad hoc network using the AODV routing protocol, nodes are the sources and destinations of routing traffic. The routing traffic typically consists of routing requests, routing replies or routing errors. The routing events (requests, replies or errors) witnessed by a node could constitute an important source of information to improve the nodes routing decisions. In this work we resort to behavioral logic to equip each node with a Routing Learning Agent (RLA) to process the routing traffic in order to determine and maintain for each node involved a score (called PRS: Pairwise Routing Similarity) in the interval [0, 1]. The occurrence of a routing event at a particular node triggers the associated agent to update the scores of the involved nodes: Route replies/errors contribute to higher/lower scores. A node considers itself in the same cluster as other nodes for which it computed a score ?0.5. A node then selectively floods received route requests to only nodes of its cluster. The nodes self clustering is used to improve routing efficiency. Simulation results using AODV show that equipping nodes with self clustering capability leads to noticeable improvement with respect to packet delivery ratio (12.9%), throughput (11.1%) and overhead (13.9%). (le lien)
• Février 2009: Wireless Routing Protocol Based on Auto-Learning Algorithm (ICDS 2009). ICDS '09: Third International Conference on Digital Society: Given the highly dynamic nature of wireless ad hoc network, routing is one of the most challenging tasks. Among the routing protocols that are in the process of normalisation is AODV (Ad hoc on demand Distance Vector). AODV is a reactive source based on routing protocol whose performance is very sensitive to several fixed parameters, such as. ACTIVE_ROUTE_TIMEOUT, HELLO_INTERVAL, MY_ROUTE_TIMEOUT, NET_DIAMETER, RREQ_RETRIES, .... In this paper we propose an adaptive version of AODV (A2ODV) where the protocol regularly adapts its routing decision to the state of the behaviour and the state of the network. In A2ODV each node maintains an estimation of the reliability as well as an expected residual uptime of its interfaces. A route is characterized by two metrics: (1) reliability defined as the product of its constituent links; and (2) Route residual lifetime estimated by the residual lifetime of its weakest link. Route selection is a function of these two metrics. Simulation shows that A2ODV clearly outperforms AODV with respect to packet delivery ratio and overhead traffic. ( Lien 1 , Lien 2). Proceedings of the 2009 Third International Conference on Digital Systems.
• Juillet 2008: Adaptive Clustering Based on Auto-Learning Algorithm (VECoS 2008). (Second International Workshop on Verification and Evaluation of Computer and Communication Systems (VECoS 2008)): This paper introduces an adaptive clustering model for wireless ad hoc networks based on Auto - Learning Algorithm (ALA). ALA allows a dynamic decomposition of the network into a virtual clusters view based on communication patterns of the mobile nodes. We consider a cluster as an Interest Group (IG) whose member nodes have common interactions. ALA is based on two types of events, New Route Events (NRE) and Route Failure Events (RFE). In this work, ALA is integrated into the well known routing protocol AODV. The adaptive version of AODV is referred to as A²ODV (Adaptive AODV). Simulation results show that AODV outperforms AODV with respect to packet delivery ratio, overhead, throughput, and route stability. (Le lien)
• Octobre 2008 Wireless Routing Protocol Based on Trust Evaluation (ICSNC 2008). (ICSNC: Third International Conference on Systems and Networks Communications): Wireless networks have specific characteristics that are totally different from conventional networks. In fact, Ad hoc networks are closely depending on the distributed cooperation among mobile nodes. Deploying trust evaluation in such environment will be an extra challenge. In this paper, we present a newest model permitting trust evaluation and establishment based on Ad hoc routing protocol. Trust evaluation and establishment provide representing, evaluating and maintaining trust within the network, and serve as the basis for higher level routing operations. Our model is an events-based according to the routing’s relationships between mobile nodes. Logical and computational trust analysis and evaluation are deployed among network nodes. Each node's evaluation of trust on other nodes should be based on experience statistics computed around two routing events: NRE (New Route Events) and RFE (Route Failure Events). First ones refer to the new requests or responses in order to establish a new route; however, second ones are consequences of a loss or errors due to existing route problems. To ensure efficiency, the experience statistics are computed by being based on Linear Temporal Logic (LTL) model. Finally and in order to prove the applicability of the proposed solution, we further present an adaptive routing protocol (A²ODV: Adaptive AODV) and analyze its efficiency around some performances metrics. ( Lien 1 , Lien 2).
• Août 2001: ASA: The Active Service Architecture for New Internet. Beatrice Paillassa, Xavier Cregut, Anis Ben Arbia. (2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, August 26-28, 2001, Victoria, B.C., Canada): Because support of new distributed multimedia applications are an important challenge for the Internet Service Providers, a lot of works are under progress for enhancing the Internet architecture. Thus, internet service architectures based upon new protocols have been proposed. While a new generation of internet may be developed from these proposals, the problem of the deployment of these new technologies becomes of a prime importance. In this article we attempt to provide a solution to the internet evolution process by means of a new concept, the active service architecture that is based on the new technology of active networking. The concept of activity in ASA architecture is presented, specifications of the nodes are given and an experimentation of active service is shown. (Le lien)

Publication Interne:

• Novembre 2001: AdHocFS: A Persistence Service for WLAN. Malika Boulkenafed, Anis Ben Arbia, David Mentré, Valérie Issarny, Apostolos Zarras (INRIA – Rocquencourt). INRIA Research Report 4303.
  Abstract:Offering access to users’ data, anytime, anywhere as needed in mobile environnments, in a transparent manner, necessitates several improvements in the way information servers and users terminals interact. In particular, users terminals should not tightly rely on an information server, which can be temporarily unavailable in a mobile situation. They should rather exploit all the information servers available in a given context through loose coupling with both stationary and mobile nodes. This report presents the AdHocFS persistence service that realizes transparent, adaptive file access according to the users’ specific situations (e.g. device in use, network connectivity, etc). The report concentrates more specifically on the support of AdHocFS for collaborative file sharing within ad hoc groups of trusted nodes that are in the local communication of each other, which has not been addressed in the past. (Le lien)
• Novembre 2001: AdHocFS: Sharing Files in WLANs. M. Boulkenafed, Anis Ben Arbia, D. Mentré, V. Issarny. INRIA Research Report 4303. INRIA Research Report 4303, Novembre 2001.
  Abstract: Among other features, pervasive computing aims at offering access to users’ data, anytime, anywhere, in a transparent manner. However, realizing such a vision necessitates several improvements in the way information servers and users terminals interact. In particular, users’ terminals should not tightly rely on an information server, which can be temporarily unavailable in a mobile situation. They should rather exploit all the information servers available in a given context through loose coupling with both stationary and mobile nodes. This paper presents the ADHOCFS file system for mobile users, which realizes transparent, adaptive file access according to the users’ specific situations (e.g., device in use, network connectivity, etc). The paper concentrates more specifically on the support of ADHOCFS for collaborative file sharing within ad hoc groups of trusted nodes that are in the local communication of each other using the underlying ad hoc network, which has not been addressed in the past. (Le lien).
• Novembre 2002: Architecture middleware pour l'intelligence ambiante. Anis Ben Arbia, Malika Boulkenafed, Nikolaos Georgantas, Valérie Issarny, Daniele Sacchetti, Françoise Sailhan. INRIA Research Report 4303, Novembre 2002.
  Résumé: Les évolutions en matière de réseaux sans fil et d'ordinateurs de petite taille, permettent a priori à tout utilisateur d'accéder à des services numériques en tout lieu. Ce travail donne un aperçu des interactions possibles, à terme, depuis un même site mobile où les ronds représentent des sites mobiles, et le cercle la portée du Wlan par rapport au site mobile qui se trouve en son centre. Le choix de l'une ou l'autre de ces interactions dépend de plusieurs facteurs, qui outre la fonctionnalité visée, relèvent de la consommation de ressources et en particulier énergétique, du temps de réponse, et de la sûreté de fonctionnement induits par telle ou telle interaction. L'objectif de nos travaux est de mieux comprendre ces critères par l'étude de services exécutifs supportant la réalisation de systèmes distribués dans un tel environnement. (Le lien)

Participation à des projets Européen:

• Novembre 2002: Système de fichiers distribués ad hoc- Application Sous VIVIAN. Valérie Issarny [correspondante], Anis Ben Arbia, Malika Boulkenafed. INRIA Research Report 4303
  Résumé: Les services de gestion de données nomades existants ont pour la plupart été conçus pour des réseaux sans fil basés sur une infrastructure. Dans le cadre de nos activités de recherche, nous avons développé un prototype de système de fichiers distribués, appelé AdHocFS, qui exploite les spécificités des réseaux ad hoc (un saut) et permet ainsi à des sites mobiles à portée de communication les uns des autres et appartenant à un même domaine de sécurité, de partager directement leurs données. Plus précisément, les données liées à un domaine de sécurité sont stockées sur un serveur de données fixe et sont en outre répliquées (cachées) sur les sites mobiles suite à des requêtes au serveur, ou à des sites mobiles à portée de communication ayant déjà une copie de la donnée. Le prototype du système AdHocFS a été développé au-dessus du système Linux et du réseau Ieee 802.11b. (Le lien)
• Mars 2002: A Persistent Storage service for mobile Users : projet européen VIVIAN. Conférence soutenu à Amsterdam le 26/03/02. Anis BEN ARBIA, Malika BOULKENAFED, Valerie ISSARNY, David MENTRE, Apostolos ZARRAS.(Le lien)

Participation aux comités d’organisation:

• Responsable du comité d’organisation de ICWUS 2010 ‘’International Conference On Wireless and Ubiquitous Systems 2010’’ www.icwus.net.
• Membre à la comité de TPC de ICDS 2011, International Conference On digital Society. (Le lien)