TY - GEN
T1 - A Novel Proof-of-Reputation Consensus for Storage Allocation in Edge Blockchain Systems
AU - Zhang, Jiarui
AU - Huang, Yaodong
AU - Ye, Fan
AU - Yang, Yuanyuan
N1 - Publisher Copyright:
© 2021 IEEE.
PY - 2021/6/25
Y1 - 2021/6/25
N2 - Edge computing guides the collaborative work of widely distributed nodes with different sensing, storage, and computing resources. For example, sensor nodes collect data and then store it in storage nodes so that computing nodes can access the data when needed. In this paper, we focus on the quality of service (QoS) in storage allocation in edge networks. We design a reputation mechanism for nodes in edge networks, which enables interactive nodes to evaluate the quality of service for reference. Each node publicly broadcasts a personal reputation list to evaluate all other nodes, and each node can calculate the global reputation of all nodes by aggregating personal reputations. We then propose a storage allocation algorithm that stores data to appropriate locations. The algorithm considers fairness, efficiency, and reliability which is derived from reputations. We build a novel Proof-of-Reputation (PoR) blockchain to support consensus on the reputation mechanism and storage allocation. The PoR blockchain ensures safety performance, saves computing resources, and avoids centralization. Extensive simulation results show our proposed algorithm is fair, efficient, and reliable. The results also show that in the presence of attackers, the success rate of honest nodes accessing data can reach 99.9%.
AB - Edge computing guides the collaborative work of widely distributed nodes with different sensing, storage, and computing resources. For example, sensor nodes collect data and then store it in storage nodes so that computing nodes can access the data when needed. In this paper, we focus on the quality of service (QoS) in storage allocation in edge networks. We design a reputation mechanism for nodes in edge networks, which enables interactive nodes to evaluate the quality of service for reference. Each node publicly broadcasts a personal reputation list to evaluate all other nodes, and each node can calculate the global reputation of all nodes by aggregating personal reputations. We then propose a storage allocation algorithm that stores data to appropriate locations. The algorithm considers fairness, efficiency, and reliability which is derived from reputations. We build a novel Proof-of-Reputation (PoR) blockchain to support consensus on the reputation mechanism and storage allocation. The PoR blockchain ensures safety performance, saves computing resources, and avoids centralization. Extensive simulation results show our proposed algorithm is fair, efficient, and reliable. The results also show that in the presence of attackers, the success rate of honest nodes accessing data can reach 99.9%.
UR - https://www.scopus.com/pages/publications/85115368426
U2 - 10.1109/IWQOS52092.2021.9521348
DO - 10.1109/IWQOS52092.2021.9521348
M3 - Conference contribution
AN - SCOPUS:85115368426
T3 - 2021 IEEE/ACM 29th International Symposium on Quality of Service, IWQOS 2021
BT - 2021 IEEE/ACM 29th International Symposium on Quality of Service, IWQOS 2021
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 29th IEEE/ACM International Symposium on Quality of Service, IWQOS 2021
Y2 - 25 June 2021 through 28 June 2021
ER -