Publications

2017

• Analyse des traces d'usage de Gallica
  
  • Nouvellet Adrien
  • Beaudouin Valérie
  • d'Alché-Buc Florence
  • Prieur Christophe
  • Roueff François
  , 2017. Gallica est l'une des plus grandes bibliothèques numériques librement accessible sur le web. Dans le cadre du Bibli-Lab, partenariat de recherche entre la Bibliothèque nationale de France et Télécom ParisTech, et avec le soutien du TeraLab, a été conduite une analyse inédite des logs de connexion aux serveurs de Gallica, en leur appliquant des méthodes d’apprentissage automatique (machine learning). L’objectif n’était pas de connaître les usagers ni leurs profils mais, en partant de traces d’usages que sont les logs, d’identifier des parcours-types. Durant 15 mois (avril 2016-juillet 2017), un chercheur en contrat postdoctoral encadré par quatre enseignants-chercheurs de Télécom ParisTech , a mis au point un algorithme de classification (ou clusterisation) permettant de regrouper des sessions de Gallica présentant des similitudes dans l’enchaînement des actions. Les logs analysés couvraient des durées variables, allant d’une semaine à un mois, avec vérification systématique de la stabilité des modèles obtenus. Le choix méthodologique fort a été ici de faire dialoguer les modèles statistiques avec les résultats issus d’autres approches (observations ethnographiques, entretiens, etc. ). Ce dialogue a permis à la fois de : a) fixer les paramètres de départ (durée d’une session, définition des actions élémentaires sur Gallica) ; b) contrôler les modèles obtenus, extrêmement sensibles aux artefacts techniques ; c) proposer des premières clés d’interprétation.
• Enhanced stimulated Brillouin scattering effect by using multilayer molybdenum disulfide on fibre end
  
  • Xu Wenqian
  • Yi L. L.
  • Nan Zhenhua
  • Wei Wei
  • Ni Zhenhaua
  • Jaouën Yves
  • Hu W.
  , 2017, paper TH.37.
• Performance Analysis of Online Matching Algorithms for D2D Communications
  
  • Zorello Ligia
  • Rojas Marco
  • Coupechoux Marceau
  • Vaze Rahul
  • Carvalho Tereza
  , 2017, pp.1-6. In this paper, we consider a Device-to-Device (D2D) cellular network in which idle users can work as relays between cell users and the base station to improve their data rate. The relaying induces a cost for the User Equipment Relays (UER), that should be compensated by a payment from the mobile operator so that UERs accept to offer the service. The problem hence arises for the operator of matching cell users and UERs at a reasonable cost and increasing the data rate. In this context, we consider the requirements of truthfulness, budget feasibility and acceptance of online scenarios to compare ON algorithm, which considers all constraints, with other three algorithms that were not built to respect all of them, Hungarian, Threshold and Online Weighted Knapsack (OWK). As expected, results show that if more constraints are considered, less devices are matched. Moreover, we observed that the budget constraint is the one that has greatest impact on the final result. We also noticed that OWK algorithm has very appealing results; however, it is not truthful. Lastly, although ON algorithm respects all requirements, it does not scale well considering the number of matched edges.
• Human Body Communication for leadless pacemaker applications
  
  • Maldari Mirko
  , 2017.
• Core Mode scramblers for ML-detection based multi-cores fibers transmission
  
  • Abouseif Akram
  • Rekaya-Ben Othman Ghaya
  • Jaouën Yves
  , 2017, paper M1B.5.
• Optimal side-channel attacks for multivariate leakages and multiple models
  
  • Bruneau Nicolas
  • Guilley Sylvain
  • Heuser Annelie
  • Damien Marion
  • Rioul Olivier
  Journal of Cryptographic Engineering, Springer, 2017, 7 (4), pp.331–341. Side-channel attacks allow to extract secret keys from embedded systems like smartcards or smartphones. In practice, the side-channel signal is measured as a trace consisting of several samples. Also, several sensitive bits are manipulated in parallel, each leaking differently. Therefore, the informed attacker needs to devise side-channel distinguishers that can handle both multivariate leakages and multiple models. In the state of the art, these two issues have two independent solutions: on the one hand, dimensionality reduction can cope with multivariate leakage; on the other hand, online stochastic approach can cope with multiple models. In this paper, we combine both solutions to derive closed-form expressions of the resulting optimal distinguisher in terms of matrix operations, in all situations where the model can be either profiled offline or regressed online. Optimality here means that the success rate is maximized for a given number of traces. We recover known results for uni- and bivariate models (including correlation power analysis) and investigate novel distinguishers for multiple models with more than two parameters. In addition, following ideas from the AsiaCrypt’2013 paper “Behind the Scene of Side-Channel Attacks,” we provide fast computation algorithms in which the traces are accumulated prior to computing the distinguisher values. (10.1007/s13389-017-0170-9)
  DOI : 10.1007/s13389-017-0170-9
• Planck intermediate results. LII. Planet flux densities
  
  • Collaboration Planck
  • Akrami Yashar
  • Ashdown M.
  • Aumont J.
  • Baccigalupi C.
  • Ballardini M.
  • Banday A.J.
  • Barreiro R.B.
  • Bartolo N.
  • Basak S.
  • Benabed K.
  • Bernard J.-P.
  • Bersanelli M.
  • Bielewicz P.
  • Bonavera L.
  • Bond J.R.
  • Borrill J.
  • Bouchet F.R.
  • Boulanger F.
  • Bucher M.
  • Burigana C.
  • Butler R.C.
  • Calabrese E.
  • Cardoso J.-F.
  • Carron J.
  • Chiang H.C.
  • Colombo L.P.L.
  • Comis B.
  • Couchot F.
  • Coulais A.
  • Crill B.P.
  • Curto A.
  • Cuttaia F.
  • de Bernardis P.
  • de Rosa A.
  • de Zotti G.
  • Delabrouille J.
  • Di Valentino E.
  • Dickinson C.
  • Diego J.M.
  • Doré O.
  • Ducout A.
  • Dupac X.
  • Elsner F.
  • Ensslin T.A.
  • Eriksen H.K.
  • Falgarone E.
  • Fantaye Y.
  • Finelli F.
  • Frailis M.
  • Fraisse A.A.
  • Franceschi E.
  • Frolov A.
  • Galeotta S.
  • Galli S.
  • Ganga K.
  • Génova-Santos R.T.
  • Gerbino M.
  • González-Nuevo J.
  • Górski K.M.
  • Gruppuso A.
  • Gudmundsson J.E.
  • Hansen F.K.
  • Helou G.
  • Henrot-Versillé S.
  • Herranz D.
  • Hivon E.
  • Jaffe A.H.
  • Jones W.C.
  • Keihänen E.
  • Keskitalo R.
  • Kiiveri K.
  • Kim J.
  • Kisner T.S.
  • Krachmalnicoff N.
  • Kunz M.
  • Kurki-Suonio H.
  • Lagache Guilaine
  • Lamarre J.-M.
  • Lasenby A.
  • Lattanzi M.
  • Lawrence C.R.
  • Le Jeune M.
  • Lellouch E.
  • Levrier F.
  • Liguori M.
  • Lilje P.B.
  • Lindholm V.
  • López-Caniego M.
  • Ma Y.-Z.
  • Macías-Pérez J.F.
  • Maggio G.
  • Maino D.
  • Mandolesi N.
  • Maris M.
  • Martin P.G.
  • Martínez-González E.
  • Matarrese S.
  • Mauri N.
  • Mcewen J.D.
  • Melchiorri A.
  • Mennella A.
  • Migliaccio M.
  • Miville-Deschênes M.-A.
  • Molinari D.
  • Moneti A.
  • Montier L.
  • Moreno R.
  • Morgante G.
  • Natoli P.
  • Oxborrow C.A.
  • Paoletti D.
  • Partridge B.
  • Patanchon G.
  • Patrizii L.
  • Perdereau O.
  • Piacentini F.
  • Plaszczynski S.
  • Polenta G.
  • Rachen J.P.
  • Racine B.
  • Reinecke M.
  • Remazeilles M.
  • Renzi A.
  • Rocha G.
  • Romelli E.
  • Rosset C.
  • Roudier G.
  • Rubiño-Martín J.A.
  • Ruiz-Granados B.
  • Salvati L.
  • Sandri M.
  • Savelainen M.
  • Scott D.
  • Sirri G.
  • Spencer L.D.
  • Suur-Uski A.-S.
  • Tauber J.A.
  • Tavagnacco D.
  • Tenti M.
  • Toffolatti L.
  • Tomasi M.
  • Tristram M.
  • Trombetti T.
  • Valiviita J.
  • van Tent F. V
  • Vielva P.
  • Villa Francesca
  • Wehus I.K.
  • Zacchei A.
  Astronomy & Astrophysics - A&A, EDP Sciences, 2017, 607, pp.A122. Measurements of flux density are described for five planets, Mars, Jupiter, Saturn, Uranus, and Neptune, across the six Planck High Frequency Instrument frequency bands (100–857 GHz) and these are then compared with models and existing data. In our analysis, we have also included estimates of the brightness of Jupiter and Saturn at the three frequencies of the Planck Low Frequency Instrument (30, 44, and 70 GHz). The results provide constraints on the intrinsic brightness and the brightness time-variability of these planets. The majority of the planet flux density estimates are limited by systematic errors, but still yield better than 1% measurements in many cases. Applying data from Planck HFI, the Wilkinson Microwave Anisotropy Probe (WMAP), and the Atacama Cosmology Telescope (ACT) to a model that incorporates contributions from Saturn’s rings to the planet’s total flux density suggests a best fit value for the spectral index of Saturn’s ring system of βring = 2.30 ± 0.03 over the 30–1000 GHz frequency range. Estimates of the polarization amplitude of the planets have also been made in the four bands that have polarization-sensitive detectors (100–353 GHz); this analysis provides a 95% confidence level upper limit on Mars’s polarization of 1.8, 1.7, 1.2, and 1.7% at 100, 143, 217, and 353 GHz, respectively. The average ratio between the Planck-HFI measurements and the adopted model predictions for all five planets (excluding Jupiter observations for 353 GHz) is 1.004, 1.002, 1.021, and 1.033 for 100, 143, 217, and 353 GHz, respectively. Model predictions for planet thermodynamic temperatures are therefore consistent with the absolute calibration of Planck-HFI detectors at about the three-percent level. We compare our measurements with published results from recent cosmic microwave background experiments. In particular, we observe that the flux densities measured by Planck HFI and WMAP agree to within 2%. These results allow experiments operating in the mm-wavelength range to cross-calibrate against Planck and improve models of radiative transport used in planetary science. (10.1051/0004-6361/201630311)
  DOI : 10.1051/0004-6361/201630311
• Polarization-Division Multiplexing Based on the Nonlinear Fourier Transform
  
  • Goossens Jen-Willem
  • Hafermann Hartmut
  • Yousefi Mansoor
  • Jaouën Yves
  Optics Express, Optical Society of America - OSA Publishing, 2017, 25, pp., 26437-26452.
• Convergecast in Wireless Body Area Networks
  
  • Badreddine Wafa
  • Khernane Nesrine
  • Potop-Butucaru Maria
  • Chaudet Claude
  Ad Hoc Networks, Elsevier, 2017, 66, pp.40-51. Wireless Body Area Networks (WBAN) is a recent challenging area in the domain of health monitoring. There are several concerns in this area ranging from energy efficient communication to designing delays efficient protocols that support nodes dynamicity induced by human body mobility. This paper focuses on the convergecast or data gathering protocols in WBAN. Our contribution is twofold. First, we extensively analyze the impact of postural body mobility on various classes of multi-hop convergecast strategies. Our study does not limit itself to the existing state-of-the-art in WBAN, we adapted to WBAN settings strategies from the areas of Delay Tolerant Networks (DTN) and Wireless Sensor Networks (WSN). We evaluate all these strategies via the OMNeT++ simulator that we enriched with realistic human body mobility models and channel models issued from the recent research on biomedical and health informatics. Our simulations show that existing results in DTN and WSN cannot be just extrapolated to WBAN without a deeper investigation. That is, existing convergecast strategies for DTN or WSN do not perform well with postural body movements because of the topological partitioning provoked by important link attenuations due to signal obstructions by clothes or body itself. Our extensive simulations give valuable insights and directions for designing efficient convergecast adaptive strategies in WBAN. Second, we propose and evaluate two novel classes of convergecast strategies. The first class integrates in the routing information the link attenuation while the second one exploits multi (pre-established) paths to the sink node. We stress all the strategies under a realistic channel model and present an extensive analysis in terms of resiliency to mobility, end-to-end delay and energy consumption for seven different mobility patterns. We advocate that, so far, there is no strategy for convergecast in WBAN that optimizes all the above criteria for all possible mobility patterns. However, each considered strategy can be a good candidate for a specific combination of parameters with a specific mobility pattern. (10.1016/j.adhoc.2017.08.008)
  DOI : 10.1016/j.adhoc.2017.08.008
• Computational Study of Primitive Emotional Contagion in Dyadic Interactions
  
  • Varni Giovanna
  • Hupont Isabelle
  • Clavel Chloé
  • Chetouani Mohamed
  IEEE Transactions on Affective Computing, Institute of Electrical and Electronics Engineers, 2017.
• GHZ-wide arbitrary-shaped microwave photonic filter based on stimulated Brillouin scattering using directly-modulated laser
  
  • Wei Wei
  • Yi L. L.
  • Jaouën Yves
  • Hu W.
  , 2017, paper We1.5.
• Joint disparity and variable size-block optimization algorithm for stereoscopic image compression
  
  • Kadaikar Aysha
  • Dauphin Gabriel
  • Mokraoui Anissa
  Signal Processing: Image Communication, Elsevier, 2017, 61, pp.1 - 8. This paper addresses the disparity map estimation problem in the context of stereoscopic image coding. It is undeniable that the use of variable size blocks offers the possibility to describe more precisely the predicted view but at the expense of a high bitrate if no particular consideration is taken into account by the estimation algorithm. Indeed more information related to the block layout, considered here as a block-length map, is required at the prediction step. This paper presents an algorithm which jointly optimizes the block-length map as well as the disparity map so as to ensure a good reconstruction of the predicted view while minimizing the bitrate. This is done thanks to a joint metric taking into account the quality of the reconstruction as well as the bitrate needed to encode the maps. Moreover the developed algorithm iteratively improves its performance by refining the estimated maps. Simulation results conducted on several stereoscopic images from the CMU-VASC and the Middlebury dataset confirm the benefits of this approach as compared to competitive block matching algorithms. (10.1016/j.image.2017.10.008)
  DOI : 10.1016/j.image.2017.10.008
• Algorithmes parallèles pour le traitement rapide de géométries 3D
  
  • Legrand Hélène
  , 2017. Au cours des vingt dernières années, les principaux concepts du traitement du signal ont trouvé leur homologue pour le cas de la géométrie numérique, et en particulier des modèles polygonaux de surfaces 3D. Ces traitements requièrent néanmoins un temps de calcul non négligeable lorsqu’on les applique sur des modèles de taille conséquente. Cette charge de calcul devient un frein important dans le contexte actuel, où les quantités massives de données 3D générées à chaque seconde peuvent potentiellement nécessiter l’application d’un sous-ensemble de ces opérateurs. La capacité à exécuter des opérateurs de traitement géométrique en un temps très court représente alors un verrou important pour les systèmes de conception, capture et restitution 3D dynamiques. Dans ce contexte, on cherche à accélérer de plusieurs ordres de grandeur certains algorithmes de traitement géométrique actuels, et à reformuler ou approcher ces algorithmes afin de diminuer leur complexité ou de les adapter à un environnement parallèle. Dans cette thèse, nous nous appuyons sur un objet compact et efficace permettant d’analyser les surfaces 3D à plusieurs échelles : les quadriques d’erreurs. En particulier, nous proposons de nouveaux algorithmes haute performance, maintenant à la surface des quadriques d’erreur représentatives de la géométrie. Un des principaux défis tient ici à la génération des structures adaptées en parallèle, afin d’exploiter les processeurs parallèles à grain fin que sont les GPU, la principale source de puissance disponible dans un ordinateur moderne.
• Random Fourier Features for Operator-Valued Kernels
  
  • Brault Romain
  • d'Alché-Buc Florence
  , 2017. Many problems in Machine Learning can be cast into vector-valued functions approximation. Operator-Valued Kernels Operator-Valued Kernels and vector-valued Reproducing Kernel Hilbert Spaces provide a theoretical and versatile framework to address that issue, extending nicely the well-known setting of scalar-valued kernels. However large scale applications are usually not affordable with these tools that require an important computational power along with a large memory capacity. In this paper, we aim at providing scalable methods that enable efficient regression with Operator-Valued Kernels. To achieve this goal, we extend Random Fourier Features, an approximation technique originally introduced for translation-invariant scalar-valued kernels, to translation-invariant Operator-Valued Kernels. We develop all the machinery in the general context of Locally Compact Abelian groups, allowing for coping with Operator-Valued Kernels. Eventually, the provided approximated operator-valued feature map converts the nonparametric kernel-based model into a linear model in a finite-dimensional space.
• Formal Methods for Railway Disasters Prevention
  
  • Belabed Lilia
  • Tanzi Tullio
  • Coudert Sophie
  , 2019, AICT-516, pp.161-176. Due to the increasing complexity of railway signalling systems, the design of those systems is more difficult and the demonstration of their safety can be extremely tedious. In this article, the verification and validation of railway signalling systems is investigated. We explain how railway signalling functions are designed, we show how they can be mathematically modelled using formal methods and we discuss some ways to use formal methods mechanisms to design, verify signalling systems and to prove the validity of their safety properties. (10.1007/978-3-030-18293-9_14)
  DOI : 10.1007/978-3-030-18293-9_14
• Wideband Power Amplifier Predistortion: Trends, Challenges and Solutions
  
  • Desgreys Patricia
  • Manyam Venkata Narasimha
  • Tchambake Kelly
  • Pham Dang-Kièn Germain
  • Jabbour Chadi
  , 2017, pp.100-103. (10.1109/ASICON.2017.8252421)
  DOI : 10.1109/ASICON.2017.8252421
• A Game Theoretical Model for Optimal Distribution of Network Security Resources
  
  • Ismail Ziad
  • Kiennert Christophe
  • Leneutre Jean
  • Chen Lin
  , 2017. Enforcing security in a network always comes with a trade-off regarding budget constraints, entailing unavoidable choices for the deployment of security equipment over the network. Therefore, finding the optimal distribution of security resources to protect the network is necessary. In this paper, we focus on Intrusion Detection Systems (IDSs), which are among the main components used to secure networks. However, configuring and deploying IDSs efficiently to optimize attack detection and mitigation remain a challenging task. In particular, in networks providing critical services, optimal IDS deployment depends on the type of interdependencies that exists between vulnerable network equipment. In this paper, we present a game theoretical analysis for optimizing intrusion detection in such networks. First, we present a set of theoretical preliminary results for resource constrained network security games. Then, we formulate the problem of intrusion detection as a resource constrained network security game where interdependencies between equipment vul-nerabilities are taken into account. Finally, we validate our model numerically via a real world case study. (10.1007/978-3-319-68711-7_13)
  DOI : 10.1007/978-3-319-68711-7_13
• Novel market approach for locally balancing renewable energy production and flexible demand
  
  • Horta José
  • Kofman Daniel
  • Menga David
  • Silva Alonso
  , 2017, pp.533-539. Future electricity distribution grids will host a considerable share of variable renewable energy sources and local storage resources. Moreover, they will face new load structures due for example to the growth of the electric vehicle market. These trends raise the need for new paradigms for distribution grids operation, in which Distribution System Operators will increasingly rely on demand side flexibility and households will progressively become prosumers playing an active role on smart grid energy management. However, in present energy management architectures, the lack of coordination among actors limits the capability of the grid to enable the mentioned trends. In this paper we tackle this problem by proposing an architecture that enables households to autonomously exchange energy blocks and flexibility services with neighbors, operators and market actors. The solution is based on a blockchain transactive platform. We focus on a market application, where households can trade energy with their neighbors, aimed to locally balancing renewable energy production. We propose a market mechanism and dynamic transport prices that provide an incentive for households to locally manage energy resources in a way that responds to both pro-sumer and operator needs. We evaluate the impact of such markets through comprehensive simulations using power flow analysis and realistic load profiles, providing valuable insight for the design of appropriate mechanisms and incentives. (10.1109/SmartGridComm.2017.8340728)
  DOI : 10.1109/SmartGridComm.2017.8340728
• Codestrates: Literate Computing with Webstrates
  
  • Rädle Roman
  • Nouwens Midas
  • Antonsen Kristian B
  • Eagan James
  • Klokmose Clemens Nylandsted
  , 2017. (10.1145/3126594.3126642)
  DOI : 10.1145/3126594.3126642
• Using YAGO for the Humanities
  
  • Rebele Thomas
  • Nekoei Arash
  • Suchanek Fabian M.
  , 2017. In this paper, we study how data from the Semantic Web can be used for case studies in the Humanities. We conduct a proof of concept, using the YAGO knowledge base to study life expectancy, birth rates, and the age at childbirth over time. We also discuss the information extraction methods that we used to make YAGO sufficiently complete for these analyses to work.
• VICKEY: Mining Conditional Keys on Knowledge Bases
  
  • Symeonidou Danai
  • Galárraga Luis
  • Pernelle Nathalie
  • Saïs Fatiha
  • Suchanek Fabian
  , 2017, 10587, Chapter 39. A conditional key is a key constraint that is valid in only a part of the data. In this paper, we show how such keys can be mined automatically on large knowledge bases (KBs). For this, we combine techniques from key mining with techniques from rule mining. We show that our method can scale to KBs of millions of facts. We also show that the conditional keys we mine can improve the quality of entity linking by up to 47% points. (10.1007/978-3-319-68288-4_39)
  DOI : 10.1007/978-3-319-68288-4_39
• Visualizing the addition of missing words to regular expressions
  
  • Rebele Thomas
  • Tzompanaki Katerina
  • Suchanek Fabian M.
  , 2017. Regular expressions are used in many information extraction systems like YAGO, DBpedia, Gate and SystemT. However, they sometimes do not match what their creator wanted to find. We investigate how missing words can be added automatically to a regular expression by creating disjunctions at the appropriate positions. Our demo visualizes the steps that our algorithm employs to repair the regular expression.
• Not Just Pointing: Shannon's Information Theory as a General Tool for Performance Evaluation of Input Techniques
  
  • Guiard Yves
  • Gori Julien
  • Roy Quentin
  • Rioul Olivier
  , 2017. Input techniques serving, quite literally, to allow users to send information to the computer, the information theoretic approach seems tailor-made for their quantitative evaluation. Shannon's framework makes it straightforward to measure the performance of any technique as an effective information transmission rate, in bits/s. Apart from pointing, however, evaluators of input techniques have generally ignored Shannon, contenting themselves with less rigorous methods of speed and accuracy measurements borrowed from psychology. We plead for a serious consideration in HCI of Shannon's information theory as a tool for the evaluation of all sorts of input techniques. We start with a primer on Shannon's basic quantities and the theoretical entities of his communication model. We then discuss how the concepts should be applied to the input techniques evaluation problem. Finally we outline two concrete methodologies, one focused on the discrete timing and the other on the continuous time course of information gain by the computer.
• An efficient data protection architecture based on fragmentation and encryption
  
  • Qiu Han
  , 2017. In this thesis, a completely revisited data protection scheme based on selective encryption is presented. First, this new scheme is agnostic in term of data format, second it has a parallel architecture using GPGPU allowing performance to be at least comparable to full encryption algorithms. Bitmap, as a special uncompressed multimedia format, is addressed as a first use case. Discrete Cosine Transform (DCT) is the first transformation for splitting fragments, getting data protection, and storing data separately on local device and cloud servers. This work has largely improved the previous published ones for bitmap protection by providing new designs and practical experimentations. General purpose graphic processing unit (GPGPU) is exploited as an accelerator to guarantee the efficiency of the calculation compared with traditional full encryption algorithms. Then, an agnostic selective encryption based on lossless Discrete Wavelet Transform (DWT) is presented. This design, with practical experimentations on different hardware configurations, provides strong level of protection and good performance at the same time plus flexible storage dispersion schemes. Therefore, our agnostic data protection and transmission solution combining fragmentation, encryption, and dispersion is made available for a wide range of end-user applications. Also a complete set of security analysis are deployed to test the level of provided protection.
• A Lightweight IoT Security Protocol
  
  • Hammi Mohamed Tahar
  • Livolant Erwan
  • Bellot Patrick
  • Serhrouchni Ahmed
  • Minet Pascale
  , 2017. The IoT is a technology that enables the inter-connection of smart physical and virtual objects and provides advanced services. Objects or things are generally constrained devices which are limited by their energy, computing and storage capacity. A Wireless Sensor Networks (WSN) is a network composed of devices managed by a CPAN (Personal Area Network Coordinator). The network is used in order to gather and process data of a given environment. It is characterized by their low bit rate and low power consumption, and it uses small size packet in their transmissions. In order to protect the WSN, a mutual authentication between devices is required during the association of a new device. The exchanged data should be authenticated and encrypted. In this work we propose a robust, lightweight and energy-efficient security protocol for the WSN systems. The real tests we made and a performance evaluation of our security protocol are provided.