8 February 2022 in IEEE Internet of Things Journal
The Age of Information (AoI) is a recently proposed metric for quantifying data freshness in real-time status monitoring systems, where timeliness is of importance. In this article, the problem of characterizing and controlling the AoI is studied in the context of blockchain-enabled monitoring networks (BeMNs). In BeMN, status updates from sources are transmitted and recorded in a blockchain. To investigate the statistical characteristics of the AoI in BeMN, the transmission latency and the consensus latency are first rigorously modeled. Then, the average AoI, the AoI violation probability, and the peak AoI violation probability are derived in a closed form so as to quantify the performance of BeMN. Furthermore, a simplified form is derived for the AoI violation probability, and it is shown that this quantity can capture the upper or lower bounds of the actual AoI violation probability. Simulation results show that each BeMN parameters (i.e., target successful transmission probability, block size, and timeout) can have conflicting effects on the AoI-related performance. Subsequently, design insights are provided to maintain the freshness of the status data in BeMN. Then, experimental results with a real Hyperledger Fabric platform further validate the accuracy of our modeling and analysis.
7 February 2023 in IEEE Network
Hyperledger Fabric (HLF), one of the most popular permissioned blockchains, has recently received attention for blockchain-enabled Internet of Things (IoT). However, for IoT applications to handle time-sensitive data, the processing latency in HLF has emerged as a new challenge. In this article, therefore, we establish a practical HLF latency model for HLF-enabled IoT. We first discuss the structure and the transaction flow of HLF-enabled IoT. After implementing real HLF, we capture the latencies that each transaction experiences and show that the total latency of HLF can be modeled as a Gamma distribution, which is validated by conducting a goodness-of-fit test (i.e., the Kolmogorov-Smirnov (KS) test). We also provide the parameter values of the modeled latency distribution for various HLF environments. Furthermore, we explore the impacts of three important HLF parameters including the average transaction generation rate, block size, and block-generation timeout on the HLF latency. As a result, this article provides design insights on minimizing the average latency for HLF-enabled IoT.
17 July 2024 in IEEE Transactions on Information Forensics and Security
As advanced V2X applications emerge in the connected and autonomous vehicle (CAV), the data communications between in-vehicle end-devices and outside nodes increase, which make the end-to-end (E2E) security to in-vehicle end-devices as the urgent issue to be handled. However, the E2E security with fine-grained access control still remains as a challenging issue for resource-constrained end-devices since the existing security solutions require complicated key management and high resource consumption. Therefore, this paper proposes a practical and secure vehicular communication protocol for the E2E security based on a new attribute-based encryption (ABE) scheme. In the ABE scheme, the outsourced computation is provided for encryption, and the computation cost for decryption constantly remains small, regardless of the number of attributes. The policy privacy can be ensured by the proposed ABE to support privacy-sensitive V2X applications, and the existing identity-based signature for outsourced signing is newly reconstructed. The protocol achieves the confidentiality, message authentication, identity anonymity, unlinkability, traceability, and reconfigurable outsourced computation, and this paper also shows the practical feasibility of the protocol via the performance evaluation.
20 January 2025 in IEEE Transactions on Services Computing
Since the permissioned blockchain technology has been proposed to ensure data integrity in distributed systems, the low throughput and high latency have been recognized as major issues. Especially, the latency exists as each transaction goes through required processes for ledger updates, and this latency becomes large when many transactions arrive in blockchain due to the large computing overhead. In some applications, the data, available later than allowed time, can be useless, so the effective throughput is newly considered, defined as the average number of transactions per second, committed within the required latencies. For maximizing the effective throughput, I propose a novel (i-TGC) method to determine the transaction generation for each client, which is developed based on (RL) with the i-TGC framework. Our experiment results show the i-TGC outperforms the (p-TGC), which generates transactions randomly with the optimal probability that maximizes the effective throughput. I also verify the performance of the i-TGC for various environments with different block sizes, block generation timeout, traffic patterns, and the number of clients. The i-TGC can be a way to accelerate the usage of the permissioned blockchain for latency-sensitive services.
29 May 2024 in IEEE Wireless Communications Letters
Recently, blockchain (BC)-empowered wireless sensor networks (WSN) emerged as a promising solution for secure and reliable data management. However, the integration of BC and WSN brings several challenges including long processing delay at BC, which reduces freshness of sensed data. Motivated by this, we first model the BC-empowered WSN and define the age of information (AoI), the elapsed time from the sensor’s data collection until its commitment to the BC. We then formulate the AoI violation probability minimization problem and propose the reinforcement learning-based sensing decision (RL-SD) algorithm. Using the RL-SD, the sensor intelligently makes sensing decisions, considering wireless channel conditions, BC process latency, and energy status. We further introduce the pause mechanism to save energy, where the sensor pauses sensing and transmission for a while after the successful transmission. Our experiments demonstrate that the proposed algorithm outperforms the probabilistic sensing decision algorithm that senses randomly with the optimal probability. We also verify the performance of the RL-SD for various environments with different block sizes, pause times, and AoI thresholds.
15 May 2025 in IEEE Transactions on Vehicular Technology
As unmanned aerial vehicles (UAVs) have been widely considered for data collection, the blockchain has been considered as a technology to ensure the data integrity of collected data. However, the usage of the blockchain leads to additional latency for processing the data. Therefore, in this paper, we newly propose and analyze the timely update probability (TUP) to provide novel design insights for timely update in blockchain-enabled UAV-assisted data collection (U-DC) networks. The TUP is defined as the probability that collected data are transferred and appended to the blockchain within the required latency. We first analyze the TUP for the general case, and then derive a closedform expression of the TUP for the special cases. The transaction generation rate is also analyzed to show how the communication performance affects the blockchain performance. We explore the impacts of communication and blockchain parameters on the TUP to provide new insights on the optimal deployment for timely update in blockchain-enabled U-DC networks. We finally explore the timely update throughput (TUT), defined as the total amount of collected and timely appended data to the blockchain ledger per second, and explore the optimal UAV deployments in terms of the TUP and TUT.