Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Wireless Streamlet: A Spectrum-Aware and Cognitive Consensus Protocol for Edge IoT

Taotao Wang, Long Shi, Fang Liu, Qing Yang, Shengli Zhang

TL;DR

Wireless Streamlet addresses the challenge of deploying blockchain-style consensus in spectrum-congested wireless edge IoT by integrating a spectrum-aware CALE mechanism, a TDMA-based deterministic voting scheme, and a dual-chain erasure-coded storage architecture. CALE uses receiver-measured CSI piggybacked in votes to derive verifiable connectivity scores and deterministically selects a unique weighted leader per epoch, improving propagation under deep fading. The lightweight State Chain/Data Chain design decouples consensus from payload storage, using Raptor codes to maintain data availability with minimal per-node storage; a Merkle-root based integrity anchor ensures secure on-demand decoding. The protocol achieves linear on-air transmissions per epoch, higher throughput, reduced latency variance, and up to substantial storage reductions, demonstrating the value of cross-layer cognition for reliable, scalable edge consensus in dynamic wireless environments.

Abstract

Blockchain offers a decentralized trust framework for the Internet of Things (IoT), yet deploying consensus in spectrum-congested and dynamic wireless edge IoT networks faces fundamental obstacles: traditional BFT protocols are spectrum-ignorant, leading to inefficient resource utilization and fragile progress under time-varying interference. This paper presents \textit{Wireless Streamlet}, a spectrum-aware and cognitive consensus protocol tailored for wireless edge IoT. Building on Streamlet's streamlined structure, we introduce a \textit{Channel-Aware Leader Election (CALE)} mechanism. CALE serves as a verifiable cross-layer cognitive engine that leverages receiver-measured channel state information (CSI) piggybacked in signed votes to derive Byzantine-robust connectivity scores from notarization certificates, and deterministically selects a unique weighted leader per epoch from finalized history, thereby improving proposal dissemination reliability under deep fading. Complementing this cognitive adaptation, Wireless Streamlet exploits the single-hop broadcast medium and a deterministic TDMA voting schedule to achieve linear per-epoch on-air transmissions (slot complexity), ensuring deterministic spectral access. To address the communication-storage trade-off, we further propose a coded dual-chain architecture that decouples header-only consensus (State Chain) from payload data (Data Chain). By employing erasure coding and on-chain integrity commitments, the system minimizes redundant spectrum usage for data retrieval while ensuring availability. Experiments show that Wireless Streamlet achieves higher throughput and lower confirmation latency than representative baselines in lossy environments, while substantially reducing per-node storage, demonstrating the efficacy of integrating cognitive sensing into consensus logic.

Wireless Streamlet: A Spectrum-Aware and Cognitive Consensus Protocol for Edge IoT

TL;DR

Wireless Streamlet addresses the challenge of deploying blockchain-style consensus in spectrum-congested wireless edge IoT by integrating a spectrum-aware CALE mechanism, a TDMA-based deterministic voting scheme, and a dual-chain erasure-coded storage architecture. CALE uses receiver-measured CSI piggybacked in votes to derive verifiable connectivity scores and deterministically selects a unique weighted leader per epoch, improving propagation under deep fading. The lightweight State Chain/Data Chain design decouples consensus from payload storage, using Raptor codes to maintain data availability with minimal per-node storage; a Merkle-root based integrity anchor ensures secure on-demand decoding. The protocol achieves linear on-air transmissions per epoch, higher throughput, reduced latency variance, and up to substantial storage reductions, demonstrating the value of cross-layer cognition for reliable, scalable edge consensus in dynamic wireless environments.

Abstract

Blockchain offers a decentralized trust framework for the Internet of Things (IoT), yet deploying consensus in spectrum-congested and dynamic wireless edge IoT networks faces fundamental obstacles: traditional BFT protocols are spectrum-ignorant, leading to inefficient resource utilization and fragile progress under time-varying interference. This paper presents \textit{Wireless Streamlet}, a spectrum-aware and cognitive consensus protocol tailored for wireless edge IoT. Building on Streamlet's streamlined structure, we introduce a \textit{Channel-Aware Leader Election (CALE)} mechanism. CALE serves as a verifiable cross-layer cognitive engine that leverages receiver-measured channel state information (CSI) piggybacked in signed votes to derive Byzantine-robust connectivity scores from notarization certificates, and deterministically selects a unique weighted leader per epoch from finalized history, thereby improving proposal dissemination reliability under deep fading. Complementing this cognitive adaptation, Wireless Streamlet exploits the single-hop broadcast medium and a deterministic TDMA voting schedule to achieve linear per-epoch on-air transmissions (slot complexity), ensuring deterministic spectral access. To address the communication-storage trade-off, we further propose a coded dual-chain architecture that decouples header-only consensus (State Chain) from payload data (Data Chain). By employing erasure coding and on-chain integrity commitments, the system minimizes redundant spectrum usage for data retrieval while ensuring availability. Experiments show that Wireless Streamlet achieves higher throughput and lower confirmation latency than representative baselines in lossy environments, while substantially reducing per-node storage, demonstrating the efficacy of integrating cognitive sensing into consensus logic.
Paper Structure (60 sections, 1 theorem, 19 equations, 14 figures, 4 tables)

This paper contains 60 sections, 1 theorem, 19 equations, 14 figures, 4 tables.

Table of Contents

  1. Introduction
  2. Related Work
  3. Classical BFT Protocols
  4. Consensus Analysis in Wireless Networks
  5. Optimization for Wireless Consensus
  6. Topology and Deployment Optimization
  7. Communication-Consensus Co-Design
  8. Coded Blockchain and Sharding
  9. Wireless-Native Blockchain and Consensus Protocols
  10. Qualitative Comparison
  11. System Model
  12. Node Model
  13. Wireless Channel Model (Packet Erasure Channel)
  14. Broadcast Reception Model
  15. Timing Model (Weak Synchrony with Epochs)
  16. ...and 45 more sections

Key Result

Theorem 1

Assume $p_H>0$ and $\pi>0$. Then $\hat{p}>0$ by eq:within_slot_delivery, which implies $q>0$ by eq:q_lower_bound. Consequently, the expected number of epochs to finality in eq:expected_epochs is finite. Moreover, if the per-epoch success events are independent across epochs or, more generally, form

Figures (14)

  • Figure 1: Logical execution flow of Wireless Streamlet within one epoch. The consensus logic follows Streamlet chan2020streamlet, while the physical transmission is adapted to wireless broadcast and a TDMA schedule.
  • Figure 2: Selective transmission (delivery to only a subset) is easy in wired point-to-point networks. In a single-hop omni-directional wireless broadcast domain, transmissions are naturally overheard by many nodes (subject to erasures), reducing the need for an explicit application-layer echo phase.
  • Figure 3: TDMA-based sequential transmission schedule (illustrative). Slot 0 is reserved for the leader's proposal; each node broadcasts its vote in a dedicated slot.
  • Figure 4: Proposed dual-chain structure. The Data Chain stores erasure-coded transaction payloads, while the State Chain maintains consensus metadata and a compact commitment $C_p$ (Merkle root) that anchors payload integrity.
  • Figure 5: System architecture. Consensus nodes (IoT devices) form a single-hop wireless broadcast cluster for State Chain agreement, while storage nodes (servers) maintain Data Chain persistence via gateways/backhaul.
  • ...and 9 more figures

Theorems & Definitions (5)

  • Remark 1: Consistency under temporary notarized forks
  • Remark 2: Overhead of CALE
  • Remark 3: Threat model clarification
  • Remark 4: Heterogeneity vs. conservative bounds
  • Theorem 1: Liveness under non-degenerate honest connectivity