Reputation Management for Consensus Mechanism in Vehicular Edge Metaverse

作     者：Liu, Lei Feng, Jie Wu, Celimuge Chen, Chen Pei, Qingqi 

作者机构：Xidian Univ Guangzhou Inst Technol Xian 710071 Shaanxi Peoples R China Xidian Univ Sch Telecommun Engn State Key Lab Integrated Serv Networks Xian 710071 Peoples R China Shaanxi Key Lab Blockchain & Secure Comp Xian 710071 Shaanxi Peoples R China Univ Electrocommun Dept Comp & Network Engn Tokyo 1828585 Japan Xidian Univ Sch Telecommun Engn Xian 710071 Shaanxi Peoples R China 

出 版 物：《IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS》 (IEEE J Sel Areas Commun)

年 卷 期：2024年第42卷第4期

页      面：919-932页

核心收录：

学科分类：0810[工学-信息与通信工程] 0808[工学-电气工程] 08[工学] 

基　　金：National Key Research and Development Program of China 

主　　题：Metaverse Consensus algorithm Resource management Energy consumption Collaboration Security Delays Vehicular metaverse PBFT consensus algorithm resource allocation vehicular edge computing 

摘      要：Metaverse is a visually rich virtual space in which users can interact with each other. By introducing metaverse into vehicular networks, vehicular metaverse can provide users real-time immersive experiences based on augmented technologies. Vehicular edge computing is a desirable approach to support computation-intensive vehicular metaverse services by network resource collaboration. User collaboration needs to reach a consensus on perception information, operation control and so on to realize user autonomy. However, the existing consensus algorithms often require computational proof or frequent communication, making them unsuitable for dynamically changing vehicular edge metaverse with low latency and energy restrictions. In this paper, we have proposed a reputation model maintained in the vehicular edge metaverse to score the vehicles, so the vehicles with a high reputation can be selected to participate in practical Byzantine fault tolerant (PBFT) consensus, which improves the probability of success and credibility of consensus without increasing the number of participating vehicles. Meanwhile, an optimization problem is formulated for each vehicle to allocate its computation and communication resources to reach a PBFT consensus. Also, the optimized communication time interval of each phase in the PBFT consensus can be used as a reference for setting the agreed upper time, which reduces the waiting time of vehicles and the probability of re-consensus. Simulation results have demonstrated that the proposed scheme effectively achieves PBFT information consensus with lower latency and energy consumption, and thus is more scalable and efficient.