RON-enhanced blockchain propagation mechanism for edge-enabled smart cities
RON-enhanced blockchain propagation mechanism for edge-enabled smart cities
复制标题
用于边缘智能城市的 RON 增强型区块链传播机制
DOI：
10.1016/j.jisa.2021.102936
复制
发表时间：
2021
影响因子：
5.6
通讯作者：
Yu Keping
中科院分区：
文献类型：
--
作者：
Huang Junjie;Tan Liang;Li Wenjuan;Yu Keping
边缘计算可以为智慧城市中的智能物联网设备生成的延迟敏感数据提供服务，这是云服务无法容纳的。然而，边缘智能城市应用面临着许多安全问题，如大规模集中化，易受篡改和跟踪困难。区块链作为一种新兴的账本技术，可以成为解决这些问题的有效方法。然而，由于网络传播延迟，区块链分叉可能会在某个时候发生在边缘启用的智慧城市网络中。它可能导致双重支付攻击并破坏数据完整性。为了解决这个问题，本文提出了一种基于弹性覆盖网络（罗恩）的区块链网络传播机制，用于边缘智能城市。首先，基于罗恩重构智慧城市中区块链节点之间的组网模式，使区块链节点能够快速检测智慧城市中互联网的链路状态。然后应用最短路径算法和策略路由来构建区块链节点之间的传播路径，以优化Gossip传播机制，提高QoS和QoE。仿真结果表明，基于RON的区块链网络传播机制在边缘智能城市的平均路由跳数、传输成功率、路由开销、平均延迟和减少分叉概率方面都是有益的。
Edge computing can serve latency-sensitive data generated by smart IoT devices in smart cities, which cannot be accommodated by cloud services. However, edge-enabled smart cities applications face many security issues such as massive centralization, vulnerability to tampering, and tracing difficulty. Blockchain, as an emerging ledger technology, can be a useful solution to these problems. However, due to network propagation delay, blockchain fork may occur in the network of edge-enabled smart cities at some time. It can lead to double payment attacks and damage data integrity. To address this issue, this paper proposes a blockchain network propagation mechanism based on the resilient overlay network (RON) for edge-enabled smart cities. Firstly, it reconstructs the networking mode between the blockchain nodes in smart cities based on RON so that the blockchain nodes can quickly detect the link state of the Internet in smart cities. The shortest path algorithm and policy routing are then applied to construct the propagation path between the blockchain nodes to optimize the Gossip propagation mechanism and enhance the QoS and QoE. Simulation results show that the RON-based blockchain network propagation mechanism for edge-enabled smart cities is beneficial in terms of average route hop count, transmission success rate, routing overhead, average delay, and reduced fork probability.