Dispersed computing is a new resourcecentric computing paradigm.Due to its high degree of openness and decentralization,it is vulnerable to attacks,and security issues have become an important challenge hindering its ...Dispersed computing is a new resourcecentric computing paradigm.Due to its high degree of openness and decentralization,it is vulnerable to attacks,and security issues have become an important challenge hindering its development.The trust evaluation technology is of great significance to the reliable operation and security assurance of dispersed computing networks.In this paper,a dynamic Bayesian-based comprehensive trust evaluation model is proposed for dispersed computing environment.Specifically,in the calculation of direct trust,a logarithmic decay function and a sliding window are introduced to improve the timeliness.In the calculation of indirect trust,a random screening method based on sine function is designed,which excludes malicious nodes providing false reports and multiple malicious nodes colluding attacks.Finally,the comprehensive trust value is dynamically updated based on historical interactions,current interactions and momentary changes.Simulation experiments are introduced to verify the performance of the model.Compared with existing model,the proposed trust evaluation model performs better in terms of the detection rate of malicious nodes,the interaction success rate,and the computational cost.展开更多
With large-scale applications,the loss of power load data during transmission is inevitable.This paper proposes a data completion method considering the low rank property of the data.According to the low-rank property...With large-scale applications,the loss of power load data during transmission is inevitable.This paper proposes a data completion method considering the low rank property of the data.According to the low-rank property of data and numerical experiments,we find either the linear interpolation(LI)or the singular value decomposition(SVD)based method is superior to other methods depending on the smoothness of the data.We construct an index to measure the smoothness of data,and propose the SVDLI algorithm which adaptively selects different algorithms for data completion according to the index.Numerical simulations show that irrespective of the smoothness of data,the data complementing results of SVDLI are comparable to or better than the best of SVD or LI algorithms.The present study is verified using the measurements in China,and the public data of the Australian electricity distribution company and Lawrence Berkeley National Laboratory.展开更多
基金supported in part by the National Science Foundation Project of P.R.China (No.61931001)the Fundamental Research Funds for the Central Universities under Grant (No.FRFAT-19-010)the Scientific and Technological Innovation Foundation of Foshan,USTB (No.BK20AF003)。
文摘Dispersed computing is a new resourcecentric computing paradigm.Due to its high degree of openness and decentralization,it is vulnerable to attacks,and security issues have become an important challenge hindering its development.The trust evaluation technology is of great significance to the reliable operation and security assurance of dispersed computing networks.In this paper,a dynamic Bayesian-based comprehensive trust evaluation model is proposed for dispersed computing environment.Specifically,in the calculation of direct trust,a logarithmic decay function and a sliding window are introduced to improve the timeliness.In the calculation of indirect trust,a random screening method based on sine function is designed,which excludes malicious nodes providing false reports and multiple malicious nodes colluding attacks.Finally,the comprehensive trust value is dynamically updated based on historical interactions,current interactions and momentary changes.Simulation experiments are introduced to verify the performance of the model.Compared with existing model,the proposed trust evaluation model performs better in terms of the detection rate of malicious nodes,the interaction success rate,and the computational cost.
文摘With large-scale applications,the loss of power load data during transmission is inevitable.This paper proposes a data completion method considering the low rank property of the data.According to the low-rank property of data and numerical experiments,we find either the linear interpolation(LI)or the singular value decomposition(SVD)based method is superior to other methods depending on the smoothness of the data.We construct an index to measure the smoothness of data,and propose the SVDLI algorithm which adaptively selects different algorithms for data completion according to the index.Numerical simulations show that irrespective of the smoothness of data,the data complementing results of SVDLI are comparable to or better than the best of SVD or LI algorithms.The present study is verified using the measurements in China,and the public data of the Australian electricity distribution company and Lawrence Berkeley National Laboratory.
