Ernesto Jiménez
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Ernesto Jiménez has a total of 44 co-authors. Here are the top co-authors by number of shared publications:
- Sergio Arévalo
Universidad Politécnica de Madrid
12 shared publications - Antonio Fernández Anta
IMDEA Software Institute & IMDEA Networks Institute, Madrid, Spain
9 shared publications Michel Raynal
7 shared publications- Vicent Cholvi
Departament de Llenguatges i Sistemes Informàtics, Universitat Jaume I, Castelló, Spain
7 shared publications - José Luis López-Presa
Universidad Politecnica de Madrid, Madrid, Spain
6 shared publications Antonio Fernandez
Universidad Rey Juan Carlos, Spain
4 shared publications
Latest Publications
- Open Access
- 1 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 4701-4715
Optimizing Gossiping for Asynchronous Fault-Prone IoT Networks With Memory and Battery Constraints
A gossip protocol is a procedure by which a device disseminates its rumor to all devices on a network. The traditional definition of the gossip problem states that, in a system with $n$ interconnected devices where each of them only knows initially its own rumor, after a known finite time of message exchange, all devices learn the $n$ rumors. This definition considers synchronous systems where devices cannot fail. Gossip-based protocols can be very useful in Internet of Things (IoT) networks as a means of disseminating information. Thus, we have reformulated the problem to expand the spectrum of networks in which the gossip technique can be applied, including asynchrony and device failures, very common features in current IoT newtwoks. Gossiping consumes valuable memory and battery resources in devices. This can be particularly problematic for small IoT devices that operate with reduced memory in remote or inaccessible locations, where battery replacement or recharging is difficult. To address these issues, two efficient gossip protocols are presented, so that the efficiency and longevity of IoT devices is not compromised. The first protocol (battery-efficient protocol) allows to reduce battery consumption while still having a good time performance, but needs quadratic memory, like traditional versions. The second protocol (memory-optimal protocol) only needs linear memory to store and manage the rumors, and is capable of significantly reducing the number of messages sent, while obtaining similar (or, in many cases, better) performance than the first protocol. Both protocols are formally proved to be correct, and upper and lower limits of their number of messages sent are determined. These theoretical limits, however, differ so much among them that they do not permit to guess the number of messages that a real case may require. Hence, the practical performance of both protocols is assessed with experiments.
- 1 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 4701-4715
Open AccessOptimizing Gossiping for Asynchronous Fault-Prone IoT Networks With Memory and Battery Constraints
A gossip protocol is a procedure by which a device disseminates its rumor to all devices on a network. The traditional definition of the gossip problem states that, in a system with $n$ interconnected devices where each of them only knows initially its own rumor, after a known finite time of message exchange, all devices learn the $n$ rumors. This definition considers synchronous systems where devices cannot fail. Gossip-based protocols can be very useful in Internet of Things (IoT) networks as a means of disseminating information. Thus, we have reformulated the problem to expand the spectrum of networks in which the gossip technique can be applied, including asynchrony and device failures, very common features in current IoT newtwoks. Gossiping consumes valuable memory and battery resources in devices. This can be particularly problematic for small IoT devices that operate with reduced memory in remote or inaccessible locations, where battery replacement or recharging is difficult. To address these issues, two efficient gossip protocols are presented, so that the efficiency and longevity of IoT devices is not compromised. The first protocol (battery-efficient protocol) allows to reduce battery consumption while still having a good time performance, but needs quadratic memory, like traditional versions. The second protocol (memory-optimal protocol) only needs linear memory to store and manage the rumors, and is capable of significantly reducing the number of messages sent, while obtaining similar (or, in many cases, better) performance than the first protocol. Both protocols are formally proved to be correct, and upper and lower limits of their number of messages sent are determined. These theoretical limits, however, differ so much among them that they do not permit to guess the number of messages that a real case may require. Hence, the practical performance of both protocols is assessed with experiments.
- 30 November 2022
- Published by Springer Nature in Computing
- Vol. 105 (6) , 1165-1187
Uniform atomic broadcast and consensus in fully anonymous synchronous systems with crash failures
- 30 November 2022
- Published by Springer Nature in Computing
- Vol. 105 (6) , 1165-1187
Uniform atomic broadcast and consensus in fully anonymous synchronous systems with crash failures
- Open Access
- 8 October 2021
- Published by Springer Nature in Computing
- Vol. 103 (12) , 2811-2837
Consensus in anonymous asynchronous systems with crash-recovery and omission failures
In anonymous distributed systems, processes are indistinguishable because they have no identity and execute the same algorithm. Currently, anonymous systems are receiving a lot of attention mainly because they preserve privacy, which is an important property when we want to avoid impersonation attacks. On the other hand, Consensus is a fundamental problem in distributed computing. It is well-known that Consensus cannot be deterministically solved in pure asynchronous anonymous systems if processes can crash (the so-called crash-stop failure model). This impossibility holds even if message losses never occur in transmission. Failure detectors are an elegant and powerful abstraction for achieving deterministic Consensus in asynchronous distributed systems. A failure detector is a distributed object that gives the processes information about crashed processes. Failure detectors have attracted so much attention in the crash-stop failure model because they provide a totally independent abstraction. $$\varOmega $$ is the weakest failure detector to solve Consensus in classic asynchronous systems when a majority of processes never crash, and $$A\varOmega '$$ is its implementable version for anonymous systems. As far as we know, there is a lack of works in the literature which tackle Consensus in anonymous asynchronous systems where crashed process can recover (the so-called crash-recovery failure model) and also assuming errors in transmission operations (the so-called omission failure model). Extending failure models in the system allows us to design more realistic systems and solve more practical security problems (i.e., fair exchange and the secure multiparty computation). We present, in this paper, an algorithm to solve Consensus using $$A\varOmega '$$ in anonymous asynchronous systems under the crash-recovery and omission failure models. Another important contribution of this paper is a communication-efficient and latency-efficient implementation of $$A\varOmega '$$ for these new failure models.- 8 October 2021
- Published by Springer Nature in Computing
- Vol. 103 (12) , 2811-2837
Open AccessConsensus in anonymous asynchronous systems with crash-recovery and omission failures
In anonymous distributed systems, processes are indistinguishable because they have no identity and execute the same algorithm. Currently, anonymous systems are receiving a lot of attention mainly because they preserve privacy, which is an important property when we want to avoid impersonation attacks. On the other hand, Consensus is a fundamental problem in distributed computing. It is well-known that Consensus cannot be deterministically solved in pure asynchronous anonymous systems if processes can crash (the so-called crash-stop failure model). This impossibility holds even if message losses never occur in transmission. Failure detectors are an elegant and powerful abstraction for achieving deterministic Consensus in asynchronous distributed systems. A failure detector is a distributed object that gives the processes information about crashed processes. Failure detectors have attracted so much attention in the crash-stop failure model because they provide a totally independent abstraction. $$\varOmega $$ is the weakest failure detector to solve Consensus in classic asynchronous systems when a majority of processes never crash, and $$A\varOmega '$$ is its implementable version for anonymous systems. As far as we know, there is a lack of works in the literature which tackle Consensus in anonymous asynchronous systems where crashed process can recover (the so-called crash-recovery failure model) and also assuming errors in transmission operations (the so-called omission failure model). Extending failure models in the system allows us to design more realistic systems and solve more practical security problems (i.e., fair exchange and the secure multiparty computation). We present, in this paper, an algorithm to solve Consensus using $$A\varOmega '$$ in anonymous asynchronous systems under the crash-recovery and omission failure models. Another important contribution of this paper is a communication-efficient and latency-efficient implementation of $$A\varOmega '$$ for these new failure models. - Open Access
- 1 October 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Robotics
- Vol. 38 (2) , 1101-1117
Following Leaders in Byzantine Multirobot Systems by Using Blockchain Technology
Interest in multirobot systems is rising rapidly both in academia and in industry. The use of multiple robots working in a coordinated way, rather than a single robot, has several advantages in a diverse range of applications. However, few studies have focused on operations in which robots can behave maliciously and alter the outcome of the collective mission. In this article, we present a set of Byzantine Follow The Leader (BFTL) problems, in which a subset of robots in the system shows unintended or inconsistent behavior (i.e., Byzantine robots). In the BFTL problems, leaders discover routes from their starting positions to specific destinations and guide the followers , while Byzantine robots try to hinder the leaders and mislead the followers. In this research, blockchain technology is used as a communication tool within multirobot systems, for leaders to broadcast directions to the whole group. We propose algorithms to tackle the BFTL problems, prove their correctness, and validate them in simulated experiments of realistic scenarios. Results show that the proposed algorithms mitigate the impact of Byzantine robots in multirobot systems conducting a BFTL mission. Our analysis provides minimum and maximum boundary calculations for important metrics including number of robots reaching their destination, number of steps taken, and weight requirements of the chain used during the mission. Our results provide a path toward the deployment of byzantine-resistant real-world multirobot systems.
- 1 October 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Robotics
- Vol. 38 (2) , 1101-1117
Open AccessFollowing Leaders in Byzantine Multirobot Systems by Using Blockchain Technology
Interest in multirobot systems is rising rapidly both in academia and in industry. The use of multiple robots working in a coordinated way, rather than a single robot, has several advantages in a diverse range of applications. However, few studies have focused on operations in which robots can behave maliciously and alter the outcome of the collective mission. In this article, we present a set of Byzantine Follow The Leader (BFTL) problems, in which a subset of robots in the system shows unintended or inconsistent behavior (i.e., Byzantine robots). In the BFTL problems, leaders discover routes from their starting positions to specific destinations and guide the followers , while Byzantine robots try to hinder the leaders and mislead the followers. In this research, blockchain technology is used as a communication tool within multirobot systems, for leaders to broadcast directions to the whole group. We propose algorithms to tackle the BFTL problems, prove their correctness, and validate them in simulated experiments of realistic scenarios. Results show that the proposed algorithms mitigate the impact of Byzantine robots in multirobot systems conducting a BFTL mission. Our analysis provides minimum and maximum boundary calculations for important metrics including number of robots reaching their destination, number of steps taken, and weight requirements of the chain used during the mission. Our results provide a path toward the deployment of byzantine-resistant real-world multirobot systems.
- 8 June 2020
- Published by Springer Nature in Computing
- Vol. 102 (9) , 1967-1999
Uniform reliable broadcast in anonymous distributed systems with fair lossy channels
- 8 June 2020
- Published by Springer Nature in Computing
- Vol. 102 (9) , 1967-1999
Uniform reliable broadcast in anonymous distributed systems with fair lossy channels
- 1 February 2020
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 107, 54-71
Consensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures
- 1 February 2020
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 107, 54-71
Consensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures
- 18 September 2019
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 75 (12) , 8262-8292
Hybrid binary consensus in anonymous asynchronous systems using coins and failure detectors
- 18 September 2019
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 75 (12) , 8262-8292
Hybrid binary consensus in anonymous asynchronous systems using coins and failure detectors
- Open Access
- 1 January 2017
- Published by Inderscience Publishers in International Journal of High Performance Computing and Networking
- Vol. 10 (4/5) , 289
Reliable broadcast in anonymous distributed systems with fair lossy channels
International publishers of academic, scientific and professional journals since 1979.
- 1 January 2017
- Published by Inderscience Publishers in International Journal of High Performance Computing and Networking
- Vol. 10 (4/5) , 289
Open AccessReliable broadcast in anonymous distributed systems with fair lossy channels
International publishers of academic, scientific and professional journals since 1979.
- Open Access
- 1 September 2015
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 83, 83-95
Failure detectors in homonymous distributed systems (with an application to consensus)
- 1 September 2015
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 83, 83-95
Open AccessFailure detectors in homonymous distributed systems (with an application to consensus)
- 25 August 2015
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 71 (11) , 4172-4191
Fault-tolerant broadcast in anonymous systems
- 25 August 2015
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 71 (11) , 4172-4191
Fault-tolerant broadcast in anonymous systems