A Novel Proof-of-Reputation Consensus for Storage Allocation in Edge Blockchain Systems

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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2021 IEEE/ACM 29th International Symposium on Quality of Service (IWQOS) s. 1 - 10
Hlavní autoři: Zhang, Jiarui, Huang, Yaodong, Ye, Fan, Yang, Yuanyuan
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 25.06.2021
Témata:
Blockchains
Collaborative work
Quality of service
Resource management
Safety
Sensors
Simulation
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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%.
DOI:10.1109/IWQOS52092.2021.9521348