A Blockchain Auto-Scaling Node Organizing Design Model for the Internet of Things  

A Blockchain Auto-Scaling Node Organizing Design Model for the Internet of Things | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article A Blockchain Auto-Scaling Node Organizing Design Model for the Internet of Things Riham ELSAADANY, Guy Bégin This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-4477101/v1 This work is licensed under a CC BY 4.0 License Status: Under Review Version 1 posted 9 You are reading this latest preprint version Abstract Many node-organizing blockchain models for IoT lack the scalability needed for high transaction volumes and mechanisms to manage decentralization and node overhead. This study proposes a multi-tiered Self-Scalable Dynamic architecture based on a forest of trees to improve scalability and efficiency by clustering all nodes to limit those involved in consensus. In addition to the architecture, our contributions include: i) A protocol to speed up consensus. ii) A mechanism for efficient node-lookup and message-routing. iii) A dynamic algorithm to balance overhead and decentralization. iv) A colocality mechanism to enhance consensus time. This architecture reduces consensus time with an upper bound of O(1) plus a propagation delay factor. As more IoT devices join, resulting in a deeper forest, the model becomes more scalable with shorter consensus delays. The proposed mechanisms may serve as general-purpose solutions for scalability, load balancing, node-lookup and message-routing, and are application-, clustering-, and consensus-algorithm-agnostic. Blockchain Internet of Things Clustering Scalability Balancing Decentralization Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Under Review Version 1 posted Editorial decision: Revision requested 20 Jun, 2024 Reviews received at journal 15 Jun, 2024 Reviews received at journal 11 Jun, 2024 Reviewers agreed at journal 05 Jun, 2024 Reviewers agreed at journal 03 Jun, 2024 Reviewers invited by journal 03 Jun, 2024 Editor assigned by journal 29 May, 2024 Submission checks completed at journal 28 May, 2024 First submitted to journal 25 May, 2024 You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-4477101","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":312584791,"identity":"1876633c-4de1-46d5-86e3-0df2ea1b8961","order_by":0,"name":"Riham ELSAADANY","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABSklEQVRIie2RP0vDQBTAXzhIl5Q4XohtvkJDoLVE7QdxSQiki5mcRLEHgXTxz3ofI0UICg6Rg3bJB0jHLk4K6SIWVLwmXRKo4iaY33B/uPvde/ceQE3NX6SRj6jY2ARALpZ4u4KqikJ+pQj8eif+IS8ZAcrezk2thy0xW9wdHhkzNlVPH/baPSLp6eoYNJmUFMUHUbmcDvV7aiFqJ44XJa6rJE/Y2I0lo38VgU7LcTsMRJBEJoSphcAOkBelUlchMbYpSF3cjMCCsjJggJbvn2ywUUbeLS2U0VpRPriiVaLwj6vNgNkbhXkhLhQLc0VdR6kUBPPE1Nb10AmThc+VmUcT1+lzRadIPDFbEdYnZUUeE7R8fjUPwpnDhFVw5t2M2eOcxBcabviT+Uu0r7WrZZezYt6xSeUE5Q39pqdy9a087+33a2pqav4PX0Qub0zSVELAAAAAAElFTkSuQmCC","orcid":"","institution":"University of Quebec in Montreal","correspondingAuthor":true,"prefix":"","firstName":"Riham","middleName":"","lastName":"ELSAADANY","suffix":""},{"id":312584792,"identity":"49c87ff5-58f1-4964-9615-a96e1995d108","order_by":1,"name":"Guy Bégin","email":"","orcid":"","institution":"University of Quebec in Montreal","correspondingAuthor":false,"prefix":"","firstName":"Guy","middleName":"","lastName":"Bégin","suffix":""}],"badges":[],"createdAt":"2024-05-25 14:08:16","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-4477101/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-4477101/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":58092971,"identity":"81ebe737-f6cd-4f79-b7f4-e1dbe23cc7b4","added_by":"auto","created_at":"2024-06-11 04:43:06","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":831578,"visible":true,"origin":"","legend":"","description":"","filename":"ConferenceLaTeXtemplateMay2024.pdf","url":"https://assets-eu.researchsquare.com/files/rs-4477101/v1_covered_bb2648c4-c7ac-4706-a1e4-d5b97caeef79.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":" A Blockchain Auto-Scaling Node Organizing Design Model for the Internet of Things ","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":true,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"cluster-computing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"","sideBox":"Learn more about [Cluster Computing](https://www.springer.com/journal/10586)","snPcode":"10586","submissionUrl":"https://submission.nature.com/new-submission/10586/3","title":"Cluster Computing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"Blockchain, Internet of Things, Clustering, Scalability, Balancing, Decentralization","lastPublishedDoi":"10.21203/rs.3.rs-4477101/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-4477101/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"Many node-organizing blockchain models for IoT lack the scalability needed for high transaction volumes and mechanisms to manage decentralization and node overhead. This study proposes a multi-tiered Self-Scalable Dynamic architecture based on a forest of trees to improve scalability and efficiency by clustering all nodes to limit those involved in consensus. In addition to the architecture, our contributions include: i) A protocol to speed up consensus. ii) A mechanism for efficient node-lookup and message-routing. iii) A dynamic algorithm to balance overhead and decentralization. iv) A colocality mechanism to enhance consensus time. This architecture reduces consensus time with an upper bound of O(1) plus a propagation delay factor. As more IoT devices join, resulting in a deeper forest, the model becomes more scalable with shorter consensus delays. The proposed mechanisms may serve as general-purpose solutions for scalability, load balancing, node-lookup and message-routing, and are application-, clustering-, and consensus-algorithm-agnostic.","manuscriptTitle":" A Blockchain Auto-Scaling Node Organizing Design Model for the Internet of Things ","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2024-06-11 04:34:58","doi":"10.21203/rs.3.rs-4477101/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Revision requested","date":"2024-06-21T02:58:52+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2024-06-15T19:16:45+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2024-06-12T02:18:18+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"279919703661960380055776094018621242957","date":"2024-06-05T10:14:57+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"4919967278203228533827499902355317064","date":"2024-06-03T08:23:03+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2024-06-03T05:46:21+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2024-05-29T05:53:17+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2024-05-28T14:22:28+00:00","index":"","fulltext":""},{"type":"submitted","content":"Cluster Computing","date":"2024-05-25T14:04:23+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"cluster-computing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"","sideBox":"Learn more about [Cluster Computing](https://www.springer.com/journal/10586)","snPcode":"10586","submissionUrl":"https://submission.nature.com/new-submission/10586/3","title":"Cluster Computing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"50af571f-8057-408c-ac4b-d4e937d35ee4","owner":[],"postedDate":"June 11th, 2024","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"under-review","subjectAreas":[],"tags":[],"updatedAt":"2024-09-29T23:08:09+00:00","versionOfRecord":[],"versionCreatedAt":"2024-06-11 04:34:58","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-4477101","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-4477101","identity":"rs-4477101","version":["v1"]},"buildId":"qtupq5eGEP_6zYnWcrvyt","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}