The purpose of this research is to deal with effective block chain framework for secure transactions.The rate of effective data transactions and the interoperability of the ledger are the two major obstacles involved ...The purpose of this research is to deal with effective block chain framework for secure transactions.The rate of effective data transactions and the interoperability of the ledger are the two major obstacles involved in Blockchain and to tackle this issue,Cross-Chain based Transaction(CCT)is introduced.Traditional industries have been restructured by the introduction of Internet of Things(IoT)to become smart industries through the feature of data-driven decision-making.Still,there are a few limitations,like decentralization,security vulnerabilities,poor interoperability,as well as privacy concerns in IoTs.To overcome this limitation,Blockchain has been employed to assure a safer transaction process,especially in asset exchanges.In recent decades,scalable local ledgers implement Blockchains,simultaneously sustaining peer validations of transactions which can be at local or global levels.From the single Hyperledger-based blockchains system,the CCT takes the transaction amid various chains.In addition,the most significant factor for this registration processing strategy is the Signature to ensure security.The application of the Quantum cryptographic algorithm amplifies the proposed Hyperledger-based blockchains,to strengthen the safety of the process.The key has been determined by restricting the number of transactions that reach the global Blockchain using the quantum-based hash function and accomplished by scalable local ledgers,and peer validations of transactions at local and global levels without any issues.The rate of transaction processing for entire peers has enhanced with the ancillary aid of the proposed solution,as it includes the procedure of load distribution.Without any boosted enhancement,the recommended solution utilizes the current transaction strategy,and also,it’s aimed at scalability,resource conservation,and interoperability.The experimental results of the system have been evaluated using the metrics like block weight,ledger memory,the usage of the central processing unit,and the communication overhead.展开更多
Blockchain is a viable solution to provide data integrity for the enormous volume of 5G IoT social data, while we need to break through the throughput bottleneck of blockchain. Sharding is a promising technology to so...Blockchain is a viable solution to provide data integrity for the enormous volume of 5G IoT social data, while we need to break through the throughput bottleneck of blockchain. Sharding is a promising technology to solve the problem of low throughput in blockchains. However, cross-shard communication hinders the effective improvement of blockchain throughput. Therefore, it is critical to reasonably allocate transactions to different shards to improve blockchain throughput. Existing research on blockchain sharding mainly focuses on shards formation, configuration, and consensus, while ignoring the negative impact of cross-shard communication on blockchain throughput. Aiming to maximize the throughput of transaction processing, we study how to allocate blockchain transactions to shards in this paper. We propose an Associated Transaction assignment algorithm based on Closest Fit (ATCF). ATCF classifies associated transactions into transaction groups which are then assigned to different shards in the non-ascending order of transaction group sizes periodically. Within each epoch, ATCF tries to select a shard that can handle all the transactions for each transaction group. If there are multiple such shards, ATCF selects the shard with the remaining processing capacity closest to the number of transactions in the transaction group. When no such shard exists, ATCF chooses the shard with the largest remaining processing capacity for the transaction group. The transaction groups that cannot be completely processed within the current epoch will be allocated in the subsequent epochs. We prove that ATCF is a 2-approximation algorithm for the associated transaction assignment problem. Simulation results show that ATCF can effectively improve the blockchain throughput and reduce the number of cross-shard transactions.展开更多
With the development of the energy Internet, more distributed generators are connected to the power grid, resulting in numerous heterogeneous energy networks. However, different energy networks cannot perform efficien...With the development of the energy Internet, more distributed generators are connected to the power grid, resulting in numerous heterogeneous energy networks. However, different energy networks cannot perform efficient energy trading in the centralized management mode, this deeply affecting the complementary ability of heterogeneous energy, resulting in the islanded energy phenomenon. In this model, the same energy on the chain is traded within the chain, and the heterogeneous energy on different chains is traded across chains. To trade energy between heterogeneous energy networks more efficiently, the blockchain-based cross-chain model is proposed based on the existing infrastructure. Heterogeneous energy nodes are assigned to different energy sub-chains and cross-chain energy transactions are performed through a relay-chain, which utilizes the improved Boneh–Lynn–Shacham signature scheme consensus algorithm based on the proof-of-stake and practical Byzantine fault tolerance. The experimental simulations on energy trading efficiency, throughput, and security, show its superiority over existing systems. Further, the simulation results provide a reference for the application of cross-chain technology in energy interconnection.展开更多
关联规则分析作为数据挖掘的主要手段之一,在发现海量事务数据中隐含的有价值信息方面具有重要的作用。该文针对Apriori算法的固有缺陷,提出了AWP(Apriori With Prejudging)算法。该算法在Apriori算法连接、剪枝的基础上,添加了预判筛...关联规则分析作为数据挖掘的主要手段之一,在发现海量事务数据中隐含的有价值信息方面具有重要的作用。该文针对Apriori算法的固有缺陷,提出了AWP(Apriori With Prejudging)算法。该算法在Apriori算法连接、剪枝的基础上,添加了预判筛选的步骤,使用先验概率对候选频繁k项集集合进行缩减优化,并且引入阻尼因子和补偿因子对预判筛选产生的误差进行修正,简化了挖掘频繁项集的操作过程。实验证明AWP算法能够有效减少扫描数据库的次数,降低算法的运行时间。展开更多
文摘The purpose of this research is to deal with effective block chain framework for secure transactions.The rate of effective data transactions and the interoperability of the ledger are the two major obstacles involved in Blockchain and to tackle this issue,Cross-Chain based Transaction(CCT)is introduced.Traditional industries have been restructured by the introduction of Internet of Things(IoT)to become smart industries through the feature of data-driven decision-making.Still,there are a few limitations,like decentralization,security vulnerabilities,poor interoperability,as well as privacy concerns in IoTs.To overcome this limitation,Blockchain has been employed to assure a safer transaction process,especially in asset exchanges.In recent decades,scalable local ledgers implement Blockchains,simultaneously sustaining peer validations of transactions which can be at local or global levels.From the single Hyperledger-based blockchains system,the CCT takes the transaction amid various chains.In addition,the most significant factor for this registration processing strategy is the Signature to ensure security.The application of the Quantum cryptographic algorithm amplifies the proposed Hyperledger-based blockchains,to strengthen the safety of the process.The key has been determined by restricting the number of transactions that reach the global Blockchain using the quantum-based hash function and accomplished by scalable local ledgers,and peer validations of transactions at local and global levels without any issues.The rate of transaction processing for entire peers has enhanced with the ancillary aid of the proposed solution,as it includes the procedure of load distribution.Without any boosted enhancement,the recommended solution utilizes the current transaction strategy,and also,it’s aimed at scalability,resource conservation,and interoperability.The experimental results of the system have been evaluated using the metrics like block weight,ledger memory,the usage of the central processing unit,and the communication overhead.
基金supported by Anhui Provincial Key R&D Program of China(202004a05020040),the open project of State Key Laboratory of Complex Electromagnetic Environment Effects on Electronics and Information System in China(CEMEE2018Z0102B)the open fund of Intelligent Interconnected Systems Laboratory of Anhui Province(PA2021AKSK0114),Hefei University of Technology.
文摘Blockchain is a viable solution to provide data integrity for the enormous volume of 5G IoT social data, while we need to break through the throughput bottleneck of blockchain. Sharding is a promising technology to solve the problem of low throughput in blockchains. However, cross-shard communication hinders the effective improvement of blockchain throughput. Therefore, it is critical to reasonably allocate transactions to different shards to improve blockchain throughput. Existing research on blockchain sharding mainly focuses on shards formation, configuration, and consensus, while ignoring the negative impact of cross-shard communication on blockchain throughput. Aiming to maximize the throughput of transaction processing, we study how to allocate blockchain transactions to shards in this paper. We propose an Associated Transaction assignment algorithm based on Closest Fit (ATCF). ATCF classifies associated transactions into transaction groups which are then assigned to different shards in the non-ascending order of transaction group sizes periodically. Within each epoch, ATCF tries to select a shard that can handle all the transactions for each transaction group. If there are multiple such shards, ATCF selects the shard with the remaining processing capacity closest to the number of transactions in the transaction group. When no such shard exists, ATCF chooses the shard with the largest remaining processing capacity for the transaction group. The transaction groups that cannot be completely processed within the current epoch will be allocated in the subsequent epochs. We prove that ATCF is a 2-approximation algorithm for the associated transaction assignment problem. Simulation results show that ATCF can effectively improve the blockchain throughput and reduce the number of cross-shard transactions.
基金Acknowledgements： This work is supported by the National Natural Science Foundation of China （No. 60205007）, Natural Science Foundation of Guangdong Province （No.031558, No. 04300462）, Research Foundation of National Science and Technology Plan Project （No.2004BA721A02）, Research Foundation of Science and Technology Plan Project in Guangdong Province （No.2003C50118）, and Research Foundation of Science and Technology Plan Project in Guangzhou City （No.2002Z3-E0017）.
基金supported by the Fundamental Research Funds for the Central Universities of Ministry of Education (2018 ZD06)。
文摘With the development of the energy Internet, more distributed generators are connected to the power grid, resulting in numerous heterogeneous energy networks. However, different energy networks cannot perform efficient energy trading in the centralized management mode, this deeply affecting the complementary ability of heterogeneous energy, resulting in the islanded energy phenomenon. In this model, the same energy on the chain is traded within the chain, and the heterogeneous energy on different chains is traded across chains. To trade energy between heterogeneous energy networks more efficiently, the blockchain-based cross-chain model is proposed based on the existing infrastructure. Heterogeneous energy nodes are assigned to different energy sub-chains and cross-chain energy transactions are performed through a relay-chain, which utilizes the improved Boneh–Lynn–Shacham signature scheme consensus algorithm based on the proof-of-stake and practical Byzantine fault tolerance. The experimental simulations on energy trading efficiency, throughput, and security, show its superiority over existing systems. Further, the simulation results provide a reference for the application of cross-chain technology in energy interconnection.
文摘关联规则分析作为数据挖掘的主要手段之一,在发现海量事务数据中隐含的有价值信息方面具有重要的作用。该文针对Apriori算法的固有缺陷,提出了AWP(Apriori With Prejudging)算法。该算法在Apriori算法连接、剪枝的基础上,添加了预判筛选的步骤,使用先验概率对候选频繁k项集集合进行缩减优化,并且引入阻尼因子和补偿因子对预判筛选产生的误差进行修正,简化了挖掘频繁项集的操作过程。实验证明AWP算法能够有效减少扫描数据库的次数,降低算法的运行时间。
