Searcharxiv⌕ Search

arXiv subjects

Israel Leyva-Mayorga

Publications and source records attributed to Israel Leyva-Mayorga.

58 records · Page 4Linked to original sources

Witness-based Approach for Scaling Distributed Ledgers to Massive IoT Scenarios

Distributed Ledger Technologies (DLTs) are playing a major role in building security and trust in Internet of Things (IoT) systems. However, IoT deployments with a large number of devices, such as in environment monitoring applications, generate and send massive amounts of data. This would generate vast number of transactions that must be processed within the distributed ledger. In this work, we first demonstrate that the Proof of Work (PoW) blockchain fails to scale in a sizable IoT connectivity infrastructure. To solve this problem, we present a lightweight distributed ledger scheme to integrate PoW blockchain into IoT. In our scheme, we classify transactions into two types: 1) global transactions, which must be processed by global blockchain nodes and 2) local transactions, which can be processed locally by entities called witnesses. Performance evaluation demonstrates that our proposed scheme improves the scalability of integrated blockchain and IoT monitoring systems by processing a fraction of the transactions, inversely proportional to the number of witnesses, locally. Hence, reducing the number of global transactions.

cs.NI↗

Wireless Mesh Networking with Devices Equipped with Multi-Connectivity

Wireless connectivity is rapidly becoming ubiquitous and affordable. As a consequence, most wireless devices are nowadays equipped with multi-connectivity, that is, availability of multiple radio access technologies (RATs). Each of these RATs has different characteristics that can be suitably utilized for different connectivity tasks. For example, a long-range low-rate RAT can be used for topology management and coordination, whereas a short-range high-rate RAT for data transmission. In this paper, we introduce a distributed consensus protocol for the hierarchical organization of Wireless Mesh Networks (WMNs) with devices using multiple RATs. Our protocol considers three hierarchical roles after the initial setup: Master, cluster head (CH), and cluster member (CM). The Master coordinates the use of all RATs, whereas the CHs coordinate all but the RAT with the longest transmission range. The initial setup takes place immediately after powering on the devices, after which the devices self-organize in a distributed manner by means of a consensus to elect the Masters and CHs. The resulting interconnected structure is based on the connectivity graphs created with the different RATs. The distributed consensus protocol operates with a minimal amount of network information and demonstrates high networking performance.

cs.NI↗

Reliability and Error Burst Length Analysis of Wireless Multi-Connectivity

Multi-connectivity offers diversity in terms of multiple interfaces through which the data can be sent, thereby improving simultaneously the overall reliability and latency. This makes interface diversity a natural candidate for supporting Ultra-Reliable Low Latency Communications (URLLC). This work investigates how the packet error statistics from different interfaces impacts the overall reliability-latency characteristics. We use the simple Gilbert-Elliott model for burst errors and estimate its parameters based on experimental measurement traces from LTE and {Wi-Fi} packet transmissions collected over several days. The results show that using interface diversity configurations that include at least one {Wi-Fi} interface leads to, somewhat surprisingly, since Wi-Fi is generally less reliable than LTE, superior results in terms of packet success and error burst duration. Another interesting finding is that {Wi-Fi}-based interface diversity configurations outperform even ultra-reliable single links.

cs.IT↗

Inter-plane satellite matching in dense LEO constellations

Dense constellations of Low Earth Orbit (LEO) small satellites are envisioned to make extensive use of the inter-satellite link (ISL). Within the same orbital plane, the inter-satellite distances are preserved and the links are rather stable. In contrast, the relative motion between planes makes the inter-plane ISL challenging. In a dense set-up, each spacecraft has several satellites in its coverage volume, but the time duration of each of these links is small and the maximum number of active connections is limited by the hardware. We analyze the matching problem of connecting satellites using the inter-plane ISL for unicast transmissions. We present and evaluate the performance of two solutions to the matching problem with any number of orbital planes and up to two transceivers: a heuristic solution with the aim of minimizing the total cost; and a Markovian solution to maintain the on-going connections as long as possible. The Markovian algorithm reduces the time needed to solve the matching up to 1000x and 10x with respect to the optimal solution and to the heuristic solution, respectively, without compromising the total cost. Our model includes power adaptation and optimizes the network energy consumption as the exemplary cost in the evaluations, but any other QoS-oriented KPI can be used instead.

cs.IT↗