A Priority-Based Blockchain Transaction Packaging Algorithm in a Cloud-Edge-end Collaboration Computing Environment

With the rapid development of mobile internet, intelligent IoT, and 5G communication technologies, many IoT devices connect to the Industrial Internet of Things, generating significant data. Blockchain is widely used in identity authentication and trust management due to its reliability. In blockchain technology, transaction packaging is a crucial component of the consensus mechanism and is critical to enhancing fairness and service quality in request processing. However, the flat structure of the blockchain, the necessity for multi-party consensus, and the profit-seeking nature of nodes lead to issues such as unfair transaction processing and prolonged response times in cloud-edge-end architectures, which are critical for empowering intelligent edge applications. To address these challenges, we have refined the blockchain consensus mechanism and introduced a novel packaging algorithm, ITFPA (Improved time-fee packaging algorithm), within the cloud-edge-end environment. This algorithm models the transaction packaging problem as a 0–1 knapsack problem and employs a branch-and-bound method to find the optimal solution. The proposed model considers both the transaction waiting time and transaction fee, using the weighted result of these factors as the priority for the transaction. We compared the proposed algorithm with the WaitTime and TxFee algorithms across four metrics: system fairness, transaction response time, and block priority. The experimental results demonstrate that the proposed algorithm enhances system fairness, reduces transaction response times, and improves service quality to a significant degree.