Bernard Tourancheau

Prof. Dr. Bernard Tourancheau

Laboratoire d'Informatique de Grenoble, Université Grenoble Alpes (Joseph Fourier), Bâtiment IMAG, 700 Avenue Centrale, 38401 Saint-Martin-d'Hères, France
orcid

Research Focus & Metrics

Academic Career Length

32Years (1995-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 December 2019
Verified
Conference Paper
Open access
TATakwa Attia
Takwa Attia
MHMartin Heusse
Martin Heusse
Bernard TourancheauBernard Tourancheau
Bernard Tourancheau
ADAndrzej Duda
Andrzej Duda
In this paper, we present the results of extensive experiments on a testbed in the The Things Network (TTN), a public LoRa network. We evaluate the transmission quality of LoRa links by measuring the Packet Reception Rate (PRR) as a function of the payload length. The results show that there is only a slight impact of the payload length on PRR, which means that the bit error rate does not strongly influence the probability of packet reception. Our measurements show that the LoRa channel behaves like a slow fading Rayleigh channel, which translates into probability Ps of being (or not) in a favorable condition for each frame reception: once the frame preamble is received, there is great chance that the whole frame is correctly received. Probability Ps depends on the Spreading Factor and the Signal to Noise Ratio, and often becomes a dominant factor of successful reception depending on the signal strength at a gateway.

9 January 2017 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
‪V‪Mališa Vučinić
‪Mališa Vučinić
MKMichal Krol
Michal Krol
BJBaptiste Jonglez
Baptiste Jonglez
TCTitouan Coladon
Titouan Coladon
Bernard TourancheauBernard Tourancheau
Bernard Tourancheau
Embedded devices of the Internet of Things form the so-called low-power and lossy networks. In these networks, nodes are constrained in terms of energy, memory, and processing. Links are lossy and exhibit a transient behavior. From the point of view of energy expenditure, governing control overhead emission is crucial and is the role of the Trickle algorithm. We address Trickle's fairness problem to evenly distribute the transmission load across the network, while keeping the total message count low. First, we analytically analyze two underlying causes of unfairness in Trickle networks: 1) desynchronization among nodes and 2) nonuniform topologies. Based on our analysis, we propose a first algorithm whose performance and parameters we study in an emulated environment. From this feedback, we design a second algorithm Trickle-D that adapts the redundancy parameter to achieve high fairness while keeping the transmission load low. We validate Trickle-D in real-life conditions using a large scale experimental testbed. Trickle-D requires minimal changes to Trickle, zero user input, emits 17.7% less messages than state-of-the-art and 37.2% less messages than state-of-practice, while guaranteeing high fairness across the network.

2 April 2021 in Computers
Verified
Journal Article
Open access
PDF file
UCUlysse Coutaud
Ulysse Coutaud
MHMartin Heusse
Martin Heusse
Bernard TourancheauBernard Tourancheau
Bernard Tourancheau
We characterize the LoRa channel in terms of multi-path fading, loss burstiness, and assess the benefits of Forward Error Correction as well as the influence of frame length. We make these observations by synthesizing extensive experimental measurements realized with The Things Network in a medium size city. We then propose to optimize the LoRaWAN Adaptive Data Rate algorithm based on this refined LoRa channel characterization and taking into account the LoRaWAN inherent macro-diversity from multi-gateway reception. Firstly, we propose ADRopt, which adjusts Spreading Factor and frame repetition number to maintain the communication below a target Packet Error Rate ceiling with optimized Time-On-Air. Secondly, we propose ADRIFECC, an extension of ADRopt in case an Inter-Frame Erasure Correction Code is available. The resulting protocol provides very high reliability even over low quality channels, with comparable Time on Air and similar downlink usage as the currently deployed mechanism. Simulations corroborate the analysis, both over a synthetic random wireless link and over replayed real-world packet transmission traces.

1 June 1995 in Parallel Processing Letters
Verified
Journal Article
Closed access
FDF. Desprez
F. Desprez
JDJ. J. Dongarra
J. J. Dongarra
Bernard TourancheauBernard Tourancheau
Bernard Tourancheau

21 March 2021 in Sensors
Verified
Journal Article
Open access
PDF file
TCTimothy Claeys
Timothy Claeys
‪V‪Mališa Vučinić
‪Mališa Vučinić
TWThomas Watteyne
Thomas Watteyne
FRFranck Rousseau
Franck Rousseau
Bernard TourancheauBernard Tourancheau
Bernard Tourancheau
This paper presents a thorough comparison of the Transport Layer Security (TLS) v1.2 and Datagram TLS (DTLS) v1.2 handshake in 6TiSCH networks. TLS and DTLS play a crucial role in protecting daily Internet traffic, while 6TiSCH is a major low-power link layer technology for the IoT. In recent years, DTLS has been the de-facto security protocol to protect IoT application traffic, mainly because it runs over lightweight, unreliable transport protocols, i.e., UDP. However, unlike the DTLS record layer, the handshake requires reliable message delivery. It, therefore, incorporates sequence numbers, a retransmission timer, and a fragmentation algorithm. Our goal is to study how well these mechanisms perform, in the constrained setting of 6TiSCH, compared to TCP’s reliability algorithms, relied upon by TLS. We port the mbedTLS library to OpenWSN, a 6TiSCH reference implementation, and deploy the code on the state-of-the-art OpenMote platform. We show that, when the peers use an ideal channel, the DTLS handshake uses up to 800 less and completes 0.6 s faster. Nonetheless, using an unreliable communication link, the DTLS handshake duration suffers a performance penalty of roughly 45%, while TLS’ handshake duration degrades by merely 15%. Similarly, the number of exchanged bytes doubles for DTLS while for TLS the increase is limited to 15%. The results indicate that IoT product developers should account for network characteristics when selecting a security protocol. Neglecting to do so can negatively impact the battery lifetime of the entire constrained network.

1 January 2018 in International Journal of Ad Hoc and Ubiquitous Computing
Verified
Journal Article
Open access
LSLeila Ben Saad
Leila Ben Saad
Bernard TourancheauBernard Tourancheau
Bernard Tourancheau
Due to the scarce energy resources of sensor nodes, wireless sensor networks (WSNs) need strategies to optimise the energy consumption of sensors to extend the network lifetime. However, improving the lifetime of WSNs remains a very challenging problem. Since, a sensor device spends most of its energy in transmitting packets, it is important to shorten the length of these packets through data compression. Nevertheless, compression deals only with data while address compression is not considered. In this work, Slepian-Wolf source coding and address allocation are used jointly to reduce the size of the emitted addresses and improve the network lifetime. The proposed approach is studied in both cluster-based and multi-hop networks where two address allocation algorithms, that guarantee high correlation between addresses, are proposed. The simulation results show that a significant network lifetime improvement can be achieved by using this solution in both cluster-based and multi-hop networks.