Huiwen Xue¹, Jiwei Wen^1,*, Akshya Kumar Swain¹, Xiaoli Luan¹

CMES-Computer Modeling in Engineering & Sciences, Vol.134, No.2, pp. 857-871, 2023, DOI:10.32604/cmes.2022.020127

Abstract In this paper, a self-triggered consensus filtering is developed for a class of discrete-time distributed filtering systems. Different from existing event-triggered filtering, the self-triggered one does not require to continuously judge the trigger condition at each sampling instant and can save computational burden while achieving good state estimation. The triggering policy is presented for pre-computing the next execution time for measurements according to the filter’s own data and the latest released data of its neighbors at the current time. However, a challenging problem is that data will be asynchronously transmitted within the filtering network because each node self-triggers independently. Therefore,… More >

Huanrong Tang, Yaojing Sun, Jianquan Ouyang^*

Journal of Cyber Security, Vol.2, No.4, pp. 167-182, 2020, DOI:10.32604/jcs.2020.011341

Abstract With the rapid development of blockchain technology, more and more people are paying attention to the consensus mechanism of blockchain. Practical Byzantine Fault Tolerance (PBFT), as the first efficient consensus algorithm solving the Byzantine Generals Problem, plays an important role. But PBFT also has its problems. First, it runs in a completely closed environment, and any node can't join or exit without rebooting the system. Second, the communication complexity in the network is as high as O(n2), which makes the algorithm only applicable to small-scale networks. For these problems, this paper proposes an Optimized consensus algorithm, Excellent Practical Byzantine Fault… More >