PBFT optimization algorithm based on community contributions
Community governance is the basic unit of social governance, and it is also an important direction for building a social governance pattern of co-construction, co-governance and sharing. Previous studies have solved the problems of data security, information traceability and participant enthusiasm i...
Gespeichert in:
| Veröffentlicht in: | Mathematical biosciences and engineering : MBE Jg. 20; H. 6; S. 10200 - 10222 |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
United States
AIMS Press
01.01.2023
|
| Schlagworte: | |
| ISSN: | 1551-0018, 1551-0018 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | Community governance is the basic unit of social governance, and it is also an important direction for building a social governance pattern of co-construction, co-governance and sharing. Previous studies have solved the problems of data security, information traceability and participant enthusiasm in the process of community digital governance by building a community governance system based on blockchain technology and incentive mechanisms. The application of blockchain technology can solve the problems of low data security, difficulty in sharing and tracing and low enthusiasm on the part of multiple subjects regarding participation in community governance. The process of community governance involves the cooperation of multiple government departments and multiple social subjects. Under the blockchain architecture, the number of alliance chain nodes will reach 1000 with the expansion of community governance. The existing consensus algorithms for coalition chains are difficult to meet the high concurrent processing requirements under such large-scale nodes. An optimization algorithm has improved the consensus performance to a certain extent, but the existing systems still cannot meet the data needs of the community and are not suitable for community governance scenarios. Since the community governance process only involves the participation of relevant departments in users, all nodes in the network are not required to participate in the consensus under the blockchain architecture. Therefore, a practical Byzantine fault tolerance (PBFT) optimization algorithm based on community contribution (CSPBFT) is proposed here. First, consensus nodes are set according to different roles of participants in community activities, and participants are given different consensus permissions. Second, the consensus process is divided into different stages, and the amount of data processed by each consensus step is reduced. Finally, a two-level consensus network is designed to perform different consensus tasks, and reduce unnecessary communication between nodes to reduce the communication complexity of consensus among nodes. Compared with the PBFT algorithm, CSPBFT reduces the communication complexity from O(N2) to O(N2/C3). Finally, the simulation results show that, through rights management, network level setting and consensus phase division, when the number of nodes in the CSPBFT network is 100–400, the consensus throughput can reach 2000 TPS. When the node in the network is 1000, the instantaneous concurrency is guaranteed to be above 1000 TPS, which can meet the concurrent needs of the community governance scenario. |
|---|---|
| AbstractList | Community governance is the basic unit of social governance, and it is also an important direction for building a social governance pattern of co-construction, co-governance and sharing. Previous studies have solved the problems of data security, information traceability and participant enthusiasm in the process of community digital governance by building a community governance system based on blockchain technology and incentive mechanisms. The application of blockchain technology can solve the problems of low data security, difficulty in sharing and tracing and low enthusiasm on the part of multiple subjects regarding participation in community governance. The process of community governance involves the cooperation of multiple government departments and multiple social subjects. Under the blockchain architecture, the number of alliance chain nodes will reach 1000 with the expansion of community governance. The existing consensus algorithms for coalition chains are difficult to meet the high concurrent processing requirements under such large-scale nodes. An optimization algorithm has improved the consensus performance to a certain extent, but the existing systems still cannot meet the data needs of the community and are not suitable for community governance scenarios. Since the community governance process only involves the participation of relevant departments in users, all nodes in the network are not required to participate in the consensus under the blockchain architecture. Therefore, a practical Byzantine fault tolerance (PBFT) optimization algorithm based on community contribution (CSPBFT) is proposed here. First, consensus nodes are set according to different roles of participants in community activities, and participants are given different consensus permissions. Second, the consensus process is divided into different stages, and the amount of data processed by each consensus step is reduced. Finally, a two-level consensus network is designed to perform different consensus tasks, and reduce unnecessary communication between nodes to reduce the communication complexity of consensus among nodes. Compared with the PBFT algorithm, CSPBFT reduces the communication complexity from O(N2) to O(N2/C3). Finally, the simulation results show that, through rights management, network level setting and consensus phase division, when the number of nodes in the CSPBFT network is 100-400, the consensus throughput can reach 2000 TPS. When the node in the network is 1000, the instantaneous concurrency is guaranteed to be above 1000 TPS, which can meet the concurrent needs of the community governance scenario.Community governance is the basic unit of social governance, and it is also an important direction for building a social governance pattern of co-construction, co-governance and sharing. Previous studies have solved the problems of data security, information traceability and participant enthusiasm in the process of community digital governance by building a community governance system based on blockchain technology and incentive mechanisms. The application of blockchain technology can solve the problems of low data security, difficulty in sharing and tracing and low enthusiasm on the part of multiple subjects regarding participation in community governance. The process of community governance involves the cooperation of multiple government departments and multiple social subjects. Under the blockchain architecture, the number of alliance chain nodes will reach 1000 with the expansion of community governance. The existing consensus algorithms for coalition chains are difficult to meet the high concurrent processing requirements under such large-scale nodes. An optimization algorithm has improved the consensus performance to a certain extent, but the existing systems still cannot meet the data needs of the community and are not suitable for community governance scenarios. Since the community governance process only involves the participation of relevant departments in users, all nodes in the network are not required to participate in the consensus under the blockchain architecture. Therefore, a practical Byzantine fault tolerance (PBFT) optimization algorithm based on community contribution (CSPBFT) is proposed here. First, consensus nodes are set according to different roles of participants in community activities, and participants are given different consensus permissions. Second, the consensus process is divided into different stages, and the amount of data processed by each consensus step is reduced. Finally, a two-level consensus network is designed to perform different consensus tasks, and reduce unnecessary communication between nodes to reduce the communication complexity of consensus among nodes. Compared with the PBFT algorithm, CSPBFT reduces the communication complexity from O(N2) to O(N2/C3). Finally, the simulation results show that, through rights management, network level setting and consensus phase division, when the number of nodes in the CSPBFT network is 100-400, the consensus throughput can reach 2000 TPS. When the node in the network is 1000, the instantaneous concurrency is guaranteed to be above 1000 TPS, which can meet the concurrent needs of the community governance scenario. Community governance is the basic unit of social governance, and it is also an important direction for building a social governance pattern of co-construction, co-governance and sharing. Previous studies have solved the problems of data security, information traceability and participant enthusiasm in the process of community digital governance by building a community governance system based on blockchain technology and incentive mechanisms. The application of blockchain technology can solve the problems of low data security, difficulty in sharing and tracing and low enthusiasm on the part of multiple subjects regarding participation in community governance. The process of community governance involves the cooperation of multiple government departments and multiple social subjects. Under the blockchain architecture, the number of alliance chain nodes will reach 1000 with the expansion of community governance. The existing consensus algorithms for coalition chains are difficult to meet the high concurrent processing requirements under such large-scale nodes. An optimization algorithm has improved the consensus performance to a certain extent, but the existing systems still cannot meet the data needs of the community and are not suitable for community governance scenarios. Since the community governance process only involves the participation of relevant departments in users, all nodes in the network are not required to participate in the consensus under the blockchain architecture. Therefore, a practical Byzantine fault tolerance (PBFT) optimization algorithm based on community contribution (CSPBFT) is proposed here. First, consensus nodes are set according to different roles of participants in community activities, and participants are given different consensus permissions. Second, the consensus process is divided into different stages, and the amount of data processed by each consensus step is reduced. Finally, a two-level consensus network is designed to perform different consensus tasks, and reduce unnecessary communication between nodes to reduce the communication complexity of consensus among nodes. Compared with the PBFT algorithm, CSPBFT reduces the communication complexity from O(N2) to O(N2/C3). Finally, the simulation results show that, through rights management, network level setting and consensus phase division, when the number of nodes in the CSPBFT network is 100–400, the consensus throughput can reach 2000 TPS. When the node in the network is 1000, the instantaneous concurrency is guaranteed to be above 1000 TPS, which can meet the concurrent needs of the community governance scenario. |
| Author | Wang, Pengpeng Xiong, Xiaoyun Wang, Xu Shen, Yumin Wang, Jinlong |
| Author_xml | – sequence: 1 givenname: Pengpeng surname: Wang fullname: Wang, Pengpeng – sequence: 2 givenname: Xu surname: Wang fullname: Wang, Xu – sequence: 3 givenname: Yumin surname: Shen fullname: Shen, Yumin – sequence: 4 givenname: Jinlong surname: Wang fullname: Wang, Jinlong – sequence: 5 givenname: Xiaoyun surname: Xiong fullname: Xiong, Xiaoyun |
| BackLink | https://www.ncbi.nlm.nih.gov/pubmed/37322929$$D View this record in MEDLINE/PubMed |
| BookMark | eNpNkc1LAzEQxYNU_KievEuPglSTTNJkwYsWq4WCHuo5zO5ma2R3U5Pdg_71prYWLzPDzI_3YN4pGbS-tYRcMHoDGYjbJrc3nHIQQh2QEyYlG1PK9ODffExOY_ygFASAOCLHoIDzjGcn5O71YbYc-XXnGveNnfPtCOuVD657b0Y5RluO0qrwTdO3rvtKU9sFl_cbMp6RwwrraM93fUjeZo_L6fN48fI0n94vxggaujHynHMlEUrGCsFyJrOi0iiVYFUBEpDbdE5FZ1SXGVJN-cRWklpUOMkRhmS-1S09fph1cA2GL-PRmd-FDyuDoXNFbQ0vtdKKquQoBWYFgqDASsqFTLbIktbVVmsd_GdvY2caFwtb19ha30fDNVdcKj3hCb3coX3e2HJv_Pe9BFxvgSL4GIOt9gijZpONSdmYXTbwA_KVfoY |
| Cites_doi | 10.11820/dlkxjz.2015.04.008 10.16619/j.cnki.rmltxsqy.2020.05.007 10.1016/j.jksuci.2022.08.017 10.1109/ACCESS.2020.3013911 10.1016/j.jpdc.2022.01.029 10.3390/fi14020047 10.1109/ACCESS.2021.3085405 10.1038/s41598-022-08587-1 10.1016/j.heliyon.2023.e13186 10.1007/s11276-018-1883-0 10.1016/j.asej.2021.01.019 10.1109/ACCESS.2022.3192426 10.19678/j.issn.1000-3428.0063887 10.1109/TII.2019.2941735 10.3390/app11146313 10.1007/s12083-021-01103-8 |
| ContentType | Journal Article |
| DBID | AAYXX CITATION NPM 7X8 DOA |
| DOI | 10.3934/mbe.2023447 |
| DatabaseName | CrossRef PubMed MEDLINE - Academic Open Access: DOAJ - Directory of Open Access Journals |
| DatabaseTitle | CrossRef PubMed MEDLINE - Academic |
| DatabaseTitleList | MEDLINE - Academic CrossRef PubMed |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: NPM name: PubMed url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 3 dbid: 7X8 name: MEDLINE - Academic url: https://search.proquest.com/medline sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Biology |
| EISSN | 1551-0018 |
| EndPage | 10222 |
| ExternalDocumentID | oai_doaj_org_article_2d878707b2254a9ca34031d0245159a1 37322929 10_3934_mbe_2023447 |
| Genre | Journal Article |
| GroupedDBID | --- 53G 5GY AAYXX AENEX ALMA_UNASSIGNED_HOLDINGS AMVHM CITATION EBD EBS EJD EMOBN F5P GROUPED_DOAJ IAO ITC J9A ML0 OK1 P2P RAN SV3 TUS NPM 7X8 |
| ID | FETCH-LOGICAL-a383t-a2b2275a3d11c41b159cf8a5741fc353a2e2752e28908d9a08026ef50ea7a6ba3 |
| IEDL.DBID | DOA |
| ISICitedReferencesCount | 2 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000964411700005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1551-0018 |
| IngestDate | Fri Oct 03 12:50:49 EDT 2025 Thu Jul 10 22:27:34 EDT 2025 Thu Jan 02 22:39:14 EST 2025 Sat Nov 29 04:14:53 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 6 |
| Keywords | consensus algorithm throughput blockchain high concurrency community digital governance |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a383t-a2b2275a3d11c41b159cf8a5741fc353a2e2752e28908d9a08026ef50ea7a6ba3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| OpenAccessLink | https://doaj.org/article/2d878707b2254a9ca34031d0245159a1 |
| PMID | 37322929 |
| PQID | 2827257862 |
| PQPubID | 23479 |
| PageCount | 23 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_2d878707b2254a9ca34031d0245159a1 proquest_miscellaneous_2827257862 pubmed_primary_37322929 crossref_primary_10_3934_mbe_2023447 |
| PublicationCentury | 2000 |
| PublicationDate | 2023-01-01 |
| PublicationDateYYYYMMDD | 2023-01-01 |
| PublicationDate_xml | – month: 01 year: 2023 text: 2023-01-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationPlace | United States |
| PublicationPlace_xml | – name: United States |
| PublicationTitle | Mathematical biosciences and engineering : MBE |
| PublicationTitleAlternate | Math Biosci Eng |
| PublicationYear | 2023 |
| Publisher | AIMS Press |
| Publisher_xml | – name: AIMS Press |
| References | key-10.3934/mbe.2023447-4 key-10.3934/mbe.2023447-16 key-10.3934/mbe.2023447-5 key-10.3934/mbe.2023447-15 key-10.3934/mbe.2023447-2 key-10.3934/mbe.2023447-14 key-10.3934/mbe.2023447-3 key-10.3934/mbe.2023447-13 key-10.3934/mbe.2023447-8 key-10.3934/mbe.2023447-12 key-10.3934/mbe.2023447-9 key-10.3934/mbe.2023447-11 key-10.3934/mbe.2023447-22 key-10.3934/mbe.2023447-6 key-10.3934/mbe.2023447-10 key-10.3934/mbe.2023447-21 key-10.3934/mbe.2023447-7 key-10.3934/mbe.2023447-20 key-10.3934/mbe.2023447-1 key-10.3934/mbe.2023447-19 key-10.3934/mbe.2023447-18 key-10.3934/mbe.2023447-17 |
| References_xml | – ident: key-10.3934/mbe.2023447-10 – ident: key-10.3934/mbe.2023447-4 – ident: key-10.3934/mbe.2023447-6 – ident: key-10.3934/mbe.2023447-2 – ident: key-10.3934/mbe.2023447-1 doi: 10.11820/dlkxjz.2015.04.008 – ident: key-10.3934/mbe.2023447-3 doi: 10.16619/j.cnki.rmltxsqy.2020.05.007 – ident: key-10.3934/mbe.2023447-8 doi: 10.1016/j.jksuci.2022.08.017 – ident: key-10.3934/mbe.2023447-11 doi: 10.1109/ACCESS.2020.3013911 – ident: key-10.3934/mbe.2023447-16 doi: 10.1016/j.jpdc.2022.01.029 – ident: key-10.3934/mbe.2023447-13 doi: 10.3390/fi14020047 – ident: key-10.3934/mbe.2023447-12 doi: 10.1109/ACCESS.2021.3085405 – ident: key-10.3934/mbe.2023447-19 doi: 10.1038/s41598-022-08587-1 – ident: key-10.3934/mbe.2023447-21 doi: 10.1016/j.heliyon.2023.e13186 – ident: key-10.3934/mbe.2023447-20 – ident: key-10.3934/mbe.2023447-5 doi: 10.1007/s11276-018-1883-0 – ident: key-10.3934/mbe.2023447-15 – ident: key-10.3934/mbe.2023447-14 doi: 10.1016/j.asej.2021.01.019 – ident: key-10.3934/mbe.2023447-17 doi: 10.1109/ACCESS.2022.3192426 – ident: key-10.3934/mbe.2023447-22 doi: 10.19678/j.issn.1000-3428.0063887 – ident: key-10.3934/mbe.2023447-7 doi: 10.1109/TII.2019.2941735 – ident: key-10.3934/mbe.2023447-9 doi: 10.3390/app11146313 – ident: key-10.3934/mbe.2023447-18 doi: 10.1007/s12083-021-01103-8 |
| SSID | ssj0034334 |
| Score | 2.2938836 |
| Snippet | Community governance is the basic unit of social governance, and it is also an important direction for building a social governance pattern of co-construction,... |
| SourceID | doaj proquest pubmed crossref |
| SourceType | Open Website Aggregation Database Index Database |
| StartPage | 10200 |
| SubjectTerms | blockchain community digital governance consensus algorithm high concurrency throughput |
| Title | PBFT optimization algorithm based on community contributions |
| URI | https://www.ncbi.nlm.nih.gov/pubmed/37322929 https://www.proquest.com/docview/2827257862 https://doaj.org/article/2d878707b2254a9ca34031d0245159a1 |
| Volume | 20 |
| WOSCitedRecordID | wos000964411700005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 1551-0018 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0034334 issn: 1551-0018 databaseCode: DOA dateStart: 20190101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3NS8MwFA86FLyI386PUWHXsi5JmwS8qDg8yNhhym7htUlVcK1snbD_3pemG3oQL156SAtNfu_1fTR5v0dIl7PUMJolIfpWGXJ0gGEqExmCjVnOMABIa8ab50cxHMrJRI2-tfpyZ8I8PbAHrkeNdDolUlQ8DioDxlEPjdsxRE8MdeITCbVKprwNZpwx7qvxmGK8N00dIyZ17HY__E9N0_97bFn7mMEe2W2Cw-DGT2qfbNjigGz7dpHLQ3I9uh2MgxI_8mlTPRnA-0uJ6f3rNHDuyAQ4lPmSj2oZ1MfQm35W8yPyNLgf3z2ETfeDEDBrrEKguGQRAzP9fsb7iJnKcgkxhgB5xmIG1OJtvEgVSaPAFc0mNo8jCwKSFNgxaRVlYU9JEHGOAohpLjPgKpVgIuMazMcyYtQktE26K0z0hye50JgcOOg0Qqcb6Nrk1uG1fsQxU9cDKC_dyEv_Ja82uVqhrVGT3fYEFLZczDUmf8IZEDefEy-G9auYQMODkdzZf0zhnOy4FfkfKRekVc0W9pJsZZ_V23zWIZtiIju1On0BOzfJdQ |
| linkProvider | Directory of Open Access Journals |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=PBFT+optimization+algorithm+based+on+community+contributions&rft.jtitle=Mathematical+biosciences+and+engineering+%3A+MBE&rft.au=Wang%2C+Pengpeng&rft.au=Wang%2C+Xu&rft.au=Shen%2C+Yumin&rft.au=Wang%2C+Jinlong&rft.date=2023-01-01&rft.eissn=1551-0018&rft.volume=20&rft.issue=6&rft.spage=10200&rft_id=info:doi/10.3934%2Fmbe.2023447&rft_id=info%3Apmid%2F37322929&rft.externalDocID=37322929 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1551-0018&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1551-0018&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1551-0018&client=summon |