scispace - formally typeset
Search or ask a question
Author

Reinhardt Euler

Bio: Reinhardt Euler is an academic researcher from University of Western Brittany. The author has contributed to research in topics: Wireless sensor network & Distributed algorithm. The author has an hindex of 12, co-authored 92 publications receiving 605 citations. Previous affiliations of Reinhardt Euler include European University of Brittany & Centre national de la recherche scientifique.


Papers
More filters
Journal ArticleDOI
TL;DR: This work proposes a new technique for the dimensionality reduction using Copulas and the LU-decomposition (Forward Substitution) method, which is compared favorably with existing approaches on real-world datasets.
Abstract: Sampling-based dimensionality reduction technique.Eliminating linearly redundant combined dimensions.Providing a convenient way to generate correlated multivariate random variables.Maintaining the integrity of the original information.Reducing the dimension of data space without losing important information. The recent trends in collecting huge and diverse datasets have created a great challenge in data analysis. One of the characteristics of these gigantic datasets is that they often have significant amounts of redundancies. The use of very large multi-dimensional data will result in more noise, redundant data, and the possibility of unconnected data entities. To efficiently manipulate data represented in a high-dimensional space and to address the impact of redundant dimensions on the final results, we propose a new technique for the dimensionality reduction using Copulas and the LU-decomposition (Forward Substitution) method. The proposed method is compared favorably with existing approaches on real-world datasets: Diabetes, Waveform, two versions of Human Activity Recognition based on Smartphone, and Thyroid Datasets taken from machine learning repository in terms of dimensionality reduction and efficiency of the method, which are performed on statistical and classification measures.

56 citations

Journal ArticleDOI
01 Sep 2017
TL;DR: A balanced multi-path routing algorithm by focusing on the residual energy and the hop count of each node to discover the best routes and to insert them into the routing table is proposed.
Abstract: A large use of applications of Wireless Sensor Networks (WSNs) pushes researchers to design and improve protocols and algorithms against the encountered challenges. One of the main goals is data gathering and routing to the base station (through the sink nodes) with lack of acknowledgement and where each node has no information about the network. Unbalanced energy consumption during the data routing process is an inherent problem in WSNs due to the limited energy capacity of the sensor nodes. In fact, WSNs require load balancing algorithms that make judicious use of the limited energy resource to route the gathered data to the sink node. In this paper, we propose a balanced multi-path routing algorithm by focusing on the residual energy and the hop count of each node to discover the best routes and to insert them into the routing table. The main idea of this algorithm comes from Ant Colony Optimization (ACO) and automata network modelization. Hence, the potential performance of the proposed algorithm relies on the best route to be selected which should have the minimum number of hops, the maximum energy and weighted energy between participating nodes to extend the lifetime of the network.

51 citations

Journal ArticleDOI
01 Mar 2017
TL;DR: A new algorithm called D-LPCN (Distributed Least Polar-angle Connected Node) is proposed which represents the distributed version of the LPCN algorithm and its distributed version is less energy consuming than the centralized version.
Abstract: A boundary of wireless sensor networks (WSNs) can be used in many fields, for example, to monitor a frontier or a secure place of strategic sensitive sites like oil fields or frontiers of a country. This situation is modeled as the problem of finding a polygon hull in a connected Euclidean graph, which represents a minimal set of connected boundary nodes. In this paper we propose a new algorithm called D-LPCN (Distributed Least Polar-angle Connected Node) which represents the distributed version of the LPCN algorithm introduced in [1]. In each iteration, any boundary node, except the first one, chooses its nearest polar angle node among its neighbors with respect to the node found in the previous iteration. The first starting node can be automatically determined using the Minimum Finding algorithm, which has two main advantages. The first one is that the algorithm works with any type of a connected network, given as planar or not. Furthermore, it takes into account any blocking situation and contains the necessary elements to avoid them. The second advantage is that the algorithm can determine all the boundaries of the different connected parts of the network. The proposed algorithm is validated using the CupCarbon, Tossim and Contiki simulators. It has also been implemented using real sensor nodes based on the TelosB and Arduino/XBee platforms. We have estimated the energy consumption of each node and we have found that the consumption of the network depends on the number of the boundary nodes and their neighbors. The simulation results show that the proposed algorithm is less energy consuming than the existing algorithms and its distributed version is less energy consuming than the centralized version.

36 citations

Proceedings ArticleDOI
22 Jun 2015
TL;DR: A Field Programmable Gate Array (FPGA) implementation based on a Bayesian network (BN) representation, that allows to continuously monitor the embedded system under time and resource constraints is proposed.
Abstract: Critical systems, like Unmanned Aerial Systems (UAS) operate in uncertain environments and have to face unexpected obstacles, weather changes and sensor, hardware or software failures. Therefore, a health management system is needed to detect and locate the failure in real time. In this paper, we propose a Field Programmable Gate Array (FPGA) implementation based on a Bayesian network (BN) representation, that allows to continuously monitor the embedded system under time and resource constraints. The hardware implementation is generated by a specific off-line framework integrating a high-level synthesis tool. The proposal is evaluated on a hybrid reconfigurable device to show potential speed-up. Some variations on the hardware implementation are also explored to give the best trade-off between accuracy, performance and resource allocation.

29 citations

Journal ArticleDOI
06 Jun 2020
TL;DR: A new scalable encryption technique, called FlexenTech, to protect IoT data during storage and in transit, which offers a low encryption time, defends against common attacks such as replay attacks and defines a configurable mode, where any number of rounds or key sizes may be used.
Abstract: IoT promises a new era of connectivity that goes beyond laptops and smart connected devices to connected vehicles, smart homes, smart cities and connected healthcare. The huge volume of data that is collected from millions of IoT devices raises information security and privacy concerns for users. This paper presents a new scalable encryption technique, called Flexible encryption Technique (FlexenTech), to protect IoT data during storage and in transit. FlexenTech is suitable for resource constrained devices and networks. It offers a low encryption time, defends against common attacks such as replay attacks and defines a configurable mode, where any number of rounds or key sizes may be used. Experimental analysis of FlexenTech shows its robustness in terms of its multiple configurable confidentiality levels by allowing various configurations. This configurability provides several advantages for resource constrained devices, including reducing the encryption computation time by up to 9.7% when compared to its best rivals in the literature.

25 citations


Cited by
More filters
Journal ArticleDOI

[...]

08 Dec 2001-BMJ
TL;DR: There is, I think, something ethereal about i —the square root of minus one, which seems an odd beast at that time—an intruder hovering on the edge of reality.
Abstract: There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality. Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

33,785 citations

01 Jan 2010
TL;DR: This journal special section will cover recent progress on parallel CAD research, including algorithm foundations, programming models, parallel architectural-specific optimization, and verification, as well as other topics relevant to the design of parallel CAD algorithms and software tools.
Abstract: High-performance parallel computer architecture and systems have been improved at a phenomenal rate. In the meantime, VLSI computer-aided design (CAD) software for multibillion-transistor IC design has become increasingly complex and requires prohibitively high computational resources. Recent studies have shown that, numerous CAD problems, with their high computational complexity, can greatly benefit from the fast-increasing parallel computation capabilities. However, parallel programming imposes big challenges for CAD applications. Fully exploiting the computational power of emerging general-purpose and domain-specific multicore/many-core processor systems, calls for fundamental research and engineering practice across every stage of parallel CAD design, from algorithm exploration, programming models, design-time and run-time environment, to CAD applications, such as verification, optimization, and simulation. This journal special section will cover recent progress on parallel CAD research, including algorithm foundations, programming models, parallel architectural-specific optimization, and verification. More specifically, papers with in-depth and extensive coverage of the following topics will be considered, as well as other topics relevant to the design of parallel CAD algorithms and software tools. 1. Parallel algorithm design and specification for CAD applications 2. Parallel programming models and languages of particular use in CAD 3. Runtime support and performance optimization for CAD applications 4. Parallel architecture-specific design and optimization for CAD applications 5. Parallel program debugging and verification techniques particularly relevant for CAD The papers should be submitted via the Manuscript Central website and should adhere to standard ACM TODAES formatting requirements (http://todaes.acm.org/). The page count limit is 25.

459 citations

Journal Article
TL;DR: This work investigates an alternative syntax for an encryption scheme, where the encryption process e is a deterministic function that surfaces an initialization vector (IV) that is guaranteed to be a nonce-something that takes on a new value with every message one encrypts.
Abstract: Symmetric encryption schemes are usually formalized so as to make the encryption operation a probabilistic or state-dependent function e of the message M and the key K: the user supplies M and K and the encryption process does the rest, flipping coins or modifying internal state in order to produce a ciphertext C. Here we investigate an alternative syntax for an encryption scheme, where the encryption process e is a deterministic function that surfaces an initialization vector (IV). The user supplies a message M, key K, and initialization vector N, getting back the (one and only) associated ciphertext C = e N K(M). We concentrate on the case where the IV is guaranteed to be a nonce-something that takes on a new value with every message one encrypts. We explore definitions, constructions, and properties for nonce-based encryption. Symmetric encryption with a surfaced IV more directly captures real-word constructions like CBC mode, and encryption schemes constructed to be secure under nonce-based security notions may be less prone to misuse.

195 citations

Journal ArticleDOI
15 May 2018
TL;DR: The state of the art in collaborative localization based on range-based as well as range-angle-based techniques is surveyed with an eye toward 5G cellular and IoT applications.
Abstract: Emerging communication network applications including fifth-generation (5G) cellular and the Internet-of-Things (IoT) will almost certainly require location information at as many network nodes as possible. Given the energy requirements and lack of indoor coverage of Global Positioning System (GPS), collaborative localization appears to be a powerful tool for such networks. In this paper, we survey the state of the art in collaborative localization with an eye toward 5G cellular and IoT applications. In particular, we discuss theoretical limits, algorithms, and practical challenges associated with collaborative localization based on range-based as well as range-angle-based techniques.

177 citations