Publications

2019

• Square Wave Emission in a Mid-infrared Quantum Cascade Oscillator Under Rotated Polarization
  
  • Spitz O
  • Herdt A
  • Carras M.
  • Elsässer W
  • Grillot F.
  , 2019. Quantum cascade lasers, which are known to only emit a transverse-magnetic wave under free-running operation, can output a square wave with transverse-electric emission under polarization-rotated feedback. (10.1364/CLEO_SI.2019.SW3N.2)
  DOI : 10.1364/CLEO_SI.2019.SW3N.2
• Controlling the Likelihood of Extreme Pulses in a Quantum Cascade Laser with Optical Feedback and Bias Perturbation
  
  • Spitz O
  • Wu J.
  • Carras M.
  • Wong C. W
  • Grillot F.
  , 2019. We experimentally generate controllable extreme pulses in a mid-infrared quantum cascade laser with external optical injection and square wave perturbation. (10.23919/CLEO.2019.8749397)
  DOI : 10.23919/CLEO.2019.8749397
• Common mathematical framework for stochastic reverberation models
  
  • Badeau Roland
  Journal of the Acoustical Society of America, Acoustical Society of America, 2019, 145 (4), pp.2733-2745. In the field of room acoustics, it is well known that reverberation can be character-1 ized statistically in a particular region of the time-frequency domain (after the tran-2 sition time and above Schroeder's frequency). Since the 1950s, various formulas have 3 been established, focusing on particular aspects of reverberation: exponential decay 4 over time, correlations between frequencies, correlations between sensors at each fre-5 quency, and time-frequency distribution. In this paper, we introduce a stochastic 6 reverberation model, that permits us to retrieve all these well-known results within 7 a common mathematical framework. To the best of our knowledge, this is the first 8 time that such a unification work is presented. The benefits are multiple: several 9 formulas generalizing the classical results are established, that jointly characterize 10 the spatial, temporal and spectral properties of late reverberation. 11 (10.1121/1.5096153)
  DOI : 10.1121/1.5096153
• Poster Abstract: The Challenge of a Common Core Backbone Network on Future Aircrafts
  
  • Delmas Thibault
  • Iannone Luigi
  • Garcia Jean-Pierre
  • Monsuez Bruno
  , 2019, pp.1075-1076. (10.1109/INFCOMW.2019.8845173)
  DOI : 10.1109/INFCOMW.2019.8845173
• Weighted Sum-Rate Maximization in Multi-Carrier NOMA with Cellular Power Constraint
  
  • Salaun Lou
  • Coupechoux Marceau
  • Shue Chen Chung
  , 2019, pp.451-459. Non-orthogonal multiple access (NOMA) has received significant attention for future wireless networks. NOMA outperforms orthogonal schemes, such as OFDMA, in terms of spectral efficiency and massive connectivity. The joint subcarrier and power allocation problem in NOMA is NP-hard to solve in general, due to complex impacts of signal superposition on each user's achievable data rates, as well as combinatorial constraints on the number of multiplexed users per sub-carrier to mitigate error propagation. In this family of problems, weighted sum-rate (WSR) is an important objective function as it can achieve different tradeoffs between sum-rate performance and user fairness. We propose a novel approach to solve the WSR maximization problem in multi-carrier NOMA with cellular power constraint. The problem is divided into two polynomial time solvable sub-problems. First, the multi-carrier power control (given a fixed subcarrier allocation) is non-convex. By taking advantage of its separability property, we design an optimal and low complexity algorithm (MCPC) based on projected gradient descent. Secondly, the single-carrier user selection is a non-convex mixed-integer problem that we solve using dynamic programming (SCUS). This work also aims to give an understanding on how each sub-problem's particular structure can facilitate the algorithm design. In that respect, the above MCPC and SCUS are basic building blocks that can be applied in a wide range of resource allocation problems. Furthermore, we propose an efficient heuristic to solve the general WSR maximization problem by combining MCPC and SCUS. Numerical results show that it achieves near-optimal sum-rate with user fairness, as well as significant performance improvement over OMA. (10.1109/INFOCOM.2019.8737495)
  DOI : 10.1109/INFOCOM.2019.8737495
• Authenticated and Privacy-Preserving Consent Management in the Internet of Things
  
  • Laurent Maryline
  • Leneutre Jean
  • Chabridon Sophie
  • Laaouane Imane
  , 2019, 151, pp.256-263. As the Internet of Things (IoT) starts providing meaningful solutions in multiple domains, users expect to take full advantage of the features and benefits of smart devices, but not at the cost of privacy loss. They want to keep control over their own data, e.g. through consent and authorization management. This paper proposes a lightweight privacy-preserving solution for managing user's consent relative to specific purposes (obligations). The originality of our proposal is manyfold. First, the consent is issued cryptographically by the user over some consented specific purposes, thus it protects both the user and the service provider against possible repudiations. Second, the users' privacy is preserved as the protocol supports untraceability over the channel, and pseudonymity with regard to the service provider. Pseudonyms are fully managed by the users themselves through suitable use of Hierarchical Identity-Based Signature (HIBS). Third, the solution is lightweight in terms of communication and computation, thus making it suitable for IoT resource constrained environments. Fourth, an illustrative car-sharing use case is presented where users are able to personalize their driving experience. Fifth, a formal validation of the protocol is provided with the AVISPA tool, along with an informal security and privacy analysis. Sixth, our approach addresses part of the European General Data Protection Regulation (GDPR), as it supports user consent management and helps providers with handling accountability. (10.1016/j.procs.2019.04.037)
  DOI : 10.1016/j.procs.2019.04.037
• Chaining your Virtual Private Clouds with Segment Routing
  
  • Spinelli Francesco
  • Iannone Luigi
  • Tollet Jerome
  , 2019, pp.1027-1028. In recent years, next to Cloud Computing, Network Function Virtualization (NFV) has emerged as one of the most interesting paradigm inside the ICT world, leading to unexplored scenarios and new features such as Service Chaining. The latter is the capability where packets are steered through a sequence of services on their way to the destination. These services could also be located inside different Public Cloud Regions, hence giving us the possibility to exploit for the first time a Multi-Cloud approach. One way to actually perform Service Chaining is through the new Segment Routing protocol for IPv6. Within this context we have started to investigate how we could create inside Amazon Web Services a Multi-Cloud configuration to provide Service Chaining. As an initial step, we have deployed, inside an Amazon Virtual Private Cloud, a software router compatible with Segment Routing called Vector Packet Processing (VPP). Then, we have automated its deployment with Terraform, a Cloud Orchestrator tool. Afterwards, taking advantage of our scripts, we have repeated the same configuration in different Amazons Region, connecting them together through Segment Routing protocol. Finally, we started a first extensive measurements campaign, looking in particular on how VPP and Segment Routing presence could affect the overall performance inside Amazon Web Services. (10.1109/INFCOMW.2019.8845113)
  DOI : 10.1109/INFCOMW.2019.8845113
• Poster Abstract: Secure Data Sharing by Means of Fragmentation, Encryption, and Dispersion
  
  • Kapusta Katarzyna
  • Qiu Han
  • Memmi Gérard
  , 2019, pp.1051-1052. (10.1109/INFCOMW.2019.8845243)
  DOI : 10.1109/INFCOMW.2019.8845243
• Finding Next Service Hop with NFV-Routers
  
  • Wion Adrien
  • Bouet Mathieu
  • Iannone Luigi
  • Conan Vania
  , 2019, pp.1017-1018. (10.1109/INFCOMW.2019.8845237)
  DOI : 10.1109/INFCOMW.2019.8845237
• Content-Prefetching and Broadcast-Scheduling in Vehicular Networks with a Realistic Channel Model
  
  • Berri Sara
  • Zhang Jun
  • Bensaou Brahim
  • Labiod Houda
  , 2019.
• Procédé d’aide à la conduite fiable pour l’embarquement et débarquement d’un véhicule cargo communicant sécurisé
  
  • Monteuuis Jean-Philippe
  • Zhang Jun J.
  • Labiod Houda
  • Mafrica Stefano
  • Servel Alain
  , 2019.
• Procédé de détection de la plausibilité des données V2X basé sur l’agrégation des techniques de mesures du signal radio
  
  • Monteuuis Jean-Philippe
  • Zhang Jun J.
  • Labiod Houda
  • Servel Alain
  • Mafrica Stefano
  , 2019.
• Procédé d’aide à la conduite sur un aéroport/port à l’aide d’une infrastructure communicante
  
  • Monteuuis Jean-Philippe
  • Zhang Jun J.
  • Labiod Houda
  • Servel Alain
  • Mafrica Stefano
  , 2019.
• Analysis and optimization of a wideband metamaterial absorber made of composite materials
  
  • Rance Olivier
  • Lepage Anne Claire
  • Begaud Xavier
  • Soiron Michel
  • Barka André
  • Parneix Patrick
  Applied physics. A, Materials science & processing, Springer Verlag, 2019. Using structural composite materials for the fabrication of Radar Absorbing Materials (RAM) allows combining the strong load bearing capability with the radar absorbing functionality in a unique structure. This article shows the possibility to transpose an already existing metamaterial absorber to the domain of composite materials. The dielectric layers of the absorber initially designed with radio-frequency (RF) materials are replaced with fiber-reinforced composite materials and their thickness is optimized again. The working principle of the absorber is explained layer by layer on the Smith chart. The performances of the composite absorber are compared against the initial RF design and against other classical absorbers. The composite design has a total thickness of 8.9 mm and achieves a reflection coefficient below 14 dB within the band 4.6 GHz - 17.2 GHz at normal incidence. The reflection coefficient remains under -10 dB at oblique incidence up to 45°. (10.1007/s00339-019-2653-2)
  DOI : 10.1007/s00339-019-2653-2
• A CLT for linear spectral statistics of large random information-plus-noise matrices
  
  • Banna Marwa
  • Najim Jamal
  • Yao Jianfeng
  , 2019. Consider a matrix ${\rm Y}_n= \frac{\sigma}{\sqrt{n}} {\rm X}_n +{\rm A}_n, $ where $\sigma>0$ and ${\rm X}_n=(x_{ij}^n)$ is a $N\times n$ random matrix with i.i.d. real or complex standardized entries and ${\rm A}_n$ is a $N\times n$ deterministic matrix with bounded spectral norm. The fluctuations of the linear spectral statistics of the eigenvalues: $$ \mathrm{Trace}\, f({\rm Y}_n {\rm Y}_n^*) = \sum_{i=1}^N f(\lambda_i),\quad (\lambda_i)\ \mathrm{eigenvalues\ of}\ {{\rm Y}}_n {{\rm Y}}_n^*, $$ are shown to be gaussian, in the case where $f$ is a smooth function of class $C^3$ with bounded support, and in the regime where both dimensions of matrix ${{\rm Y}}_n$ go to infinity at the same pace. The CLT is expressed in terms of vanishing Lévy-Prohorov distance between the linear statistics' distribution and a centered Gaussian probability distribution, the variance of which depends upon $N$ and $n$ and may not converge.
• On good polynomials over finite fields for optimal locally recoverable codes
  
  • Mesnager Sihem
  , 2019, 11445, pp.257–268. [This is an extended abstract of the paper [3]] A locally recoverable (LRC) code is a code that enables a simple recovery of an erased symbol by accessing only a small number of other symbols. LRC codes currently form one of the rapidly developing topics in coding theory because of their applications in distributed and cloud storage systems. In 2014, Tamo and Barg have presented in a very remarkable paper a family of LRC codes that attain the maximum possible (minimum) distance (given code length, cardinality, and locality). The key ingredient for constructing such optimal linear LRC codes is the so-called r-good polynomials, where r is equal to the locality of the LRC code. In this extended abstract, we review and discuss good polynomials over finite fields for constructing optimal LRC codes. (10.1007/978-3-030-16458-4_15)
  DOI : 10.1007/978-3-030-16458-4_15
• Cache-Timing Attacks Still Threaten IoT Devices
  
  • Takarabt Sofiane
  • Schaub Alexander
  • Facon Adrien
  • Guilley Sylvain
  • Sauvage Laurent
  • Souissi Youssef
  • Mathieu Yves
  , 2019, 11445, pp.13-30. Deployed widely and embedding sensitive data, IoT devices depend on the reliability of cryptographic libraries to protect user information. However when implemented on real systems, cryptographic algorithms are vulnerable to side channel attacks based on their execution behavior, which can be revealed by measurements of physical quantities such as timing or power consumption. Some countermeasures can be implemented in order to prevent those attacks. However those countermeasures are generally designed at high level description, and when implemented, some residual leakage may persist. In this article we propose a methodology to assess the robustness of the MbedTLS library against timing and cache-timing attacks. This comprehensive study of side-channel security allows us to identify the most frequent weaknesses in software cryptographic code and how those might be fixed. This methodology checks the whole source code, from the top level routines to low level primitives, that are used for the final application. We recover hundreds of lines of code that leak sensitive information. (10.1007/978-3-030-16458-4_2)
  DOI : 10.1007/978-3-030-16458-4_2
• Formal Method for RailWays Disasters prevention
  
  • Belabed Lilia
  • Tanzi Tullio Joseph
  • Coudert Sophie
  , 2019, 516, pp.161-170.
• Modularity-based Sparse Soft Graph Clustering
  
  • Hollocou Alexandre
  • Bonald Thomas
  • Lelarge Marc
  , 2019. Clustering is a central problem in machine learning for which graph-based approaches have proven their efficiency. In this paper, we study a relaxation of the modularity maxi-mization problem, well-known in the graph partitioning literature. A solution of this relaxation gives to each element of the dataset a probability to belong to a given cluster, whereas a solution of the standard modular-ity problem is a partition. We introduce an efficient optimization algorithm to solve this relaxation, that is both memory efficient and local. Furthermore, we prove that our method includes, as a special case, the Louvain optimization scheme, a state-of-the-art technique to solve the traditional modularity problem. Experiments on both synthetic and real-world data illustrate that our approach provides meaningful information on various types of data.
• Data Center’s Energy Savings for Data Transport via TCP on Hybrid Optoelectronic Switches
  
  • Minakhmetov Artur
  • Iannone Luigi
  • Ware Cédric
  IEEE Photonics Technology Letters, Institute of Electrical and Electronics Engineers, 2019, 31 (8), pp.631-634. We report on possible 75% lower energy consumption for packet transport in data center networks replacing Electronic with Hybrid Optical Packet Switching (optical switches with a shared electronic buffer) combined with enhanced Transmission Control Protocol. (10.1109/LPT.2019.2902980)
  DOI : 10.1109/LPT.2019.2902980
• On information-centric routing and forwarding in the internet of things
  
  • Enguehard Marcel
  , 2019. As the Internet of Things (IoT) has brought upon new communication patterns and challenges, Information-Centric Networking (ICN) has been touted as a potential solution. To confirm that hypothesis, the fundamental issue of routing and forwarding in the ICN-IoT must be addressed. This thesis investigates this topic across the IoT architecture.First, a scheme to securely forward ICN interests packets based on geographic coordinates is proposed for low-power wireless sensor networks (WSN). Its efficiency is compared to an optimized flooding-based scheme similar to current ICN-WSN approaches in terms of deployability and scalability using an analytical model. Realistic data for the model is derived from a mixture of simulation, literature study, and experiments on state-of-the-art sensor boards. Geographic forwarding is shown to halve the memory footprint of the ICN stack on reference deployments and to yield significant energy savings, especially for dynamic topologies. Second, ICN is used to enhance admission control (AC) to fixed-capacity Edge-computing platforms to guarantee request-completion time for latency-constrained applications. The LRU-AC, a request-aware AC strategy based on online learning of the request popularity distribution through a Least-Recently-Used (LRU) filter, is proposed. Using a queueing model, the LRU-AC is shown to decrease the number of requests that must be offloaded to the Cloud. An implementation of the LRU-AC on FPGA hardware is then proposed, using Ageing Bloom Filters (ABF) to provide a compact memory representation. The validity of using ABFs for the LRU-AC is proven through analytical modelling. The implementation provides high throughput and low latency.Finally, the management and virtualization of ICN-IoT networks are considered.vICN (virtualized ICN), a unified intent-based framework for network configuration and management that uses recent progress in resource isolation and virtualization techniques is introduced. It offers a single, flexible and scalable platform to serve different purposes, ranging from reproducible large-scale research experimentation to demonstrations with emulated and/or physical devices and network resources and to real deployments of ICN in existing IP networks.
• CaTch: A Confidence Range Tolerant Misbehavior Detection Approach
  
  • Kamel Joseph
  • Kaiser Arnaud
  • Jemaa Ines Ben
  • Cincilla Pierpaolo
  • Urien Pascal
  , 2019. Misbehavior detection is a challenging problem that needs to be addressed in vehicular communications. Misbe-havior detection consists of monitoring the semantic of the exchanged messages to identify potential misbehaving entities. This is achieved by performing plausibility and consistency checks on exchanged beacon and warning messages. However, existing misbehavior detection solutions ignore the mandatory information on data inaccuracy, being gathered by the vehicular sensors. In this paper, we propose CaTch, an embedded misbehavior detection solution that integrates data inaccuracy when performing plausibility and consistency checks. Through extensive simulations, we show that CaTch is able to attribute an accurate uncertainty factor to misbehaving nodes and that it performs better than the state-of-the-art solutions.
• On the performance of ESPAR for spatial multiplexing in reception
  
  • Bucheli Garcia Juan Carlos
  • Kamoun Mohamed
  • Sibille Alain
  , 2019, pp.1-5. (10.1109/WCNC.2019.8885547)
  DOI : 10.1109/WCNC.2019.8885547
• Reconfigurable passive relaying array for coverage enhancement
  
  • Garcia Juan Carlos Bucheli
  • Kamoun Mohamed
  • Sibille Alain
  , 2019, pp.1-6. (10.1109/WCNC.2019.8885448)
  DOI : 10.1109/WCNC.2019.8885448
• Guessing a secret cryptographic key from side-channel leakages
  
  • Cheng Wei
  • Rioul Olivier
  • Guilley Sylvain
  , 2019.